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

About the Execution of LTSMin+red for StigmergyElection-PT-10a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
3539.979 131700.00 187769.00 617.80 [undef] Cannot compute

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 51M
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Apr 23 08:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 23 08:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K 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 11K Apr 11 19:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 117K Apr 11 19:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Apr 11 19:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 47K Apr 11 19:27 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 50M 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-10a-CTLCardinality-2024-00
FORMULA_NAME StigmergyElection-PT-10a-CTLCardinality-2024-01
FORMULA_NAME StigmergyElection-PT-10a-CTLCardinality-2024-02
FORMULA_NAME StigmergyElection-PT-10a-CTLCardinality-2024-03
FORMULA_NAME StigmergyElection-PT-10a-CTLCardinality-2024-04
FORMULA_NAME StigmergyElection-PT-10a-CTLCardinality-2024-05
FORMULA_NAME StigmergyElection-PT-10a-CTLCardinality-2024-06
FORMULA_NAME StigmergyElection-PT-10a-CTLCardinality-2024-07
FORMULA_NAME StigmergyElection-PT-10a-CTLCardinality-2024-08
FORMULA_NAME StigmergyElection-PT-10a-CTLCardinality-2024-09
FORMULA_NAME StigmergyElection-PT-10a-CTLCardinality-2024-10
FORMULA_NAME StigmergyElection-PT-10a-CTLCardinality-2024-11
FORMULA_NAME StigmergyElection-PT-10a-CTLCardinality-2023-12
FORMULA_NAME StigmergyElection-PT-10a-CTLCardinality-2023-13
FORMULA_NAME StigmergyElection-PT-10a-CTLCardinality-2023-14
FORMULA_NAME StigmergyElection-PT-10a-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1717251175394

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-10a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 14:12:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 14:12:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 14:12:58] [INFO ] Load time of PNML (sax parser for PT used): 2028 ms
[2024-06-01 14:12:58] [INFO ] Transformed 142 places.
[2024-06-01 14:12:59] [INFO ] Transformed 50162 transitions.
[2024-06-01 14:12:59] [INFO ] Found NUPN structural information;
[2024-06-01 14:12:59] [INFO ] Parsed PT model containing 142 places and 50162 transitions and 999212 arcs in 2499 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 17 ms.
Ensure Unique test removed 47924 transitions
Reduce redundant transitions removed 47924 transitions.
Support contains 96 out of 142 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 142/142 places, 2238/2238 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 140 transition count 2236
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 140 transition count 2236
Applied a total of 4 rules in 41 ms. Remains 140 /142 variables (removed 2) and now considering 2236/2238 (removed 2) transitions.
[2024-06-01 14:12:59] [INFO ] Flow matrix only has 2208 transitions (discarded 28 similar events)
// Phase 1: matrix 2208 rows 140 cols
[2024-06-01 14:12:59] [INFO ] Computed 9 invariants in 37 ms
[2024-06-01 14:12:59] [INFO ] Implicit Places using invariants in 505 ms returned []
[2024-06-01 14:12:59] [INFO ] Flow matrix only has 2208 transitions (discarded 28 similar events)
[2024-06-01 14:12:59] [INFO ] Invariant cache hit.
[2024-06-01 14:13:00] [INFO ] State equation strengthened by 2095 read => feed constraints.
[2024-06-01 14:13:01] [INFO ] Implicit Places using invariants and state equation in 1261 ms returned []
Implicit Place search using SMT with State Equation took 1801 ms to find 0 implicit places.
Running 2235 sub problems to find dead transitions.
[2024-06-01 14:13:01] [INFO ] Flow matrix only has 2208 transitions (discarded 28 similar events)
[2024-06-01 14:13:01] [INFO ] Invariant cache hit.
[2024-06-01 14:13:01] [INFO ] State equation strengthened by 2095 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2235 unsolved
At refinement iteration 1 (OVERLAPS) 1/140 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 2235 unsolved
[2024-06-01 14:13:45] [INFO ] Deduced a trap composed of 13 places in 688 ms of which 18 ms to minimize.
[2024-06-01 14:13:46] [INFO ] Deduced a trap composed of 13 places in 689 ms of which 1 ms to minimize.
[2024-06-01 14:13:46] [INFO ] Deduced a trap composed of 13 places in 553 ms of which 2 ms to minimize.
[2024-06-01 14:13:47] [INFO ] Deduced a trap composed of 12 places in 477 ms of which 2 ms to minimize.
[2024-06-01 14:13:48] [INFO ] Deduced a trap composed of 13 places in 598 ms of which 2 ms to minimize.
[2024-06-01 14:13:48] [INFO ] Deduced a trap composed of 12 places in 438 ms of which 1 ms to minimize.
[2024-06-01 14:13:48] [INFO ] Deduced a trap composed of 12 places in 400 ms of which 1 ms to minimize.
[2024-06-01 14:13:49] [INFO ] Deduced a trap composed of 13 places in 521 ms of which 1 ms to minimize.
[2024-06-01 14:13:49] [INFO ] Deduced a trap composed of 12 places in 475 ms of which 1 ms to minimize.
[2024-06-01 14:13:50] [INFO ] Deduced a trap composed of 12 places in 491 ms of which 1 ms to minimize.
[2024-06-01 14:13:50] [INFO ] Deduced a trap composed of 13 places in 414 ms of which 4 ms to minimize.
[2024-06-01 14:13:51] [INFO ] Deduced a trap composed of 12 places in 358 ms of which 1 ms to minimize.
[2024-06-01 14:13:51] [INFO ] Deduced a trap composed of 13 places in 301 ms of which 1 ms to minimize.
[2024-06-01 14:13:51] [INFO ] Deduced a trap composed of 13 places in 326 ms of which 0 ms to minimize.
[2024-06-01 14:13:52] [INFO ] Deduced a trap composed of 12 places in 260 ms of which 1 ms to minimize.
[2024-06-01 14:13:52] [INFO ] Deduced a trap composed of 12 places in 242 ms of which 1 ms to minimize.
[2024-06-01 14:13:52] [INFO ] Deduced a trap composed of 12 places in 280 ms of which 1 ms to minimize.
[2024-06-01 14:13:52] [INFO ] Deduced a trap composed of 12 places in 313 ms of which 1 ms to minimize.
[2024-06-01 14:13:53] [INFO ] Deduced a trap composed of 12 places in 354 ms of which 0 ms to minimize.
[2024-06-01 14:13:53] [INFO ] Deduced a trap composed of 12 places in 326 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/140 variables, 20/29 constraints. Problems are: Problem set: 0 solved, 2235 unsolved
[2024-06-01 14:13:54] [INFO ] Deduced a trap composed of 13 places in 378 ms of which 1 ms to minimize.
[2024-06-01 14:13:54] [INFO ] Deduced a trap composed of 12 places in 353 ms of which 1 ms to minimize.
[2024-06-01 14:13:55] [INFO ] Deduced a trap composed of 12 places in 353 ms of which 1 ms to minimize.
[2024-06-01 14:13:55] [INFO ] Deduced a trap composed of 13 places in 352 ms of which 1 ms to minimize.
[2024-06-01 14:13:55] [INFO ] Deduced a trap composed of 12 places in 286 ms of which 1 ms to minimize.
[2024-06-01 14:13:56] [INFO ] Deduced a trap composed of 13 places in 216 ms of which 1 ms to minimize.
[2024-06-01 14:13:56] [INFO ] Deduced a trap composed of 12 places in 179 ms of which 0 ms to minimize.
[2024-06-01 14:13:56] [INFO ] Deduced a trap composed of 12 places in 219 ms of which 1 ms to minimize.
[2024-06-01 14:13:56] [INFO ] Deduced a trap composed of 12 places in 266 ms of which 0 ms to minimize.
[2024-06-01 14:13:56] [INFO ] Deduced a trap composed of 12 places in 291 ms of which 1 ms to minimize.
[2024-06-01 14:13:57] [INFO ] Deduced a trap composed of 13 places in 264 ms of which 0 ms to minimize.
[2024-06-01 14:13:57] [INFO ] Deduced a trap composed of 12 places in 211 ms of which 1 ms to minimize.
[2024-06-01 14:13:57] [INFO ] Deduced a trap composed of 13 places in 207 ms of which 1 ms to minimize.
[2024-06-01 14:13:57] [INFO ] Deduced a trap composed of 12 places in 210 ms of which 2 ms to minimize.
[2024-06-01 14:13:58] [INFO ] Deduced a trap composed of 12 places in 201 ms of which 2 ms to minimize.
[2024-06-01 14:13:58] [INFO ] Deduced a trap composed of 12 places in 119 ms of which 1 ms to minimize.
[2024-06-01 14:13:58] [INFO ] Deduced a trap composed of 13 places in 354 ms of which 0 ms to minimize.
[2024-06-01 14:13:58] [INFO ] Deduced a trap composed of 12 places in 296 ms of which 1 ms to minimize.
[2024-06-01 14:13:59] [INFO ] Deduced a trap composed of 12 places in 284 ms of which 1 ms to minimize.
[2024-06-01 14:13:59] [INFO ] Deduced a trap composed of 13 places in 307 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/140 variables, 20/49 constraints. Problems are: Problem set: 0 solved, 2235 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 140/2348 variables, and 49 constraints, problems are : Problem set: 0 solved, 2235 unsolved in 30066 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 0/140 constraints, ReadFeed: 0/2095 constraints, PredecessorRefiner: 2235/178 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2235 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2235 unsolved
At refinement iteration 1 (OVERLAPS) 1/140 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 2235 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/140 variables, 40/49 constraints. Problems are: Problem set: 0 solved, 2235 unsolved
[2024-06-01 14:14:09] [INFO ] Deduced a trap composed of 12 places in 135 ms of which 1 ms to minimize.
[2024-06-01 14:14:09] [INFO ] Deduced a trap composed of 12 places in 287 ms of which 1 ms to minimize.
[2024-06-01 14:14:09] [INFO ] Deduced a trap composed of 12 places in 292 ms of which 1 ms to minimize.
[2024-06-01 14:14:09] [INFO ] Deduced a trap composed of 13 places in 263 ms of which 1 ms to minimize.
[2024-06-01 14:14:10] [INFO ] Deduced a trap composed of 12 places in 300 ms of which 0 ms to minimize.
[2024-06-01 14:14:10] [INFO ] Deduced a trap composed of 13 places in 310 ms of which 1 ms to minimize.
[2024-06-01 14:14:10] [INFO ] Deduced a trap composed of 12 places in 304 ms of which 0 ms to minimize.
[2024-06-01 14:14:11] [INFO ] Deduced a trap composed of 12 places in 258 ms of which 1 ms to minimize.
[2024-06-01 14:14:11] [INFO ] Deduced a trap composed of 12 places in 216 ms of which 0 ms to minimize.
[2024-06-01 14:14:11] [INFO ] Deduced a trap composed of 12 places in 163 ms of which 0 ms to minimize.
[2024-06-01 14:14:11] [INFO ] Deduced a trap composed of 13 places in 297 ms of which 1 ms to minimize.
[2024-06-01 14:14:12] [INFO ] Deduced a trap composed of 12 places in 214 ms of which 0 ms to minimize.
[2024-06-01 14:14:12] [INFO ] Deduced a trap composed of 13 places in 259 ms of which 1 ms to minimize.
[2024-06-01 14:14:12] [INFO ] Deduced a trap composed of 12 places in 224 ms of which 1 ms to minimize.
[2024-06-01 14:14:12] [INFO ] Deduced a trap composed of 12 places in 215 ms of which 0 ms to minimize.
[2024-06-01 14:14:13] [INFO ] Deduced a trap composed of 12 places in 230 ms of which 1 ms to minimize.
[2024-06-01 14:14:13] [INFO ] Deduced a trap composed of 12 places in 204 ms of which 0 ms to minimize.
[2024-06-01 14:14:13] [INFO ] Deduced a trap composed of 12 places in 217 ms of which 1 ms to minimize.
[2024-06-01 14:14:13] [INFO ] Deduced a trap composed of 12 places in 172 ms of which 1 ms to minimize.
[2024-06-01 14:14:13] [INFO ] Deduced a trap composed of 12 places in 120 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/140 variables, 20/69 constraints. Problems are: Problem set: 0 solved, 2235 unsolved
[2024-06-01 14:14:14] [INFO ] Deduced a trap composed of 13 places in 368 ms of which 1 ms to minimize.
[2024-06-01 14:14:15] [INFO ] Deduced a trap composed of 12 places in 305 ms of which 1 ms to minimize.
[2024-06-01 14:14:15] [INFO ] Deduced a trap composed of 13 places in 215 ms of which 1 ms to minimize.
[2024-06-01 14:14:15] [INFO ] Deduced a trap composed of 12 places in 262 ms of which 1 ms to minimize.
[2024-06-01 14:14:15] [INFO ] Deduced a trap composed of 12 places in 209 ms of which 0 ms to minimize.
[2024-06-01 14:14:15] [INFO ] Deduced a trap composed of 13 places in 261 ms of which 1 ms to minimize.
[2024-06-01 14:14:16] [INFO ] Deduced a trap composed of 13 places in 207 ms of which 1 ms to minimize.
[2024-06-01 14:14:16] [INFO ] Deduced a trap composed of 12 places in 162 ms of which 0 ms to minimize.
[2024-06-01 14:14:16] [INFO ] Deduced a trap composed of 12 places in 209 ms of which 1 ms to minimize.
[2024-06-01 14:14:16] [INFO ] Deduced a trap composed of 12 places in 157 ms of which 1 ms to minimize.
[2024-06-01 14:14:16] [INFO ] Deduced a trap composed of 12 places in 211 ms of which 1 ms to minimize.
[2024-06-01 14:14:17] [INFO ] Deduced a trap composed of 12 places in 264 ms of which 1 ms to minimize.
[2024-06-01 14:14:17] [INFO ] Deduced a trap composed of 12 places in 206 ms of which 0 ms to minimize.
[2024-06-01 14:14:17] [INFO ] Deduced a trap composed of 12 places in 154 ms of which 1 ms to minimize.
[2024-06-01 14:14:17] [INFO ] Deduced a trap composed of 12 places in 166 ms of which 1 ms to minimize.
[2024-06-01 14:14:17] [INFO ] Deduced a trap composed of 12 places in 161 ms of which 1 ms to minimize.
[2024-06-01 14:14:18] [INFO ] Deduced a trap composed of 12 places in 123 ms of which 1 ms to minimize.
[2024-06-01 14:14:18] [INFO ] Deduced a trap composed of 12 places in 216 ms of which 0 ms to minimize.
[2024-06-01 14:14:18] [INFO ] Deduced a trap composed of 12 places in 168 ms of which 0 ms to minimize.
[2024-06-01 14:14:18] [INFO ] Deduced a trap composed of 13 places in 263 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/140 variables, 20/89 constraints. Problems are: Problem set: 0 solved, 2235 unsolved
[2024-06-01 14:14:19] [INFO ] Deduced a trap composed of 12 places in 209 ms of which 0 ms to minimize.
[2024-06-01 14:14:19] [INFO ] Deduced a trap composed of 12 places in 209 ms of which 0 ms to minimize.
[2024-06-01 14:14:20] [INFO ] Deduced a trap composed of 12 places in 269 ms of which 1 ms to minimize.
[2024-06-01 14:14:20] [INFO ] Deduced a trap composed of 12 places in 211 ms of which 1 ms to minimize.
[2024-06-01 14:14:20] [INFO ] Deduced a trap composed of 12 places in 174 ms of which 0 ms to minimize.
[2024-06-01 14:14:20] [INFO ] Deduced a trap composed of 12 places in 162 ms of which 1 ms to minimize.
[2024-06-01 14:14:20] [INFO ] Deduced a trap composed of 12 places in 127 ms of which 1 ms to minimize.
[2024-06-01 14:14:20] [INFO ] Deduced a trap composed of 12 places in 158 ms of which 1 ms to minimize.
[2024-06-01 14:14:21] [INFO ] Deduced a trap composed of 12 places in 117 ms of which 1 ms to minimize.
[2024-06-01 14:14:21] [INFO ] Deduced a trap composed of 12 places in 209 ms of which 0 ms to minimize.
[2024-06-01 14:14:21] [INFO ] Deduced a trap composed of 12 places in 167 ms of which 1 ms to minimize.
[2024-06-01 14:14:21] [INFO ] Deduced a trap composed of 12 places in 269 ms of which 1 ms to minimize.
[2024-06-01 14:14:22] [INFO ] Deduced a trap composed of 12 places in 217 ms of which 0 ms to minimize.
[2024-06-01 14:14:22] [INFO ] Deduced a trap composed of 12 places in 162 ms of which 0 ms to minimize.
[2024-06-01 14:14:22] [INFO ] Deduced a trap composed of 12 places in 365 ms of which 1 ms to minimize.
[2024-06-01 14:14:22] [INFO ] Deduced a trap composed of 12 places in 317 ms of which 1 ms to minimize.
[2024-06-01 14:14:23] [INFO ] Deduced a trap composed of 12 places in 265 ms of which 1 ms to minimize.
[2024-06-01 14:14:23] [INFO ] Deduced a trap composed of 12 places in 213 ms of which 1 ms to minimize.
[2024-06-01 14:14:23] [INFO ] Deduced a trap composed of 12 places in 157 ms of which 0 ms to minimize.
[2024-06-01 14:14:23] [INFO ] Deduced a trap composed of 12 places in 112 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/140 variables, 20/109 constraints. Problems are: Problem set: 0 solved, 2235 unsolved
[2024-06-01 14:14:24] [INFO ] Deduced a trap composed of 13 places in 161 ms of which 0 ms to minimize.
[2024-06-01 14:14:24] [INFO ] Deduced a trap composed of 12 places in 111 ms of which 1 ms to minimize.
[2024-06-01 14:14:24] [INFO ] Deduced a trap composed of 12 places in 113 ms of which 1 ms to minimize.
[2024-06-01 14:14:25] [INFO ] Deduced a trap composed of 12 places in 160 ms of which 1 ms to minimize.
[2024-06-01 14:14:25] [INFO ] Deduced a trap composed of 12 places in 115 ms of which 0 ms to minimize.
[2024-06-01 14:14:25] [INFO ] Deduced a trap composed of 12 places in 117 ms of which 0 ms to minimize.
[2024-06-01 14:14:25] [INFO ] Deduced a trap composed of 13 places in 222 ms of which 1 ms to minimize.
[2024-06-01 14:14:25] [INFO ] Deduced a trap composed of 12 places in 161 ms of which 1 ms to minimize.
[2024-06-01 14:14:25] [INFO ] Deduced a trap composed of 12 places in 122 ms of which 0 ms to minimize.
[2024-06-01 14:14:26] [INFO ] Deduced a trap composed of 12 places in 217 ms of which 0 ms to minimize.
[2024-06-01 14:14:26] [INFO ] Deduced a trap composed of 12 places in 159 ms of which 1 ms to minimize.
[2024-06-01 14:14:26] [INFO ] Deduced a trap composed of 12 places in 214 ms of which 1 ms to minimize.
[2024-06-01 14:14:26] [INFO ] Deduced a trap composed of 12 places in 214 ms of which 1 ms to minimize.
[2024-06-01 14:14:27] [INFO ] Deduced a trap composed of 12 places in 212 ms of which 1 ms to minimize.
[2024-06-01 14:14:27] [INFO ] Deduced a trap composed of 12 places in 207 ms of which 0 ms to minimize.
[2024-06-01 14:14:27] [INFO ] Deduced a trap composed of 12 places in 207 ms of which 1 ms to minimize.
[2024-06-01 14:14:27] [INFO ] Deduced a trap composed of 12 places in 154 ms of which 0 ms to minimize.
[2024-06-01 14:14:27] [INFO ] Deduced a trap composed of 15 places in 118 ms of which 1 ms to minimize.
[2024-06-01 14:14:28] [INFO ] Deduced a trap composed of 12 places in 210 ms of which 0 ms to minimize.
[2024-06-01 14:14:28] [INFO ] Deduced a trap composed of 12 places in 167 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 20/129 constraints. Problems are: Problem set: 0 solved, 2235 unsolved
[2024-06-01 14:14:29] [INFO ] Deduced a trap composed of 12 places in 120 ms of which 0 ms to minimize.
[2024-06-01 14:14:29] [INFO ] Deduced a trap composed of 12 places in 154 ms of which 1 ms to minimize.
[2024-06-01 14:14:29] [INFO ] Deduced a trap composed of 15 places in 171 ms of which 1 ms to minimize.
[2024-06-01 14:14:29] [INFO ] Deduced a trap composed of 13 places in 166 ms of which 0 ms to minimize.
[2024-06-01 14:14:29] [INFO ] Deduced a trap composed of 12 places in 115 ms of which 0 ms to minimize.
[2024-06-01 14:14:30] [INFO ] Deduced a trap composed of 12 places in 214 ms of which 1 ms to minimize.
[2024-06-01 14:14:30] [INFO ] Deduced a trap composed of 12 places in 208 ms of which 0 ms to minimize.
[2024-06-01 14:14:30] [INFO ] Deduced a trap composed of 12 places in 159 ms of which 1 ms to minimize.
[2024-06-01 14:14:30] [INFO ] Deduced a trap composed of 12 places in 166 ms of which 0 ms to minimize.
[2024-06-01 14:14:30] [INFO ] Deduced a trap composed of 12 places in 127 ms of which 0 ms to minimize.
[2024-06-01 14:14:30] [INFO ] Deduced a trap composed of 12 places in 160 ms of which 0 ms to minimize.
[2024-06-01 14:14:31] [INFO ] Deduced a trap composed of 12 places in 143 ms of which 1 ms to minimize.
[2024-06-01 14:14:31] [INFO ] Deduced a trap composed of 12 places in 113 ms of which 1 ms to minimize.
SMT process timed out in 89943ms, After SMT, problems are : Problem set: 0 solved, 2235 unsolved
Search for dead transitions found 0 dead transitions in 89998ms
Starting structural reductions in LTL mode, iteration 1 : 140/142 places, 2236/2238 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 91883 ms. Remains : 140/142 places, 2236/2238 transitions.
Support contains 96 out of 140 places after structural reductions.
[2024-06-01 14:14:31] [INFO ] Flatten gal took : 305 ms
[2024-06-01 14:14:32] [INFO ] Flatten gal took : 183 ms
[2024-06-01 14:14:32] [INFO ] Input system was already deterministic with 2236 transitions.
Support contains 91 out of 140 places (down from 96) after GAL structural reductions.
RANDOM walk for 40000 steps (10 resets) in 5906 ms. (6 steps per ms) remains 16/71 properties
BEST_FIRST walk for 4004 steps (0 resets) in 25 ms. (154 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (0 resets) in 22 ms. (174 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (0 resets) in 20 ms. (190 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (0 resets) in 20 ms. (190 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (0 resets) in 18 ms. (210 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (0 resets) in 19 ms. (200 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (0 resets) in 15 ms. (250 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (0 resets) in 19 ms. (200 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (0 resets) in 19 ms. (200 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (0 resets) in 19 ms. (200 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (0 resets) in 27 ms. (143 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (0 resets) in 14 ms. (266 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (0 resets) in 15 ms. (250 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (0 resets) in 16 ms. (235 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (0 resets) in 16 ms. (235 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (0 resets) in 14 ms. (266 steps per ms) remains 16/16 properties
[2024-06-01 14:14:34] [INFO ] Flow matrix only has 2208 transitions (discarded 28 similar events)
[2024-06-01 14:14:34] [INFO ] Invariant cache hit.
[2024-06-01 14:14:34] [INFO ] State equation strengthened by 2095 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 105/126 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 14/140 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/140 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 2207/2347 variables, 140/149 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2347 variables, 2094/2243 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2347 variables, 0/2243 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 1/2348 variables, 1/2244 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2348 variables, 0/2244 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 10 (OVERLAPS) 0/2348 variables, 0/2244 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2348/2348 variables, and 2244 constraints, problems are : Problem set: 0 solved, 16 unsolved in 2188 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 140/140 constraints, ReadFeed: 2095/2095 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
Problem AtomicPropp0 is UNSAT
At refinement iteration 1 (OVERLAPS) 105/126 variables, 8/8 constraints. Problems are: Problem set: 1 solved, 15 unsolved
[2024-06-01 14:14:37] [INFO ] Deduced a trap composed of 12 places in 581 ms of which 1 ms to minimize.
[2024-06-01 14:14:37] [INFO ] Deduced a trap composed of 13 places in 577 ms of which 1 ms to minimize.
[2024-06-01 14:14:38] [INFO ] Deduced a trap composed of 13 places in 566 ms of which 1 ms to minimize.
[2024-06-01 14:14:38] [INFO ] Deduced a trap composed of 12 places in 443 ms of which 1 ms to minimize.
[2024-06-01 14:14:39] [INFO ] Deduced a trap composed of 13 places in 489 ms of which 1 ms to minimize.
[2024-06-01 14:14:39] [INFO ] Deduced a trap composed of 12 places in 422 ms of which 1 ms to minimize.
[2024-06-01 14:14:40] [INFO ] Deduced a trap composed of 12 places in 415 ms of which 1 ms to minimize.
Problem AtomicPropp3 is UNSAT
[2024-06-01 14:14:40] [INFO ] Deduced a trap composed of 13 places in 420 ms of which 1 ms to minimize.
[2024-06-01 14:14:41] [INFO ] Deduced a trap composed of 12 places in 517 ms of which 1 ms to minimize.
[2024-06-01 14:14:41] [INFO ] Deduced a trap composed of 13 places in 502 ms of which 1 ms to minimize.
SMT process timed out in 7439ms, After SMT, problems are : Problem set: 1 solved, 15 unsolved
Fused 15 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 18 out of 140 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 140/140 places, 2236/2236 transitions.
Graph (complete) has 501 edges and 140 vertex of which 134 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.31 ms
Discarding 6 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Drop transitions (Empty/Sink Transition effects.) removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 47 rules applied. Total rules applied 48 place count 134 transition count 2183
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 42 rules applied. Total rules applied 90 place count 117 transition count 2158
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 98 place count 109 transition count 2158
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 15 Pre rules applied. Total rules applied 98 place count 109 transition count 2143
Deduced a syphon composed of 15 places in 2 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 128 place count 94 transition count 2143
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 142 place count 80 transition count 2129
Iterating global reduction 3 with 14 rules applied. Total rules applied 156 place count 80 transition count 2129
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 166 place count 70 transition count 2119
Iterating global reduction 3 with 10 rules applied. Total rules applied 176 place count 70 transition count 2119
Ensure Unique test removed 66 transitions
Reduce isomorphic transitions removed 66 transitions.
Iterating post reduction 3 with 66 rules applied. Total rules applied 242 place count 70 transition count 2053
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 2 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 262 place count 60 transition count 2043
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 272 place count 50 transition count 2033
Iterating global reduction 4 with 10 rules applied. Total rules applied 282 place count 50 transition count 2033
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 286 place count 50 transition count 2029
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 287 place count 50 transition count 2029
Applied a total of 287 rules in 1875 ms. Remains 50 /140 variables (removed 90) and now considering 2029/2236 (removed 207) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1877 ms. Remains : 50/140 places, 2029/2236 transitions.
RANDOM walk for 40000 steps (9 resets) in 7836 ms. (5 steps per ms) remains 2/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 96 ms. (412 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (12 resets) in 98 ms. (404 steps per ms) remains 2/2 properties
// Phase 1: matrix 2029 rows 50 cols
[2024-06-01 14:14:45] [INFO ] Computed 10 invariants in 10 ms
[2024-06-01 14:14:45] [INFO ] State equation strengthened by 2008 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 22/28 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 18/46 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 2024/2070 variables, 46/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2070 variables, 1039/1095 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2070 variables, 0/1095 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 9/2079 variables, 4/1099 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2079 variables, 969/2068 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2079 variables, 0/2068 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/2079 variables, 0/2068 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2079/2079 variables, and 2068 constraints, problems are : Problem set: 0 solved, 2 unsolved in 645 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 50/50 constraints, ReadFeed: 2008/2008 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 22/28 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 14:14:46] [INFO ] Deduced a trap composed of 7 places in 206 ms of which 1 ms to minimize.
[2024-06-01 14:14:46] [INFO ] Deduced a trap composed of 7 places in 150 ms of which 1 ms to minimize.
Problem AtomicPropp27 is UNSAT
[2024-06-01 14:14:47] [INFO ] Deduced a trap composed of 4 places in 120 ms of which 0 ms to minimize.
[2024-06-01 14:14:47] [INFO ] Deduced a trap composed of 4 places in 171 ms of which 0 ms to minimize.
[2024-06-01 14:14:47] [INFO ] Deduced a trap composed of 4 places in 118 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 5/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 18/46 variables, 6/15 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-06-01 14:14:47] [INFO ] Deduced a trap composed of 4 places in 119 ms of which 0 ms to minimize.
[2024-06-01 14:14:47] [INFO ] Deduced a trap composed of 4 places in 117 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/46 variables, 2/17 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/46 variables, 0/17 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2024/2070 variables, 46/63 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2070 variables, 1039/1102 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2070 variables, 0/1102 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 9/2079 variables, 4/1106 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2079 variables, 969/2075 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2079 variables, 1/2076 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-06-01 14:14:48] [INFO ] Deduced a trap composed of 5 places in 204 ms of which 1 ms to minimize.
[2024-06-01 14:14:48] [INFO ] Deduced a trap composed of 4 places in 227 ms of which 1 ms to minimize.
[2024-06-01 14:14:48] [INFO ] Deduced a trap composed of 4 places in 176 ms of which 0 ms to minimize.
Problem AtomicPropp46 is UNSAT
After SMT solving in domain Int declared 2079/2079 variables, and 2079 constraints, problems are : Problem set: 2 solved, 0 unsolved in 2463 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 50/50 constraints, ReadFeed: 2008/2008 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 10/10 constraints]
After SMT, in 3233ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 4 atomic propositions for a total of 16 simplifications.
[2024-06-01 14:14:49] [INFO ] Flatten gal took : 132 ms
[2024-06-01 14:14:49] [INFO ] Flatten gal took : 145 ms
[2024-06-01 14:14:49] [INFO ] Input system was already deterministic with 2236 transitions.
Support contains 84 out of 140 places (down from 85) after GAL structural reductions.
Computed a total of 22 stabilizing places and 21 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 140/140 places, 2236/2236 transitions.
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 20 Pre rules applied. Total rules applied 0 place count 140 transition count 2216
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 0 with 40 rules applied. Total rules applied 40 place count 120 transition count 2216
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 54 place count 106 transition count 2194
Iterating global reduction 0 with 14 rules applied. Total rules applied 68 place count 106 transition count 2194
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 74 place count 100 transition count 2182
Iterating global reduction 0 with 6 rules applied. Total rules applied 80 place count 100 transition count 2182
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 85 place count 95 transition count 2177
Iterating global reduction 0 with 5 rules applied. Total rules applied 90 place count 95 transition count 2177
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 0 with 31 rules applied. Total rules applied 121 place count 95 transition count 2146
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 1 with 16 rules applied. Total rules applied 137 place count 87 transition count 2138
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 145 place count 79 transition count 2130
Iterating global reduction 1 with 8 rules applied. Total rules applied 153 place count 79 transition count 2130
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 1 with 12 rules applied. Total rules applied 165 place count 79 transition count 2118
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 1 with 20 rules applied. Total rules applied 185 place count 69 transition count 2108
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 188 place count 69 transition count 2108
Applied a total of 188 rules in 2246 ms. Remains 69 /140 variables (removed 71) and now considering 2108/2236 (removed 128) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2247 ms. Remains : 69/140 places, 2108/2236 transitions.
[2024-06-01 14:14:52] [INFO ] Flatten gal took : 166 ms
[2024-06-01 14:14:52] [INFO ] Flatten gal took : 158 ms
[2024-06-01 14:14:52] [INFO ] Input system was already deterministic with 2108 transitions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 2236/2236 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 126 transition count 2215
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 126 transition count 2215
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 35 place count 119 transition count 2201
Iterating global reduction 0 with 7 rules applied. Total rules applied 42 place count 119 transition count 2201
Applied a total of 42 rules in 20 ms. Remains 119 /140 variables (removed 21) and now considering 2201/2236 (removed 35) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21 ms. Remains : 119/140 places, 2201/2236 transitions.
[2024-06-01 14:14:52] [INFO ] Flatten gal took : 112 ms
[2024-06-01 14:14:52] [INFO ] Flatten gal took : 122 ms
[2024-06-01 14:14:53] [INFO ] Input system was already deterministic with 2201 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 140/140 places, 2236/2236 transitions.
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 18 Pre rules applied. Total rules applied 0 place count 140 transition count 2218
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 122 transition count 2218
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 47 place count 111 transition count 2200
Iterating global reduction 0 with 11 rules applied. Total rules applied 58 place count 111 transition count 2200
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 64 place count 105 transition count 2188
Iterating global reduction 0 with 6 rules applied. Total rules applied 70 place count 105 transition count 2188
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 74 place count 101 transition count 2184
Iterating global reduction 0 with 4 rules applied. Total rules applied 78 place count 101 transition count 2184
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 93 place count 101 transition count 2169
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 1 with 20 rules applied. Total rules applied 113 place count 91 transition count 2159
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 122 place count 82 transition count 2150
Iterating global reduction 1 with 9 rules applied. Total rules applied 131 place count 82 transition count 2150
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 1 with 11 rules applied. Total rules applied 142 place count 82 transition count 2139
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 1 with 20 rules applied. Total rules applied 162 place count 72 transition count 2129
Partial Post-agglomeration rule applied 5 times.
Drop transitions (Partial Post agglomeration) removed 5 transitions
Iterating global reduction 1 with 5 rules applied. Total rules applied 167 place count 72 transition count 2129
Applied a total of 167 rules in 1985 ms. Remains 72 /140 variables (removed 68) and now considering 2129/2236 (removed 107) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1986 ms. Remains : 72/140 places, 2129/2236 transitions.
[2024-06-01 14:14:55] [INFO ] Flatten gal took : 139 ms
[2024-06-01 14:14:55] [INFO ] Flatten gal took : 149 ms
[2024-06-01 14:14:55] [INFO ] Input system was already deterministic with 2129 transitions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 2236/2236 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 123 transition count 2209
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 123 transition count 2209
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 43 place count 114 transition count 2191
Iterating global reduction 0 with 9 rules applied. Total rules applied 52 place count 114 transition count 2191
Applied a total of 52 rules in 19 ms. Remains 114 /140 variables (removed 26) and now considering 2191/2236 (removed 45) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20 ms. Remains : 114/140 places, 2191/2236 transitions.
[2024-06-01 14:14:55] [INFO ] Flatten gal took : 111 ms
[2024-06-01 14:14:55] [INFO ] Flatten gal took : 122 ms
[2024-06-01 14:14:56] [INFO ] Input system was already deterministic with 2191 transitions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 2236/2236 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 123 transition count 2209
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 123 transition count 2209
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 43 place count 114 transition count 2191
Iterating global reduction 0 with 9 rules applied. Total rules applied 52 place count 114 transition count 2191
Applied a total of 52 rules in 20 ms. Remains 114 /140 variables (removed 26) and now considering 2191/2236 (removed 45) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20 ms. Remains : 114/140 places, 2191/2236 transitions.
[2024-06-01 14:14:56] [INFO ] Flatten gal took : 113 ms
[2024-06-01 14:14:56] [INFO ] Flatten gal took : 156 ms
[2024-06-01 14:14:56] [INFO ] Input system was already deterministic with 2191 transitions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 2236/2236 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 126 transition count 2215
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 126 transition count 2215
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 33 place count 121 transition count 2205
Iterating global reduction 0 with 5 rules applied. Total rules applied 38 place count 121 transition count 2205
Applied a total of 38 rules in 18 ms. Remains 121 /140 variables (removed 19) and now considering 2205/2236 (removed 31) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19 ms. Remains : 121/140 places, 2205/2236 transitions.
[2024-06-01 14:14:56] [INFO ] Flatten gal took : 113 ms
[2024-06-01 14:14:56] [INFO ] Flatten gal took : 122 ms
[2024-06-01 14:14:57] [INFO ] Input system was already deterministic with 2205 transitions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 2236/2236 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 124 transition count 2211
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 124 transition count 2211
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 40 place count 116 transition count 2195
Iterating global reduction 0 with 8 rules applied. Total rules applied 48 place count 116 transition count 2195
Applied a total of 48 rules in 19 ms. Remains 116 /140 variables (removed 24) and now considering 2195/2236 (removed 41) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19 ms. Remains : 116/140 places, 2195/2236 transitions.
[2024-06-01 14:14:57] [INFO ] Flatten gal took : 113 ms
[2024-06-01 14:14:57] [INFO ] Flatten gal took : 124 ms
[2024-06-01 14:14:57] [INFO ] Input system was already deterministic with 2195 transitions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 2236/2236 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 126 transition count 2214
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 126 transition count 2214
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 35 place count 119 transition count 2200
Iterating global reduction 0 with 7 rules applied. Total rules applied 42 place count 119 transition count 2200
Applied a total of 42 rules in 17 ms. Remains 119 /140 variables (removed 21) and now considering 2200/2236 (removed 36) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17 ms. Remains : 119/140 places, 2200/2236 transitions.
[2024-06-01 14:14:57] [INFO ] Flatten gal took : 112 ms
[2024-06-01 14:14:58] [INFO ] Flatten gal took : 121 ms
[2024-06-01 14:14:58] [INFO ] Input system was already deterministic with 2200 transitions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 2236/2236 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 124 transition count 2211
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 124 transition count 2211
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 40 place count 116 transition count 2195
Iterating global reduction 0 with 8 rules applied. Total rules applied 48 place count 116 transition count 2195
Applied a total of 48 rules in 17 ms. Remains 116 /140 variables (removed 24) and now considering 2195/2236 (removed 41) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17 ms. Remains : 116/140 places, 2195/2236 transitions.
[2024-06-01 14:14:58] [INFO ] Flatten gal took : 115 ms
[2024-06-01 14:14:58] [INFO ] Flatten gal took : 124 ms
[2024-06-01 14:14:58] [INFO ] Input system was already deterministic with 2195 transitions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 2236/2236 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 124 transition count 2211
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 124 transition count 2211
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 41 place count 115 transition count 2193
Iterating global reduction 0 with 9 rules applied. Total rules applied 50 place count 115 transition count 2193
Applied a total of 50 rules in 19 ms. Remains 115 /140 variables (removed 25) and now considering 2193/2236 (removed 43) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20 ms. Remains : 115/140 places, 2193/2236 transitions.
[2024-06-01 14:14:59] [INFO ] Flatten gal took : 119 ms
[2024-06-01 14:14:59] [INFO ] Flatten gal took : 131 ms
[2024-06-01 14:14:59] [INFO ] Input system was already deterministic with 2193 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 140/140 places, 2236/2236 transitions.
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 18 Pre rules applied. Total rules applied 0 place count 140 transition count 2218
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 122 transition count 2218
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 49 place count 109 transition count 2197
Iterating global reduction 0 with 13 rules applied. Total rules applied 62 place count 109 transition count 2197
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 69 place count 102 transition count 2183
Iterating global reduction 0 with 7 rules applied. Total rules applied 76 place count 102 transition count 2183
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 82 place count 96 transition count 2177
Iterating global reduction 0 with 6 rules applied. Total rules applied 88 place count 96 transition count 2177
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 0 with 63 rules applied. Total rules applied 151 place count 96 transition count 2114
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 1 with 16 rules applied. Total rules applied 167 place count 88 transition count 2106
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 175 place count 80 transition count 2098
Iterating global reduction 1 with 8 rules applied. Total rules applied 183 place count 80 transition count 2098
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 1 with 11 rules applied. Total rules applied 194 place count 80 transition count 2087
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 1 with 20 rules applied. Total rules applied 214 place count 70 transition count 2077
Partial Post-agglomeration rule applied 6 times.
Drop transitions (Partial Post agglomeration) removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 220 place count 70 transition count 2077
Applied a total of 220 rules in 1809 ms. Remains 70 /140 variables (removed 70) and now considering 2077/2236 (removed 159) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1809 ms. Remains : 70/140 places, 2077/2236 transitions.
[2024-06-01 14:15:01] [INFO ] Flatten gal took : 140 ms
[2024-06-01 14:15:01] [INFO ] Flatten gal took : 149 ms
[2024-06-01 14:15:01] [INFO ] Input system was already deterministic with 2077 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 140/140 places, 2236/2236 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 0 with 39 rules applied. Total rules applied 39 place count 138 transition count 2197
Reduce places removed 38 places and 0 transitions.
Iterating post reduction 1 with 38 rules applied. Total rules applied 77 place count 100 transition count 2197
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 77 place count 100 transition count 2177
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 117 place count 80 transition count 2177
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 135 place count 62 transition count 2149
Iterating global reduction 2 with 18 rules applied. Total rules applied 153 place count 62 transition count 2149
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 162 place count 53 transition count 2131
Iterating global reduction 2 with 9 rules applied. Total rules applied 171 place count 53 transition count 2131
Ensure Unique test removed 511 transitions
Reduce isomorphic transitions removed 511 transitions.
Iterating post reduction 2 with 511 rules applied. Total rules applied 682 place count 53 transition count 1620
Drop transitions (Redundant composition of simpler transitions.) removed 1451 transitions
Redundant transition composition rules discarded 1451 transitions
Iterating global reduction 3 with 1451 rules applied. Total rules applied 2133 place count 53 transition count 169
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 2153 place count 43 transition count 159
Reduce places removed 9 places and 9 transitions.
Iterating global reduction 3 with 9 rules applied. Total rules applied 2162 place count 34 transition count 150
Applied a total of 2162 rules in 251 ms. Remains 34 /140 variables (removed 106) and now considering 150/2236 (removed 2086) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 251 ms. Remains : 34/140 places, 150/2236 transitions.
[2024-06-01 14:15:02] [INFO ] Flatten gal took : 7 ms
[2024-06-01 14:15:02] [INFO ] Flatten gal took : 7 ms
[2024-06-01 14:15:02] [INFO ] Input system was already deterministic with 150 transitions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 2236/2236 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 126 transition count 2213
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 126 transition count 2213
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 37 place count 117 transition count 2195
Iterating global reduction 0 with 9 rules applied. Total rules applied 46 place count 117 transition count 2195
Applied a total of 46 rules in 17 ms. Remains 117 /140 variables (removed 23) and now considering 2195/2236 (removed 41) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17 ms. Remains : 117/140 places, 2195/2236 transitions.
[2024-06-01 14:15:02] [INFO ] Flatten gal took : 109 ms
[2024-06-01 14:15:02] [INFO ] Flatten gal took : 119 ms
[2024-06-01 14:15:02] [INFO ] Input system was already deterministic with 2195 transitions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 2236/2236 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 124 transition count 2211
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 124 transition count 2211
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 41 place count 115 transition count 2193
Iterating global reduction 0 with 9 rules applied. Total rules applied 50 place count 115 transition count 2193
Applied a total of 50 rules in 18 ms. Remains 115 /140 variables (removed 25) and now considering 2193/2236 (removed 43) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18 ms. Remains : 115/140 places, 2193/2236 transitions.
[2024-06-01 14:15:02] [INFO ] Flatten gal took : 111 ms
[2024-06-01 14:15:02] [INFO ] Flatten gal took : 121 ms
[2024-06-01 14:15:03] [INFO ] Input system was already deterministic with 2193 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 140/140 places, 2236/2236 transitions.
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 17 Pre rules applied. Total rules applied 0 place count 140 transition count 2219
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 0 with 34 rules applied. Total rules applied 34 place count 123 transition count 2219
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 48 place count 109 transition count 2198
Iterating global reduction 0 with 14 rules applied. Total rules applied 62 place count 109 transition count 2198
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 68 place count 103 transition count 2186
Iterating global reduction 0 with 6 rules applied. Total rules applied 74 place count 103 transition count 2186
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 79 place count 98 transition count 2181
Iterating global reduction 0 with 5 rules applied. Total rules applied 84 place count 98 transition count 2181
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 0 with 31 rules applied. Total rules applied 115 place count 98 transition count 2150
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 1 with 18 rules applied. Total rules applied 133 place count 89 transition count 2141
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 142 place count 80 transition count 2132
Iterating global reduction 1 with 9 rules applied. Total rules applied 151 place count 80 transition count 2132
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 1 with 11 rules applied. Total rules applied 162 place count 80 transition count 2121
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 1 with 20 rules applied. Total rules applied 182 place count 70 transition count 2111
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 185 place count 70 transition count 2111
Applied a total of 185 rules in 1838 ms. Remains 70 /140 variables (removed 70) and now considering 2111/2236 (removed 125) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1838 ms. Remains : 70/140 places, 2111/2236 transitions.
[2024-06-01 14:15:05] [INFO ] Flatten gal took : 136 ms
[2024-06-01 14:15:05] [INFO ] Flatten gal took : 146 ms
[2024-06-01 14:15:05] [INFO ] Input system was already deterministic with 2111 transitions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 2236/2236 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 123 transition count 2209
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 123 transition count 2209
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 43 place count 114 transition count 2191
Iterating global reduction 0 with 9 rules applied. Total rules applied 52 place count 114 transition count 2191
Applied a total of 52 rules in 20 ms. Remains 114 /140 variables (removed 26) and now considering 2191/2236 (removed 45) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20 ms. Remains : 114/140 places, 2191/2236 transitions.
[2024-06-01 14:15:05] [INFO ] Flatten gal took : 119 ms
[2024-06-01 14:15:05] [INFO ] Flatten gal took : 130 ms
[2024-06-01 14:15:06] [INFO ] Input system was already deterministic with 2191 transitions.
[2024-06-01 14:15:06] [INFO ] Flatten gal took : 119 ms
[2024-06-01 14:15:06] [INFO ] Flatten gal took : 121 ms
[2024-06-01 14:15:06] [INFO ] Export to MCC of 16 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 4 ms.
[2024-06-01 14:15:06] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 140 places, 2236 transitions and 41588 arcs took 30 ms.
Total runtime 130028 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-10a-CTLCardinality-2024-00
Could not compute solution for formula : StigmergyElection-PT-10a-CTLCardinality-2024-01
Could not compute solution for formula : StigmergyElection-PT-10a-CTLCardinality-2024-02
Could not compute solution for formula : StigmergyElection-PT-10a-CTLCardinality-2024-03
Could not compute solution for formula : StigmergyElection-PT-10a-CTLCardinality-2024-04
Could not compute solution for formula : StigmergyElection-PT-10a-CTLCardinality-2024-05
Could not compute solution for formula : StigmergyElection-PT-10a-CTLCardinality-2024-06
Could not compute solution for formula : StigmergyElection-PT-10a-CTLCardinality-2024-07
Could not compute solution for formula : StigmergyElection-PT-10a-CTLCardinality-2024-08
Could not compute solution for formula : StigmergyElection-PT-10a-CTLCardinality-2024-09
Could not compute solution for formula : StigmergyElection-PT-10a-CTLCardinality-2024-10
Could not compute solution for formula : StigmergyElection-PT-10a-CTLCardinality-2024-11
Could not compute solution for formula : StigmergyElection-PT-10a-CTLCardinality-2023-12
Could not compute solution for formula : StigmergyElection-PT-10a-CTLCardinality-2023-13
Could not compute solution for formula : StigmergyElection-PT-10a-CTLCardinality-2023-14
Could not compute solution for formula : StigmergyElection-PT-10a-CTLCardinality-2023-15

BK_STOP 1717251307094

--------------------
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-10a-CTLCardinality-2024-00
ctl formula formula --ctl=/tmp/1004/ctl_0_
ctl formula name StigmergyElection-PT-10a-CTLCardinality-2024-01
ctl formula formula --ctl=/tmp/1004/ctl_1_
ctl formula name StigmergyElection-PT-10a-CTLCardinality-2024-02
ctl formula formula --ctl=/tmp/1004/ctl_2_
ctl formula name StigmergyElection-PT-10a-CTLCardinality-2024-03
ctl formula formula --ctl=/tmp/1004/ctl_3_
ctl formula name StigmergyElection-PT-10a-CTLCardinality-2024-04
ctl formula formula --ctl=/tmp/1004/ctl_4_
ctl formula name StigmergyElection-PT-10a-CTLCardinality-2024-05
ctl formula formula --ctl=/tmp/1004/ctl_5_
ctl formula name StigmergyElection-PT-10a-CTLCardinality-2024-06
ctl formula formula --ctl=/tmp/1004/ctl_6_
ctl formula name StigmergyElection-PT-10a-CTLCardinality-2024-07
ctl formula formula --ctl=/tmp/1004/ctl_7_
ctl formula name StigmergyElection-PT-10a-CTLCardinality-2024-08
ctl formula formula --ctl=/tmp/1004/ctl_8_
ctl formula name StigmergyElection-PT-10a-CTLCardinality-2024-09
ctl formula formula --ctl=/tmp/1004/ctl_9_
ctl formula name StigmergyElection-PT-10a-CTLCardinality-2024-10
ctl formula formula --ctl=/tmp/1004/ctl_10_
ctl formula name StigmergyElection-PT-10a-CTLCardinality-2024-11
ctl formula formula --ctl=/tmp/1004/ctl_11_
ctl formula name StigmergyElection-PT-10a-CTLCardinality-2023-12
ctl formula formula --ctl=/tmp/1004/ctl_12_
ctl formula name StigmergyElection-PT-10a-CTLCardinality-2023-13
ctl formula formula --ctl=/tmp/1004/ctl_13_
ctl formula name StigmergyElection-PT-10a-CTLCardinality-2023-14
ctl formula formula --ctl=/tmp/1004/ctl_14_
ctl formula name StigmergyElection-PT-10a-CTLCardinality-2023-15
ctl formula formula --ctl=/tmp/1004/ctl_15_
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-10a"
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-10a, 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-171690532200377"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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