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

About the Execution of LTSMin+red for StigmergyElection-PT-03b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
495.439 73081.00 106581.00 257.70 ??????FT?T?????? normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r536-tall-171690532000273.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-03b, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r536-tall-171690532000273
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 528K
-rw-r--r-- 1 mcc users 7.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Apr 23 07:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 23 07:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 11 18:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K Apr 11 18:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Apr 11 18:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K 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 117K 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-03b-CTLCardinality-2024-00
FORMULA_NAME StigmergyElection-PT-03b-CTLCardinality-2024-01
FORMULA_NAME StigmergyElection-PT-03b-CTLCardinality-2024-02
FORMULA_NAME StigmergyElection-PT-03b-CTLCardinality-2024-03
FORMULA_NAME StigmergyElection-PT-03b-CTLCardinality-2024-04
FORMULA_NAME StigmergyElection-PT-03b-CTLCardinality-2024-05
FORMULA_NAME StigmergyElection-PT-03b-CTLCardinality-2024-06
FORMULA_NAME StigmergyElection-PT-03b-CTLCardinality-2024-07
FORMULA_NAME StigmergyElection-PT-03b-CTLCardinality-2024-08
FORMULA_NAME StigmergyElection-PT-03b-CTLCardinality-2024-09
FORMULA_NAME StigmergyElection-PT-03b-CTLCardinality-2024-10
FORMULA_NAME StigmergyElection-PT-03b-CTLCardinality-2024-11
FORMULA_NAME StigmergyElection-PT-03b-CTLCardinality-2023-12
FORMULA_NAME StigmergyElection-PT-03b-CTLCardinality-2023-13
FORMULA_NAME StigmergyElection-PT-03b-CTLCardinality-2023-14
FORMULA_NAME StigmergyElection-PT-03b-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1717245091204

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyElection-PT-03b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 12:31:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 12:31:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 12:31:32] [INFO ] Load time of PNML (sax parser for PT used): 95 ms
[2024-06-01 12:31:32] [INFO ] Transformed 427 places.
[2024-06-01 12:31:32] [INFO ] Transformed 518 transitions.
[2024-06-01 12:31:32] [INFO ] Found NUPN structural information;
[2024-06-01 12:31:32] [INFO ] Parsed PT model containing 427 places and 518 transitions and 1323 arcs in 190 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 16 ms.
Support contains 100 out of 427 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 427/427 places, 518/518 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 395 transition count 486
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 395 transition count 486
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 72 place count 387 transition count 478
Iterating global reduction 0 with 8 rules applied. Total rules applied 80 place count 387 transition count 478
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 81 place count 386 transition count 477
Iterating global reduction 0 with 1 rules applied. Total rules applied 82 place count 386 transition count 477
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 83 place count 385 transition count 476
Iterating global reduction 0 with 1 rules applied. Total rules applied 84 place count 385 transition count 476
Applied a total of 84 rules in 96 ms. Remains 385 /427 variables (removed 42) and now considering 476/518 (removed 42) transitions.
// Phase 1: matrix 476 rows 385 cols
[2024-06-01 12:31:32] [INFO ] Computed 4 invariants in 25 ms
[2024-06-01 12:31:33] [INFO ] Implicit Places using invariants in 265 ms returned []
[2024-06-01 12:31:33] [INFO ] Invariant cache hit.
[2024-06-01 12:31:33] [INFO ] Implicit Places using invariants and state equation in 245 ms returned []
Implicit Place search using SMT with State Equation took 544 ms to find 0 implicit places.
Running 475 sub problems to find dead transitions.
[2024-06-01 12:31:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/384 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 475 unsolved
At refinement iteration 1 (OVERLAPS) 1/385 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 475 unsolved
[2024-06-01 12:31:39] [INFO ] Deduced a trap composed of 233 places in 139 ms of which 21 ms to minimize.
[2024-06-01 12:31:39] [INFO ] Deduced a trap composed of 180 places in 106 ms of which 2 ms to minimize.
[2024-06-01 12:31:39] [INFO ] Deduced a trap composed of 175 places in 102 ms of which 3 ms to minimize.
[2024-06-01 12:31:39] [INFO ] Deduced a trap composed of 182 places in 103 ms of which 3 ms to minimize.
[2024-06-01 12:31:39] [INFO ] Deduced a trap composed of 175 places in 97 ms of which 2 ms to minimize.
[2024-06-01 12:31:39] [INFO ] Deduced a trap composed of 182 places in 85 ms of which 2 ms to minimize.
[2024-06-01 12:31:40] [INFO ] Deduced a trap composed of 288 places in 110 ms of which 3 ms to minimize.
[2024-06-01 12:31:40] [INFO ] Deduced a trap composed of 177 places in 89 ms of which 3 ms to minimize.
[2024-06-01 12:31:40] [INFO ] Deduced a trap composed of 177 places in 83 ms of which 2 ms to minimize.
[2024-06-01 12:31:40] [INFO ] Deduced a trap composed of 174 places in 81 ms of which 1 ms to minimize.
[2024-06-01 12:31:41] [INFO ] Deduced a trap composed of 175 places in 82 ms of which 2 ms to minimize.
[2024-06-01 12:31:41] [INFO ] Deduced a trap composed of 175 places in 96 ms of which 2 ms to minimize.
[2024-06-01 12:31:42] [INFO ] Deduced a trap composed of 230 places in 107 ms of which 3 ms to minimize.
[2024-06-01 12:31:42] [INFO ] Deduced a trap composed of 179 places in 98 ms of which 2 ms to minimize.
[2024-06-01 12:31:43] [INFO ] Deduced a trap composed of 180 places in 160 ms of which 2 ms to minimize.
[2024-06-01 12:31:43] [INFO ] Deduced a trap composed of 178 places in 130 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/385 variables, 16/20 constraints. Problems are: Problem set: 0 solved, 475 unsolved
[2024-06-01 12:31:48] [INFO ] Deduced a trap composed of 175 places in 90 ms of which 2 ms to minimize.
[2024-06-01 12:31:48] [INFO ] Deduced a trap composed of 176 places in 83 ms of which 2 ms to minimize.
[2024-06-01 12:31:48] [INFO ] Deduced a trap composed of 180 places in 102 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/385 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 475 unsolved
[2024-06-01 12:31:54] [INFO ] Deduced a trap composed of 179 places in 91 ms of which 2 ms to minimize.
[2024-06-01 12:31:55] [INFO ] Deduced a trap composed of 176 places in 104 ms of which 3 ms to minimize.
[2024-06-01 12:31:55] [INFO ] Deduced a trap composed of 180 places in 90 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/385 variables, 3/26 constraints. Problems are: Problem set: 0 solved, 475 unsolved
[2024-06-01 12:31:58] [INFO ] Deduced a trap composed of 182 places in 94 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/385 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 475 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 385/861 variables, and 27 constraints, problems are : Problem set: 0 solved, 475 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/385 constraints, PredecessorRefiner: 475/475 constraints, Known Traps: 23/23 constraints]
Escalating to Integer solving :Problem set: 0 solved, 475 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/384 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 475 unsolved
At refinement iteration 1 (OVERLAPS) 1/385 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 475 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/385 variables, 23/27 constraints. Problems are: Problem set: 0 solved, 475 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/385 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 475 unsolved
At refinement iteration 4 (OVERLAPS) 476/861 variables, 385/412 constraints. Problems are: Problem set: 0 solved, 475 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/861 variables, 475/887 constraints. Problems are: Problem set: 0 solved, 475 unsolved
[2024-06-01 12:32:15] [INFO ] Deduced a trap composed of 215 places in 117 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/861 variables, 1/888 constraints. Problems are: Problem set: 0 solved, 475 unsolved
[2024-06-01 12:32:29] [INFO ] Deduced a trap composed of 170 places in 105 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 861/861 variables, and 889 constraints, problems are : Problem set: 0 solved, 475 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 385/385 constraints, PredecessorRefiner: 475/475 constraints, Known Traps: 25/25 constraints]
After SMT, in 60186ms problems are : Problem set: 0 solved, 475 unsolved
Search for dead transitions found 0 dead transitions in 60204ms
Starting structural reductions in LTL mode, iteration 1 : 385/427 places, 476/518 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60869 ms. Remains : 385/427 places, 476/518 transitions.
Support contains 100 out of 385 places after structural reductions.
[2024-06-01 12:32:33] [INFO ] Flatten gal took : 53 ms
[2024-06-01 12:32:33] [INFO ] Flatten gal took : 25 ms
[2024-06-01 12:32:33] [INFO ] Input system was already deterministic with 476 transitions.
Support contains 93 out of 385 places (down from 100) after GAL structural reductions.
FORMULA StigmergyElection-PT-03b-CTLCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (686 resets) in 1603 ms. (24 steps per ms) remains 16/49 properties
BEST_FIRST walk for 4002 steps (13 resets) in 45 ms. (87 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (13 resets) in 47 ms. (83 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (16 resets) in 23 ms. (166 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (16 resets) in 35 ms. (111 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (15 resets) in 25 ms. (153 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (15 resets) in 12 ms. (308 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (15 resets) in 15 ms. (250 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (15 resets) in 29 ms. (133 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (18 resets) in 31 ms. (125 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (16 resets) in 12 ms. (307 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (16 resets) in 23 ms. (166 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (16 resets) in 12 ms. (307 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (15 resets) in 24 ms. (160 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (15 resets) in 22 ms. (174 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (16 resets) in 11 ms. (333 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (16 resets) in 23 ms. (166 steps per ms) remains 16/16 properties
[2024-06-01 12:32:34] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
Problem AtomicPropp23 is UNSAT
At refinement iteration 1 (OVERLAPS) 343/385 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 15 unsolved
[2024-06-01 12:32:34] [INFO ] Deduced a trap composed of 179 places in 116 ms of which 2 ms to minimize.
Problem AtomicPropp1 is UNSAT
[2024-06-01 12:32:34] [INFO ] Deduced a trap composed of 176 places in 116 ms of which 2 ms to minimize.
[2024-06-01 12:32:34] [INFO ] Deduced a trap composed of 182 places in 86 ms of which 1 ms to minimize.
[2024-06-01 12:32:35] [INFO ] Deduced a trap composed of 174 places in 88 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/385 variables, 4/8 constraints. Problems are: Problem set: 2 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/385 variables, 0/8 constraints. Problems are: Problem set: 2 solved, 14 unsolved
At refinement iteration 4 (OVERLAPS) 476/861 variables, 385/393 constraints. Problems are: Problem set: 2 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/861 variables, 0/393 constraints. Problems are: Problem set: 2 solved, 14 unsolved
At refinement iteration 6 (OVERLAPS) 0/861 variables, 0/393 constraints. Problems are: Problem set: 2 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 861/861 variables, and 393 constraints, problems are : Problem set: 2 solved, 14 unsolved in 1228 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 385/385 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 2 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 14 unsolved
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp30 is UNSAT
At refinement iteration 1 (OVERLAPS) 349/385 variables, 4/4 constraints. Problems are: Problem set: 4 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/385 variables, 4/8 constraints. Problems are: Problem set: 4 solved, 12 unsolved
[2024-06-01 12:32:35] [INFO ] Deduced a trap composed of 216 places in 105 ms of which 2 ms to minimize.
[2024-06-01 12:32:36] [INFO ] Deduced a trap composed of 175 places in 102 ms of which 2 ms to minimize.
[2024-06-01 12:32:36] [INFO ] Deduced a trap composed of 180 places in 96 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/385 variables, 3/11 constraints. Problems are: Problem set: 4 solved, 12 unsolved
[2024-06-01 12:32:36] [INFO ] Deduced a trap composed of 177 places in 114 ms of which 3 ms to minimize.
[2024-06-01 12:32:36] [INFO ] Deduced a trap composed of 180 places in 100 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/385 variables, 2/13 constraints. Problems are: Problem set: 4 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/385 variables, 0/13 constraints. Problems are: Problem set: 4 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 476/861 variables, 385/398 constraints. Problems are: Problem set: 4 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/861 variables, 12/410 constraints. Problems are: Problem set: 4 solved, 12 unsolved
[2024-06-01 12:32:36] [INFO ] Deduced a trap composed of 175 places in 90 ms of which 3 ms to minimize.
[2024-06-01 12:32:37] [INFO ] Deduced a trap composed of 179 places in 112 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/861 variables, 2/412 constraints. Problems are: Problem set: 4 solved, 12 unsolved
[2024-06-01 12:32:37] [INFO ] Deduced a trap composed of 179 places in 89 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/861 variables, 1/413 constraints. Problems are: Problem set: 4 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/861 variables, 0/413 constraints. Problems are: Problem set: 4 solved, 12 unsolved
At refinement iteration 11 (OVERLAPS) 0/861 variables, 0/413 constraints. Problems are: Problem set: 4 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 861/861 variables, and 413 constraints, problems are : Problem set: 4 solved, 12 unsolved in 2502 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 385/385 constraints, PredecessorRefiner: 12/16 constraints, Known Traps: 12/12 constraints]
After SMT, in 3741ms problems are : Problem set: 4 solved, 12 unsolved
Parikh walk visited 8 properties in 4253 ms.
Support contains 9 out of 385 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 385/385 places, 476/476 transitions.
Graph (trivial) has 378 edges and 385 vertex of which 54 / 385 are part of one of the 8 SCC in 5 ms
Free SCC test removed 46 places
Drop transitions (Empty/Sink Transition effects.) removed 59 transitions
Reduce isomorphic transitions removed 59 transitions.
Graph (complete) has 547 edges and 339 vertex of which 337 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 229 transitions
Trivial Post-agglo rules discarded 229 transitions
Performed 229 trivial Post agglomeration. Transition count delta: 229
Iterating post reduction 0 with 231 rules applied. Total rules applied 233 place count 337 transition count 186
Reduce places removed 229 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 1 with 235 rules applied. Total rules applied 468 place count 108 transition count 180
Reduce places removed 3 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 6 rules applied. Total rules applied 474 place count 105 transition count 177
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 477 place count 102 transition count 177
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 14 Pre rules applied. Total rules applied 477 place count 102 transition count 163
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 505 place count 88 transition count 163
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 516 place count 77 transition count 152
Iterating global reduction 4 with 11 rules applied. Total rules applied 527 place count 77 transition count 152
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 527 place count 77 transition count 150
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 531 place count 75 transition count 150
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 536 place count 70 transition count 119
Iterating global reduction 4 with 5 rules applied. Total rules applied 541 place count 70 transition count 119
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 543 place count 70 transition count 117
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 5 with 20 rules applied. Total rules applied 563 place count 60 transition count 107
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 569 place count 60 transition count 101
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 573 place count 56 transition count 89
Iterating global reduction 6 with 4 rules applied. Total rules applied 577 place count 56 transition count 89
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 579 place count 56 transition count 87
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 580 place count 55 transition count 86
Iterating global reduction 7 with 1 rules applied. Total rules applied 581 place count 55 transition count 86
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 7 with 8 rules applied. Total rules applied 589 place count 51 transition count 82
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 7 with 8 rules applied. Total rules applied 597 place count 47 transition count 86
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 598 place count 47 transition count 85
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 602 place count 47 transition count 81
Free-agglomeration rule applied 17 times.
Iterating global reduction 8 with 17 rules applied. Total rules applied 619 place count 47 transition count 64
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 8 with 17 rules applied. Total rules applied 636 place count 30 transition count 64
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 639 place count 27 transition count 61
Iterating global reduction 9 with 3 rules applied. Total rules applied 642 place count 27 transition count 61
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 9 with 4 rules applied. Total rules applied 646 place count 27 transition count 57
Applied a total of 646 rules in 99 ms. Remains 27 /385 variables (removed 358) and now considering 57/476 (removed 419) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 100 ms. Remains : 27/385 places, 57/476 transitions.
RANDOM walk for 20276 steps (43 resets) in 197 ms. (102 steps per ms) remains 0/4 properties
Successfully simplified 4 atomic propositions for a total of 15 simplifications.
Initial state reduction rules removed 2 formulas.
FORMULA StigmergyElection-PT-03b-CTLCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-03b-CTLCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 12:32:42] [INFO ] Flatten gal took : 18 ms
[2024-06-01 12:32:42] [INFO ] Flatten gal took : 19 ms
[2024-06-01 12:32:42] [INFO ] Input system was already deterministic with 476 transitions.
Computed a total of 49 stabilizing places and 52 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 385/385 places, 476/476 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 359 transition count 450
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 359 transition count 450
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 68 place count 343 transition count 434
Iterating global reduction 0 with 16 rules applied. Total rules applied 84 place count 343 transition count 434
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 86 place count 341 transition count 432
Iterating global reduction 0 with 2 rules applied. Total rules applied 88 place count 341 transition count 432
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 89 place count 340 transition count 431
Iterating global reduction 0 with 1 rules applied. Total rules applied 90 place count 340 transition count 431
Applied a total of 90 rules in 41 ms. Remains 340 /385 variables (removed 45) and now considering 431/476 (removed 45) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41 ms. Remains : 340/385 places, 431/476 transitions.
[2024-06-01 12:32:42] [INFO ] Flatten gal took : 15 ms
[2024-06-01 12:32:42] [INFO ] Flatten gal took : 15 ms
[2024-06-01 12:32:42] [INFO ] Input system was already deterministic with 431 transitions.
Starting structural reductions in LTL mode, iteration 0 : 385/385 places, 476/476 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 361 transition count 452
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 361 transition count 452
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 63 place count 346 transition count 437
Iterating global reduction 0 with 15 rules applied. Total rules applied 78 place count 346 transition count 437
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 81 place count 343 transition count 434
Iterating global reduction 0 with 3 rules applied. Total rules applied 84 place count 343 transition count 434
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 86 place count 341 transition count 432
Iterating global reduction 0 with 2 rules applied. Total rules applied 88 place count 341 transition count 432
Applied a total of 88 rules in 40 ms. Remains 341 /385 variables (removed 44) and now considering 432/476 (removed 44) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40 ms. Remains : 341/385 places, 432/476 transitions.
[2024-06-01 12:32:42] [INFO ] Flatten gal took : 14 ms
[2024-06-01 12:32:42] [INFO ] Flatten gal took : 15 ms
[2024-06-01 12:32:42] [INFO ] Input system was already deterministic with 432 transitions.
Starting structural reductions in LTL mode, iteration 0 : 385/385 places, 476/476 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 357 transition count 448
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 357 transition count 448
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 73 place count 340 transition count 431
Iterating global reduction 0 with 17 rules applied. Total rules applied 90 place count 340 transition count 431
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 93 place count 337 transition count 428
Iterating global reduction 0 with 3 rules applied. Total rules applied 96 place count 337 transition count 428
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 98 place count 335 transition count 426
Iterating global reduction 0 with 2 rules applied. Total rules applied 100 place count 335 transition count 426
Applied a total of 100 rules in 41 ms. Remains 335 /385 variables (removed 50) and now considering 426/476 (removed 50) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41 ms. Remains : 335/385 places, 426/476 transitions.
[2024-06-01 12:32:43] [INFO ] Flatten gal took : 14 ms
[2024-06-01 12:32:43] [INFO ] Flatten gal took : 14 ms
[2024-06-01 12:32:43] [INFO ] Input system was already deterministic with 426 transitions.
Starting structural reductions in LTL mode, iteration 0 : 385/385 places, 476/476 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 359 transition count 450
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 359 transition count 450
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 66 place count 345 transition count 436
Iterating global reduction 0 with 14 rules applied. Total rules applied 80 place count 345 transition count 436
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 82 place count 343 transition count 434
Iterating global reduction 0 with 2 rules applied. Total rules applied 84 place count 343 transition count 434
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 85 place count 342 transition count 433
Iterating global reduction 0 with 1 rules applied. Total rules applied 86 place count 342 transition count 433
Applied a total of 86 rules in 39 ms. Remains 342 /385 variables (removed 43) and now considering 433/476 (removed 43) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39 ms. Remains : 342/385 places, 433/476 transitions.
[2024-06-01 12:32:43] [INFO ] Flatten gal took : 13 ms
[2024-06-01 12:32:43] [INFO ] Flatten gal took : 13 ms
[2024-06-01 12:32:43] [INFO ] Input system was already deterministic with 433 transitions.
Starting structural reductions in LTL mode, iteration 0 : 385/385 places, 476/476 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 358 transition count 449
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 358 transition count 449
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 71 place count 341 transition count 432
Iterating global reduction 0 with 17 rules applied. Total rules applied 88 place count 341 transition count 432
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 91 place count 338 transition count 429
Iterating global reduction 0 with 3 rules applied. Total rules applied 94 place count 338 transition count 429
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 96 place count 336 transition count 427
Iterating global reduction 0 with 2 rules applied. Total rules applied 98 place count 336 transition count 427
Applied a total of 98 rules in 39 ms. Remains 336 /385 variables (removed 49) and now considering 427/476 (removed 49) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39 ms. Remains : 336/385 places, 427/476 transitions.
[2024-06-01 12:32:43] [INFO ] Flatten gal took : 12 ms
[2024-06-01 12:32:43] [INFO ] Flatten gal took : 13 ms
[2024-06-01 12:32:43] [INFO ] Input system was already deterministic with 427 transitions.
Starting structural reductions in LTL mode, iteration 0 : 385/385 places, 476/476 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 357 transition count 448
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 357 transition count 448
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 73 place count 340 transition count 431
Iterating global reduction 0 with 17 rules applied. Total rules applied 90 place count 340 transition count 431
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 93 place count 337 transition count 428
Iterating global reduction 0 with 3 rules applied. Total rules applied 96 place count 337 transition count 428
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 98 place count 335 transition count 426
Iterating global reduction 0 with 2 rules applied. Total rules applied 100 place count 335 transition count 426
Applied a total of 100 rules in 39 ms. Remains 335 /385 variables (removed 50) and now considering 426/476 (removed 50) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39 ms. Remains : 335/385 places, 426/476 transitions.
[2024-06-01 12:32:43] [INFO ] Flatten gal took : 12 ms
[2024-06-01 12:32:43] [INFO ] Flatten gal took : 18 ms
[2024-06-01 12:32:43] [INFO ] Input system was already deterministic with 426 transitions.
Starting structural reductions in LTL mode, iteration 0 : 385/385 places, 476/476 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 357 transition count 448
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 357 transition count 448
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 73 place count 340 transition count 431
Iterating global reduction 0 with 17 rules applied. Total rules applied 90 place count 340 transition count 431
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 93 place count 337 transition count 428
Iterating global reduction 0 with 3 rules applied. Total rules applied 96 place count 337 transition count 428
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 98 place count 335 transition count 426
Iterating global reduction 0 with 2 rules applied. Total rules applied 100 place count 335 transition count 426
Applied a total of 100 rules in 38 ms. Remains 335 /385 variables (removed 50) and now considering 426/476 (removed 50) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 38 ms. Remains : 335/385 places, 426/476 transitions.
[2024-06-01 12:32:43] [INFO ] Flatten gal took : 11 ms
[2024-06-01 12:32:43] [INFO ] Flatten gal took : 11 ms
[2024-06-01 12:32:43] [INFO ] Input system was already deterministic with 426 transitions.
Starting structural reductions in LTL mode, iteration 0 : 385/385 places, 476/476 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 360 transition count 451
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 360 transition count 451
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 66 place count 344 transition count 435
Iterating global reduction 0 with 16 rules applied. Total rules applied 82 place count 344 transition count 435
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 85 place count 341 transition count 432
Iterating global reduction 0 with 3 rules applied. Total rules applied 88 place count 341 transition count 432
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 90 place count 339 transition count 430
Iterating global reduction 0 with 2 rules applied. Total rules applied 92 place count 339 transition count 430
Applied a total of 92 rules in 46 ms. Remains 339 /385 variables (removed 46) and now considering 430/476 (removed 46) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 46 ms. Remains : 339/385 places, 430/476 transitions.
[2024-06-01 12:32:43] [INFO ] Flatten gal took : 11 ms
[2024-06-01 12:32:43] [INFO ] Flatten gal took : 11 ms
[2024-06-01 12:32:43] [INFO ] Input system was already deterministic with 430 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 385/385 places, 476/476 transitions.
Graph (trivial) has 383 edges and 385 vertex of which 56 / 385 are part of one of the 9 SCC in 1 ms
Free SCC test removed 47 places
Ensure Unique test removed 52 transitions
Reduce isomorphic transitions removed 52 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 233 transitions
Trivial Post-agglo rules discarded 233 transitions
Performed 233 trivial Post agglomeration. Transition count delta: 233
Iterating post reduction 0 with 233 rules applied. Total rules applied 234 place count 337 transition count 190
Reduce places removed 233 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 1 with 239 rules applied. Total rules applied 473 place count 104 transition count 184
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 477 place count 101 transition count 183
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 478 place count 100 transition count 183
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 9 Pre rules applied. Total rules applied 478 place count 100 transition count 174
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 496 place count 91 transition count 174
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 508 place count 79 transition count 162
Iterating global reduction 4 with 12 rules applied. Total rules applied 520 place count 79 transition count 162
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 520 place count 79 transition count 161
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 522 place count 78 transition count 161
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 526 place count 74 transition count 131
Iterating global reduction 4 with 4 rules applied. Total rules applied 530 place count 74 transition count 131
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 534 place count 74 transition count 127
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 5 with 20 rules applied. Total rules applied 554 place count 64 transition count 117
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 561 place count 57 transition count 97
Iterating global reduction 5 with 7 rules applied. Total rules applied 568 place count 57 transition count 97
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 571 place count 57 transition count 94
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 573 place count 55 transition count 90
Iterating global reduction 6 with 2 rules applied. Total rules applied 575 place count 55 transition count 90
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 577 place count 53 transition count 88
Iterating global reduction 6 with 2 rules applied. Total rules applied 579 place count 53 transition count 88
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 583 place count 53 transition count 84
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 591 place count 49 transition count 80
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 592 place count 48 transition count 79
Applied a total of 592 rules in 34 ms. Remains 48 /385 variables (removed 337) and now considering 79/476 (removed 397) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 34 ms. Remains : 48/385 places, 79/476 transitions.
[2024-06-01 12:32:43] [INFO ] Flatten gal took : 3 ms
[2024-06-01 12:32:43] [INFO ] Flatten gal took : 3 ms
[2024-06-01 12:32:43] [INFO ] Input system was already deterministic with 79 transitions.
Starting structural reductions in LTL mode, iteration 0 : 385/385 places, 476/476 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 358 transition count 449
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 358 transition count 449
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 70 place count 342 transition count 433
Iterating global reduction 0 with 16 rules applied. Total rules applied 86 place count 342 transition count 433
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 89 place count 339 transition count 430
Iterating global reduction 0 with 3 rules applied. Total rules applied 92 place count 339 transition count 430
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 94 place count 337 transition count 428
Iterating global reduction 0 with 2 rules applied. Total rules applied 96 place count 337 transition count 428
Applied a total of 96 rules in 42 ms. Remains 337 /385 variables (removed 48) and now considering 428/476 (removed 48) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42 ms. Remains : 337/385 places, 428/476 transitions.
[2024-06-01 12:32:43] [INFO ] Flatten gal took : 11 ms
[2024-06-01 12:32:43] [INFO ] Flatten gal took : 11 ms
[2024-06-01 12:32:43] [INFO ] Input system was already deterministic with 428 transitions.
Starting structural reductions in LTL mode, iteration 0 : 385/385 places, 476/476 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 357 transition count 448
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 357 transition count 448
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 73 place count 340 transition count 431
Iterating global reduction 0 with 17 rules applied. Total rules applied 90 place count 340 transition count 431
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 93 place count 337 transition count 428
Iterating global reduction 0 with 3 rules applied. Total rules applied 96 place count 337 transition count 428
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 98 place count 335 transition count 426
Iterating global reduction 0 with 2 rules applied. Total rules applied 100 place count 335 transition count 426
Applied a total of 100 rules in 41 ms. Remains 335 /385 variables (removed 50) and now considering 426/476 (removed 50) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41 ms. Remains : 335/385 places, 426/476 transitions.
[2024-06-01 12:32:43] [INFO ] Flatten gal took : 10 ms
[2024-06-01 12:32:43] [INFO ] Flatten gal took : 11 ms
[2024-06-01 12:32:43] [INFO ] Input system was already deterministic with 426 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 385/385 places, 476/476 transitions.
Graph (trivial) has 389 edges and 385 vertex of which 56 / 385 are part of one of the 8 SCC in 1 ms
Free SCC test removed 48 places
Ensure Unique test removed 54 transitions
Reduce isomorphic transitions removed 54 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 235 transitions
Trivial Post-agglo rules discarded 235 transitions
Performed 235 trivial Post agglomeration. Transition count delta: 235
Iterating post reduction 0 with 235 rules applied. Total rules applied 236 place count 336 transition count 186
Reduce places removed 235 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 1 with 241 rules applied. Total rules applied 477 place count 101 transition count 180
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 481 place count 98 transition count 179
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 482 place count 97 transition count 179
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 10 Pre rules applied. Total rules applied 482 place count 97 transition count 169
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 502 place count 87 transition count 169
Discarding 13 places :
Symmetric choice reduction at 4 with 13 rule applications. Total rules 515 place count 74 transition count 156
Iterating global reduction 4 with 13 rules applied. Total rules applied 528 place count 74 transition count 156
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 528 place count 74 transition count 154
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 532 place count 72 transition count 154
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 537 place count 67 transition count 123
Iterating global reduction 4 with 5 rules applied. Total rules applied 542 place count 67 transition count 123
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 545 place count 67 transition count 120
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 5 with 18 rules applied. Total rules applied 563 place count 58 transition count 111
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 571 place count 50 transition count 89
Iterating global reduction 5 with 8 rules applied. Total rules applied 579 place count 50 transition count 89
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 582 place count 50 transition count 86
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 585 place count 47 transition count 80
Iterating global reduction 6 with 3 rules applied. Total rules applied 588 place count 47 transition count 80
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 591 place count 44 transition count 77
Iterating global reduction 6 with 3 rules applied. Total rules applied 594 place count 44 transition count 77
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 597 place count 44 transition count 74
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 6 with 6 rules applied. Total rules applied 603 place count 41 transition count 71
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 604 place count 40 transition count 70
Applied a total of 604 rules in 27 ms. Remains 40 /385 variables (removed 345) and now considering 70/476 (removed 406) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 27 ms. Remains : 40/385 places, 70/476 transitions.
[2024-06-01 12:32:43] [INFO ] Flatten gal took : 3 ms
[2024-06-01 12:32:43] [INFO ] Flatten gal took : 2 ms
[2024-06-01 12:32:43] [INFO ] Input system was already deterministic with 70 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 385/385 places, 476/476 transitions.
Graph (trivial) has 386 edges and 385 vertex of which 48 / 385 are part of one of the 8 SCC in 1 ms
Free SCC test removed 40 places
Ensure Unique test removed 44 transitions
Reduce isomorphic transitions removed 44 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 240 transitions
Trivial Post-agglo rules discarded 240 transitions
Performed 240 trivial Post agglomeration. Transition count delta: 240
Iterating post reduction 0 with 240 rules applied. Total rules applied 241 place count 344 transition count 191
Reduce places removed 240 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 248 rules applied. Total rules applied 489 place count 104 transition count 183
Reduce places removed 4 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 6 rules applied. Total rules applied 495 place count 100 transition count 181
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 497 place count 98 transition count 181
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 10 Pre rules applied. Total rules applied 497 place count 98 transition count 171
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 517 place count 88 transition count 171
Discarding 13 places :
Symmetric choice reduction at 4 with 13 rule applications. Total rules 530 place count 75 transition count 158
Iterating global reduction 4 with 13 rules applied. Total rules applied 543 place count 75 transition count 158
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 543 place count 75 transition count 156
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 547 place count 73 transition count 156
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 552 place count 68 transition count 125
Iterating global reduction 4 with 5 rules applied. Total rules applied 557 place count 68 transition count 125
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 561 place count 68 transition count 121
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 5 with 18 rules applied. Total rules applied 579 place count 59 transition count 112
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 584 place count 54 transition count 95
Iterating global reduction 5 with 5 rules applied. Total rules applied 589 place count 54 transition count 95
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 592 place count 54 transition count 92
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 593 place count 53 transition count 90
Iterating global reduction 6 with 1 rules applied. Total rules applied 594 place count 53 transition count 90
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 595 place count 52 transition count 89
Iterating global reduction 6 with 1 rules applied. Total rules applied 596 place count 52 transition count 89
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 600 place count 52 transition count 85
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 608 place count 48 transition count 81
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 609 place count 47 transition count 80
Applied a total of 609 rules in 22 ms. Remains 47 /385 variables (removed 338) and now considering 80/476 (removed 396) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 22 ms. Remains : 47/385 places, 80/476 transitions.
[2024-06-01 12:32:43] [INFO ] Flatten gal took : 2 ms
[2024-06-01 12:32:43] [INFO ] Flatten gal took : 2 ms
[2024-06-01 12:32:43] [INFO ] Input system was already deterministic with 80 transitions.
[2024-06-01 12:32:43] [INFO ] Flatten gal took : 12 ms
[2024-06-01 12:32:43] [INFO ] Flatten gal took : 12 ms
[2024-06-01 12:32:43] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2024-06-01 12:32:43] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 385 places, 476 transitions and 1239 arcs took 3 ms.
Total runtime 71565 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-03b-CTLCardinality-2024-00
Could not compute solution for formula : StigmergyElection-PT-03b-CTLCardinality-2024-01
Could not compute solution for formula : StigmergyElection-PT-03b-CTLCardinality-2024-02
Could not compute solution for formula : StigmergyElection-PT-03b-CTLCardinality-2024-03
Could not compute solution for formula : StigmergyElection-PT-03b-CTLCardinality-2024-04
Could not compute solution for formula : StigmergyElection-PT-03b-CTLCardinality-2024-05
Could not compute solution for formula : StigmergyElection-PT-03b-CTLCardinality-2024-08
Could not compute solution for formula : StigmergyElection-PT-03b-CTLCardinality-2024-10
Could not compute solution for formula : StigmergyElection-PT-03b-CTLCardinality-2024-11
Could not compute solution for formula : StigmergyElection-PT-03b-CTLCardinality-2023-12
Could not compute solution for formula : StigmergyElection-PT-03b-CTLCardinality-2023-13
Could not compute solution for formula : StigmergyElection-PT-03b-CTLCardinality-2023-14
Could not compute solution for formula : StigmergyElection-PT-03b-CTLCardinality-2023-15

BK_STOP 1717245164285

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -timeout 360 -rebuildPNML
mcc2024
ctl formula name StigmergyElection-PT-03b-CTLCardinality-2024-00
ctl formula formula --ctl=/tmp/633/ctl_0_
ctl formula name StigmergyElection-PT-03b-CTLCardinality-2024-01
ctl formula formula --ctl=/tmp/633/ctl_1_
ctl formula name StigmergyElection-PT-03b-CTLCardinality-2024-02
ctl formula formula --ctl=/tmp/633/ctl_2_
ctl formula name StigmergyElection-PT-03b-CTLCardinality-2024-03
ctl formula formula --ctl=/tmp/633/ctl_3_
ctl formula name StigmergyElection-PT-03b-CTLCardinality-2024-04
ctl formula formula --ctl=/tmp/633/ctl_4_
ctl formula name StigmergyElection-PT-03b-CTLCardinality-2024-05
ctl formula formula --ctl=/tmp/633/ctl_5_
ctl formula name StigmergyElection-PT-03b-CTLCardinality-2024-08
ctl formula formula --ctl=/tmp/633/ctl_6_
ctl formula name StigmergyElection-PT-03b-CTLCardinality-2024-10
ctl formula formula --ctl=/tmp/633/ctl_7_
ctl formula name StigmergyElection-PT-03b-CTLCardinality-2024-11
ctl formula formula --ctl=/tmp/633/ctl_8_
ctl formula name StigmergyElection-PT-03b-CTLCardinality-2023-12
ctl formula formula --ctl=/tmp/633/ctl_9_
ctl formula name StigmergyElection-PT-03b-CTLCardinality-2023-13
ctl formula formula --ctl=/tmp/633/ctl_10_
ctl formula name StigmergyElection-PT-03b-CTLCardinality-2023-14
ctl formula formula --ctl=/tmp/633/ctl_11_
ctl formula name StigmergyElection-PT-03b-CTLCardinality-2023-15
ctl formula formula --ctl=/tmp/633/ctl_12_
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-03b"
export BK_EXAMINATION="CTLCardinality"
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-03b, examination is CTLCardinality"
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-171690532000273"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/StigmergyElection-PT-03b.tgz
mv StigmergyElection-PT-03b execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;