Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 9.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 113K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Apr 23 08:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 08:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 23 08:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 08:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 11 18:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 118K Apr 11 18:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K Apr 11 18:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 145K Apr 11 18:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 08:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 08:00 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 565K 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-06a-CTLFireability-2024-00
FORMULA_NAME StigmergyElection-PT-06a-CTLFireability-2024-01
FORMULA_NAME StigmergyElection-PT-06a-CTLFireability-2024-02
FORMULA_NAME StigmergyElection-PT-06a-CTLFireability-2024-03
FORMULA_NAME StigmergyElection-PT-06a-CTLFireability-2024-04
FORMULA_NAME StigmergyElection-PT-06a-CTLFireability-2024-05
FORMULA_NAME StigmergyElection-PT-06a-CTLFireability-2024-06
FORMULA_NAME StigmergyElection-PT-06a-CTLFireability-2024-07
FORMULA_NAME StigmergyElection-PT-06a-CTLFireability-2024-08
FORMULA_NAME StigmergyElection-PT-06a-CTLFireability-2024-09
FORMULA_NAME StigmergyElection-PT-06a-CTLFireability-2024-10
FORMULA_NAME StigmergyElection-PT-06a-CTLFireability-2024-11
FORMULA_NAME StigmergyElection-PT-06a-CTLFireability-2023-12
FORMULA_NAME StigmergyElection-PT-06a-CTLFireability-2023-13
FORMULA_NAME StigmergyElection-PT-06a-CTLFireability-2023-14
FORMULA_NAME StigmergyElection-PT-06a-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1717010430166

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyElection-PT-06a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-29 19:20:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-29 19:20:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 19:20:31] [INFO ] Load time of PNML (sax parser for PT used): 135 ms
[2024-05-29 19:20:31] [INFO ] Transformed 86 places.
[2024-05-29 19:20:31] [INFO ] Transformed 1042 transitions.
[2024-05-29 19:20:31] [INFO ] Found NUPN structural information;
[2024-05-29 19:20:31] [INFO ] Parsed PT model containing 86 places and 1042 transitions and 11192 arcs in 257 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 12 ms.
Initial state reduction rules removed 1 formulas.
Ensure Unique test removed 800 transitions
Reduce redundant transitions removed 800 transitions.
FORMULA StigmergyElection-PT-06a-CTLFireability-2023-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 17 out of 86 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 242/242 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 79 transition count 233
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 79 transition count 233
Applied a total of 14 rules in 21 ms. Remains 79 /86 variables (removed 7) and now considering 233/242 (removed 9) transitions.
[2024-05-29 19:20:31] [INFO ] Flow matrix only has 222 transitions (discarded 11 similar events)
// Phase 1: matrix 222 rows 79 cols
[2024-05-29 19:20:31] [INFO ] Computed 2 invariants in 16 ms
[2024-05-29 19:20:31] [INFO ] Implicit Places using invariants in 199 ms returned []
[2024-05-29 19:20:31] [INFO ] Flow matrix only has 222 transitions (discarded 11 similar events)
[2024-05-29 19:20:31] [INFO ] Invariant cache hit.
[2024-05-29 19:20:32] [INFO ] State equation strengthened by 155 read => feed constraints.
[2024-05-29 19:20:32] [INFO ] Implicit Places using invariants and state equation in 158 ms returned []
Implicit Place search using SMT with State Equation took 390 ms to find 0 implicit places.
Running 232 sub problems to find dead transitions.
[2024-05-29 19:20:32] [INFO ] Flow matrix only has 222 transitions (discarded 11 similar events)
[2024-05-29 19:20:32] [INFO ] Invariant cache hit.
[2024-05-29 19:20:32] [INFO ] State equation strengthened by 155 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 1 (OVERLAPS) 1/79 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-05-29 19:20:33] [INFO ] Deduced a trap composed of 12 places in 95 ms of which 12 ms to minimize.
[2024-05-29 19:20:33] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 1 ms to minimize.
[2024-05-29 19:20:33] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 1 ms to minimize.
[2024-05-29 19:20:34] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 1 ms to minimize.
[2024-05-29 19:20:34] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 1 ms to minimize.
[2024-05-29 19:20:34] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 1 ms to minimize.
[2024-05-29 19:20:34] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 1 ms to minimize.
[2024-05-29 19:20:34] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 1 ms to minimize.
[2024-05-29 19:20:34] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 0 ms to minimize.
[2024-05-29 19:20:34] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 1 ms to minimize.
[2024-05-29 19:20:34] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 1 ms to minimize.
[2024-05-29 19:20:34] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
[2024-05-29 19:20:34] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2024-05-29 19:20:34] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 0 ms to minimize.
[2024-05-29 19:20:34] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
[2024-05-29 19:20:34] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 1 ms to minimize.
[2024-05-29 19:20:34] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
[2024-05-29 19:20:34] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
[2024-05-29 19:20:34] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 3 ms to minimize.
[2024-05-29 19:20:34] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-05-29 19:20:34] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 0 ms to minimize.
[2024-05-29 19:20:34] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 0 ms to minimize.
[2024-05-29 19:20:34] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 0 ms to minimize.
[2024-05-29 19:20:35] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 2 ms to minimize.
[2024-05-29 19:20:35] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2024-05-29 19:20:35] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 0 ms to minimize.
[2024-05-29 19:20:35] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2024-05-29 19:20:35] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 0 ms to minimize.
[2024-05-29 19:20:35] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 1 ms to minimize.
[2024-05-29 19:20:35] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
[2024-05-29 19:20:35] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
[2024-05-29 19:20:35] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
[2024-05-29 19:20:35] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
[2024-05-29 19:20:35] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 1 ms to minimize.
[2024-05-29 19:20:35] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 4 ms to minimize.
[2024-05-29 19:20:35] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
[2024-05-29 19:20:35] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 0 ms to minimize.
[2024-05-29 19:20:35] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 0 ms to minimize.
[2024-05-29 19:20:35] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 0 ms to minimize.
[2024-05-29 19:20:35] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/79 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-05-29 19:20:36] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2024-05-29 19:20:36] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 0 ms to minimize.
[2024-05-29 19:20:36] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 1 ms to minimize.
[2024-05-29 19:20:36] [INFO ] Deduced a trap composed of 15 places in 21 ms of which 1 ms to minimize.
[2024-05-29 19:20:36] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 0 ms to minimize.
[2024-05-29 19:20:36] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
[2024-05-29 19:20:36] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
[2024-05-29 19:20:36] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 0 ms to minimize.
[2024-05-29 19:20:36] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
[2024-05-29 19:20:36] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 0 ms to minimize.
[2024-05-29 19:20:36] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 11/53 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-05-29 19:20:36] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 0 ms to minimize.
[2024-05-29 19:20:37] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 1 ms to minimize.
[2024-05-29 19:20:37] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
[2024-05-29 19:20:37] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 0 ms to minimize.
[2024-05-29 19:20:37] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 8 ms to minimize.
[2024-05-29 19:20:37] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 0 ms to minimize.
[2024-05-29 19:20:37] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 1 ms to minimize.
[2024-05-29 19:20:37] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 0 ms to minimize.
[2024-05-29 19:20:37] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
[2024-05-29 19:20:37] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 0 ms to minimize.
[2024-05-29 19:20:37] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 0 ms to minimize.
[2024-05-29 19:20:37] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 0 ms to minimize.
[2024-05-29 19:20:37] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
[2024-05-29 19:20:37] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2024-05-29 19:20:37] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 0 ms to minimize.
[2024-05-29 19:20:37] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 0 ms to minimize.
[2024-05-29 19:20:37] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 1 ms to minimize.
[2024-05-29 19:20:37] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 0 ms to minimize.
[2024-05-29 19:20:38] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 1 ms to minimize.
[2024-05-29 19:20:38] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/79 variables, 20/73 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-05-29 19:20:38] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
[2024-05-29 19:20:38] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2024-05-29 19:20:38] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
[2024-05-29 19:20:38] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 1 ms to minimize.
[2024-05-29 19:20:38] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/79 variables, 5/78 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/79 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 8 (OVERLAPS) 221/300 variables, 79/157 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/300 variables, 154/311 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/300 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 11 (OVERLAPS) 1/301 variables, 1/312 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-05-29 19:20:44] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/301 variables, 1/313 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-05-29 19:20:46] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/301 variables, 1/314 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/301 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 15 (OVERLAPS) 0/301 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 232 unsolved
No progress, stopping.
After SMT solving in domain Real declared 301/301 variables, and 314 constraints, problems are : Problem set: 0 solved, 232 unsolved in 20705 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 79/79 constraints, ReadFeed: 155/155 constraints, PredecessorRefiner: 232/232 constraints, Known Traps: 78/78 constraints]
Escalating to Integer solving :Problem set: 0 solved, 232 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 1 (OVERLAPS) 1/79 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 78/80 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-05-29 19:20:55] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/79 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-05-29 19:20:55] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
[2024-05-29 19:20:55] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 2/83 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/79 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 6 (OVERLAPS) 221/300 variables, 79/162 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/300 variables, 154/316 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/300 variables, 232/548 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/300 variables, 0/548 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 10 (OVERLAPS) 1/301 variables, 1/549 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/301 variables, 0/549 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 12 (OVERLAPS) 0/301 variables, 0/549 constraints. Problems are: Problem set: 0 solved, 232 unsolved
No progress, stopping.
After SMT solving in domain Int declared 301/301 variables, and 549 constraints, problems are : Problem set: 0 solved, 232 unsolved in 27855 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 79/79 constraints, ReadFeed: 155/155 constraints, PredecessorRefiner: 232/232 constraints, Known Traps: 81/81 constraints]
After SMT, in 49172ms problems are : Problem set: 0 solved, 232 unsolved
Search for dead transitions found 0 dead transitions in 49196ms
Starting structural reductions in LTL mode, iteration 1 : 79/86 places, 233/242 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 49628 ms. Remains : 79/86 places, 233/242 transitions.
Support contains 17 out of 79 places after structural reductions.
[2024-05-29 19:21:21] [INFO ] Flatten gal took : 47 ms
[2024-05-29 19:21:21] [INFO ] Flatten gal took : 23 ms
[2024-05-29 19:21:21] [INFO ] Input system was already deterministic with 233 transitions.
Reduction of identical properties reduced properties to check from 18 to 12
RANDOM walk for 40000 steps (86 resets) in 1964 ms. (20 steps per ms) remains 2/12 properties
BEST_FIRST walk for 40004 steps (40 resets) in 388 ms. (102 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (10 resets) in 96 ms. (412 steps per ms) remains 2/2 properties
[2024-05-29 19:21:22] [INFO ] Flow matrix only has 222 transitions (discarded 11 similar events)
[2024-05-29 19:21:22] [INFO ] Invariant cache hit.
[2024-05-29 19:21:22] [INFO ] State equation strengthened by 155 read => feed constraints.
Problem AtomicPropp1 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 70/78 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-29 19:21:22] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 1 ms to minimize.
[2024-05-29 19:21:22] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 1 ms to minimize.
[2024-05-29 19:21:22] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 1 ms to minimize.
[2024-05-29 19:21:22] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 1 ms to minimize.
[2024-05-29 19:21:22] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 0 ms to minimize.
[2024-05-29 19:21:22] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 0 ms to minimize.
[2024-05-29 19:21:22] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 1 ms to minimize.
[2024-05-29 19:21:22] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 8/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 1/79 variables, 1/10 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/79 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Problem AtomicPropp13 is UNSAT
After SMT solving in domain Real declared 300/301 variables, and 89 constraints, problems are : Problem set: 2 solved, 0 unsolved in 533 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 79/79 constraints, ReadFeed: 0/155 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 8/8 constraints]
After SMT, in 552ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 5 atomic propositions for a total of 15 simplifications.
[2024-05-29 19:21:22] [INFO ] Flatten gal took : 17 ms
[2024-05-29 19:21:23] [INFO ] Flatten gal took : 16 ms
[2024-05-29 19:21:23] [INFO ] Input system was already deterministic with 233 transitions.
Computed a total of 14 stabilizing places and 13 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 233/233 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 73 transition count 221
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 73 transition count 221
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 16 place count 69 transition count 213
Iterating global reduction 0 with 4 rules applied. Total rules applied 20 place count 69 transition count 213
Applied a total of 20 rules in 7 ms. Remains 69 /79 variables (removed 10) and now considering 213/233 (removed 20) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 69/79 places, 213/233 transitions.
[2024-05-29 19:21:23] [INFO ] Flatten gal took : 13 ms
[2024-05-29 19:21:23] [INFO ] Flatten gal took : 13 ms
[2024-05-29 19:21:23] [INFO ] Input system was already deterministic with 213 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 79/79 places, 233/233 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 77 transition count 220
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 25 place count 65 transition count 220
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 25 place count 65 transition count 202
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 61 place count 47 transition count 202
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 73 place count 35 transition count 184
Iterating global reduction 2 with 12 rules applied. Total rules applied 85 place count 35 transition count 184
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 88 place count 35 transition count 181
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 92 place count 31 transition count 173
Iterating global reduction 3 with 4 rules applied. Total rules applied 96 place count 31 transition count 173
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 3 with 60 rules applied. Total rules applied 156 place count 31 transition count 113
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 162 place count 31 transition count 107
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 174 place count 25 transition count 101
Applied a total of 174 rules in 48 ms. Remains 25 /79 variables (removed 54) and now considering 101/233 (removed 132) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 48 ms. Remains : 25/79 places, 101/233 transitions.
[2024-05-29 19:21:23] [INFO ] Flatten gal took : 6 ms
[2024-05-29 19:21:23] [INFO ] Flatten gal took : 7 ms
[2024-05-29 19:21:23] [INFO ] Input system was already deterministic with 101 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 79/79 places, 233/233 transitions.
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 12 Pre rules applied. Total rules applied 0 place count 79 transition count 221
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 24 rules applied. Total rules applied 24 place count 67 transition count 221
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 30 place count 61 transition count 209
Iterating global reduction 0 with 6 rules applied. Total rules applied 36 place count 61 transition count 209
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 42 place count 55 transition count 199
Iterating global reduction 0 with 6 rules applied. Total rules applied 48 place count 55 transition count 199
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 51 place count 55 transition count 196
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 54 place count 52 transition count 193
Iterating global reduction 1 with 3 rules applied. Total rules applied 57 place count 52 transition count 193
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 85 place count 52 transition count 165
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 91 place count 52 transition count 159
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 103 place count 46 transition count 153
Applied a total of 103 rules in 34 ms. Remains 46 /79 variables (removed 33) and now considering 153/233 (removed 80) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 34 ms. Remains : 46/79 places, 153/233 transitions.
[2024-05-29 19:21:23] [INFO ] Flatten gal took : 10 ms
[2024-05-29 19:21:23] [INFO ] Flatten gal took : 10 ms
[2024-05-29 19:21:23] [INFO ] Input system was already deterministic with 153 transitions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 233/233 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 74 transition count 223
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 74 transition count 223
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 14 place count 70 transition count 215
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 70 transition count 215
Applied a total of 18 rules in 5 ms. Remains 70 /79 variables (removed 9) and now considering 215/233 (removed 18) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 70/79 places, 215/233 transitions.
[2024-05-29 19:21:23] [INFO ] Flatten gal took : 9 ms
[2024-05-29 19:21:23] [INFO ] Flatten gal took : 11 ms
[2024-05-29 19:21:23] [INFO ] Input system was already deterministic with 215 transitions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 233/233 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 74 transition count 223
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 74 transition count 223
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 13 place count 71 transition count 217
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 71 transition count 217
Applied a total of 16 rules in 5 ms. Remains 71 /79 variables (removed 8) and now considering 217/233 (removed 16) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 71/79 places, 217/233 transitions.
[2024-05-29 19:21:23] [INFO ] Flatten gal took : 10 ms
[2024-05-29 19:21:23] [INFO ] Flatten gal took : 10 ms
[2024-05-29 19:21:23] [INFO ] Input system was already deterministic with 217 transitions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 233/233 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 73 transition count 221
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 73 transition count 221
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 16 place count 69 transition count 213
Iterating global reduction 0 with 4 rules applied. Total rules applied 20 place count 69 transition count 213
Applied a total of 20 rules in 5 ms. Remains 69 /79 variables (removed 10) and now considering 213/233 (removed 20) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 69/79 places, 213/233 transitions.
[2024-05-29 19:21:23] [INFO ] Flatten gal took : 10 ms
[2024-05-29 19:21:23] [INFO ] Flatten gal took : 10 ms
[2024-05-29 19:21:23] [INFO ] Input system was already deterministic with 213 transitions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 233/233 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 73 transition count 221
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 73 transition count 221
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 16 place count 69 transition count 213
Iterating global reduction 0 with 4 rules applied. Total rules applied 20 place count 69 transition count 213
Applied a total of 20 rules in 5 ms. Remains 69 /79 variables (removed 10) and now considering 213/233 (removed 20) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 69/79 places, 213/233 transitions.
[2024-05-29 19:21:23] [INFO ] Flatten gal took : 10 ms
[2024-05-29 19:21:23] [INFO ] Flatten gal took : 11 ms
[2024-05-29 19:21:23] [INFO ] Input system was already deterministic with 213 transitions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 233/233 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 73 transition count 221
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 73 transition count 221
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 16 place count 69 transition count 213
Iterating global reduction 0 with 4 rules applied. Total rules applied 20 place count 69 transition count 213
Applied a total of 20 rules in 5 ms. Remains 69 /79 variables (removed 10) and now considering 213/233 (removed 20) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 69/79 places, 213/233 transitions.
[2024-05-29 19:21:23] [INFO ] Flatten gal took : 8 ms
[2024-05-29 19:21:23] [INFO ] Flatten gal took : 9 ms
[2024-05-29 19:21:23] [INFO ] Input system was already deterministic with 213 transitions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 233/233 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 73 transition count 221
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 73 transition count 221
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 16 place count 69 transition count 213
Iterating global reduction 0 with 4 rules applied. Total rules applied 20 place count 69 transition count 213
Applied a total of 20 rules in 4 ms. Remains 69 /79 variables (removed 10) and now considering 213/233 (removed 20) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 69/79 places, 213/233 transitions.
[2024-05-29 19:21:23] [INFO ] Flatten gal took : 8 ms
[2024-05-29 19:21:23] [INFO ] Flatten gal took : 9 ms
[2024-05-29 19:21:23] [INFO ] Input system was already deterministic with 213 transitions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 233/233 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 73 transition count 221
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 73 transition count 221
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 16 place count 69 transition count 213
Iterating global reduction 0 with 4 rules applied. Total rules applied 20 place count 69 transition count 213
Applied a total of 20 rules in 4 ms. Remains 69 /79 variables (removed 10) and now considering 213/233 (removed 20) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 69/79 places, 213/233 transitions.
[2024-05-29 19:21:23] [INFO ] Flatten gal took : 8 ms
[2024-05-29 19:21:23] [INFO ] Flatten gal took : 9 ms
[2024-05-29 19:21:23] [INFO ] Input system was already deterministic with 213 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 79/79 places, 233/233 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 77 transition count 220
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 25 place count 65 transition count 220
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 25 place count 65 transition count 202
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 61 place count 47 transition count 202
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 73 place count 35 transition count 184
Iterating global reduction 2 with 12 rules applied. Total rules applied 85 place count 35 transition count 184
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 88 place count 35 transition count 181
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 92 place count 31 transition count 173
Iterating global reduction 3 with 4 rules applied. Total rules applied 96 place count 31 transition count 173
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 3 with 60 rules applied. Total rules applied 156 place count 31 transition count 113
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 162 place count 31 transition count 107
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 174 place count 25 transition count 101
Applied a total of 174 rules in 19 ms. Remains 25 /79 variables (removed 54) and now considering 101/233 (removed 132) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 19 ms. Remains : 25/79 places, 101/233 transitions.
[2024-05-29 19:21:23] [INFO ] Flatten gal took : 4 ms
[2024-05-29 19:21:23] [INFO ] Flatten gal took : 4 ms
[2024-05-29 19:21:23] [INFO ] Input system was already deterministic with 101 transitions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 233/233 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 73 transition count 221
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 73 transition count 221
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 16 place count 69 transition count 213
Iterating global reduction 0 with 4 rules applied. Total rules applied 20 place count 69 transition count 213
Applied a total of 20 rules in 2 ms. Remains 69 /79 variables (removed 10) and now considering 213/233 (removed 20) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 69/79 places, 213/233 transitions.
[2024-05-29 19:21:23] [INFO ] Flatten gal took : 8 ms
[2024-05-29 19:21:23] [INFO ] Flatten gal took : 9 ms
[2024-05-29 19:21:23] [INFO ] Input system was already deterministic with 213 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 79/79 places, 233/233 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 77 transition count 220
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 25 place count 65 transition count 220
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 25 place count 65 transition count 202
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 61 place count 47 transition count 202
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 73 place count 35 transition count 184
Iterating global reduction 2 with 12 rules applied. Total rules applied 85 place count 35 transition count 184
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 88 place count 35 transition count 181
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 92 place count 31 transition count 173
Iterating global reduction 3 with 4 rules applied. Total rules applied 96 place count 31 transition count 173
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 3 with 60 rules applied. Total rules applied 156 place count 31 transition count 113
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 162 place count 31 transition count 107
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 174 place count 25 transition count 101
Applied a total of 174 rules in 22 ms. Remains 25 /79 variables (removed 54) and now considering 101/233 (removed 132) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 22 ms. Remains : 25/79 places, 101/233 transitions.
[2024-05-29 19:21:23] [INFO ] Flatten gal took : 4 ms
[2024-05-29 19:21:23] [INFO ] Flatten gal took : 4 ms
[2024-05-29 19:21:23] [INFO ] Input system was already deterministic with 101 transitions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 233/233 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 75 transition count 225
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 75 transition count 225
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 72 transition count 219
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 72 transition count 219
Applied a total of 14 rules in 2 ms. Remains 72 /79 variables (removed 7) and now considering 219/233 (removed 14) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 72/79 places, 219/233 transitions.
[2024-05-29 19:21:23] [INFO ] Flatten gal took : 8 ms
[2024-05-29 19:21:23] [INFO ] Flatten gal took : 8 ms
[2024-05-29 19:21:23] [INFO ] Input system was already deterministic with 219 transitions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 233/233 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 73 transition count 221
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 73 transition count 221
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 16 place count 69 transition count 213
Iterating global reduction 0 with 4 rules applied. Total rules applied 20 place count 69 transition count 213
Applied a total of 20 rules in 3 ms. Remains 69 /79 variables (removed 10) and now considering 213/233 (removed 20) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 69/79 places, 213/233 transitions.
[2024-05-29 19:21:23] [INFO ] Flatten gal took : 7 ms
[2024-05-29 19:21:23] [INFO ] Flatten gal took : 8 ms
[2024-05-29 19:21:23] [INFO ] Input system was already deterministic with 213 transitions.
[2024-05-29 19:21:23] [INFO ] Flatten gal took : 10 ms
[2024-05-29 19:21:23] [INFO ] Flatten gal took : 10 ms
[2024-05-29 19:21:23] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLFireability.sr.xml took 7 ms.
[2024-05-29 19:21:23] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 79 places, 233 transitions and 1850 arcs took 4 ms.
Total runtime 52555 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running StigmergyElection-PT-06a

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/410/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 79
TRANSITIONS: 233
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.009s, Sys 0.000s]


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


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

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

Process ID: 823
MODEL NAME: /home/mcc/execution/410/model
79 places, 233 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA StigmergyElection-PT-06a-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA StigmergyElection-PT-06a-CTLFireability-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA StigmergyElection-PT-06a-CTLFireability-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA StigmergyElection-PT-06a-CTLFireability-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA StigmergyElection-PT-06a-CTLFireability-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA StigmergyElection-PT-06a-CTLFireability-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA StigmergyElection-PT-06a-CTLFireability-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA StigmergyElection-PT-06a-CTLFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA StigmergyElection-PT-06a-CTLFireability-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA StigmergyElection-PT-06a-CTLFireability-2023-13 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA StigmergyElection-PT-06a-CTLFireability-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA StigmergyElection-PT-06a-CTLFireability-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA StigmergyElection-PT-06a-CTLFireability-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA StigmergyElection-PT-06a-CTLFireability-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA StigmergyElection-PT-06a-CTLFireability-2023-15 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1717010513572

--------------------
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:
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ sed s/.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 CTLFireability -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="StigmergyElection-PT-06a"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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