About the Execution of LTSMin+red for TokenRing-PT-010
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 7872.871 | 130185.00 | 239264.00 | 609.90 | ?????????F?FF??? | normal |
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.r540-smll-171690573700162.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 TokenRing-PT-010, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r540-smll-171690573700162
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 15M
-rw-r--r-- 1 mcc users 125K Apr 11 19:17 CTLCardinality.txt
-rw-r--r-- 1 mcc users 687K Apr 11 19:17 CTLCardinality.xml
-rw-r--r-- 1 mcc users 900K Apr 11 19:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 3.4M Apr 11 19:05 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 57K Apr 23 08:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 218K Apr 23 08:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 436K Apr 23 08:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 1.3M Apr 23 08:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 212K Apr 11 19:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 1.2M Apr 11 19:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 1.3M Apr 11 19:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 4.6M Apr 11 19:23 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 23 08:02 UpperBounds.txt
-rw-r--r-- 1 mcc users 35K Apr 23 08:02 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 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 519K 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 TokenRing-PT-010-CTLFireability-2024-00
FORMULA_NAME TokenRing-PT-010-CTLFireability-2024-01
FORMULA_NAME TokenRing-PT-010-CTLFireability-2024-02
FORMULA_NAME TokenRing-PT-010-CTLFireability-2024-03
FORMULA_NAME TokenRing-PT-010-CTLFireability-2024-04
FORMULA_NAME TokenRing-PT-010-CTLFireability-2024-05
FORMULA_NAME TokenRing-PT-010-CTLFireability-2024-06
FORMULA_NAME TokenRing-PT-010-CTLFireability-2024-07
FORMULA_NAME TokenRing-PT-010-CTLFireability-2024-08
FORMULA_NAME TokenRing-PT-010-CTLFireability-2024-09
FORMULA_NAME TokenRing-PT-010-CTLFireability-2024-10
FORMULA_NAME TokenRing-PT-010-CTLFireability-2024-11
FORMULA_NAME TokenRing-PT-010-CTLFireability-2024-12
FORMULA_NAME TokenRing-PT-010-CTLFireability-2024-13
FORMULA_NAME TokenRing-PT-010-CTLFireability-2024-14
FORMULA_NAME TokenRing-PT-010-CTLFireability-2024-15
=== Now, execution of the tool begins
BK_START 1717246563894
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=TokenRing-PT-010
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 12:56:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 12:56:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 12:56:07] [INFO ] Load time of PNML (sax parser for PT used): 307 ms
[2024-06-01 12:56:07] [INFO ] Transformed 121 places.
[2024-06-01 12:56:07] [INFO ] Transformed 1111 transitions.
[2024-06-01 12:56:07] [INFO ] Found NUPN structural information;
[2024-06-01 12:56:07] [INFO ] Parsed PT model containing 121 places and 1111 transitions and 4444 arcs in 859 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 236 ms.
Support contains 121 out of 121 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 121/121 places, 1111/1111 transitions.
Applied a total of 0 rules in 43 ms. Remains 121 /121 variables (removed 0) and now considering 1111/1111 (removed 0) transitions.
// Phase 1: matrix 1111 rows 121 cols
[2024-06-01 12:56:10] [INFO ] Computed 11 invariants in 30 ms
[2024-06-01 12:56:10] [INFO ] Implicit Places using invariants in 368 ms returned []
[2024-06-01 12:56:10] [INFO ] Invariant cache hit.
[2024-06-01 12:56:11] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2024-06-01 12:56:11] [INFO ] Implicit Places using invariants and state equation in 954 ms returned []
Implicit Place search using SMT with State Equation took 1393 ms to find 0 implicit places.
Running 1101 sub problems to find dead transitions.
[2024-06-01 12:56:11] [INFO ] Invariant cache hit.
[2024-06-01 12:56:11] [INFO ] State equation strengthened by 1010 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 11/132 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-06-01 12:56:21] [INFO ] Deduced a trap composed of 66 places in 362 ms of which 36 ms to minimize.
[2024-06-01 12:56:21] [INFO ] Deduced a trap composed of 67 places in 290 ms of which 3 ms to minimize.
[2024-06-01 12:56:21] [INFO ] Deduced a trap composed of 66 places in 308 ms of which 4 ms to minimize.
[2024-06-01 12:56:21] [INFO ] Deduced a trap composed of 65 places in 236 ms of which 3 ms to minimize.
[2024-06-01 12:56:22] [INFO ] Deduced a trap composed of 66 places in 249 ms of which 2 ms to minimize.
[2024-06-01 12:56:22] [INFO ] Deduced a trap composed of 65 places in 219 ms of which 3 ms to minimize.
[2024-06-01 12:56:22] [INFO ] Deduced a trap composed of 66 places in 224 ms of which 3 ms to minimize.
[2024-06-01 12:56:23] [INFO ] Deduced a trap composed of 65 places in 281 ms of which 4 ms to minimize.
[2024-06-01 12:56:23] [INFO ] Deduced a trap composed of 65 places in 277 ms of which 3 ms to minimize.
[2024-06-01 12:56:23] [INFO ] Deduced a trap composed of 67 places in 270 ms of which 3 ms to minimize.
[2024-06-01 12:56:23] [INFO ] Deduced a trap composed of 65 places in 273 ms of which 3 ms to minimize.
[2024-06-01 12:56:24] [INFO ] Deduced a trap composed of 64 places in 268 ms of which 3 ms to minimize.
[2024-06-01 12:56:24] [INFO ] Deduced a trap composed of 65 places in 268 ms of which 3 ms to minimize.
[2024-06-01 12:56:24] [INFO ] Deduced a trap composed of 66 places in 269 ms of which 3 ms to minimize.
[2024-06-01 12:56:24] [INFO ] Deduced a trap composed of 64 places in 197 ms of which 3 ms to minimize.
[2024-06-01 12:56:25] [INFO ] Deduced a trap composed of 62 places in 273 ms of which 3 ms to minimize.
[2024-06-01 12:56:25] [INFO ] Deduced a trap composed of 65 places in 210 ms of which 3 ms to minimize.
[2024-06-01 12:56:25] [INFO ] Deduced a trap composed of 63 places in 174 ms of which 1 ms to minimize.
[2024-06-01 12:56:25] [INFO ] Deduced a trap composed of 64 places in 198 ms of which 3 ms to minimize.
[2024-06-01 12:56:26] [INFO ] Deduced a trap composed of 66 places in 271 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-06-01 12:56:27] [INFO ] Deduced a trap composed of 64 places in 134 ms of which 2 ms to minimize.
[2024-06-01 12:56:27] [INFO ] Deduced a trap composed of 65 places in 233 ms of which 3 ms to minimize.
[2024-06-01 12:56:27] [INFO ] Deduced a trap composed of 65 places in 239 ms of which 3 ms to minimize.
[2024-06-01 12:56:27] [INFO ] Deduced a trap composed of 65 places in 245 ms of which 2 ms to minimize.
[2024-06-01 12:56:28] [INFO ] Deduced a trap composed of 64 places in 266 ms of which 2 ms to minimize.
[2024-06-01 12:56:28] [INFO ] Deduced a trap composed of 66 places in 254 ms of which 2 ms to minimize.
[2024-06-01 12:56:28] [INFO ] Deduced a trap composed of 64 places in 167 ms of which 2 ms to minimize.
[2024-06-01 12:56:28] [INFO ] Deduced a trap composed of 64 places in 184 ms of which 2 ms to minimize.
[2024-06-01 12:56:28] [INFO ] Deduced a trap composed of 64 places in 132 ms of which 2 ms to minimize.
[2024-06-01 12:56:29] [INFO ] Deduced a trap composed of 65 places in 129 ms of which 2 ms to minimize.
[2024-06-01 12:56:29] [INFO ] Deduced a trap composed of 65 places in 192 ms of which 2 ms to minimize.
[2024-06-01 12:56:29] [INFO ] Deduced a trap composed of 68 places in 246 ms of which 3 ms to minimize.
[2024-06-01 12:56:29] [INFO ] Deduced a trap composed of 64 places in 233 ms of which 2 ms to minimize.
[2024-06-01 12:56:29] [INFO ] Deduced a trap composed of 65 places in 133 ms of which 3 ms to minimize.
[2024-06-01 12:56:30] [INFO ] Deduced a trap composed of 65 places in 135 ms of which 5 ms to minimize.
[2024-06-01 12:56:30] [INFO ] Deduced a trap composed of 64 places in 216 ms of which 3 ms to minimize.
[2024-06-01 12:56:30] [INFO ] Deduced a trap composed of 65 places in 163 ms of which 2 ms to minimize.
[2024-06-01 12:56:30] [INFO ] Deduced a trap composed of 65 places in 197 ms of which 3 ms to minimize.
[2024-06-01 12:56:30] [INFO ] Deduced a trap composed of 65 places in 138 ms of which 3 ms to minimize.
[2024-06-01 12:56:31] [INFO ] Deduced a trap composed of 65 places in 135 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 20/172 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-06-01 12:56:37] [INFO ] Deduced a trap composed of 65 places in 163 ms of which 2 ms to minimize.
[2024-06-01 12:56:37] [INFO ] Deduced a trap composed of 67 places in 257 ms of which 2 ms to minimize.
[2024-06-01 12:56:38] [INFO ] Deduced a trap composed of 68 places in 251 ms of which 3 ms to minimize.
[2024-06-01 12:56:38] [INFO ] Deduced a trap composed of 66 places in 234 ms of which 3 ms to minimize.
[2024-06-01 12:56:38] [INFO ] Deduced a trap composed of 64 places in 248 ms of which 3 ms to minimize.
[2024-06-01 12:56:39] [INFO ] Deduced a trap composed of 64 places in 260 ms of which 2 ms to minimize.
[2024-06-01 12:56:39] [INFO ] Deduced a trap composed of 67 places in 205 ms of which 2 ms to minimize.
[2024-06-01 12:56:39] [INFO ] Deduced a trap composed of 67 places in 252 ms of which 2 ms to minimize.
[2024-06-01 12:56:39] [INFO ] Deduced a trap composed of 67 places in 236 ms of which 3 ms to minimize.
[2024-06-01 12:56:39] [INFO ] Deduced a trap composed of 67 places in 145 ms of which 2 ms to minimize.
[2024-06-01 12:56:40] [INFO ] Deduced a trap composed of 68 places in 198 ms of which 2 ms to minimize.
[2024-06-01 12:56:40] [INFO ] Deduced a trap composed of 67 places in 199 ms of which 2 ms to minimize.
[2024-06-01 12:56:40] [INFO ] Deduced a trap composed of 64 places in 198 ms of which 2 ms to minimize.
[2024-06-01 12:56:40] [INFO ] Deduced a trap composed of 64 places in 184 ms of which 2 ms to minimize.
[2024-06-01 12:56:41] [INFO ] Deduced a trap composed of 67 places in 202 ms of which 3 ms to minimize.
[2024-06-01 12:56:41] [INFO ] Deduced a trap composed of 65 places in 207 ms of which 3 ms to minimize.
[2024-06-01 12:56:41] [INFO ] Deduced a trap composed of 65 places in 249 ms of which 3 ms to minimize.
[2024-06-01 12:56:41] [INFO ] Deduced a trap composed of 65 places in 242 ms of which 2 ms to minimize.
[2024-06-01 12:56:42] [INFO ] Deduced a trap composed of 65 places in 245 ms of which 2 ms to minimize.
[2024-06-01 12:56:42] [INFO ] Deduced a trap composed of 66 places in 230 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 20/192 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 121/1232 variables, and 192 constraints, problems are : Problem set: 0 solved, 1101 unsolved in 30091 ms.
Refiners :[Domain max(s): 121/121 constraints, Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 0/121 constraints, ReadFeed: 0/1010 constraints, PredecessorRefiner: 1101/1101 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1101 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 11/132 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 60/192 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-06-01 12:56:47] [INFO ] Deduced a trap composed of 66 places in 199 ms of which 2 ms to minimize.
[2024-06-01 12:56:47] [INFO ] Deduced a trap composed of 63 places in 205 ms of which 3 ms to minimize.
[2024-06-01 12:56:48] [INFO ] Deduced a trap composed of 67 places in 228 ms of which 3 ms to minimize.
[2024-06-01 12:56:48] [INFO ] Deduced a trap composed of 67 places in 374 ms of which 4 ms to minimize.
[2024-06-01 12:56:48] [INFO ] Deduced a trap composed of 63 places in 187 ms of which 2 ms to minimize.
[2024-06-01 12:56:49] [INFO ] Deduced a trap composed of 67 places in 264 ms of which 3 ms to minimize.
[2024-06-01 12:56:49] [INFO ] Deduced a trap composed of 64 places in 255 ms of which 2 ms to minimize.
[2024-06-01 12:56:49] [INFO ] Deduced a trap composed of 65 places in 251 ms of which 3 ms to minimize.
[2024-06-01 12:56:49] [INFO ] Deduced a trap composed of 66 places in 238 ms of which 2 ms to minimize.
[2024-06-01 12:56:50] [INFO ] Deduced a trap composed of 63 places in 252 ms of which 2 ms to minimize.
[2024-06-01 12:56:50] [INFO ] Deduced a trap composed of 67 places in 268 ms of which 2 ms to minimize.
[2024-06-01 12:56:50] [INFO ] Deduced a trap composed of 68 places in 271 ms of which 3 ms to minimize.
[2024-06-01 12:56:50] [INFO ] Deduced a trap composed of 64 places in 256 ms of which 2 ms to minimize.
[2024-06-01 12:56:51] [INFO ] Deduced a trap composed of 62 places in 279 ms of which 2 ms to minimize.
[2024-06-01 12:56:51] [INFO ] Deduced a trap composed of 66 places in 246 ms of which 2 ms to minimize.
[2024-06-01 12:56:51] [INFO ] Deduced a trap composed of 65 places in 236 ms of which 2 ms to minimize.
[2024-06-01 12:56:52] [INFO ] Deduced a trap composed of 66 places in 256 ms of which 2 ms to minimize.
[2024-06-01 12:56:52] [INFO ] Deduced a trap composed of 66 places in 279 ms of which 2 ms to minimize.
[2024-06-01 12:56:52] [INFO ] Deduced a trap composed of 64 places in 253 ms of which 3 ms to minimize.
[2024-06-01 12:56:52] [INFO ] Deduced a trap composed of 65 places in 236 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 20/212 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-06-01 12:56:54] [INFO ] Deduced a trap composed of 63 places in 127 ms of which 2 ms to minimize.
[2024-06-01 12:56:54] [INFO ] Deduced a trap composed of 64 places in 249 ms of which 3 ms to minimize.
[2024-06-01 12:56:55] [INFO ] Deduced a trap composed of 66 places in 244 ms of which 3 ms to minimize.
[2024-06-01 12:56:55] [INFO ] Deduced a trap composed of 67 places in 254 ms of which 2 ms to minimize.
[2024-06-01 12:56:55] [INFO ] Deduced a trap composed of 65 places in 251 ms of which 3 ms to minimize.
[2024-06-01 12:56:55] [INFO ] Deduced a trap composed of 66 places in 205 ms of which 2 ms to minimize.
[2024-06-01 12:56:56] [INFO ] Deduced a trap composed of 64 places in 258 ms of which 2 ms to minimize.
[2024-06-01 12:56:56] [INFO ] Deduced a trap composed of 65 places in 268 ms of which 2 ms to minimize.
[2024-06-01 12:56:56] [INFO ] Deduced a trap composed of 63 places in 257 ms of which 6 ms to minimize.
[2024-06-01 12:56:57] [INFO ] Deduced a trap composed of 65 places in 252 ms of which 3 ms to minimize.
[2024-06-01 12:56:57] [INFO ] Deduced a trap composed of 64 places in 233 ms of which 2 ms to minimize.
[2024-06-01 12:56:57] [INFO ] Deduced a trap composed of 64 places in 234 ms of which 2 ms to minimize.
[2024-06-01 12:56:57] [INFO ] Deduced a trap composed of 63 places in 249 ms of which 2 ms to minimize.
[2024-06-01 12:56:58] [INFO ] Deduced a trap composed of 65 places in 243 ms of which 3 ms to minimize.
[2024-06-01 12:56:58] [INFO ] Deduced a trap composed of 65 places in 240 ms of which 3 ms to minimize.
[2024-06-01 12:56:58] [INFO ] Deduced a trap composed of 65 places in 259 ms of which 3 ms to minimize.
[2024-06-01 12:56:58] [INFO ] Deduced a trap composed of 65 places in 240 ms of which 2 ms to minimize.
[2024-06-01 12:56:59] [INFO ] Deduced a trap composed of 64 places in 264 ms of which 2 ms to minimize.
[2024-06-01 12:56:59] [INFO ] Deduced a trap composed of 66 places in 234 ms of which 3 ms to minimize.
[2024-06-01 12:56:59] [INFO ] Deduced a trap composed of 62 places in 251 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 20/232 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-06-01 12:57:01] [INFO ] Deduced a trap composed of 66 places in 186 ms of which 3 ms to minimize.
[2024-06-01 12:57:01] [INFO ] Deduced a trap composed of 65 places in 231 ms of which 4 ms to minimize.
[2024-06-01 12:57:02] [INFO ] Deduced a trap composed of 65 places in 239 ms of which 2 ms to minimize.
[2024-06-01 12:57:02] [INFO ] Deduced a trap composed of 65 places in 251 ms of which 2 ms to minimize.
[2024-06-01 12:57:02] [INFO ] Deduced a trap composed of 64 places in 200 ms of which 2 ms to minimize.
[2024-06-01 12:57:02] [INFO ] Deduced a trap composed of 65 places in 203 ms of which 2 ms to minimize.
[2024-06-01 12:57:03] [INFO ] Deduced a trap composed of 66 places in 254 ms of which 2 ms to minimize.
[2024-06-01 12:57:03] [INFO ] Deduced a trap composed of 67 places in 228 ms of which 2 ms to minimize.
[2024-06-01 12:57:03] [INFO ] Deduced a trap composed of 68 places in 245 ms of which 3 ms to minimize.
[2024-06-01 12:57:03] [INFO ] Deduced a trap composed of 69 places in 244 ms of which 3 ms to minimize.
[2024-06-01 12:57:04] [INFO ] Deduced a trap composed of 69 places in 250 ms of which 3 ms to minimize.
[2024-06-01 12:57:04] [INFO ] Deduced a trap composed of 68 places in 236 ms of which 2 ms to minimize.
[2024-06-01 12:57:04] [INFO ] Deduced a trap composed of 66 places in 238 ms of which 2 ms to minimize.
[2024-06-01 12:57:04] [INFO ] Deduced a trap composed of 66 places in 241 ms of which 3 ms to minimize.
[2024-06-01 12:57:05] [INFO ] Deduced a trap composed of 66 places in 207 ms of which 2 ms to minimize.
[2024-06-01 12:57:05] [INFO ] Deduced a trap composed of 68 places in 244 ms of which 2 ms to minimize.
[2024-06-01 12:57:05] [INFO ] Deduced a trap composed of 66 places in 250 ms of which 3 ms to minimize.
[2024-06-01 12:57:06] [INFO ] Deduced a trap composed of 68 places in 236 ms of which 2 ms to minimize.
[2024-06-01 12:57:06] [INFO ] Deduced a trap composed of 64 places in 247 ms of which 3 ms to minimize.
[2024-06-01 12:57:06] [INFO ] Deduced a trap composed of 66 places in 237 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/121 variables, 20/252 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-06-01 12:57:08] [INFO ] Deduced a trap composed of 65 places in 200 ms of which 3 ms to minimize.
[2024-06-01 12:57:09] [INFO ] Deduced a trap composed of 65 places in 230 ms of which 3 ms to minimize.
[2024-06-01 12:57:09] [INFO ] Deduced a trap composed of 66 places in 177 ms of which 3 ms to minimize.
[2024-06-01 12:57:09] [INFO ] Deduced a trap composed of 65 places in 247 ms of which 2 ms to minimize.
[2024-06-01 12:57:09] [INFO ] Deduced a trap composed of 68 places in 232 ms of which 2 ms to minimize.
[2024-06-01 12:57:10] [INFO ] Deduced a trap composed of 65 places in 199 ms of which 3 ms to minimize.
[2024-06-01 12:57:10] [INFO ] Deduced a trap composed of 66 places in 147 ms of which 1 ms to minimize.
[2024-06-01 12:57:10] [INFO ] Deduced a trap composed of 64 places in 129 ms of which 1 ms to minimize.
[2024-06-01 12:57:10] [INFO ] Deduced a trap composed of 65 places in 124 ms of which 2 ms to minimize.
[2024-06-01 12:57:10] [INFO ] Deduced a trap composed of 65 places in 125 ms of which 1 ms to minimize.
[2024-06-01 12:57:10] [INFO ] Deduced a trap composed of 65 places in 132 ms of which 2 ms to minimize.
[2024-06-01 12:57:11] [INFO ] Deduced a trap composed of 67 places in 128 ms of which 1 ms to minimize.
[2024-06-01 12:57:11] [INFO ] Deduced a trap composed of 67 places in 126 ms of which 1 ms to minimize.
[2024-06-01 12:57:11] [INFO ] Deduced a trap composed of 65 places in 190 ms of which 2 ms to minimize.
[2024-06-01 12:57:11] [INFO ] Deduced a trap composed of 66 places in 133 ms of which 1 ms to minimize.
[2024-06-01 12:57:11] [INFO ] Deduced a trap composed of 65 places in 134 ms of which 2 ms to minimize.
[2024-06-01 12:57:12] [INFO ] Deduced a trap composed of 64 places in 242 ms of which 2 ms to minimize.
[2024-06-01 12:57:12] [INFO ] Deduced a trap composed of 65 places in 192 ms of which 3 ms to minimize.
[2024-06-01 12:57:12] [INFO ] Deduced a trap composed of 63 places in 234 ms of which 2 ms to minimize.
[2024-06-01 12:57:12] [INFO ] Deduced a trap composed of 62 places in 236 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 20/272 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 121/1232 variables, and 272 constraints, problems are : Problem set: 0 solved, 1101 unsolved in 30032 ms.
Refiners :[Domain max(s): 121/121 constraints, Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 0/121 constraints, ReadFeed: 0/1010 constraints, PredecessorRefiner: 0/1101 constraints, Known Traps: 140/140 constraints]
After SMT, in 61633ms problems are : Problem set: 0 solved, 1101 unsolved
Search for dead transitions found 0 dead transitions in 61706ms
Finished structural reductions in LTL mode , in 1 iterations and 63197 ms. Remains : 121/121 places, 1111/1111 transitions.
Support contains 121 out of 121 places after structural reductions.
[2024-06-01 12:57:14] [INFO ] Flatten gal took : 345 ms
[2024-06-01 12:57:17] [INFO ] Flatten gal took : 381 ms
[2024-06-01 12:57:19] [INFO ] Input system was already deterministic with 1111 transitions.
Reduction of identical properties reduced properties to check from 63 to 55
RANDOM walk for 40000 steps (8 resets) in 10505 ms. (3 steps per ms) remains 37/55 properties
BEST_FIRST walk for 4000 steps (8 resets) in 1790 ms. (2 steps per ms) remains 36/37 properties
BEST_FIRST walk for 4000 steps (8 resets) in 679 ms. (5 steps per ms) remains 35/36 properties
BEST_FIRST walk for 4000 steps (8 resets) in 661 ms. (6 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4000 steps (8 resets) in 1246 ms. (3 steps per ms) remains 33/35 properties
BEST_FIRST walk for 4000 steps (8 resets) in 464 ms. (8 steps per ms) remains 32/33 properties
BEST_FIRST walk for 4000 steps (8 resets) in 499 ms. (8 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4000 steps (8 resets) in 470 ms. (8 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4000 steps (8 resets) in 427 ms. (9 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4000 steps (8 resets) in 442 ms. (9 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4000 steps (8 resets) in 437 ms. (9 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4000 steps (8 resets) in 413 ms. (9 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4000 steps (8 resets) in 389 ms. (10 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4000 steps (8 resets) in 415 ms. (9 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4000 steps (8 resets) in 397 ms. (10 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4000 steps (8 resets) in 405 ms. (9 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4000 steps (8 resets) in 444 ms. (8 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4000 steps (8 resets) in 506 ms. (7 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4000 steps (8 resets) in 461 ms. (8 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4000 steps (8 resets) in 558 ms. (7 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4000 steps (8 resets) in 560 ms. (7 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4000 steps (8 resets) in 561 ms. (7 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4000 steps (8 resets) in 539 ms. (7 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4000 steps (8 resets) in 611 ms. (6 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4000 steps (8 resets) in 614 ms. (6 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4000 steps (8 resets) in 521 ms. (7 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4000 steps (8 resets) in 401 ms. (9 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4000 steps (8 resets) in 402 ms. (9 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4000 steps (8 resets) in 384 ms. (10 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4000 steps (8 resets) in 413 ms. (9 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4000 steps (8 resets) in 390 ms. (10 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4000 steps (8 resets) in 398 ms. (10 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4000 steps (8 resets) in 382 ms. (10 steps per ms) remains 32/32 properties
[2024-06-01 12:57:28] [INFO ] Invariant cache hit.
[2024-06-01 12:57:28] [INFO ] State equation strengthened by 1010 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 32 unsolved
Problem AtomicPropp16 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 11/132 constraints. Problems are: Problem set: 1 solved, 31 unsolved
[2024-06-01 12:57:39] [INFO ] Deduced a trap composed of 63 places in 259 ms of which 3 ms to minimize.
[2024-06-01 12:57:39] [INFO ] Deduced a trap composed of 63 places in 205 ms of which 2 ms to minimize.
[2024-06-01 12:57:39] [INFO ] Deduced a trap composed of 66 places in 201 ms of which 2 ms to minimize.
[2024-06-01 12:57:39] [INFO ] Deduced a trap composed of 66 places in 209 ms of which 2 ms to minimize.
[2024-06-01 12:57:40] [INFO ] Deduced a trap composed of 69 places in 262 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 5/137 constraints. Problems are: Problem set: 1 solved, 31 unsolved
[2024-06-01 12:57:40] [INFO ] Deduced a trap composed of 68 places in 178 ms of which 3 ms to minimize.
[2024-06-01 12:57:41] [INFO ] Deduced a trap composed of 64 places in 195 ms of which 2 ms to minimize.
[2024-06-01 12:57:41] [INFO ] Deduced a trap composed of 63 places in 199 ms of which 3 ms to minimize.
[2024-06-01 12:57:41] [INFO ] Deduced a trap composed of 66 places in 256 ms of which 3 ms to minimize.
[2024-06-01 12:57:41] [INFO ] Deduced a trap composed of 67 places in 251 ms of which 2 ms to minimize.
[2024-06-01 12:57:42] [INFO ] Deduced a trap composed of 69 places in 256 ms of which 3 ms to minimize.
[2024-06-01 12:57:42] [INFO ] Deduced a trap composed of 70 places in 209 ms of which 2 ms to minimize.
[2024-06-01 12:57:42] [INFO ] Deduced a trap composed of 67 places in 240 ms of which 3 ms to minimize.
[2024-06-01 12:57:42] [INFO ] Deduced a trap composed of 68 places in 263 ms of which 2 ms to minimize.
[2024-06-01 12:57:43] [INFO ] Deduced a trap composed of 68 places in 252 ms of which 2 ms to minimize.
SMT process timed out in 15268ms, After SMT, problems are : Problem set: 1 solved, 31 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 121 out of 121 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 121/121 places, 1111/1111 transitions.
Applied a total of 0 rules in 68 ms. Remains 121 /121 variables (removed 0) and now considering 1111/1111 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69 ms. Remains : 121/121 places, 1111/1111 transitions.
RANDOM walk for 40000 steps (8 resets) in 6388 ms. (6 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4000 steps (8 resets) in 710 ms. (5 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4000 steps (8 resets) in 603 ms. (6 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4000 steps (8 resets) in 520 ms. (7 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4000 steps (8 resets) in 859 ms. (4 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4000 steps (8 resets) in 367 ms. (10 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4000 steps (8 resets) in 380 ms. (10 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4000 steps (8 resets) in 363 ms. (10 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4000 steps (8 resets) in 355 ms. (11 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4000 steps (8 resets) in 295 ms. (13 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4000 steps (8 resets) in 288 ms. (13 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4000 steps (8 resets) in 295 ms. (13 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4000 steps (8 resets) in 317 ms. (12 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4000 steps (8 resets) in 302 ms. (13 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4000 steps (8 resets) in 313 ms. (12 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4000 steps (8 resets) in 317 ms. (12 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4000 steps (8 resets) in 323 ms. (12 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4000 steps (8 resets) in 299 ms. (13 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4000 steps (8 resets) in 296 ms. (13 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4000 steps (8 resets) in 319 ms. (12 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4000 steps (8 resets) in 306 ms. (13 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4000 steps (8 resets) in 333 ms. (11 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4000 steps (8 resets) in 359 ms. (11 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4000 steps (8 resets) in 344 ms. (11 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4000 steps (8 resets) in 356 ms. (11 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4000 steps (8 resets) in 349 ms. (11 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4000 steps (8 resets) in 316 ms. (12 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4000 steps (8 resets) in 304 ms. (13 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4000 steps (8 resets) in 310 ms. (12 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4000 steps (8 resets) in 293 ms. (13 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4000 steps (8 resets) in 307 ms. (12 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4000 steps (8 resets) in 296 ms. (13 steps per ms) remains 31/31 properties
Probably explored full state space saw : 58904 states, properties seen :0
Probabilistic random walk after 352949 steps, saw 58904 distinct states, run finished after 6857 ms. (steps per millisecond=51 ) properties seen :0
Explored full state space saw : 58905 states, properties seen :0
Exhaustive walk after 352955 steps, saw 58905 distinct states, run finished after 5856 ms. (steps per millisecond=60 ) properties seen :0
Successfully simplified 32 atomic propositions for a total of 16 simplifications.
FORMULA TokenRing-PT-010-CTLFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 12:58:01] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-06-01 12:58:01] [INFO ] Flatten gal took : 178 ms
[2024-06-01 12:58:01] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA TokenRing-PT-010-CTLFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TokenRing-PT-010-CTLFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 12:58:03] [INFO ] Flatten gal took : 214 ms
[2024-06-01 12:58:04] [INFO ] Input system was already deterministic with 1111 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 121/121 places, 1111/1111 transitions.
Applied a total of 0 rules in 4 ms. Remains 121 /121 variables (removed 0) and now considering 1111/1111 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 121/121 places, 1111/1111 transitions.
[2024-06-01 12:58:05] [INFO ] Flatten gal took : 42 ms
[2024-06-01 12:58:05] [INFO ] Flatten gal took : 57 ms
[2024-06-01 12:58:05] [INFO ] Input system was already deterministic with 1111 transitions.
Starting structural reductions in LTL mode, iteration 0 : 121/121 places, 1111/1111 transitions.
Applied a total of 0 rules in 4 ms. Remains 121 /121 variables (removed 0) and now considering 1111/1111 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 121/121 places, 1111/1111 transitions.
[2024-06-01 12:58:05] [INFO ] Flatten gal took : 43 ms
[2024-06-01 12:58:05] [INFO ] Flatten gal took : 62 ms
[2024-06-01 12:58:05] [INFO ] Input system was already deterministic with 1111 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 121/121 places, 1111/1111 transitions.
Applied a total of 0 rules in 33 ms. Remains 121 /121 variables (removed 0) and now considering 1111/1111 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 33 ms. Remains : 121/121 places, 1111/1111 transitions.
[2024-06-01 12:58:05] [INFO ] Flatten gal took : 42 ms
[2024-06-01 12:58:05] [INFO ] Flatten gal took : 55 ms
[2024-06-01 12:58:05] [INFO ] Input system was already deterministic with 1111 transitions.
Starting structural reductions in LTL mode, iteration 0 : 121/121 places, 1111/1111 transitions.
Applied a total of 0 rules in 3 ms. Remains 121 /121 variables (removed 0) and now considering 1111/1111 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 121/121 places, 1111/1111 transitions.
[2024-06-01 12:58:06] [INFO ] Flatten gal took : 40 ms
[2024-06-01 12:58:06] [INFO ] Flatten gal took : 51 ms
[2024-06-01 12:58:06] [INFO ] Input system was already deterministic with 1111 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 121/121 places, 1111/1111 transitions.
Applied a total of 0 rules in 28 ms. Remains 121 /121 variables (removed 0) and now considering 1111/1111 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 28 ms. Remains : 121/121 places, 1111/1111 transitions.
[2024-06-01 12:58:06] [INFO ] Flatten gal took : 38 ms
[2024-06-01 12:58:06] [INFO ] Flatten gal took : 49 ms
[2024-06-01 12:58:06] [INFO ] Input system was already deterministic with 1111 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 121/121 places, 1111/1111 transitions.
Applied a total of 0 rules in 63 ms. Remains 121 /121 variables (removed 0) and now considering 1111/1111 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 64 ms. Remains : 121/121 places, 1111/1111 transitions.
[2024-06-01 12:58:06] [INFO ] Flatten gal took : 28 ms
[2024-06-01 12:58:06] [INFO ] Flatten gal took : 35 ms
[2024-06-01 12:58:06] [INFO ] Input system was already deterministic with 1111 transitions.
Starting structural reductions in LTL mode, iteration 0 : 121/121 places, 1111/1111 transitions.
Applied a total of 0 rules in 3 ms. Remains 121 /121 variables (removed 0) and now considering 1111/1111 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 121/121 places, 1111/1111 transitions.
[2024-06-01 12:58:07] [INFO ] Flatten gal took : 47 ms
[2024-06-01 12:58:07] [INFO ] Flatten gal took : 83 ms
[2024-06-01 12:58:07] [INFO ] Input system was already deterministic with 1111 transitions.
Starting structural reductions in LTL mode, iteration 0 : 121/121 places, 1111/1111 transitions.
Applied a total of 0 rules in 4 ms. Remains 121 /121 variables (removed 0) and now considering 1111/1111 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 121/121 places, 1111/1111 transitions.
[2024-06-01 12:58:07] [INFO ] Flatten gal took : 35 ms
[2024-06-01 12:58:07] [INFO ] Flatten gal took : 55 ms
[2024-06-01 12:58:07] [INFO ] Input system was already deterministic with 1111 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 121/121 places, 1111/1111 transitions.
Applied a total of 0 rules in 37 ms. Remains 121 /121 variables (removed 0) and now considering 1111/1111 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 38 ms. Remains : 121/121 places, 1111/1111 transitions.
[2024-06-01 12:58:08] [INFO ] Flatten gal took : 26 ms
[2024-06-01 12:58:08] [INFO ] Flatten gal took : 28 ms
[2024-06-01 12:58:08] [INFO ] Input system was already deterministic with 1111 transitions.
Starting structural reductions in LTL mode, iteration 0 : 121/121 places, 1111/1111 transitions.
Applied a total of 0 rules in 10 ms. Remains 121 /121 variables (removed 0) and now considering 1111/1111 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 121/121 places, 1111/1111 transitions.
[2024-06-01 12:58:08] [INFO ] Flatten gal took : 24 ms
[2024-06-01 12:58:08] [INFO ] Flatten gal took : 28 ms
[2024-06-01 12:58:08] [INFO ] Input system was already deterministic with 1111 transitions.
Starting structural reductions in LTL mode, iteration 0 : 121/121 places, 1111/1111 transitions.
Applied a total of 0 rules in 11 ms. Remains 121 /121 variables (removed 0) and now considering 1111/1111 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 121/121 places, 1111/1111 transitions.
[2024-06-01 12:58:08] [INFO ] Flatten gal took : 23 ms
[2024-06-01 12:58:08] [INFO ] Flatten gal took : 27 ms
[2024-06-01 12:58:08] [INFO ] Input system was already deterministic with 1111 transitions.
Starting structural reductions in LTL mode, iteration 0 : 121/121 places, 1111/1111 transitions.
Applied a total of 0 rules in 8 ms. Remains 121 /121 variables (removed 0) and now considering 1111/1111 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 121/121 places, 1111/1111 transitions.
[2024-06-01 12:58:08] [INFO ] Flatten gal took : 22 ms
[2024-06-01 12:58:08] [INFO ] Flatten gal took : 27 ms
[2024-06-01 12:58:08] [INFO ] Input system was already deterministic with 1111 transitions.
Starting structural reductions in LTL mode, iteration 0 : 121/121 places, 1111/1111 transitions.
Applied a total of 0 rules in 7 ms. Remains 121 /121 variables (removed 0) and now considering 1111/1111 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 121/121 places, 1111/1111 transitions.
[2024-06-01 12:58:08] [INFO ] Flatten gal took : 22 ms
[2024-06-01 12:58:08] [INFO ] Flatten gal took : 26 ms
[2024-06-01 12:58:08] [INFO ] Input system was already deterministic with 1111 transitions.
[2024-06-01 12:58:08] [INFO ] Flatten gal took : 203 ms
[2024-06-01 12:58:10] [INFO ] Flatten gal took : 202 ms
[2024-06-01 12:58:11] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLFireability.sr.xml took 172 ms.
[2024-06-01 12:58:11] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 121 places, 1111 transitions and 4444 arcs took 11 ms.
Total runtime 124882 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=
[--mu-opt] [--saturation=
[--sat-granularity=
[--guidance=
[--action=
[--trace=
[--mu=
[--ctl=
[--save-levels=STRING] [--pg-solve] [--attr=
[--saturating-attractor] [--write-strategy=
[--check-strategy] [--interactive-play] [--player]
[--pg-write=
[--edge-label=
[--mucalc=
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por=
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=
[--cw-max-cols=
[--mh-timeout=
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=
[--ldd32-cache=
[--cache-ratio=
[--min-free-nodes=
[--fdd-reorder=
[--vset-cache-diff=
[--next-union] [--peak-nodes] [--maxsum=
[--block-size=
[--debug=
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS]
Could not compute solution for formula : TokenRing-PT-010-CTLFireability-2024-00
Could not compute solution for formula : TokenRing-PT-010-CTLFireability-2024-01
Could not compute solution for formula : TokenRing-PT-010-CTLFireability-2024-02
Could not compute solution for formula : TokenRing-PT-010-CTLFireability-2024-03
Could not compute solution for formula : TokenRing-PT-010-CTLFireability-2024-04
Could not compute solution for formula : TokenRing-PT-010-CTLFireability-2024-05
Could not compute solution for formula : TokenRing-PT-010-CTLFireability-2024-06
Could not compute solution for formula : TokenRing-PT-010-CTLFireability-2024-07
Could not compute solution for formula : TokenRing-PT-010-CTLFireability-2024-08
Could not compute solution for formula : TokenRing-PT-010-CTLFireability-2024-10
Could not compute solution for formula : TokenRing-PT-010-CTLFireability-2024-13
Could not compute solution for formula : TokenRing-PT-010-CTLFireability-2024-14
Could not compute solution for formula : TokenRing-PT-010-CTLFireability-2024-15
BK_STOP 1717246694079
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
mcc2024
ctl formula name TokenRing-PT-010-CTLFireability-2024-00
ctl formula formula --ctl=/tmp/1006/ctl_0_
ctl formula name TokenRing-PT-010-CTLFireability-2024-01
ctl formula formula --ctl=/tmp/1006/ctl_1_
ctl formula name TokenRing-PT-010-CTLFireability-2024-02
ctl formula formula --ctl=/tmp/1006/ctl_2_
ctl formula name TokenRing-PT-010-CTLFireability-2024-03
ctl formula formula --ctl=/tmp/1006/ctl_3_
ctl formula name TokenRing-PT-010-CTLFireability-2024-04
ctl formula formula --ctl=/tmp/1006/ctl_4_
ctl formula name TokenRing-PT-010-CTLFireability-2024-05
ctl formula formula --ctl=/tmp/1006/ctl_5_
ctl formula name TokenRing-PT-010-CTLFireability-2024-06
ctl formula formula --ctl=/tmp/1006/ctl_6_
ctl formula name TokenRing-PT-010-CTLFireability-2024-07
ctl formula formula --ctl=/tmp/1006/ctl_7_
ctl formula name TokenRing-PT-010-CTLFireability-2024-08
ctl formula formula --ctl=/tmp/1006/ctl_8_
ctl formula name TokenRing-PT-010-CTLFireability-2024-10
ctl formula formula --ctl=/tmp/1006/ctl_9_
ctl formula name TokenRing-PT-010-CTLFireability-2024-13
ctl formula formula --ctl=/tmp/1006/ctl_10_
ctl formula name TokenRing-PT-010-CTLFireability-2024-14
ctl formula formula --ctl=/tmp/1006/ctl_11_
ctl formula name TokenRing-PT-010-CTLFireability-2024-15
ctl formula formula --ctl=/tmp/1006/ctl_12_
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="TokenRing-PT-010"
export BK_EXAMINATION="CTLFireability"
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 TokenRing-PT-010, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r540-smll-171690573700162"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/TokenRing-PT-010.tgz
mv TokenRing-PT-010 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;