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-171690573700166.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 ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r540-smll-171690573700166
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1717247344437

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
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 13:09:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 13:09:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 13:09:07] [INFO ] Load time of PNML (sax parser for PT used): 316 ms
[2024-06-01 13:09:07] [INFO ] Transformed 121 places.
[2024-06-01 13:09:07] [INFO ] Transformed 1111 transitions.
[2024-06-01 13:09:07] [INFO ] Found NUPN structural information;
[2024-06-01 13:09:07] [INFO ] Parsed PT model containing 121 places and 1111 transitions and 4444 arcs in 565 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 148 ms.
Working with output stream class java.io.PrintStream
FORMULA TokenRing-PT-010-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TokenRing-PT-010-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TokenRing-PT-010-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TokenRing-PT-010-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TokenRing-PT-010-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TokenRing-PT-010-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TokenRing-PT-010-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TokenRing-PT-010-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TokenRing-PT-010-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8 resets) in 2708 ms. (14 steps per ms) remains 4/7 properties
FORMULA TokenRing-PT-010-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA TokenRing-PT-010-ReachabilityCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA TokenRing-PT-010-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40000 steps (8 resets) in 483 ms. (82 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (8 resets) in 428 ms. (93 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (8 resets) in 326 ms. (122 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (8 resets) in 327 ms. (121 steps per ms) remains 4/4 properties
// Phase 1: matrix 1111 rows 121 cols
[2024-06-01 13:09:09] [INFO ] Computed 11 invariants in 49 ms
[2024-06-01 13:09:09] [INFO ] State equation strengthened by 1010 read => feed constraints.
Problem TokenRing-PT-010-ReachabilityCardinality-2024-09 is UNSAT
FORMULA TokenRing-PT-010-ReachabilityCardinality-2024-09 FALSE TECHNIQUES SMT_REFINEMENT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 84/84 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/84 variables, 0/84 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 37/121 variables, 11/95 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 37/132 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 0/132 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1111/1232 variables, 121/253 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1232 variables, 1010/1263 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1232 variables, 0/1263 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/1232 variables, 0/1263 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1232/1232 variables, and 1263 constraints, problems are : Problem set: 1 solved, 3 unsolved in 1474 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: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 58/58 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 0/58 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 63/121 variables, 11/69 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 63/132 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-06-01 13:09:12] [INFO ] Deduced a trap composed of 65 places in 302 ms of which 25 ms to minimize.
[2024-06-01 13:09:12] [INFO ] Deduced a trap composed of 63 places in 267 ms of which 3 ms to minimize.
[2024-06-01 13:09:12] [INFO ] Deduced a trap composed of 65 places in 283 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 3/135 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-06-01 13:09:12] [INFO ] Deduced a trap composed of 66 places in 155 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/121 variables, 1/136 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 0/136 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 1111/1232 variables, 121/257 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1232 variables, 1010/1267 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1232 variables, 3/1270 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1232 variables, 0/1270 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/1232 variables, 0/1270 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1232/1232 variables, and 1270 constraints, problems are : Problem set: 1 solved, 3 unsolved in 3264 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: 3/4 constraints, Known Traps: 4/4 constraints]
After SMT, in 5222ms problems are : Problem set: 1 solved, 3 unsolved
Parikh walk visited 0 properties in 1896 ms.
Support contains 58 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 63 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 78 ms. Remains : 121/121 places, 1111/1111 transitions.
RANDOM walk for 40000 steps (8 resets) in 276 ms. (144 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40000 steps (8 resets) in 318 ms. (125 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40000 steps (8 resets) in 233 ms. (170 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40000 steps (8 resets) in 177 ms. (224 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 337761 steps, run timeout after 3001 ms. (steps per millisecond=112 ) properties seen :0 out of 3
Probabilistic random walk after 337761 steps, saw 56930 distinct states, run finished after 3011 ms. (steps per millisecond=112 ) properties seen :0
[2024-06-01 13:09:20] [INFO ] Invariant cache hit.
[2024-06-01 13:09:20] [INFO ] State equation strengthened by 1010 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 64/121 variables, 11/68 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 64/132 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1111/1232 variables, 121/253 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1232 variables, 1010/1263 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1232 variables, 0/1263 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/1232 variables, 0/1263 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1232/1232 variables, and 1263 constraints, problems are : Problem set: 0 solved, 3 unsolved in 909 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: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 64/121 variables, 11/68 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 64/132 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 13:09:21] [INFO ] Deduced a trap composed of 65 places in 247 ms of which 3 ms to minimize.
[2024-06-01 13:09:21] [INFO ] Deduced a trap composed of 65 places in 275 ms of which 3 ms to minimize.
[2024-06-01 13:09:21] [INFO ] Deduced a trap composed of 64 places in 224 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 3/135 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 13:09:22] [INFO ] Deduced a trap composed of 64 places in 200 ms of which 5 ms to minimize.
[2024-06-01 13:09:22] [INFO ] Deduced a trap composed of 66 places in 199 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/121 variables, 2/137 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 13:09:22] [INFO ] Deduced a trap composed of 67 places in 228 ms of which 3 ms to minimize.
[2024-06-01 13:09:22] [INFO ] Deduced a trap composed of 68 places in 191 ms of which 2 ms to minimize.
[2024-06-01 13:09:23] [INFO ] Deduced a trap composed of 64 places in 149 ms of which 2 ms to minimize.
[2024-06-01 13:09:23] [INFO ] Deduced a trap composed of 69 places in 152 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 4/141 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 13:09:23] [INFO ] Deduced a trap composed of 64 places in 148 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/121 variables, 1/142 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/121 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 1111/1232 variables, 121/263 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1232 variables, 1010/1273 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1232 variables, 3/1276 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1232 variables, 0/1276 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/1232 variables, 0/1276 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1232/1232 variables, and 1276 constraints, problems are : Problem set: 0 solved, 3 unsolved in 3598 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: 3/3 constraints, Known Traps: 10/10 constraints]
After SMT, in 4626ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 1363 ms.
Support contains 57 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 47 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 47 ms. Remains : 121/121 places, 1111/1111 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 121/121 places, 1111/1111 transitions.
Applied a total of 0 rules in 24 ms. Remains 121 /121 variables (removed 0) and now considering 1111/1111 (removed 0) transitions.
[2024-06-01 13:09:26] [INFO ] Invariant cache hit.
[2024-06-01 13:09:26] [INFO ] Implicit Places using invariants in 180 ms returned []
[2024-06-01 13:09:26] [INFO ] Invariant cache hit.
[2024-06-01 13:09:26] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2024-06-01 13:09:27] [INFO ] Implicit Places using invariants and state equation in 1090 ms returned []
Implicit Place search using SMT with State Equation took 1283 ms to find 0 implicit places.
[2024-06-01 13:09:27] [INFO ] Redundant transitions in 76 ms returned []
Running 1101 sub problems to find dead transitions.
[2024-06-01 13:09:27] [INFO ] Invariant cache hit.
[2024-06-01 13:09:27] [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 13:09:34] [INFO ] Deduced a trap composed of 66 places in 248 ms of which 3 ms to minimize.
[2024-06-01 13:09:35] [INFO ] Deduced a trap composed of 67 places in 248 ms of which 2 ms to minimize.
[2024-06-01 13:09:35] [INFO ] Deduced a trap composed of 66 places in 211 ms of which 2 ms to minimize.
[2024-06-01 13:09:35] [INFO ] Deduced a trap composed of 65 places in 215 ms of which 3 ms to minimize.
[2024-06-01 13:09:35] [INFO ] Deduced a trap composed of 66 places in 209 ms of which 2 ms to minimize.
[2024-06-01 13:09:35] [INFO ] Deduced a trap composed of 65 places in 223 ms of which 1 ms to minimize.
[2024-06-01 13:09:36] [INFO ] Deduced a trap composed of 66 places in 142 ms of which 2 ms to minimize.
[2024-06-01 13:09:36] [INFO ] Deduced a trap composed of 65 places in 146 ms of which 3 ms to minimize.
[2024-06-01 13:09:36] [INFO ] Deduced a trap composed of 65 places in 134 ms of which 1 ms to minimize.
[2024-06-01 13:09:36] [INFO ] Deduced a trap composed of 67 places in 127 ms of which 2 ms to minimize.
[2024-06-01 13:09:36] [INFO ] Deduced a trap composed of 65 places in 152 ms of which 2 ms to minimize.
[2024-06-01 13:09:36] [INFO ] Deduced a trap composed of 64 places in 149 ms of which 2 ms to minimize.
[2024-06-01 13:09:37] [INFO ] Deduced a trap composed of 65 places in 126 ms of which 2 ms to minimize.
[2024-06-01 13:09:37] [INFO ] Deduced a trap composed of 66 places in 167 ms of which 2 ms to minimize.
[2024-06-01 13:09:37] [INFO ] Deduced a trap composed of 64 places in 167 ms of which 2 ms to minimize.
[2024-06-01 13:09:37] [INFO ] Deduced a trap composed of 62 places in 174 ms of which 2 ms to minimize.
[2024-06-01 13:09:37] [INFO ] Deduced a trap composed of 65 places in 175 ms of which 2 ms to minimize.
[2024-06-01 13:09:37] [INFO ] Deduced a trap composed of 63 places in 181 ms of which 2 ms to minimize.
[2024-06-01 13:09:38] [INFO ] Deduced a trap composed of 64 places in 250 ms of which 3 ms to minimize.
[2024-06-01 13:09:38] [INFO ] Deduced a trap composed of 66 places in 250 ms of which 4 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 13:09:39] [INFO ] Deduced a trap composed of 64 places in 214 ms of which 11 ms to minimize.
[2024-06-01 13:09:39] [INFO ] Deduced a trap composed of 65 places in 242 ms of which 2 ms to minimize.
[2024-06-01 13:09:40] [INFO ] Deduced a trap composed of 65 places in 247 ms of which 2 ms to minimize.
[2024-06-01 13:09:40] [INFO ] Deduced a trap composed of 65 places in 203 ms of which 2 ms to minimize.
[2024-06-01 13:09:40] [INFO ] Deduced a trap composed of 64 places in 252 ms of which 2 ms to minimize.
[2024-06-01 13:09:40] [INFO ] Deduced a trap composed of 66 places in 239 ms of which 4 ms to minimize.
[2024-06-01 13:09:41] [INFO ] Deduced a trap composed of 64 places in 245 ms of which 3 ms to minimize.
[2024-06-01 13:09:41] [INFO ] Deduced a trap composed of 64 places in 200 ms of which 2 ms to minimize.
[2024-06-01 13:09:41] [INFO ] Deduced a trap composed of 64 places in 243 ms of which 3 ms to minimize.
[2024-06-01 13:09:41] [INFO ] Deduced a trap composed of 65 places in 263 ms of which 2 ms to minimize.
[2024-06-01 13:09:42] [INFO ] Deduced a trap composed of 65 places in 201 ms of which 2 ms to minimize.
[2024-06-01 13:09:42] [INFO ] Deduced a trap composed of 68 places in 201 ms of which 2 ms to minimize.
[2024-06-01 13:09:42] [INFO ] Deduced a trap composed of 64 places in 193 ms of which 2 ms to minimize.
[2024-06-01 13:09:42] [INFO ] Deduced a trap composed of 65 places in 187 ms of which 2 ms to minimize.
[2024-06-01 13:09:42] [INFO ] Deduced a trap composed of 65 places in 126 ms of which 1 ms to minimize.
[2024-06-01 13:09:43] [INFO ] Deduced a trap composed of 64 places in 196 ms of which 3 ms to minimize.
[2024-06-01 13:09:43] [INFO ] Deduced a trap composed of 65 places in 256 ms of which 4 ms to minimize.
[2024-06-01 13:09:43] [INFO ] Deduced a trap composed of 65 places in 248 ms of which 2 ms to minimize.
[2024-06-01 13:09:43] [INFO ] Deduced a trap composed of 65 places in 252 ms of which 2 ms to minimize.
[2024-06-01 13:09:44] [INFO ] Deduced a trap composed of 65 places in 231 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 13:09:51] [INFO ] Deduced a trap composed of 65 places in 228 ms of which 2 ms to minimize.
[2024-06-01 13:09:51] [INFO ] Deduced a trap composed of 67 places in 237 ms of which 4 ms to minimize.
[2024-06-01 13:09:51] [INFO ] Deduced a trap composed of 68 places in 230 ms of which 3 ms to minimize.
[2024-06-01 13:09:52] [INFO ] Deduced a trap composed of 66 places in 228 ms of which 2 ms to minimize.
[2024-06-01 13:09:52] [INFO ] Deduced a trap composed of 64 places in 231 ms of which 3 ms to minimize.
[2024-06-01 13:09:52] [INFO ] Deduced a trap composed of 64 places in 244 ms of which 2 ms to minimize.
[2024-06-01 13:09:52] [INFO ] Deduced a trap composed of 67 places in 191 ms of which 2 ms to minimize.
[2024-06-01 13:09:52] [INFO ] Deduced a trap composed of 67 places in 232 ms of which 2 ms to minimize.
[2024-06-01 13:09:53] [INFO ] Deduced a trap composed of 67 places in 228 ms of which 2 ms to minimize.
[2024-06-01 13:09:53] [INFO ] Deduced a trap composed of 67 places in 202 ms of which 3 ms to minimize.
[2024-06-01 13:09:53] [INFO ] Deduced a trap composed of 68 places in 233 ms of which 2 ms to minimize.
[2024-06-01 13:09:53] [INFO ] Deduced a trap composed of 67 places in 247 ms of which 2 ms to minimize.
[2024-06-01 13:09:54] [INFO ] Deduced a trap composed of 64 places in 235 ms of which 2 ms to minimize.
[2024-06-01 13:09:54] [INFO ] Deduced a trap composed of 64 places in 211 ms of which 2 ms to minimize.
[2024-06-01 13:09:54] [INFO ] Deduced a trap composed of 67 places in 234 ms of which 3 ms to minimize.
[2024-06-01 13:09:54] [INFO ] Deduced a trap composed of 65 places in 239 ms of which 2 ms to minimize.
[2024-06-01 13:09:55] [INFO ] Deduced a trap composed of 65 places in 242 ms of which 3 ms to minimize.
[2024-06-01 13:09:55] [INFO ] Deduced a trap composed of 65 places in 236 ms of which 2 ms to minimize.
[2024-06-01 13:09:55] [INFO ] Deduced a trap composed of 65 places in 247 ms of which 3 ms to minimize.
[2024-06-01 13:09:55] [INFO ] Deduced a trap composed of 66 places in 224 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-06-01 13:09:57] [INFO ] Deduced a trap composed of 68 places in 138 ms of which 2 ms to minimize.
[2024-06-01 13:09:57] [INFO ] Deduced a trap composed of 66 places in 143 ms of which 2 ms to minimize.
[2024-06-01 13:09:57] [INFO ] Deduced a trap composed of 65 places in 142 ms of which 2 ms to minimize.
[2024-06-01 13:09:58] [INFO ] Deduced a trap composed of 64 places in 177 ms of which 2 ms to minimize.
[2024-06-01 13:09:58] [INFO ] Deduced a trap composed of 64 places in 259 ms of which 3 ms to minimize.
[2024-06-01 13:09:58] [INFO ] Deduced a trap composed of 65 places in 235 ms of which 2 ms to minimize.
[2024-06-01 13:09:58] [INFO ] Deduced a trap composed of 65 places in 197 ms of which 3 ms to minimize.
SMT process timed out in 31274ms, After SMT, problems are : Problem set: 0 solved, 1101 unsolved
Search for dead transitions found 0 dead transitions in 31294ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32701 ms. Remains : 121/121 places, 1111/1111 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 297 edges and 121 vertex of which 58 / 121 are part of one of the 10 SCC in 6 ms
Free SCC test removed 48 places
Drop transitions (Empty/Sink Transition effects.) removed 294 transitions
Ensure Unique test removed 468 transitions
Reduce isomorphic transitions removed 762 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 73 transition count 348
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 72 transition count 347
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5 place count 71 transition count 347
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 5 place count 71 transition count 346
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 7 place count 70 transition count 346
Drop transitions (Redundant composition of simpler transitions.) removed 247 transitions
Redundant transition composition rules discarded 247 transitions
Iterating global reduction 3 with 247 rules applied. Total rules applied 254 place count 70 transition count 99
Applied a total of 254 rules in 78 ms. Remains 70 /121 variables (removed 51) and now considering 99/1111 (removed 1012) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 99 rows 70 cols
[2024-06-01 13:09:58] [INFO ] Computed 11 invariants in 2 ms
[2024-06-01 13:09:59] [INFO ] After 72ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-06-01 13:09:59] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2024-06-01 13:09:59] [INFO ] After 124ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
TRAPS : Iteration 0
[2024-06-01 13:09:59] [INFO ] After 205ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
[2024-06-01 13:09:59] [INFO ] After 359ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Over-approximation ignoring read arcs solved 0 properties in 554 ms.
[2024-06-01 13:09:59] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 9 ms.
[2024-06-01 13:09:59] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 121 places, 1111 transitions and 4444 arcs took 21 ms.
[2024-06-01 13:09:59] [INFO ] Flatten gal took : 210 ms
Total runtime 53005 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : TokenRing-PT-010-ReachabilityCardinality-2024-08
Could not compute solution for formula : TokenRing-PT-010-ReachabilityCardinality-2024-12
Could not compute solution for formula : TokenRing-PT-010-ReachabilityCardinality-2024-13

BK_STOP 1717247400353

--------------------
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 ReachabilityCardinality -timeout 360 -rebuildPNML
mcc2024
rfs formula name TokenRing-PT-010-ReachabilityCardinality-2024-08
rfs formula type AG
rfs formula formula --invariant=/tmp/784/inv_0_
rfs formula name TokenRing-PT-010-ReachabilityCardinality-2024-12
rfs formula type AG
rfs formula formula --invariant=/tmp/784/inv_1_
rfs formula name TokenRing-PT-010-ReachabilityCardinality-2024-13
rfs formula type EF
rfs formula formula --invariant=/tmp/784/inv_2_
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="ReachabilityCardinality"
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 ReachabilityCardinality"
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-171690573700166"
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 [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;