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.r421-smll-171690572800161.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is TokenRing-PT-010, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r421-smll-171690572800161
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1717002404152

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=TokenRing-PT-010
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-29 17:06:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-29 17:06:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 17:06:47] [INFO ] Load time of PNML (sax parser for PT used): 311 ms
[2024-05-29 17:06:47] [INFO ] Transformed 121 places.
[2024-05-29 17:06:47] [INFO ] Transformed 1111 transitions.
[2024-05-29 17:06:47] [INFO ] Found NUPN structural information;
[2024-05-29 17:06:47] [INFO ] Parsed PT model containing 121 places and 1111 transitions and 4444 arcs in 650 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 215 ms.
Initial state reduction rules removed 1 formulas.
FORMULA TokenRing-PT-010-CTLCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TokenRing-PT-010-CTLCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TokenRing-PT-010-CTLCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TokenRing-PT-010-CTLCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 53 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 62 ms. Remains 121 /121 variables (removed 0) and now considering 1111/1111 (removed 0) transitions.
// Phase 1: matrix 1111 rows 121 cols
[2024-05-29 17:06:47] [INFO ] Computed 11 invariants in 48 ms
[2024-05-29 17:06:48] [INFO ] Implicit Places using invariants in 678 ms returned []
[2024-05-29 17:06:48] [INFO ] Invariant cache hit.
[2024-05-29 17:06:49] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2024-05-29 17:06:50] [INFO ] Implicit Places using invariants and state equation in 1557 ms returned []
Implicit Place search using SMT with State Equation took 2307 ms to find 0 implicit places.
Running 1101 sub problems to find dead transitions.
[2024-05-29 17:06:50] [INFO ] Invariant cache hit.
[2024-05-29 17:06:50] [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-05-29 17:06:59] [INFO ] Deduced a trap composed of 66 places in 290 ms of which 45 ms to minimize.
[2024-05-29 17:06:59] [INFO ] Deduced a trap composed of 67 places in 350 ms of which 4 ms to minimize.
[2024-05-29 17:06:59] [INFO ] Deduced a trap composed of 66 places in 249 ms of which 3 ms to minimize.
[2024-05-29 17:07:00] [INFO ] Deduced a trap composed of 65 places in 257 ms of which 3 ms to minimize.
[2024-05-29 17:07:00] [INFO ] Deduced a trap composed of 66 places in 309 ms of which 3 ms to minimize.
[2024-05-29 17:07:00] [INFO ] Deduced a trap composed of 65 places in 292 ms of which 3 ms to minimize.
[2024-05-29 17:07:00] [INFO ] Deduced a trap composed of 66 places in 178 ms of which 3 ms to minimize.
[2024-05-29 17:07:01] [INFO ] Deduced a trap composed of 65 places in 170 ms of which 2 ms to minimize.
[2024-05-29 17:07:01] [INFO ] Deduced a trap composed of 65 places in 144 ms of which 2 ms to minimize.
[2024-05-29 17:07:01] [INFO ] Deduced a trap composed of 67 places in 212 ms of which 3 ms to minimize.
[2024-05-29 17:07:01] [INFO ] Deduced a trap composed of 65 places in 176 ms of which 2 ms to minimize.
[2024-05-29 17:07:01] [INFO ] Deduced a trap composed of 64 places in 199 ms of which 3 ms to minimize.
[2024-05-29 17:07:02] [INFO ] Deduced a trap composed of 65 places in 241 ms of which 12 ms to minimize.
[2024-05-29 17:07:02] [INFO ] Deduced a trap composed of 66 places in 217 ms of which 9 ms to minimize.
[2024-05-29 17:07:02] [INFO ] Deduced a trap composed of 64 places in 266 ms of which 3 ms to minimize.
[2024-05-29 17:07:02] [INFO ] Deduced a trap composed of 62 places in 261 ms of which 2 ms to minimize.
[2024-05-29 17:07:03] [INFO ] Deduced a trap composed of 65 places in 256 ms of which 2 ms to minimize.
[2024-05-29 17:07:03] [INFO ] Deduced a trap composed of 63 places in 164 ms of which 2 ms to minimize.
[2024-05-29 17:07:03] [INFO ] Deduced a trap composed of 64 places in 253 ms of which 3 ms to minimize.
[2024-05-29 17:07:03] [INFO ] Deduced a trap composed of 66 places in 246 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-05-29 17:07:04] [INFO ] Deduced a trap composed of 64 places in 229 ms of which 3 ms to minimize.
[2024-05-29 17:07:05] [INFO ] Deduced a trap composed of 65 places in 230 ms of which 2 ms to minimize.
[2024-05-29 17:07:05] [INFO ] Deduced a trap composed of 65 places in 236 ms of which 2 ms to minimize.
[2024-05-29 17:07:05] [INFO ] Deduced a trap composed of 65 places in 244 ms of which 2 ms to minimize.
[2024-05-29 17:07:05] [INFO ] Deduced a trap composed of 64 places in 235 ms of which 2 ms to minimize.
[2024-05-29 17:07:06] [INFO ] Deduced a trap composed of 66 places in 242 ms of which 3 ms to minimize.
[2024-05-29 17:07:06] [INFO ] Deduced a trap composed of 64 places in 249 ms of which 3 ms to minimize.
[2024-05-29 17:07:06] [INFO ] Deduced a trap composed of 64 places in 241 ms of which 2 ms to minimize.
[2024-05-29 17:07:07] [INFO ] Deduced a trap composed of 64 places in 247 ms of which 2 ms to minimize.
[2024-05-29 17:07:07] [INFO ] Deduced a trap composed of 65 places in 227 ms of which 2 ms to minimize.
[2024-05-29 17:07:07] [INFO ] Deduced a trap composed of 65 places in 247 ms of which 2 ms to minimize.
[2024-05-29 17:07:07] [INFO ] Deduced a trap composed of 68 places in 239 ms of which 3 ms to minimize.
[2024-05-29 17:07:07] [INFO ] Deduced a trap composed of 64 places in 194 ms of which 2 ms to minimize.
[2024-05-29 17:07:08] [INFO ] Deduced a trap composed of 65 places in 230 ms of which 3 ms to minimize.
[2024-05-29 17:07:08] [INFO ] Deduced a trap composed of 65 places in 226 ms of which 3 ms to minimize.
[2024-05-29 17:07:08] [INFO ] Deduced a trap composed of 64 places in 223 ms of which 2 ms to minimize.
[2024-05-29 17:07:08] [INFO ] Deduced a trap composed of 65 places in 249 ms of which 2 ms to minimize.
[2024-05-29 17:07:09] [INFO ] Deduced a trap composed of 65 places in 255 ms of which 3 ms to minimize.
[2024-05-29 17:07:09] [INFO ] Deduced a trap composed of 65 places in 251 ms of which 3 ms to minimize.
[2024-05-29 17:07:09] [INFO ] Deduced a trap composed of 65 places in 248 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 20/172 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-05-29 17:07:15] [INFO ] Deduced a trap composed of 65 places in 266 ms of which 2 ms to minimize.
[2024-05-29 17:07:15] [INFO ] Deduced a trap composed of 67 places in 246 ms of which 2 ms to minimize.
[2024-05-29 17:07:15] [INFO ] Deduced a trap composed of 68 places in 192 ms of which 3 ms to minimize.
[2024-05-29 17:07:16] [INFO ] Deduced a trap composed of 66 places in 197 ms of which 3 ms to minimize.
[2024-05-29 17:07:16] [INFO ] Deduced a trap composed of 64 places in 191 ms of which 2 ms to minimize.
[2024-05-29 17:07:16] [INFO ] Deduced a trap composed of 64 places in 180 ms of which 2 ms to minimize.
[2024-05-29 17:07:16] [INFO ] Deduced a trap composed of 67 places in 160 ms of which 2 ms to minimize.
[2024-05-29 17:07:17] [INFO ] Deduced a trap composed of 67 places in 246 ms of which 3 ms to minimize.
[2024-05-29 17:07:17] [INFO ] Deduced a trap composed of 67 places in 248 ms of which 3 ms to minimize.
[2024-05-29 17:07:17] [INFO ] Deduced a trap composed of 67 places in 247 ms of which 3 ms to minimize.
[2024-05-29 17:07:17] [INFO ] Deduced a trap composed of 68 places in 251 ms of which 2 ms to minimize.
[2024-05-29 17:07:18] [INFO ] Deduced a trap composed of 67 places in 229 ms of which 3 ms to minimize.
[2024-05-29 17:07:18] [INFO ] Deduced a trap composed of 64 places in 203 ms of which 2 ms to minimize.
[2024-05-29 17:07:18] [INFO ] Deduced a trap composed of 64 places in 237 ms of which 3 ms to minimize.
[2024-05-29 17:07:18] [INFO ] Deduced a trap composed of 67 places in 218 ms of which 3 ms to minimize.
[2024-05-29 17:07:19] [INFO ] Deduced a trap composed of 65 places in 252 ms of which 3 ms to minimize.
[2024-05-29 17:07:19] [INFO ] Deduced a trap composed of 65 places in 245 ms of which 4 ms to minimize.
[2024-05-29 17:07:19] [INFO ] Deduced a trap composed of 65 places in 257 ms of which 2 ms to minimize.
[2024-05-29 17:07:19] [INFO ] Deduced a trap composed of 65 places in 255 ms of which 3 ms to minimize.
[2024-05-29 17:07:20] [INFO ] Deduced a trap composed of 66 places in 214 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
[2024-05-29 17:07:21] [INFO ] Deduced a trap composed of 68 places in 138 ms of which 1 ms to minimize.
[2024-05-29 17:07:21] [INFO ] Deduced a trap composed of 66 places in 150 ms of which 1 ms to minimize.
SMT process timed out in 31645ms, After SMT, problems are : Problem set: 0 solved, 1101 unsolved
Search for dead transitions found 0 dead transitions in 31709ms
Finished structural reductions in LTL mode , in 1 iterations and 34147 ms. Remains : 121/121 places, 1111/1111 transitions.
Support contains 53 out of 121 places after structural reductions.
[2024-05-29 17:07:22] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2024-05-29 17:07:22] [INFO ] Flatten gal took : 139 ms
[2024-05-29 17:07:22] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA TokenRing-PT-010-CTLCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TokenRing-PT-010-CTLCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TokenRing-PT-010-CTLCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TokenRing-PT-010-CTLCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-29 17:07:22] [INFO ] Flatten gal took : 98 ms
[2024-05-29 17:07:22] [INFO ] Input system was already deterministic with 1111 transitions.
Support contains 42 out of 121 places (down from 53) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 1612 ms. (24 steps per ms) remains 1/32 properties
BEST_FIRST walk for 40000 steps (8 resets) in 663 ms. (60 steps per ms) remains 1/1 properties
[2024-05-29 17:07:23] [INFO ] Invariant cache hit.
[2024-05-29 17:07:24] [INFO ] State equation strengthened by 1010 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 20/22 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/22 variables, 20/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 220/242 variables, 22/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/242 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 310/552 variables, 400/446 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/552 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 75/627 variables, 44/490 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/627 variables, 44/534 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/627 variables, 4/538 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/627 variables, 0/538 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 400/1027 variables, 310/848 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1027 variables, 80/928 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1027 variables, 0/928 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 84/1111 variables, 44/972 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1111 variables, 44/1016 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1111 variables, 4/1020 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1111 variables, 20/1040 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1111 variables, 0/1040 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 110/1221 variables, 200/1240 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1221 variables, 0/1240 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 11/1232 variables, 11/1251 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1232 variables, 11/1262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1232 variables, 1/1263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1232 variables, 0/1263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/1232 variables, 0/1263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1232/1232 variables, and 1263 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1248 ms.
Refiners :[Domain max(s): 121/121 constraints, Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 121/121 constraints, ReadFeed: 1010/1010 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 20/22 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/22 variables, 20/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 220/242 variables, 22/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/242 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 310/552 variables, 400/446 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/552 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 75/627 variables, 44/490 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/627 variables, 44/534 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/627 variables, 4/538 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/627 variables, 1/539 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/627 variables, 0/539 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 400/1027 variables, 310/849 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1027 variables, 80/929 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1027 variables, 0/929 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 84/1111 variables, 44/973 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1111 variables, 44/1017 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1111 variables, 4/1021 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1111 variables, 20/1041 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1111 variables, 0/1041 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 110/1221 variables, 200/1241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1221 variables, 0/1241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 11/1232 variables, 11/1252 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1232 variables, 11/1263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1232 variables, 1/1264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1232 variables, 0/1264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 0/1232 variables, 0/1264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1232/1232 variables, and 1264 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1194 ms.
Refiners :[Domain max(s): 121/121 constraints, Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 121/121 constraints, ReadFeed: 1010/1010 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 2517ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 122 ms.
Support contains 2 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 101 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 102 ms. Remains : 121/121 places, 1111/1111 transitions.
RANDOM walk for 40000 steps (8 resets) in 1251 ms. (31 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (8 resets) in 287 ms. (138 steps per ms) remains 1/1 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 2820 ms. (steps per millisecond=125 ) 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 2089 ms. (steps per millisecond=168 ) properties seen :0
Successfully simplified 1 atomic propositions for a total of 6 simplifications.
[2024-05-29 17:07:32] [INFO ] Flatten gal took : 50 ms
[2024-05-29 17:07:32] [INFO ] Flatten gal took : 51 ms
[2024-05-29 17:07:32] [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 12 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 13 ms. Remains : 121/121 places, 1111/1111 transitions.
[2024-05-29 17:07:32] [INFO ] Flatten gal took : 35 ms
[2024-05-29 17:07:32] [INFO ] Flatten gal took : 38 ms
[2024-05-29 17:07:32] [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-05-29 17:07:32] [INFO ] Flatten gal took : 36 ms
[2024-05-29 17:07:32] [INFO ] Flatten gal took : 39 ms
[2024-05-29 17:07:32] [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 32 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-05-29 17:07:32] [INFO ] Flatten gal took : 32 ms
[2024-05-29 17:07:32] [INFO ] Flatten gal took : 38 ms
[2024-05-29 17:07:32] [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 9 ms. Remains : 121/121 places, 1111/1111 transitions.
[2024-05-29 17:07:33] [INFO ] Flatten gal took : 34 ms
[2024-05-29 17:07:33] [INFO ] Flatten gal took : 33 ms
[2024-05-29 17:07:33] [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 9 ms. Remains : 121/121 places, 1111/1111 transitions.
[2024-05-29 17:07:33] [INFO ] Flatten gal took : 28 ms
[2024-05-29 17:07:33] [INFO ] Flatten gal took : 31 ms
[2024-05-29 17:07:33] [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 8 ms. Remains : 121/121 places, 1111/1111 transitions.
[2024-05-29 17:07:33] [INFO ] Flatten gal took : 26 ms
[2024-05-29 17:07:33] [INFO ] Flatten gal took : 39 ms
[2024-05-29 17:07:33] [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 21 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 21 ms. Remains : 121/121 places, 1111/1111 transitions.
[2024-05-29 17:07:33] [INFO ] Flatten gal took : 31 ms
[2024-05-29 17:07:33] [INFO ] Flatten gal took : 37 ms
[2024-05-29 17:07:33] [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-05-29 17:07:33] [INFO ] Flatten gal took : 30 ms
[2024-05-29 17:07:33] [INFO ] Flatten gal took : 34 ms
[2024-05-29 17:07:33] [INFO ] Input system was already deterministic with 1111 transitions.
[2024-05-29 17:07:33] [INFO ] Flatten gal took : 46 ms
[2024-05-29 17:07:34] [INFO ] Flatten gal took : 45 ms
[2024-05-29 17:07:34] [INFO ] Export to MCC of 8 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 6 ms.
[2024-05-29 17:07:34] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 121 places, 1111 transitions and 4444 arcs took 14 ms.
Total runtime 47746 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running TokenRing-PT-010

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/412/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 121
TRANSITIONS: 1111
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.028s, Sys 0.005s]


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


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 749
MODEL NAME: /home/mcc/execution/412/model
121 places, 1111 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA TokenRing-PT-010-CTLCardinality-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA TokenRing-PT-010-CTLCardinality-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA TokenRing-PT-010-CTLCardinality-2024-12 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA TokenRing-PT-010-CTLCardinality-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA TokenRing-PT-010-CTLCardinality-2024-14 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA TokenRing-PT-010-CTLCardinality-2024-08 CANNOT_COMPUTE
FORMULA TokenRing-PT-010-CTLCardinality-2024-13 CANNOT_COMPUTE
FORMULA TokenRing-PT-010-CTLCardinality-2024-15 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1717002728454

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

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

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

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="CTLCardinality"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is TokenRing-PT-010, 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 r421-smll-171690572800161"
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 [ "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 ;