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-171690530100330.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-07a, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r399-tall-171690530100330
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.3M
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 23 08:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 23 08:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 08:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 23 08:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 11 19:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 156K Apr 11 19:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 11 18:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 108K Apr 11 18:57 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 1.8M 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-07a-CTLFireability-2024-00
FORMULA_NAME StigmergyElection-PT-07a-CTLFireability-2024-01
FORMULA_NAME StigmergyElection-PT-07a-CTLFireability-2024-02
FORMULA_NAME StigmergyElection-PT-07a-CTLFireability-2024-03
FORMULA_NAME StigmergyElection-PT-07a-CTLFireability-2024-04
FORMULA_NAME StigmergyElection-PT-07a-CTLFireability-2024-05
FORMULA_NAME StigmergyElection-PT-07a-CTLFireability-2024-06
FORMULA_NAME StigmergyElection-PT-07a-CTLFireability-2024-07
FORMULA_NAME StigmergyElection-PT-07a-CTLFireability-2024-08
FORMULA_NAME StigmergyElection-PT-07a-CTLFireability-2024-09
FORMULA_NAME StigmergyElection-PT-07a-CTLFireability-2024-10
FORMULA_NAME StigmergyElection-PT-07a-CTLFireability-2024-11
FORMULA_NAME StigmergyElection-PT-07a-CTLFireability-2023-12
FORMULA_NAME StigmergyElection-PT-07a-CTLFireability-2023-13
FORMULA_NAME StigmergyElection-PT-07a-CTLFireability-2023-14
FORMULA_NAME StigmergyElection-PT-07a-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1717011801234

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-07a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-29 19:43:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-29 19:43:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 19:43:22] [INFO ] Load time of PNML (sax parser for PT used): 232 ms
[2024-05-29 19:43:22] [INFO ] Transformed 100 places.
[2024-05-29 19:43:22] [INFO ] Transformed 2618 transitions.
[2024-05-29 19:43:22] [INFO ] Found NUPN structural information;
[2024-05-29 19:43:22] [INFO ] Parsed PT model containing 100 places and 2618 transitions and 34799 arcs in 365 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 13 ms.
Ensure Unique test removed 2229 transitions
Reduce redundant transitions removed 2229 transitions.
Support contains 14 out of 100 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 389/389 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 88 transition count 370
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 88 transition count 370
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 28 place count 84 transition count 362
Iterating global reduction 0 with 4 rules applied. Total rules applied 32 place count 84 transition count 362
Applied a total of 32 rules in 31 ms. Remains 84 /100 variables (removed 16) and now considering 362/389 (removed 27) transitions.
[2024-05-29 19:43:23] [INFO ] Flow matrix only has 353 transitions (discarded 9 similar events)
// Phase 1: matrix 353 rows 84 cols
[2024-05-29 19:43:23] [INFO ] Computed 3 invariants in 20 ms
[2024-05-29 19:43:23] [INFO ] Implicit Places using invariants in 208 ms returned []
[2024-05-29 19:43:23] [INFO ] Flow matrix only has 353 transitions (discarded 9 similar events)
[2024-05-29 19:43:23] [INFO ] Invariant cache hit.
[2024-05-29 19:43:23] [INFO ] State equation strengthened by 288 read => feed constraints.
[2024-05-29 19:43:23] [INFO ] Implicit Places using invariants and state equation in 220 ms returned []
Implicit Place search using SMT with State Equation took 465 ms to find 0 implicit places.
Running 361 sub problems to find dead transitions.
[2024-05-29 19:43:23] [INFO ] Flow matrix only has 353 transitions (discarded 9 similar events)
[2024-05-29 19:43:23] [INFO ] Invariant cache hit.
[2024-05-29 19:43:23] [INFO ] State equation strengthened by 288 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 1 (OVERLAPS) 1/84 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 361 unsolved
[2024-05-29 19:43:26] [INFO ] Deduced a trap composed of 12 places in 95 ms of which 8 ms to minimize.
[2024-05-29 19:43:27] [INFO ] Deduced a trap composed of 10 places in 101 ms of which 2 ms to minimize.
[2024-05-29 19:43:27] [INFO ] Deduced a trap composed of 11 places in 136 ms of which 1 ms to minimize.
[2024-05-29 19:43:27] [INFO ] Deduced a trap composed of 11 places in 213 ms of which 1 ms to minimize.
[2024-05-29 19:43:27] [INFO ] Deduced a trap composed of 13 places in 184 ms of which 1 ms to minimize.
[2024-05-29 19:43:27] [INFO ] Deduced a trap composed of 12 places in 78 ms of which 0 ms to minimize.
[2024-05-29 19:43:27] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 1 ms to minimize.
[2024-05-29 19:43:27] [INFO ] Deduced a trap composed of 10 places in 76 ms of which 1 ms to minimize.
[2024-05-29 19:43:27] [INFO ] Deduced a trap composed of 10 places in 71 ms of which 1 ms to minimize.
[2024-05-29 19:43:27] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 1 ms to minimize.
[2024-05-29 19:43:28] [INFO ] Deduced a trap composed of 11 places in 63 ms of which 1 ms to minimize.
[2024-05-29 19:43:28] [INFO ] Deduced a trap composed of 11 places in 79 ms of which 0 ms to minimize.
[2024-05-29 19:43:28] [INFO ] Deduced a trap composed of 10 places in 61 ms of which 1 ms to minimize.
[2024-05-29 19:43:28] [INFO ] Deduced a trap composed of 10 places in 74 ms of which 1 ms to minimize.
[2024-05-29 19:43:28] [INFO ] Deduced a trap composed of 10 places in 78 ms of which 1 ms to minimize.
[2024-05-29 19:43:28] [INFO ] Deduced a trap composed of 11 places in 69 ms of which 1 ms to minimize.
[2024-05-29 19:43:28] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 3 ms to minimize.
[2024-05-29 19:43:28] [INFO ] Deduced a trap composed of 11 places in 77 ms of which 1 ms to minimize.
[2024-05-29 19:43:28] [INFO ] Deduced a trap composed of 12 places in 62 ms of which 1 ms to minimize.
[2024-05-29 19:43:28] [INFO ] Deduced a trap composed of 11 places in 51 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 20/23 constraints. Problems are: Problem set: 0 solved, 361 unsolved
[2024-05-29 19:43:28] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 1 ms to minimize.
[2024-05-29 19:43:28] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 0 ms to minimize.
[2024-05-29 19:43:28] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 0 ms to minimize.
[2024-05-29 19:43:29] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 0 ms to minimize.
[2024-05-29 19:43:29] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
[2024-05-29 19:43:29] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 1 ms to minimize.
[2024-05-29 19:43:29] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 0 ms to minimize.
[2024-05-29 19:43:29] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 1 ms to minimize.
[2024-05-29 19:43:29] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 1 ms to minimize.
[2024-05-29 19:43:29] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 1 ms to minimize.
[2024-05-29 19:43:29] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 1 ms to minimize.
[2024-05-29 19:43:29] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 1 ms to minimize.
[2024-05-29 19:43:29] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 0 ms to minimize.
[2024-05-29 19:43:29] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 1 ms to minimize.
[2024-05-29 19:43:29] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 3 ms to minimize.
[2024-05-29 19:43:29] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 2 ms to minimize.
[2024-05-29 19:43:29] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 1 ms to minimize.
[2024-05-29 19:43:29] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 0 ms to minimize.
[2024-05-29 19:43:29] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 1 ms to minimize.
[2024-05-29 19:43:29] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 20/43 constraints. Problems are: Problem set: 0 solved, 361 unsolved
[2024-05-29 19:43:30] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 1 ms to minimize.
[2024-05-29 19:43:30] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2024-05-29 19:43:30] [INFO ] Deduced a trap composed of 10 places in 120 ms of which 0 ms to minimize.
[2024-05-29 19:43:30] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 1 ms to minimize.
[2024-05-29 19:43:30] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2024-05-29 19:43:30] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 1 ms to minimize.
[2024-05-29 19:43:30] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 1 ms to minimize.
[2024-05-29 19:43:30] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 1 ms to minimize.
[2024-05-29 19:43:31] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 0 ms to minimize.
[2024-05-29 19:43:31] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 1 ms to minimize.
[2024-05-29 19:43:31] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 2 ms to minimize.
[2024-05-29 19:43:31] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 0 ms to minimize.
[2024-05-29 19:43:31] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 0 ms to minimize.
[2024-05-29 19:43:31] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 0 ms to minimize.
[2024-05-29 19:43:31] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 0 ms to minimize.
[2024-05-29 19:43:31] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 0 ms to minimize.
[2024-05-29 19:43:31] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 2 ms to minimize.
[2024-05-29 19:43:31] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 1 ms to minimize.
[2024-05-29 19:43:31] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 1 ms to minimize.
[2024-05-29 19:43:31] [INFO ] Deduced a trap composed of 11 places in 51 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 20/63 constraints. Problems are: Problem set: 0 solved, 361 unsolved
[2024-05-29 19:43:31] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 0 ms to minimize.
[2024-05-29 19:43:31] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 1 ms to minimize.
[2024-05-29 19:43:31] [INFO ] Deduced a trap composed of 13 places in 82 ms of which 1 ms to minimize.
[2024-05-29 19:43:31] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 0 ms to minimize.
[2024-05-29 19:43:32] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 1 ms to minimize.
[2024-05-29 19:43:32] [INFO ] Deduced a trap composed of 12 places in 84 ms of which 1 ms to minimize.
[2024-05-29 19:43:32] [INFO ] Deduced a trap composed of 12 places in 73 ms of which 1 ms to minimize.
[2024-05-29 19:43:32] [INFO ] Deduced a trap composed of 12 places in 82 ms of which 1 ms to minimize.
[2024-05-29 19:43:32] [INFO ] Deduced a trap composed of 12 places in 84 ms of which 1 ms to minimize.
[2024-05-29 19:43:32] [INFO ] Deduced a trap composed of 13 places in 79 ms of which 0 ms to minimize.
[2024-05-29 19:43:32] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 1 ms to minimize.
[2024-05-29 19:43:32] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 0 ms to minimize.
[2024-05-29 19:43:32] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 1 ms to minimize.
[2024-05-29 19:43:32] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 0 ms to minimize.
[2024-05-29 19:43:32] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 1 ms to minimize.
[2024-05-29 19:43:32] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 0 ms to minimize.
[2024-05-29 19:43:33] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 1 ms to minimize.
[2024-05-29 19:43:33] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 1 ms to minimize.
[2024-05-29 19:43:33] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 1 ms to minimize.
[2024-05-29 19:43:33] [INFO ] Deduced a trap composed of 13 places in 79 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 20/83 constraints. Problems are: Problem set: 0 solved, 361 unsolved
[2024-05-29 19:43:33] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 0 ms to minimize.
[2024-05-29 19:43:33] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 0 ms to minimize.
[2024-05-29 19:43:33] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 0 ms to minimize.
[2024-05-29 19:43:33] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 1 ms to minimize.
[2024-05-29 19:43:33] [INFO ] Deduced a trap composed of 12 places in 62 ms of which 0 ms to minimize.
[2024-05-29 19:43:33] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 1 ms to minimize.
[2024-05-29 19:43:33] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 1 ms to minimize.
[2024-05-29 19:43:33] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 1 ms to minimize.
[2024-05-29 19:43:33] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 1 ms to minimize.
[2024-05-29 19:43:34] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 1 ms to minimize.
[2024-05-29 19:43:34] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 0 ms to minimize.
[2024-05-29 19:43:34] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 0 ms to minimize.
[2024-05-29 19:43:34] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 0 ms to minimize.
[2024-05-29 19:43:34] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 0 ms to minimize.
[2024-05-29 19:43:34] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 0 ms to minimize.
[2024-05-29 19:43:35] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 1 ms to minimize.
[2024-05-29 19:43:35] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/84 variables, 17/100 constraints. Problems are: Problem set: 0 solved, 361 unsolved
[2024-05-29 19:43:36] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 1 ms to minimize.
[2024-05-29 19:43:36] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 0 ms to minimize.
[2024-05-29 19:43:36] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 0 ms to minimize.
[2024-05-29 19:43:36] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/84 variables, 4/104 constraints. Problems are: Problem set: 0 solved, 361 unsolved
[2024-05-29 19:43:37] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 0 ms to minimize.
[2024-05-29 19:43:37] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 0 ms to minimize.
[2024-05-29 19:43:37] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 0 ms to minimize.
[2024-05-29 19:43:37] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 0 ms to minimize.
[2024-05-29 19:43:37] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/84 variables, 5/109 constraints. Problems are: Problem set: 0 solved, 361 unsolved
[2024-05-29 19:43:38] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 0 ms to minimize.
[2024-05-29 19:43:38] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 1 ms to minimize.
[2024-05-29 19:43:38] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/84 variables, 3/112 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/84 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 11 (OVERLAPS) 352/436 variables, 84/196 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/436 variables, 287/483 constraints. Problems are: Problem set: 0 solved, 361 unsolved
[2024-05-29 19:43:47] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/436 variables, 1/484 constraints. Problems are: Problem set: 0 solved, 361 unsolved
[2024-05-29 19:43:49] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/436 variables, 1/485 constraints. Problems are: Problem set: 0 solved, 361 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 436/437 variables, and 485 constraints, problems are : Problem set: 0 solved, 361 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 84/84 constraints, ReadFeed: 287/288 constraints, PredecessorRefiner: 361/361 constraints, Known Traps: 111/111 constraints]
Escalating to Integer solving :Problem set: 0 solved, 361 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 1 (OVERLAPS) 1/84 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 111/114 constraints. Problems are: Problem set: 0 solved, 361 unsolved
[2024-05-29 19:43:57] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 0 ms to minimize.
[2024-05-29 19:43:57] [INFO ] Deduced a trap composed of 12 places in 85 ms of which 1 ms to minimize.
[2024-05-29 19:43:58] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 3/117 constraints. Problems are: Problem set: 0 solved, 361 unsolved
[2024-05-29 19:44:00] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 1 ms to minimize.
[2024-05-29 19:44:00] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 2/119 constraints. Problems are: Problem set: 0 solved, 361 unsolved
[2024-05-29 19:44:02] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 1 ms to minimize.
[2024-05-29 19:44:02] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 0 ms to minimize.
[2024-05-29 19:44:02] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2024-05-29 19:44:02] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 4/123 constraints. Problems are: Problem set: 0 solved, 361 unsolved
[2024-05-29 19:44:04] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/84 variables, 1/124 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/84 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 8 (OVERLAPS) 352/436 variables, 84/208 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/436 variables, 287/495 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/436 variables, 361/856 constraints. Problems are: Problem set: 0 solved, 361 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 436/437 variables, and 856 constraints, problems are : Problem set: 0 solved, 361 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 84/84 constraints, ReadFeed: 287/288 constraints, PredecessorRefiner: 361/361 constraints, Known Traps: 121/121 constraints]
After SMT, in 61965ms problems are : Problem set: 0 solved, 361 unsolved
Search for dead transitions found 0 dead transitions in 61984ms
Starting structural reductions in LTL mode, iteration 1 : 84/100 places, 362/389 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62510 ms. Remains : 84/100 places, 362/389 transitions.
Support contains 14 out of 84 places after structural reductions.
[2024-05-29 19:44:25] [INFO ] Flatten gal took : 73 ms
[2024-05-29 19:44:25] [INFO ] Flatten gal took : 42 ms
[2024-05-29 19:44:25] [INFO ] Input system was already deterministic with 362 transitions.
Reduction of identical properties reduced properties to check from 18 to 9
RANDOM walk for 40000 steps (53 resets) in 3001 ms. (13 steps per ms) remains 4/9 properties
BEST_FIRST walk for 40004 steps (21 resets) in 144 ms. (275 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (33 resets) in 291 ms. (137 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (22 resets) in 77 ms. (512 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (32 resets) in 86 ms. (459 steps per ms) remains 4/4 properties
[2024-05-29 19:44:26] [INFO ] Flow matrix only has 353 transitions (discarded 9 similar events)
[2024-05-29 19:44:26] [INFO ] Invariant cache hit.
[2024-05-29 19:44:26] [INFO ] State equation strengthened by 288 read => feed constraints.
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp16 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 2 unsolved
Problem AtomicPropp6 is UNSAT
At refinement iteration 1 (OVERLAPS) 75/83 variables, 2/2 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 1/84 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 352/436 variables, 84/87 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/436 variables, 287/374 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/436 variables, 0/374 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/437 variables, 1/375 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/437 variables, 0/375 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/437 variables, 0/375 constraints. Problems are: Problem set: 3 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 437/437 variables, and 375 constraints, problems are : Problem set: 3 solved, 1 unsolved in 191 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 84/84 constraints, ReadFeed: 288/288 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 1 unsolved
Problem AtomicPropp8 is UNSAT
After SMT solving in domain Int declared 83/437 variables, and 2 constraints, problems are : Problem set: 4 solved, 0 unsolved in 26 ms.
Refiners :[Positive P Invariants (semi-flows): 2/3 constraints, State Equation: 0/84 constraints, ReadFeed: 0/288 constraints, PredecessorRefiner: 0/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 292ms problems are : Problem set: 4 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 5 atomic propositions for a total of 16 simplifications.
[2024-05-29 19:44:27] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-29 19:44:27] [INFO ] Flatten gal took : 33 ms
FORMULA StigmergyElection-PT-07a-CTLFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-29 19:44:27] [INFO ] Flatten gal took : 32 ms
[2024-05-29 19:44:27] [INFO ] Input system was already deterministic with 362 transitions.
Computed a total of 16 stabilizing places and 15 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 84/84 places, 362/362 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 80 transition count 355
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 80 transition count 355
Applied a total of 8 rules in 6 ms. Remains 80 /84 variables (removed 4) and now considering 355/362 (removed 7) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 80/84 places, 355/362 transitions.
[2024-05-29 19:44:27] [INFO ] Flatten gal took : 22 ms
[2024-05-29 19:44:27] [INFO ] Flatten gal took : 23 ms
[2024-05-29 19:44:27] [INFO ] Input system was already deterministic with 355 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 84/84 places, 362/362 transitions.
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 10 Pre rules applied. Total rules applied 0 place count 84 transition count 352
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 20 place count 74 transition count 352
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 23 place count 71 transition count 346
Iterating global reduction 0 with 3 rules applied. Total rules applied 26 place count 71 transition count 346
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 28 place count 69 transition count 344
Iterating global reduction 0 with 2 rules applied. Total rules applied 30 place count 69 transition count 344
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 33 place count 69 transition count 341
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 1 with 8 rules applied. Total rules applied 41 place count 65 transition count 337
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 45 place count 61 transition count 333
Iterating global reduction 1 with 4 rules applied. Total rules applied 49 place count 61 transition count 333
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 1 with 60 rules applied. Total rules applied 109 place count 61 transition count 273
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 2 with 7 rules applied. Total rules applied 116 place count 61 transition count 266
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 130 place count 54 transition count 259
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 131 place count 54 transition count 259
Applied a total of 131 rules in 108 ms. Remains 54 /84 variables (removed 30) and now considering 259/362 (removed 103) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 108 ms. Remains : 54/84 places, 259/362 transitions.
[2024-05-29 19:44:27] [INFO ] Flatten gal took : 17 ms
[2024-05-29 19:44:27] [INFO ] Flatten gal took : 17 ms
[2024-05-29 19:44:27] [INFO ] Input system was already deterministic with 259 transitions.
Starting structural reductions in LTL mode, iteration 0 : 84/84 places, 362/362 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 80 transition count 355
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 80 transition count 355
Applied a total of 8 rules in 4 ms. Remains 80 /84 variables (removed 4) and now considering 355/362 (removed 7) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 80/84 places, 355/362 transitions.
[2024-05-29 19:44:27] [INFO ] Flatten gal took : 18 ms
[2024-05-29 19:44:27] [INFO ] Flatten gal took : 18 ms
[2024-05-29 19:44:27] [INFO ] Input system was already deterministic with 355 transitions.
Starting structural reductions in LTL mode, iteration 0 : 84/84 places, 362/362 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 80 transition count 355
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 80 transition count 355
Applied a total of 8 rules in 4 ms. Remains 80 /84 variables (removed 4) and now considering 355/362 (removed 7) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 80/84 places, 355/362 transitions.
[2024-05-29 19:44:27] [INFO ] Flatten gal took : 17 ms
[2024-05-29 19:44:27] [INFO ] Flatten gal took : 17 ms
[2024-05-29 19:44:27] [INFO ] Input system was already deterministic with 355 transitions.
Starting structural reductions in LTL mode, iteration 0 : 84/84 places, 362/362 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 80 transition count 355
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 80 transition count 355
Applied a total of 8 rules in 5 ms. Remains 80 /84 variables (removed 4) and now considering 355/362 (removed 7) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 80/84 places, 355/362 transitions.
[2024-05-29 19:44:27] [INFO ] Flatten gal took : 16 ms
[2024-05-29 19:44:27] [INFO ] Flatten gal took : 17 ms
[2024-05-29 19:44:28] [INFO ] Input system was already deterministic with 355 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 84/84 places, 362/362 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 82 transition count 347
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 29 place count 68 transition count 347
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 29 place count 68 transition count 334
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 55 place count 55 transition count 334
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 70 place count 40 transition count 316
Iterating global reduction 2 with 15 rules applied. Total rules applied 85 place count 40 transition count 316
Ensure Unique test removed 127 transitions
Reduce isomorphic transitions removed 127 transitions.
Iterating post reduction 2 with 127 rules applied. Total rules applied 212 place count 40 transition count 189
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 212 place count 40 transition count 185
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 220 place count 36 transition count 185
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 3 with 7 rules applied. Total rules applied 227 place count 36 transition count 178
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 241 place count 29 transition count 171
Applied a total of 241 rules in 31 ms. Remains 29 /84 variables (removed 55) and now considering 171/362 (removed 191) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 31 ms. Remains : 29/84 places, 171/362 transitions.
[2024-05-29 19:44:28] [INFO ] Flatten gal took : 7 ms
[2024-05-29 19:44:28] [INFO ] Flatten gal took : 7 ms
[2024-05-29 19:44:28] [INFO ] Input system was already deterministic with 171 transitions.
Starting structural reductions in LTL mode, iteration 0 : 84/84 places, 362/362 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 81 transition count 357
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 81 transition count 357
Applied a total of 6 rules in 4 ms. Remains 81 /84 variables (removed 3) and now considering 357/362 (removed 5) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 81/84 places, 357/362 transitions.
[2024-05-29 19:44:28] [INFO ] Flatten gal took : 16 ms
[2024-05-29 19:44:28] [INFO ] Flatten gal took : 17 ms
[2024-05-29 19:44:28] [INFO ] Input system was already deterministic with 357 transitions.
Starting structural reductions in LTL mode, iteration 0 : 84/84 places, 362/362 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 80 transition count 355
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 80 transition count 355
Applied a total of 8 rules in 3 ms. Remains 80 /84 variables (removed 4) and now considering 355/362 (removed 7) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 80/84 places, 355/362 transitions.
[2024-05-29 19:44:28] [INFO ] Flatten gal took : 15 ms
[2024-05-29 19:44:28] [INFO ] Flatten gal took : 17 ms
[2024-05-29 19:44:28] [INFO ] Input system was already deterministic with 355 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 84/84 places, 362/362 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 82 transition count 348
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 27 place count 69 transition count 348
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 27 place count 69 transition count 335
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 53 place count 56 transition count 335
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 67 place count 42 transition count 319
Iterating global reduction 2 with 14 rules applied. Total rules applied 81 place count 42 transition count 319
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 2 with 63 rules applied. Total rules applied 144 place count 42 transition count 256
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 144 place count 42 transition count 252
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 152 place count 38 transition count 252
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 3 with 7 rules applied. Total rules applied 159 place count 38 transition count 245
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 173 place count 31 transition count 238
Applied a total of 173 rules in 38 ms. Remains 31 /84 variables (removed 53) and now considering 238/362 (removed 124) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 39 ms. Remains : 31/84 places, 238/362 transitions.
[2024-05-29 19:44:28] [INFO ] Flatten gal took : 11 ms
[2024-05-29 19:44:28] [INFO ] Flatten gal took : 12 ms
[2024-05-29 19:44:28] [INFO ] Input system was already deterministic with 238 transitions.
Starting structural reductions in LTL mode, iteration 0 : 84/84 places, 362/362 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 80 transition count 355
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 80 transition count 355
Applied a total of 8 rules in 3 ms. Remains 80 /84 variables (removed 4) and now considering 355/362 (removed 7) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 80/84 places, 355/362 transitions.
[2024-05-29 19:44:28] [INFO ] Flatten gal took : 13 ms
[2024-05-29 19:44:28] [INFO ] Flatten gal took : 14 ms
[2024-05-29 19:44:28] [INFO ] Input system was already deterministic with 355 transitions.
Starting structural reductions in LTL mode, iteration 0 : 84/84 places, 362/362 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 80 transition count 355
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 80 transition count 355
Applied a total of 8 rules in 2 ms. Remains 80 /84 variables (removed 4) and now considering 355/362 (removed 7) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 80/84 places, 355/362 transitions.
[2024-05-29 19:44:28] [INFO ] Flatten gal took : 13 ms
[2024-05-29 19:44:28] [INFO ] Flatten gal took : 13 ms
[2024-05-29 19:44:28] [INFO ] Input system was already deterministic with 355 transitions.
Starting structural reductions in LTL mode, iteration 0 : 84/84 places, 362/362 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 80 transition count 355
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 80 transition count 355
Applied a total of 8 rules in 3 ms. Remains 80 /84 variables (removed 4) and now considering 355/362 (removed 7) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 80/84 places, 355/362 transitions.
[2024-05-29 19:44:28] [INFO ] Flatten gal took : 12 ms
[2024-05-29 19:44:28] [INFO ] Flatten gal took : 13 ms
[2024-05-29 19:44:28] [INFO ] Input system was already deterministic with 355 transitions.
Starting structural reductions in LTL mode, iteration 0 : 84/84 places, 362/362 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 80 transition count 355
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 80 transition count 355
Applied a total of 8 rules in 3 ms. Remains 80 /84 variables (removed 4) and now considering 355/362 (removed 7) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 80/84 places, 355/362 transitions.
[2024-05-29 19:44:28] [INFO ] Flatten gal took : 13 ms
[2024-05-29 19:44:28] [INFO ] Flatten gal took : 14 ms
[2024-05-29 19:44:28] [INFO ] Input system was already deterministic with 355 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 84/84 places, 362/362 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 82 transition count 347
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 29 place count 68 transition count 347
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 29 place count 68 transition count 334
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 55 place count 55 transition count 334
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 70 place count 40 transition count 316
Iterating global reduction 2 with 15 rules applied. Total rules applied 85 place count 40 transition count 316
Ensure Unique test removed 127 transitions
Reduce isomorphic transitions removed 127 transitions.
Iterating post reduction 2 with 127 rules applied. Total rules applied 212 place count 40 transition count 189
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 212 place count 40 transition count 185
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 220 place count 36 transition count 185
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 3 with 7 rules applied. Total rules applied 227 place count 36 transition count 178
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 241 place count 29 transition count 171
Applied a total of 241 rules in 25 ms. Remains 29 /84 variables (removed 55) and now considering 171/362 (removed 191) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 25 ms. Remains : 29/84 places, 171/362 transitions.
[2024-05-29 19:44:28] [INFO ] Flatten gal took : 6 ms
[2024-05-29 19:44:28] [INFO ] Flatten gal took : 6 ms
[2024-05-29 19:44:28] [INFO ] Input system was already deterministic with 171 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 84/84 places, 362/362 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 82 transition count 347
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 29 place count 68 transition count 347
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 29 place count 68 transition count 334
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 55 place count 55 transition count 334
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 70 place count 40 transition count 316
Iterating global reduction 2 with 15 rules applied. Total rules applied 85 place count 40 transition count 316
Ensure Unique test removed 127 transitions
Reduce isomorphic transitions removed 127 transitions.
Iterating post reduction 2 with 127 rules applied. Total rules applied 212 place count 40 transition count 189
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 212 place count 40 transition count 185
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 220 place count 36 transition count 185
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 3 with 7 rules applied. Total rules applied 227 place count 36 transition count 178
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 241 place count 29 transition count 171
Applied a total of 241 rules in 24 ms. Remains 29 /84 variables (removed 55) and now considering 171/362 (removed 191) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 24 ms. Remains : 29/84 places, 171/362 transitions.
[2024-05-29 19:44:28] [INFO ] Flatten gal took : 6 ms
[2024-05-29 19:44:28] [INFO ] Flatten gal took : 6 ms
[2024-05-29 19:44:28] [INFO ] Input system was already deterministic with 171 transitions.
[2024-05-29 19:44:28] [INFO ] Flatten gal took : 15 ms
[2024-05-29 19:44:28] [INFO ] Flatten gal took : 16 ms
[2024-05-29 19:44:28] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLFireability.sr.xml took 7 ms.
[2024-05-29 19:44:28] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 84 places, 362 transitions and 3931 arcs took 7 ms.
Total runtime 66402 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running StigmergyElection-PT-07a

IS_COLORED=
IS_NUPN=

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


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


----------------------------------------------------------------------
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: 920
MODEL NAME: /home/mcc/execution/411/model
84 places, 362 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-07a-CTLFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA StigmergyElection-PT-07a-CTLFireability-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA StigmergyElection-PT-07a-CTLFireability-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA StigmergyElection-PT-07a-CTLFireability-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA StigmergyElection-PT-07a-CTLFireability-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA StigmergyElection-PT-07a-CTLFireability-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA StigmergyElection-PT-07a-CTLFireability-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA StigmergyElection-PT-07a-CTLFireability-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA StigmergyElection-PT-07a-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA StigmergyElection-PT-07a-CTLFireability-2023-12 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA StigmergyElection-PT-07a-CTLFireability-2023-13 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA StigmergyElection-PT-07a-CTLFireability-2023-15 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA StigmergyElection-PT-07a-CTLFireability-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA StigmergyElection-PT-07a-CTLFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA StigmergyElection-PT-07a-CTLFireability-2023-14 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1717011901873

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML

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-07a"
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-07a, 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-171690530100330"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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