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-171690532100313.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-06a, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r536-tall-171690532100313
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 9.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 113K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Apr 23 08:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 08:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 23 08:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 08:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 11 18:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 118K Apr 11 18:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K Apr 11 18:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 145K Apr 11 18:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 08:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 08:00 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 565K May 18 16:43 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME StigmergyElection-PT-06a-CTLCardinality-2024-00
FORMULA_NAME StigmergyElection-PT-06a-CTLCardinality-2024-01
FORMULA_NAME StigmergyElection-PT-06a-CTLCardinality-2024-02
FORMULA_NAME StigmergyElection-PT-06a-CTLCardinality-2024-03
FORMULA_NAME StigmergyElection-PT-06a-CTLCardinality-2024-04
FORMULA_NAME StigmergyElection-PT-06a-CTLCardinality-2024-05
FORMULA_NAME StigmergyElection-PT-06a-CTLCardinality-2024-06
FORMULA_NAME StigmergyElection-PT-06a-CTLCardinality-2024-07
FORMULA_NAME StigmergyElection-PT-06a-CTLCardinality-2024-08
FORMULA_NAME StigmergyElection-PT-06a-CTLCardinality-2024-09
FORMULA_NAME StigmergyElection-PT-06a-CTLCardinality-2024-10
FORMULA_NAME StigmergyElection-PT-06a-CTLCardinality-2024-11
FORMULA_NAME StigmergyElection-PT-06a-CTLCardinality-2023-12
FORMULA_NAME StigmergyElection-PT-06a-CTLCardinality-2023-13
FORMULA_NAME StigmergyElection-PT-06a-CTLCardinality-2023-14
FORMULA_NAME StigmergyElection-PT-06a-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1717246662143

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-06a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 12:57:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 12:57:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 12:57:43] [INFO ] Load time of PNML (sax parser for PT used): 153 ms
[2024-06-01 12:57:43] [INFO ] Transformed 86 places.
[2024-06-01 12:57:43] [INFO ] Transformed 1042 transitions.
[2024-06-01 12:57:43] [INFO ] Found NUPN structural information;
[2024-06-01 12:57:43] [INFO ] Parsed PT model containing 86 places and 1042 transitions and 11192 arcs in 292 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 29 ms.
Initial state reduction rules removed 1 formulas.
Ensure Unique test removed 800 transitions
Reduce redundant transitions removed 800 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA StigmergyElection-PT-06a-CTLCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-06a-CTLCardinality-2023-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 76 out of 86 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 242/242 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 85 transition count 241
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 85 transition count 241
Applied a total of 2 rules in 27 ms. Remains 85 /86 variables (removed 1) and now considering 241/242 (removed 1) transitions.
[2024-06-01 12:57:43] [INFO ] Flow matrix only has 224 transitions (discarded 17 similar events)
// Phase 1: matrix 224 rows 85 cols
[2024-06-01 12:57:43] [INFO ] Computed 6 invariants in 16 ms
[2024-06-01 12:57:43] [INFO ] Implicit Places using invariants in 221 ms returned []
[2024-06-01 12:57:43] [INFO ] Flow matrix only has 224 transitions (discarded 17 similar events)
[2024-06-01 12:57:43] [INFO ] Invariant cache hit.
[2024-06-01 12:57:44] [INFO ] State equation strengthened by 155 read => feed constraints.
[2024-06-01 12:57:44] [INFO ] Implicit Places using invariants and state equation in 178 ms returned []
Implicit Place search using SMT with State Equation took 447 ms to find 0 implicit places.
Running 240 sub problems to find dead transitions.
[2024-06-01 12:57:44] [INFO ] Flow matrix only has 224 transitions (discarded 17 similar events)
[2024-06-01 12:57:44] [INFO ] Invariant cache hit.
[2024-06-01 12:57:44] [INFO ] State equation strengthened by 155 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 1 (OVERLAPS) 1/85 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-06-01 12:57:46] [INFO ] Deduced a trap composed of 13 places in 118 ms of which 19 ms to minimize.
[2024-06-01 12:57:46] [INFO ] Deduced a trap composed of 12 places in 62 ms of which 1 ms to minimize.
[2024-06-01 12:57:46] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 1 ms to minimize.
[2024-06-01 12:57:46] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 1 ms to minimize.
[2024-06-01 12:57:46] [INFO ] Deduced a trap composed of 13 places in 139 ms of which 0 ms to minimize.
[2024-06-01 12:57:46] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 0 ms to minimize.
[2024-06-01 12:57:46] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 1 ms to minimize.
[2024-06-01 12:57:46] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
[2024-06-01 12:57:46] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 8 ms to minimize.
[2024-06-01 12:57:46] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2024-06-01 12:57:46] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 2 ms to minimize.
[2024-06-01 12:57:47] [INFO ] Deduced a trap composed of 12 places in 193 ms of which 1 ms to minimize.
[2024-06-01 12:57:47] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
[2024-06-01 12:57:47] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 1 ms to minimize.
[2024-06-01 12:57:47] [INFO ] Deduced a trap composed of 12 places in 118 ms of which 1 ms to minimize.
[2024-06-01 12:57:47] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 0 ms to minimize.
[2024-06-01 12:57:47] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 1 ms to minimize.
[2024-06-01 12:57:47] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 1 ms to minimize.
[2024-06-01 12:57:47] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 2 ms to minimize.
[2024-06-01 12:57:47] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 20/26 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-06-01 12:57:47] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 0 ms to minimize.
[2024-06-01 12:57:47] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2024-06-01 12:57:47] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
[2024-06-01 12:57:47] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 11 ms to minimize.
[2024-06-01 12:57:47] [INFO ] Deduced a trap composed of 12 places in 84 ms of which 1 ms to minimize.
[2024-06-01 12:57:47] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 0 ms to minimize.
[2024-06-01 12:57:48] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
[2024-06-01 12:57:48] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 1 ms to minimize.
[2024-06-01 12:57:48] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 1 ms to minimize.
[2024-06-01 12:57:48] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 0 ms to minimize.
[2024-06-01 12:57:48] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 1 ms to minimize.
[2024-06-01 12:57:48] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 1 ms to minimize.
[2024-06-01 12:57:48] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 1 ms to minimize.
[2024-06-01 12:57:48] [INFO ] Deduced a trap composed of 12 places in 72 ms of which 1 ms to minimize.
[2024-06-01 12:57:48] [INFO ] Deduced a trap composed of 12 places in 449 ms of which 3 ms to minimize.
[2024-06-01 12:57:48] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 0 ms to minimize.
[2024-06-01 12:57:49] [INFO ] Deduced a trap composed of 12 places in 85 ms of which 1 ms to minimize.
[2024-06-01 12:57:49] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 1 ms to minimize.
[2024-06-01 12:57:49] [INFO ] Deduced a trap composed of 12 places in 65 ms of which 1 ms to minimize.
[2024-06-01 12:57:49] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 20/46 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-06-01 12:57:49] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2024-06-01 12:57:49] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 0 ms to minimize.
[2024-06-01 12:57:49] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 0 ms to minimize.
[2024-06-01 12:57:49] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
[2024-06-01 12:57:49] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 1 ms to minimize.
[2024-06-01 12:57:50] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 0 ms to minimize.
[2024-06-01 12:57:50] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 0 ms to minimize.
[2024-06-01 12:57:50] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 0 ms to minimize.
[2024-06-01 12:57:50] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 0 ms to minimize.
[2024-06-01 12:57:50] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 0 ms to minimize.
[2024-06-01 12:57:50] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 2 ms to minimize.
[2024-06-01 12:57:50] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 1 ms to minimize.
[2024-06-01 12:57:50] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 1 ms to minimize.
[2024-06-01 12:57:50] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
[2024-06-01 12:57:50] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
[2024-06-01 12:57:50] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 0 ms to minimize.
[2024-06-01 12:57:50] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 10 ms to minimize.
[2024-06-01 12:57:50] [INFO ] Deduced a trap composed of 15 places in 20 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 18/64 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-06-01 12:57:51] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 0 ms to minimize.
[2024-06-01 12:57:51] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 0 ms to minimize.
[2024-06-01 12:57:51] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 0 ms to minimize.
[2024-06-01 12:57:51] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 0 ms to minimize.
[2024-06-01 12:57:51] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 0 ms to minimize.
[2024-06-01 12:57:51] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 1 ms to minimize.
[2024-06-01 12:57:51] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/85 variables, 7/71 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-06-01 12:57:51] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 0 ms to minimize.
[2024-06-01 12:57:52] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 0 ms to minimize.
[2024-06-01 12:57:52] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 0 ms to minimize.
[2024-06-01 12:57:52] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/85 variables, 4/75 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-06-01 12:57:53] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 1 ms to minimize.
[2024-06-01 12:57:53] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 0 ms to minimize.
[2024-06-01 12:57:53] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 1 ms to minimize.
[2024-06-01 12:57:53] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 1 ms to minimize.
[2024-06-01 12:57:53] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/85 variables, 5/80 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-06-01 12:57:53] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 1 ms to minimize.
[2024-06-01 12:57:53] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
[2024-06-01 12:57:53] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/85 variables, 3/83 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/85 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 10 (OVERLAPS) 223/308 variables, 85/168 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/308 variables, 154/322 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/308 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 13 (OVERLAPS) 1/309 variables, 1/323 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/309 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 15 (OVERLAPS) 0/309 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 240 unsolved
No progress, stopping.
After SMT solving in domain Real declared 309/309 variables, and 323 constraints, problems are : Problem set: 0 solved, 240 unsolved in 17812 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 85/85 constraints, ReadFeed: 155/155 constraints, PredecessorRefiner: 240/240 constraints, Known Traps: 77/77 constraints]
Escalating to Integer solving :Problem set: 0 solved, 240 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 1 (OVERLAPS) 1/85 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 77/83 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 4 (OVERLAPS) 223/308 variables, 85/168 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/308 variables, 154/322 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/308 variables, 240/562 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/308 variables, 0/562 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 8 (OVERLAPS) 1/309 variables, 1/563 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/309 variables, 0/563 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 10 (OVERLAPS) 0/309 variables, 0/563 constraints. Problems are: Problem set: 0 solved, 240 unsolved
No progress, stopping.
After SMT solving in domain Int declared 309/309 variables, and 563 constraints, problems are : Problem set: 0 solved, 240 unsolved in 19646 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 85/85 constraints, ReadFeed: 155/155 constraints, PredecessorRefiner: 240/240 constraints, Known Traps: 77/77 constraints]
After SMT, in 38224ms problems are : Problem set: 0 solved, 240 unsolved
Search for dead transitions found 0 dead transitions in 38245ms
Starting structural reductions in LTL mode, iteration 1 : 85/86 places, 241/242 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 38742 ms. Remains : 85/86 places, 241/242 transitions.
Support contains 76 out of 85 places after structural reductions.
[2024-06-01 12:58:22] [INFO ] Flatten gal took : 62 ms
[2024-06-01 12:58:22] [INFO ] Flatten gal took : 23 ms
[2024-06-01 12:58:22] [INFO ] Input system was already deterministic with 241 transitions.
Support contains 74 out of 85 places (down from 76) after GAL structural reductions.
RANDOM walk for 40000 steps (101 resets) in 2210 ms. (18 steps per ms) remains 6/79 properties
BEST_FIRST walk for 40004 steps (121 resets) in 195 ms. (204 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 93 ms. (425 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (9 resets) in 89 ms. (444 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (116 resets) in 79 ms. (500 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (9 resets) in 118 ms. (336 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 86 ms. (459 steps per ms) remains 6/6 properties
[2024-06-01 12:58:23] [INFO ] Flow matrix only has 224 transitions (discarded 17 similar events)
[2024-06-01 12:58:23] [INFO ] Invariant cache hit.
[2024-06-01 12:58:23] [INFO ] State equation strengthened by 155 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 66/85 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 223/308 variables, 85/91 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/308 variables, 154/245 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/308 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 1/309 variables, 1/246 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/309 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 0/309 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 309/309 variables, and 246 constraints, problems are : Problem set: 0 solved, 6 unsolved in 222 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 85/85 constraints, ReadFeed: 155/155 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem AtomicPropp25 is UNSAT
At refinement iteration 1 (OVERLAPS) 66/85 variables, 6/6 constraints. Problems are: Problem set: 1 solved, 5 unsolved
[2024-06-01 12:58:24] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 0 ms to minimize.
[2024-06-01 12:58:24] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 1 ms to minimize.
[2024-06-01 12:58:24] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 1 ms to minimize.
[2024-06-01 12:58:24] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 1 ms to minimize.
[2024-06-01 12:58:24] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
[2024-06-01 12:58:24] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 1 ms to minimize.
[2024-06-01 12:58:24] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 0 ms to minimize.
[2024-06-01 12:58:24] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 1 ms to minimize.
[2024-06-01 12:58:24] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 1 ms to minimize.
[2024-06-01 12:58:24] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 0 ms to minimize.
[2024-06-01 12:58:24] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2024-06-01 12:58:24] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 0 ms to minimize.
[2024-06-01 12:58:24] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
[2024-06-01 12:58:24] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 1 ms to minimize.
Problem AtomicPropp1 is UNSAT
[2024-06-01 12:58:24] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 1 ms to minimize.
[2024-06-01 12:58:24] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 0 ms to minimize.
[2024-06-01 12:58:24] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 1 ms to minimize.
[2024-06-01 12:58:24] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 1 ms to minimize.
[2024-06-01 12:58:24] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp69 is UNSAT
[2024-06-01 12:58:25] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 0 ms to minimize.
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp69 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 20/26 constraints. Problems are: Problem set: 5 solved, 1 unsolved
[2024-06-01 12:58:25] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 0 ms to minimize.
[2024-06-01 12:58:25] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
Problem AtomicPropp77 is UNSAT
After SMT solving in domain Int declared 85/309 variables, and 28 constraints, problems are : Problem set: 6 solved, 0 unsolved in 1009 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 0/85 constraints, ReadFeed: 0/155 constraints, PredecessorRefiner: 0/6 constraints, Known Traps: 22/22 constraints]
After SMT, in 1252ms problems are : Problem set: 6 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 6 atomic propositions for a total of 14 simplifications.
[2024-06-01 12:58:25] [INFO ] Flatten gal took : 14 ms
[2024-06-01 12:58:25] [INFO ] Flatten gal took : 16 ms
[2024-06-01 12:58:25] [INFO ] Input system was already deterministic with 241 transitions.
Computed a total of 14 stabilizing places and 13 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 241/241 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 78 transition count 229
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 78 transition count 229
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 76 transition count 225
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 76 transition count 225
Applied a total of 18 rules in 8 ms. Remains 76 /85 variables (removed 9) and now considering 225/241 (removed 16) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 76/85 places, 225/241 transitions.
[2024-06-01 12:58:25] [INFO ] Flatten gal took : 13 ms
[2024-06-01 12:58:25] [INFO ] Flatten gal took : 14 ms
[2024-06-01 12:58:25] [INFO ] Input system was already deterministic with 225 transitions.
Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 241/241 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 78 transition count 230
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 78 transition count 230
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 18 place count 74 transition count 222
Iterating global reduction 0 with 4 rules applied. Total rules applied 22 place count 74 transition count 222
Applied a total of 22 rules in 6 ms. Remains 74 /85 variables (removed 11) and now considering 222/241 (removed 19) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 74/85 places, 222/241 transitions.
[2024-06-01 12:58:25] [INFO ] Flatten gal took : 13 ms
[2024-06-01 12:58:25] [INFO ] Flatten gal took : 14 ms
[2024-06-01 12:58:25] [INFO ] Input system was already deterministic with 222 transitions.
Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 241/241 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 75 transition count 225
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 75 transition count 225
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 25 place count 70 transition count 215
Iterating global reduction 0 with 5 rules applied. Total rules applied 30 place count 70 transition count 215
Applied a total of 30 rules in 7 ms. Remains 70 /85 variables (removed 15) and now considering 215/241 (removed 26) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 70/85 places, 215/241 transitions.
[2024-06-01 12:58:25] [INFO ] Flatten gal took : 11 ms
[2024-06-01 12:58:25] [INFO ] Flatten gal took : 11 ms
[2024-06-01 12:58:25] [INFO ] Input system was already deterministic with 215 transitions.
Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 241/241 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 78 transition count 231
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 78 transition count 231
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 76 transition count 227
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 76 transition count 227
Applied a total of 18 rules in 6 ms. Remains 76 /85 variables (removed 9) and now considering 227/241 (removed 14) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 76/85 places, 227/241 transitions.
[2024-06-01 12:58:25] [INFO ] Flatten gal took : 12 ms
[2024-06-01 12:58:25] [INFO ] Flatten gal took : 12 ms
[2024-06-01 12:58:25] [INFO ] Input system was already deterministic with 227 transitions.
Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 241/241 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 78 transition count 231
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 78 transition count 231
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 76 transition count 227
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 76 transition count 227
Applied a total of 18 rules in 5 ms. Remains 76 /85 variables (removed 9) and now considering 227/241 (removed 14) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 76/85 places, 227/241 transitions.
[2024-06-01 12:58:25] [INFO ] Flatten gal took : 11 ms
[2024-06-01 12:58:25] [INFO ] Flatten gal took : 12 ms
[2024-06-01 12:58:25] [INFO ] Input system was already deterministic with 227 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 85/85 places, 241/241 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 83 transition count 219
Reduce places removed 21 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 23 rules applied. Total rules applied 45 place count 62 transition count 217
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 47 place count 60 transition count 217
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 47 place count 60 transition count 207
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 67 place count 50 transition count 207
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 77 place count 40 transition count 191
Iterating global reduction 3 with 10 rules applied. Total rules applied 87 place count 40 transition count 191
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 92 place count 35 transition count 181
Iterating global reduction 3 with 5 rules applied. Total rules applied 97 place count 35 transition count 181
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 104 place count 35 transition count 174
Drop transitions (Redundant composition of simpler transitions.) removed 113 transitions
Redundant transition composition rules discarded 113 transitions
Iterating global reduction 4 with 113 rules applied. Total rules applied 217 place count 35 transition count 61
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 229 place count 29 transition count 55
Reduce places removed 6 places and 6 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 235 place count 23 transition count 49
Applied a total of 235 rules in 51 ms. Remains 23 /85 variables (removed 62) and now considering 49/241 (removed 192) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 52 ms. Remains : 23/85 places, 49/241 transitions.
[2024-06-01 12:58:25] [INFO ] Flatten gal took : 3 ms
[2024-06-01 12:58:25] [INFO ] Flatten gal took : 2 ms
[2024-06-01 12:58:25] [INFO ] Input system was already deterministic with 49 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 85/85 places, 241/241 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 83 transition count 221
Reduce places removed 19 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 20 rules applied. Total rules applied 40 place count 64 transition count 220
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 41 place count 63 transition count 220
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 41 place count 63 transition count 209
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 63 place count 52 transition count 209
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 74 place count 41 transition count 192
Iterating global reduction 3 with 11 rules applied. Total rules applied 85 place count 41 transition count 192
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 90 place count 36 transition count 182
Iterating global reduction 3 with 5 rules applied. Total rules applied 95 place count 36 transition count 182
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 3 with 15 rules applied. Total rules applied 110 place count 36 transition count 167
Drop transitions (Redundant composition of simpler transitions.) removed 91 transitions
Redundant transition composition rules discarded 91 transitions
Iterating global reduction 4 with 91 rules applied. Total rules applied 201 place count 36 transition count 76
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 202 place count 36 transition count 75
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 203 place count 35 transition count 75
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 6 with 10 rules applied. Total rules applied 213 place count 30 transition count 70
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 214 place count 30 transition count 70
Reduce places removed 5 places and 5 transitions.
Iterating global reduction 6 with 5 rules applied. Total rules applied 219 place count 25 transition count 65
Applied a total of 219 rules in 38 ms. Remains 25 /85 variables (removed 60) and now considering 65/241 (removed 176) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 38 ms. Remains : 25/85 places, 65/241 transitions.
[2024-06-01 12:58:25] [INFO ] Flatten gal took : 3 ms
[2024-06-01 12:58:25] [INFO ] Flatten gal took : 3 ms
[2024-06-01 12:58:25] [INFO ] Input system was already deterministic with 65 transitions.
Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 241/241 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 75 transition count 225
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 75 transition count 225
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 25 place count 70 transition count 215
Iterating global reduction 0 with 5 rules applied. Total rules applied 30 place count 70 transition count 215
Applied a total of 30 rules in 5 ms. Remains 70 /85 variables (removed 15) and now considering 215/241 (removed 26) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 70/85 places, 215/241 transitions.
[2024-06-01 12:58:25] [INFO ] Flatten gal took : 9 ms
[2024-06-01 12:58:25] [INFO ] Flatten gal took : 9 ms
[2024-06-01 12:58:25] [INFO ] Input system was already deterministic with 215 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 85/85 places, 241/241 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 83 transition count 220
Reduce places removed 20 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 21 rules applied. Total rules applied 42 place count 63 transition count 219
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 43 place count 62 transition count 219
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 43 place count 62 transition count 208
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 65 place count 51 transition count 208
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 74 place count 42 transition count 194
Iterating global reduction 3 with 9 rules applied. Total rules applied 83 place count 42 transition count 194
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 87 place count 38 transition count 186
Iterating global reduction 3 with 4 rules applied. Total rules applied 91 place count 38 transition count 186
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 98 place count 38 transition count 179
Drop transitions (Redundant composition of simpler transitions.) removed 105 transitions
Redundant transition composition rules discarded 105 transitions
Iterating global reduction 4 with 105 rules applied. Total rules applied 203 place count 38 transition count 74
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 215 place count 32 transition count 68
Reduce places removed 6 places and 6 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 221 place count 26 transition count 62
Applied a total of 221 rules in 26 ms. Remains 26 /85 variables (removed 59) and now considering 62/241 (removed 179) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 26 ms. Remains : 26/85 places, 62/241 transitions.
[2024-06-01 12:58:25] [INFO ] Flatten gal took : 3 ms
[2024-06-01 12:58:25] [INFO ] Flatten gal took : 2 ms
[2024-06-01 12:58:25] [INFO ] Input system was already deterministic with 62 transitions.
Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 241/241 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 80 transition count 233
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 80 transition count 233
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 79 transition count 231
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 79 transition count 231
Applied a total of 12 rules in 3 ms. Remains 79 /85 variables (removed 6) and now considering 231/241 (removed 10) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 79/85 places, 231/241 transitions.
[2024-06-01 12:58:25] [INFO ] Flatten gal took : 9 ms
[2024-06-01 12:58:25] [INFO ] Flatten gal took : 10 ms
[2024-06-01 12:58:25] [INFO ] Input system was already deterministic with 231 transitions.
Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 241/241 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 78 transition count 230
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 78 transition count 230
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 76 transition count 226
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 76 transition count 226
Applied a total of 18 rules in 3 ms. Remains 76 /85 variables (removed 9) and now considering 226/241 (removed 15) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 76/85 places, 226/241 transitions.
[2024-06-01 12:58:25] [INFO ] Flatten gal took : 8 ms
[2024-06-01 12:58:25] [INFO ] Flatten gal took : 9 ms
[2024-06-01 12:58:25] [INFO ] Input system was already deterministic with 226 transitions.
Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 241/241 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 75 transition count 225
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 75 transition count 225
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 25 place count 70 transition count 215
Iterating global reduction 0 with 5 rules applied. Total rules applied 30 place count 70 transition count 215
Applied a total of 30 rules in 3 ms. Remains 70 /85 variables (removed 15) and now considering 215/241 (removed 26) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 70/85 places, 215/241 transitions.
[2024-06-01 12:58:25] [INFO ] Flatten gal took : 8 ms
[2024-06-01 12:58:25] [INFO ] Flatten gal took : 9 ms
[2024-06-01 12:58:25] [INFO ] Input system was already deterministic with 215 transitions.
Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 241/241 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 75 transition count 225
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 75 transition count 225
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 25 place count 70 transition count 215
Iterating global reduction 0 with 5 rules applied. Total rules applied 30 place count 70 transition count 215
Applied a total of 30 rules in 3 ms. Remains 70 /85 variables (removed 15) and now considering 215/241 (removed 26) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 70/85 places, 215/241 transitions.
[2024-06-01 12:58:25] [INFO ] Flatten gal took : 8 ms
[2024-06-01 12:58:25] [INFO ] Flatten gal took : 9 ms
[2024-06-01 12:58:25] [INFO ] Input system was already deterministic with 215 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 85/85 places, 241/241 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 83 transition count 219
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 43 place count 62 transition count 219
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 43 place count 62 transition count 207
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 67 place count 50 transition count 207
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 74 place count 43 transition count 196
Iterating global reduction 2 with 7 rules applied. Total rules applied 81 place count 43 transition count 196
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 85 place count 39 transition count 188
Iterating global reduction 2 with 4 rules applied. Total rules applied 89 place count 39 transition count 188
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 96 place count 39 transition count 181
Drop transitions (Redundant composition of simpler transitions.) removed 104 transitions
Redundant transition composition rules discarded 104 transitions
Iterating global reduction 3 with 104 rules applied. Total rules applied 200 place count 39 transition count 77
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 212 place count 33 transition count 71
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 214 place count 33 transition count 71
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 215 place count 33 transition count 70
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 216 place count 33 transition count 69
Reduce places removed 5 places and 5 transitions.
Iterating global reduction 4 with 5 rules applied. Total rules applied 221 place count 28 transition count 64
Applied a total of 221 rules in 27 ms. Remains 28 /85 variables (removed 57) and now considering 64/241 (removed 177) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 28 ms. Remains : 28/85 places, 64/241 transitions.
[2024-06-01 12:58:25] [INFO ] Flatten gal took : 3 ms
[2024-06-01 12:58:25] [INFO ] Flatten gal took : 3 ms
[2024-06-01 12:58:25] [INFO ] Input system was already deterministic with 64 transitions.
[2024-06-01 12:58:25] [INFO ] Flatten gal took : 10 ms
[2024-06-01 12:58:25] [INFO ] Flatten gal took : 9 ms
[2024-06-01 12:58:25] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 4 ms.
[2024-06-01 12:58:25] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 85 places, 241 transitions and 1866 arcs took 3 ms.
Total runtime 42739 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-06a-CTLCardinality-2024-00
Could not compute solution for formula : StigmergyElection-PT-06a-CTLCardinality-2024-01
Could not compute solution for formula : StigmergyElection-PT-06a-CTLCardinality-2024-02
Could not compute solution for formula : StigmergyElection-PT-06a-CTLCardinality-2024-03
Could not compute solution for formula : StigmergyElection-PT-06a-CTLCardinality-2024-04
Could not compute solution for formula : StigmergyElection-PT-06a-CTLCardinality-2024-05
Could not compute solution for formula : StigmergyElection-PT-06a-CTLCardinality-2024-06
Could not compute solution for formula : StigmergyElection-PT-06a-CTLCardinality-2024-07
Could not compute solution for formula : StigmergyElection-PT-06a-CTLCardinality-2024-08
Could not compute solution for formula : StigmergyElection-PT-06a-CTLCardinality-2024-09
Could not compute solution for formula : StigmergyElection-PT-06a-CTLCardinality-2024-10
Could not compute solution for formula : StigmergyElection-PT-06a-CTLCardinality-2023-12
Could not compute solution for formula : StigmergyElection-PT-06a-CTLCardinality-2023-13
Could not compute solution for formula : StigmergyElection-PT-06a-CTLCardinality-2023-15

BK_STOP 1717246706371

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -timeout 360 -rebuildPNML
mcc2024
ctl formula name StigmergyElection-PT-06a-CTLCardinality-2024-00
ctl formula formula --ctl=/tmp/824/ctl_0_
ctl formula name StigmergyElection-PT-06a-CTLCardinality-2024-01
ctl formula formula --ctl=/tmp/824/ctl_1_
ctl formula name StigmergyElection-PT-06a-CTLCardinality-2024-02
ctl formula formula --ctl=/tmp/824/ctl_2_
ctl formula name StigmergyElection-PT-06a-CTLCardinality-2024-03
ctl formula formula --ctl=/tmp/824/ctl_3_
ctl formula name StigmergyElection-PT-06a-CTLCardinality-2024-04
ctl formula formula --ctl=/tmp/824/ctl_4_
ctl formula name StigmergyElection-PT-06a-CTLCardinality-2024-05
ctl formula formula --ctl=/tmp/824/ctl_5_
ctl formula name StigmergyElection-PT-06a-CTLCardinality-2024-06
ctl formula formula --ctl=/tmp/824/ctl_6_
ctl formula name StigmergyElection-PT-06a-CTLCardinality-2024-07
ctl formula formula --ctl=/tmp/824/ctl_7_
ctl formula name StigmergyElection-PT-06a-CTLCardinality-2024-08
ctl formula formula --ctl=/tmp/824/ctl_8_
ctl formula name StigmergyElection-PT-06a-CTLCardinality-2024-09
ctl formula formula --ctl=/tmp/824/ctl_9_
ctl formula name StigmergyElection-PT-06a-CTLCardinality-2024-10
ctl formula formula --ctl=/tmp/824/ctl_10_
ctl formula name StigmergyElection-PT-06a-CTLCardinality-2023-12
ctl formula formula --ctl=/tmp/824/ctl_11_
ctl formula name StigmergyElection-PT-06a-CTLCardinality-2023-13
ctl formula formula --ctl=/tmp/824/ctl_12_
ctl formula name StigmergyElection-PT-06a-CTLCardinality-2023-15
ctl formula formula --ctl=/tmp/824/ctl_13_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="StigmergyElection-PT-06a"
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-06a, 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-171690532100313"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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