Execution Chart

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

Trace from the execution

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

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

=== Now, execution of the tool begins

BK_START 1717247073242

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyElection-PT-07a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 13:04:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 13:04:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 13:04:34] [INFO ] Load time of PNML (sax parser for PT used): 233 ms
[2024-06-01 13:04:34] [INFO ] Transformed 100 places.
[2024-06-01 13:04:34] [INFO ] Transformed 2618 transitions.
[2024-06-01 13:04:34] [INFO ] Found NUPN structural information;
[2024-06-01 13:04:34] [INFO ] Parsed PT model containing 100 places and 2618 transitions and 34799 arcs in 356 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 16 ms.
Ensure Unique test removed 2229 transitions
Reduce redundant transitions removed 2229 transitions.
FORMULA StigmergyElection-PT-07a-CTLCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-07a-CTLCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-07a-CTLCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 61 out of 100 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 389/389 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 98 transition count 387
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 98 transition count 387
Applied a total of 4 rules in 25 ms. Remains 98 /100 variables (removed 2) and now considering 387/389 (removed 2) transitions.
[2024-06-01 13:04:34] [INFO ] Flow matrix only has 368 transitions (discarded 19 similar events)
// Phase 1: matrix 368 rows 98 cols
[2024-06-01 13:04:34] [INFO ] Computed 6 invariants in 18 ms
[2024-06-01 13:04:35] [INFO ] Implicit Places using invariants in 230 ms returned []
[2024-06-01 13:04:35] [INFO ] Flow matrix only has 368 transitions (discarded 19 similar events)
[2024-06-01 13:04:35] [INFO ] Invariant cache hit.
[2024-06-01 13:04:35] [INFO ] State equation strengthened by 288 read => feed constraints.
[2024-06-01 13:04:35] [INFO ] Implicit Places using invariants and state equation in 248 ms returned []
Implicit Place search using SMT with State Equation took 507 ms to find 0 implicit places.
Running 386 sub problems to find dead transitions.
[2024-06-01 13:04:35] [INFO ] Flow matrix only has 368 transitions (discarded 19 similar events)
[2024-06-01 13:04:35] [INFO ] Invariant cache hit.
[2024-06-01 13:04:35] [INFO ] State equation strengthened by 288 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 1 (OVERLAPS) 1/98 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 386 unsolved
[2024-06-01 13:04:38] [INFO ] Deduced a trap composed of 12 places in 98 ms of which 12 ms to minimize.
[2024-06-01 13:04:39] [INFO ] Deduced a trap composed of 12 places in 99 ms of which 1 ms to minimize.
[2024-06-01 13:04:39] [INFO ] Deduced a trap composed of 12 places in 82 ms of which 1 ms to minimize.
[2024-06-01 13:04:39] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 1 ms to minimize.
[2024-06-01 13:04:39] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 1 ms to minimize.
[2024-06-01 13:04:39] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 1 ms to minimize.
[2024-06-01 13:04:39] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 1 ms to minimize.
[2024-06-01 13:04:39] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 2 ms to minimize.
[2024-06-01 13:04:39] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 1 ms to minimize.
[2024-06-01 13:04:39] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 0 ms to minimize.
[2024-06-01 13:04:39] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 1 ms to minimize.
[2024-06-01 13:04:39] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 1 ms to minimize.
[2024-06-01 13:04:39] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
[2024-06-01 13:04:39] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 0 ms to minimize.
[2024-06-01 13:04:39] [INFO ] Deduced a trap composed of 12 places in 106 ms of which 1 ms to minimize.
[2024-06-01 13:04:39] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 1 ms to minimize.
[2024-06-01 13:04:39] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 0 ms to minimize.
[2024-06-01 13:04:40] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 1 ms to minimize.
[2024-06-01 13:04:40] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2024-06-01 13:04:40] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 20/26 constraints. Problems are: Problem set: 0 solved, 386 unsolved
[2024-06-01 13:04:40] [INFO ] Deduced a trap composed of 12 places in 73 ms of which 1 ms to minimize.
[2024-06-01 13:04:40] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 1 ms to minimize.
[2024-06-01 13:04:40] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 1 ms to minimize.
[2024-06-01 13:04:40] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 0 ms to minimize.
[2024-06-01 13:04:40] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 1 ms to minimize.
[2024-06-01 13:04:40] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 1 ms to minimize.
[2024-06-01 13:04:40] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 1 ms to minimize.
[2024-06-01 13:04:40] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 0 ms to minimize.
[2024-06-01 13:04:40] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 0 ms to minimize.
[2024-06-01 13:04:40] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 0 ms to minimize.
[2024-06-01 13:04:40] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 1 ms to minimize.
[2024-06-01 13:04:40] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 0 ms to minimize.
[2024-06-01 13:04:40] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 0 ms to minimize.
[2024-06-01 13:04:40] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 2 ms to minimize.
[2024-06-01 13:04:40] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 3 ms to minimize.
[2024-06-01 13:04:41] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 0 ms to minimize.
[2024-06-01 13:04:41] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 0 ms to minimize.
[2024-06-01 13:04:41] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 1 ms to minimize.
[2024-06-01 13:04:41] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 1 ms to minimize.
[2024-06-01 13:04:41] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 20/46 constraints. Problems are: Problem set: 0 solved, 386 unsolved
[2024-06-01 13:04:41] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 1 ms to minimize.
[2024-06-01 13:04:42] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 1 ms to minimize.
[2024-06-01 13:04:42] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2024-06-01 13:04:42] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 2 ms to minimize.
[2024-06-01 13:04:42] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 1 ms to minimize.
[2024-06-01 13:04:42] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 0 ms to minimize.
[2024-06-01 13:04:42] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 1 ms to minimize.
[2024-06-01 13:04:42] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 0 ms to minimize.
[2024-06-01 13:04:42] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 1 ms to minimize.
[2024-06-01 13:04:42] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
[2024-06-01 13:04:42] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2024-06-01 13:04:42] [INFO ] Deduced a trap composed of 15 places in 22 ms of which 1 ms to minimize.
[2024-06-01 13:04:42] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 0 ms to minimize.
[2024-06-01 13:04:42] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 0 ms to minimize.
[2024-06-01 13:04:42] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
[2024-06-01 13:04:42] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-06-01 13:04:42] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
[2024-06-01 13:04:42] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 1 ms to minimize.
[2024-06-01 13:04:42] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 0 ms to minimize.
[2024-06-01 13:04:42] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 386 unsolved
[2024-06-01 13:04:43] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 1 ms to minimize.
[2024-06-01 13:04:43] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 0 ms to minimize.
[2024-06-01 13:04:43] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
[2024-06-01 13:04:43] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 1 ms to minimize.
[2024-06-01 13:04:43] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 0 ms to minimize.
[2024-06-01 13:04:43] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
[2024-06-01 13:04:43] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 1 ms to minimize.
[2024-06-01 13:04:43] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 0 ms to minimize.
[2024-06-01 13:04:43] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 1 ms to minimize.
[2024-06-01 13:04:43] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 0 ms to minimize.
[2024-06-01 13:04:43] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 1 ms to minimize.
[2024-06-01 13:04:43] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 0 ms to minimize.
[2024-06-01 13:04:43] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 0 ms to minimize.
[2024-06-01 13:04:43] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2024-06-01 13:04:43] [INFO ] Deduced a trap composed of 12 places in 74 ms of which 1 ms to minimize.
[2024-06-01 13:04:43] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 0 ms to minimize.
[2024-06-01 13:04:43] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
[2024-06-01 13:04:43] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 0 ms to minimize.
[2024-06-01 13:04:44] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 0 ms to minimize.
[2024-06-01 13:04:44] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/98 variables, 20/86 constraints. Problems are: Problem set: 0 solved, 386 unsolved
[2024-06-01 13:04:44] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 1 ms to minimize.
[2024-06-01 13:04:45] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
[2024-06-01 13:04:45] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 0 ms to minimize.
[2024-06-01 13:04:45] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 1 ms to minimize.
[2024-06-01 13:04:45] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 0 ms to minimize.
[2024-06-01 13:04:45] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/98 variables, 6/92 constraints. Problems are: Problem set: 0 solved, 386 unsolved
[2024-06-01 13:04:47] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 0 ms to minimize.
[2024-06-01 13:04:47] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 1 ms to minimize.
[2024-06-01 13:04:47] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/98 variables, 3/95 constraints. Problems are: Problem set: 0 solved, 386 unsolved
[2024-06-01 13:04:48] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 0 ms to minimize.
[2024-06-01 13:04:48] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/98 variables, 2/97 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/98 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 10 (OVERLAPS) 367/465 variables, 98/195 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/465 variables, 287/482 constraints. Problems are: Problem set: 0 solved, 386 unsolved
[2024-06-01 13:04:52] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/465 variables, 1/483 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/465 variables, 0/483 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 14 (OVERLAPS) 1/466 variables, 1/484 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/466 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 386 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 466/466 variables, and 484 constraints, problems are : Problem set: 0 solved, 386 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 98/98 constraints, ReadFeed: 288/288 constraints, PredecessorRefiner: 386/386 constraints, Known Traps: 92/92 constraints]
Escalating to Integer solving :Problem set: 0 solved, 386 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 1 (OVERLAPS) 1/98 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 92/98 constraints. Problems are: Problem set: 0 solved, 386 unsolved
[2024-06-01 13:05:08] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
[2024-06-01 13:05:08] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 1 ms to minimize.
[2024-06-01 13:05:09] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 3/101 constraints. Problems are: Problem set: 0 solved, 386 unsolved
[2024-06-01 13:05:10] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 1 ms to minimize.
[2024-06-01 13:05:10] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 1 ms to minimize.
[2024-06-01 13:05:10] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 0 ms to minimize.
[2024-06-01 13:05:10] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 4/105 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/98 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 6 (OVERLAPS) 367/465 variables, 98/203 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/465 variables, 287/490 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/465 variables, 386/876 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/465 variables, 0/876 constraints. Problems are: Problem set: 0 solved, 386 unsolved
SMT process timed out in 61880ms, After SMT, problems are : Problem set: 0 solved, 386 unsolved
Search for dead transitions found 0 dead transitions in 61899ms
Starting structural reductions in LTL mode, iteration 1 : 98/100 places, 387/389 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62456 ms. Remains : 98/100 places, 387/389 transitions.
Support contains 61 out of 98 places after structural reductions.
[2024-06-01 13:05:37] [INFO ] Flatten gal took : 69 ms
[2024-06-01 13:05:37] [INFO ] Flatten gal took : 36 ms
[2024-06-01 13:05:37] [INFO ] Input system was already deterministic with 387 transitions.
Support contains 58 out of 98 places (down from 61) after GAL structural reductions.
RANDOM walk for 40000 steps (47 resets) in 2327 ms. (17 steps per ms) remains 3/52 properties
BEST_FIRST walk for 40004 steps (8 resets) in 84 ms. (470 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (8 resets) in 71 ms. (555 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (10 resets) in 76 ms. (519 steps per ms) remains 3/3 properties
[2024-06-01 13:05:38] [INFO ] Flow matrix only has 368 transitions (discarded 19 similar events)
[2024-06-01 13:05:38] [INFO ] Invariant cache hit.
[2024-06-01 13:05:38] [INFO ] State equation strengthened by 288 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem AtomicPropp44 is UNSAT
At refinement iteration 1 (OVERLAPS) 75/83 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 15/98 variables, 2/6 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 367/465 variables, 98/104 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/465 variables, 287/391 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/465 variables, 0/391 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1/466 variables, 1/392 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/466 variables, 0/392 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/466 variables, 0/392 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 466/466 variables, and 392 constraints, problems are : Problem set: 1 solved, 2 unsolved in 196 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 98/98 constraints, ReadFeed: 288/288 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 64/69 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-06-01 13:05:38] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 1 ms to minimize.
[2024-06-01 13:05:38] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 0 ms to minimize.
[2024-06-01 13:05:38] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 1 ms to minimize.
[2024-06-01 13:05:38] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 0 ms to minimize.
[2024-06-01 13:05:38] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 0 ms to minimize.
[2024-06-01 13:05:39] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 1 ms to minimize.
[2024-06-01 13:05:39] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 0 ms to minimize.
[2024-06-01 13:05:39] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 0 ms to minimize.
[2024-06-01 13:05:39] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
[2024-06-01 13:05:39] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 0 ms to minimize.
[2024-06-01 13:05:39] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 1 ms to minimize.
[2024-06-01 13:05:39] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
[2024-06-01 13:05:39] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
Problem AtomicPropp3 is UNSAT
[2024-06-01 13:05:39] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 0 ms to minimize.
Problem AtomicPropp33 is UNSAT
After SMT solving in domain Int declared 69/466 variables, and 17 constraints, problems are : Problem set: 3 solved, 0 unsolved in 805 ms.
Refiners :[Positive P Invariants (semi-flows): 3/6 constraints, State Equation: 0/98 constraints, ReadFeed: 0/288 constraints, PredecessorRefiner: 0/3 constraints, Known Traps: 14/14 constraints]
After SMT, in 1033ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 3 atomic propositions for a total of 13 simplifications.
FORMULA StigmergyElection-PT-07a-CTLCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 13:05:39] [INFO ] Flatten gal took : 40 ms
[2024-06-01 13:05:39] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA StigmergyElection-PT-07a-CTLCardinality-2023-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 13:05:39] [INFO ] Flatten gal took : 28 ms
[2024-06-01 13:05:39] [INFO ] Input system was already deterministic with 387 transitions.
Support contains 51 out of 98 places (down from 53) after GAL structural reductions.
Computed a total of 16 stabilizing places and 15 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 98/98 places, 387/387 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 91 transition count 375
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 91 transition count 375
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 90 transition count 373
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 90 transition count 373
Applied a total of 16 rules in 7 ms. Remains 90 /98 variables (removed 8) and now considering 373/387 (removed 14) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 90/98 places, 373/387 transitions.
[2024-06-01 13:05:39] [INFO ] Flatten gal took : 20 ms
[2024-06-01 13:05:39] [INFO ] Flatten gal took : 20 ms
[2024-06-01 13:05:39] [INFO ] Input system was already deterministic with 373 transitions.
Starting structural reductions in LTL mode, iteration 0 : 98/98 places, 387/387 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 87 transition count 369
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 87 transition count 369
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 29 place count 80 transition count 355
Iterating global reduction 0 with 7 rules applied. Total rules applied 36 place count 80 transition count 355
Applied a total of 36 rules in 7 ms. Remains 80 /98 variables (removed 18) and now considering 355/387 (removed 32) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 80/98 places, 355/387 transitions.
[2024-06-01 13:05:39] [INFO ] Flatten gal took : 18 ms
[2024-06-01 13:05:39] [INFO ] Flatten gal took : 17 ms
[2024-06-01 13:05:39] [INFO ] Input system was already deterministic with 355 transitions.
Starting structural reductions in LTL mode, iteration 0 : 98/98 places, 387/387 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 87 transition count 369
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 87 transition count 369
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 29 place count 80 transition count 355
Iterating global reduction 0 with 7 rules applied. Total rules applied 36 place count 80 transition count 355
Applied a total of 36 rules in 7 ms. Remains 80 /98 variables (removed 18) and now considering 355/387 (removed 32) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 80/98 places, 355/387 transitions.
[2024-06-01 13:05:39] [INFO ] Flatten gal took : 16 ms
[2024-06-01 13:05:39] [INFO ] Flatten gal took : 16 ms
[2024-06-01 13:05:39] [INFO ] Input system was already deterministic with 355 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 98/98 places, 387/387 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 96 transition count 361
Reduce places removed 25 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 26 rules applied. Total rules applied 52 place count 71 transition count 360
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 53 place count 70 transition count 360
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 53 place count 70 transition count 346
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 81 place count 56 transition count 346
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 93 place count 44 transition count 327
Iterating global reduction 3 with 12 rules applied. Total rules applied 105 place count 44 transition count 327
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 112 place count 37 transition count 313
Iterating global reduction 3 with 7 rules applied. Total rules applied 119 place count 37 transition count 313
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 3 with 63 rules applied. Total rules applied 182 place count 37 transition count 250
Drop transitions (Redundant composition of simpler transitions.) removed 183 transitions
Redundant transition composition rules discarded 183 transitions
Iterating global reduction 4 with 183 rules applied. Total rules applied 365 place count 37 transition count 67
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 4 with 14 rules applied. Total rules applied 379 place count 30 transition count 60
Reduce places removed 6 places and 6 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 385 place count 24 transition count 54
Applied a total of 385 rules in 62 ms. Remains 24 /98 variables (removed 74) and now considering 54/387 (removed 333) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 63 ms. Remains : 24/98 places, 54/387 transitions.
[2024-06-01 13:05:39] [INFO ] Flatten gal took : 2 ms
[2024-06-01 13:05:39] [INFO ] Flatten gal took : 2 ms
[2024-06-01 13:05:39] [INFO ] Input system was already deterministic with 54 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 98/98 places, 387/387 transitions.
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 9 Pre rules applied. Total rules applied 0 place count 98 transition count 378
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 18 place count 89 transition count 378
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 27 place count 80 transition count 363
Iterating global reduction 0 with 9 rules applied. Total rules applied 36 place count 80 transition count 363
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 41 place count 75 transition count 353
Iterating global reduction 0 with 5 rules applied. Total rules applied 46 place count 75 transition count 353
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 48 place count 73 transition count 351
Iterating global reduction 0 with 2 rules applied. Total rules applied 50 place count 73 transition count 351
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 53 place count 73 transition count 348
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 1 with 14 rules applied. Total rules applied 67 place count 66 transition count 341
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 74 place count 59 transition count 334
Iterating global reduction 1 with 7 rules applied. Total rules applied 81 place count 59 transition count 334
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 1 with 8 rules applied. Total rules applied 89 place count 59 transition count 326
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 1 with 14 rules applied. Total rules applied 103 place count 52 transition count 319
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 105 place count 52 transition count 319
Applied a total of 105 rules in 102 ms. Remains 52 /98 variables (removed 46) and now considering 319/387 (removed 68) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 102 ms. Remains : 52/98 places, 319/387 transitions.
[2024-06-01 13:05:40] [INFO ] Flatten gal took : 22 ms
[2024-06-01 13:05:40] [INFO ] Flatten gal took : 21 ms
[2024-06-01 13:05:40] [INFO ] Input system was already deterministic with 319 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 98/98 places, 387/387 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 98 transition count 375
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 86 transition count 375
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 32 place count 78 transition count 362
Iterating global reduction 0 with 8 rules applied. Total rules applied 40 place count 78 transition count 362
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 45 place count 73 transition count 352
Iterating global reduction 0 with 5 rules applied. Total rules applied 50 place count 73 transition count 352
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 54 place count 69 transition count 348
Iterating global reduction 0 with 4 rules applied. Total rules applied 58 place count 69 transition count 348
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 73 place count 69 transition count 333
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 1 with 14 rules applied. Total rules applied 87 place count 62 transition count 326
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 94 place count 55 transition count 319
Iterating global reduction 1 with 7 rules applied. Total rules applied 101 place count 55 transition count 319
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 1 with 7 rules applied. Total rules applied 108 place count 55 transition count 312
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 1 with 14 rules applied. Total rules applied 122 place count 48 transition count 305
Partial Post-agglomeration rule applied 3 times.
Drop transitions (Partial Post agglomeration) removed 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 125 place count 48 transition count 305
Applied a total of 125 rules in 74 ms. Remains 48 /98 variables (removed 50) and now considering 305/387 (removed 82) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 75 ms. Remains : 48/98 places, 305/387 transitions.
[2024-06-01 13:05:40] [INFO ] Flatten gal took : 17 ms
[2024-06-01 13:05:40] [INFO ] Flatten gal took : 18 ms
[2024-06-01 13:05:40] [INFO ] Input system was already deterministic with 305 transitions.
Starting structural reductions in LTL mode, iteration 0 : 98/98 places, 387/387 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 88 transition count 371
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 88 transition count 371
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 24 place count 84 transition count 363
Iterating global reduction 0 with 4 rules applied. Total rules applied 28 place count 84 transition count 363
Applied a total of 28 rules in 4 ms. Remains 84 /98 variables (removed 14) and now considering 363/387 (removed 24) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 84/98 places, 363/387 transitions.
[2024-06-01 13:05:40] [INFO ] Flatten gal took : 15 ms
[2024-06-01 13:05:40] [INFO ] Flatten gal took : 16 ms
[2024-06-01 13:05:40] [INFO ] Input system was already deterministic with 363 transitions.
Starting structural reductions in LTL mode, iteration 0 : 98/98 places, 387/387 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 88 transition count 371
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 88 transition count 371
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 26 place count 82 transition count 359
Iterating global reduction 0 with 6 rules applied. Total rules applied 32 place count 82 transition count 359
Applied a total of 32 rules in 4 ms. Remains 82 /98 variables (removed 16) and now considering 359/387 (removed 28) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 82/98 places, 359/387 transitions.
[2024-06-01 13:05:40] [INFO ] Flatten gal took : 14 ms
[2024-06-01 13:05:40] [INFO ] Flatten gal took : 15 ms
[2024-06-01 13:05:40] [INFO ] Input system was already deterministic with 359 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 98/98 places, 387/387 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 96 transition count 359
Reduce places removed 27 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 28 rules applied. Total rules applied 56 place count 69 transition count 358
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 57 place count 68 transition count 358
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 57 place count 68 transition count 346
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 81 place count 56 transition count 346
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 92 place count 45 transition count 328
Iterating global reduction 3 with 11 rules applied. Total rules applied 103 place count 45 transition count 328
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 110 place count 38 transition count 314
Iterating global reduction 3 with 7 rules applied. Total rules applied 117 place count 38 transition count 314
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 3 with 31 rules applied. Total rules applied 148 place count 38 transition count 283
Drop transitions (Redundant composition of simpler transitions.) removed 221 transitions
Redundant transition composition rules discarded 221 transitions
Iterating global reduction 4 with 221 rules applied. Total rules applied 369 place count 38 transition count 62
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 4 with 14 rules applied. Total rules applied 383 place count 31 transition count 55
Reduce places removed 7 places and 7 transitions.
Iterating global reduction 4 with 7 rules applied. Total rules applied 390 place count 24 transition count 48
Applied a total of 390 rules in 25 ms. Remains 24 /98 variables (removed 74) and now considering 48/387 (removed 339) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 25 ms. Remains : 24/98 places, 48/387 transitions.
[2024-06-01 13:05:40] [INFO ] Flatten gal took : 2 ms
[2024-06-01 13:05:40] [INFO ] Flatten gal took : 1 ms
[2024-06-01 13:05:40] [INFO ] Input system was already deterministic with 48 transitions.
Starting structural reductions in LTL mode, iteration 0 : 98/98 places, 387/387 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 88 transition count 371
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 88 transition count 371
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 25 place count 83 transition count 361
Iterating global reduction 0 with 5 rules applied. Total rules applied 30 place count 83 transition count 361
Applied a total of 30 rules in 4 ms. Remains 83 /98 variables (removed 15) and now considering 361/387 (removed 26) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 83/98 places, 361/387 transitions.
[2024-06-01 13:05:40] [INFO ] Flatten gal took : 14 ms
[2024-06-01 13:05:40] [INFO ] Flatten gal took : 14 ms
[2024-06-01 13:05:40] [INFO ] Input system was already deterministic with 361 transitions.
Starting structural reductions in LTL mode, iteration 0 : 98/98 places, 387/387 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 87 transition count 369
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 87 transition count 369
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 29 place count 80 transition count 355
Iterating global reduction 0 with 7 rules applied. Total rules applied 36 place count 80 transition count 355
Applied a total of 36 rules in 4 ms. Remains 80 /98 variables (removed 18) and now considering 355/387 (removed 32) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 80/98 places, 355/387 transitions.
[2024-06-01 13:05:40] [INFO ] Flatten gal took : 14 ms
[2024-06-01 13:05:40] [INFO ] Flatten gal took : 16 ms
[2024-06-01 13:05:40] [INFO ] Input system was already deterministic with 355 transitions.
[2024-06-01 13:05:40] [INFO ] Flatten gal took : 16 ms
[2024-06-01 13:05:40] [INFO ] Flatten gal took : 15 ms
[2024-06-01 13:05:40] [INFO ] Export to MCC of 11 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2024-06-01 13:05:40] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 98 places, 387 transitions and 3981 arcs took 5 ms.
Total runtime 66246 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : StigmergyElection-PT-07a-CTLCardinality-2024-02
Could not compute solution for formula : StigmergyElection-PT-07a-CTLCardinality-2024-03
Could not compute solution for formula : StigmergyElection-PT-07a-CTLCardinality-2024-04
Could not compute solution for formula : StigmergyElection-PT-07a-CTLCardinality-2024-06
Could not compute solution for formula : StigmergyElection-PT-07a-CTLCardinality-2024-07
Could not compute solution for formula : StigmergyElection-PT-07a-CTLCardinality-2024-09
Could not compute solution for formula : StigmergyElection-PT-07a-CTLCardinality-2024-10
Could not compute solution for formula : StigmergyElection-PT-07a-CTLCardinality-2024-11
Could not compute solution for formula : StigmergyElection-PT-07a-CTLCardinality-2023-12
Could not compute solution for formula : StigmergyElection-PT-07a-CTLCardinality-2023-14
Could not compute solution for formula : StigmergyElection-PT-07a-CTLCardinality-2023-15

BK_STOP 1717247140907

--------------------
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 CTLCardinality -timeout 360 -rebuildPNML
mcc2024
ctl formula name StigmergyElection-PT-07a-CTLCardinality-2024-02
ctl formula formula --ctl=/tmp/863/ctl_0_
ctl formula name StigmergyElection-PT-07a-CTLCardinality-2024-03
ctl formula formula --ctl=/tmp/863/ctl_1_
ctl formula name StigmergyElection-PT-07a-CTLCardinality-2024-04
ctl formula formula --ctl=/tmp/863/ctl_2_
ctl formula name StigmergyElection-PT-07a-CTLCardinality-2024-06
ctl formula formula --ctl=/tmp/863/ctl_3_
ctl formula name StigmergyElection-PT-07a-CTLCardinality-2024-07
ctl formula formula --ctl=/tmp/863/ctl_4_
ctl formula name StigmergyElection-PT-07a-CTLCardinality-2024-09
ctl formula formula --ctl=/tmp/863/ctl_5_
ctl formula name StigmergyElection-PT-07a-CTLCardinality-2024-10
ctl formula formula --ctl=/tmp/863/ctl_6_
ctl formula name StigmergyElection-PT-07a-CTLCardinality-2024-11
ctl formula formula --ctl=/tmp/863/ctl_7_
ctl formula name StigmergyElection-PT-07a-CTLCardinality-2023-12
ctl formula formula --ctl=/tmp/863/ctl_8_
ctl formula name StigmergyElection-PT-07a-CTLCardinality-2023-14
ctl formula formula --ctl=/tmp/863/ctl_9_
ctl formula name StigmergyElection-PT-07a-CTLCardinality-2023-15
ctl formula formula --ctl=/tmp/863/ctl_10_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is StigmergyElection-PT-07a, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r536-tall-171690532100329"
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 [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;