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.r113-smll-171624275000462.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 DNAwalker-PT-12ringLLLarge, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r113-smll-171624275000462
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 552K
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K May 19 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 15:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 19 07:16 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.3K Apr 13 13:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 84K Apr 13 13:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Apr 13 13:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K Apr 13 13:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:39 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 14 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 135K May 18 16:42 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 DNAwalker-PT-12ringLLLarge-ReachabilityCardinality-2024-00
FORMULA_NAME DNAwalker-PT-12ringLLLarge-ReachabilityCardinality-2024-01
FORMULA_NAME DNAwalker-PT-12ringLLLarge-ReachabilityCardinality-2024-02
FORMULA_NAME DNAwalker-PT-12ringLLLarge-ReachabilityCardinality-2024-03
FORMULA_NAME DNAwalker-PT-12ringLLLarge-ReachabilityCardinality-2024-04
FORMULA_NAME DNAwalker-PT-12ringLLLarge-ReachabilityCardinality-2024-05
FORMULA_NAME DNAwalker-PT-12ringLLLarge-ReachabilityCardinality-2024-06
FORMULA_NAME DNAwalker-PT-12ringLLLarge-ReachabilityCardinality-2024-07
FORMULA_NAME DNAwalker-PT-12ringLLLarge-ReachabilityCardinality-2024-08
FORMULA_NAME DNAwalker-PT-12ringLLLarge-ReachabilityCardinality-2024-09
FORMULA_NAME DNAwalker-PT-12ringLLLarge-ReachabilityCardinality-2024-10
FORMULA_NAME DNAwalker-PT-12ringLLLarge-ReachabilityCardinality-2024-11
FORMULA_NAME DNAwalker-PT-12ringLLLarge-ReachabilityCardinality-2024-12
FORMULA_NAME DNAwalker-PT-12ringLLLarge-ReachabilityCardinality-2024-13
FORMULA_NAME DNAwalker-PT-12ringLLLarge-ReachabilityCardinality-2024-14
FORMULA_NAME DNAwalker-PT-12ringLLLarge-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716518668293

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DNAwalker-PT-12ringLLLarge
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-24 02:44:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-24 02:44:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 02:44:30] [INFO ] Load time of PNML (sax parser for PT used): 186 ms
[2024-05-24 02:44:30] [INFO ] Transformed 33 places.
[2024-05-24 02:44:30] [INFO ] Transformed 312 transitions.
[2024-05-24 02:44:30] [INFO ] Parsed PT model containing 33 places and 312 transitions and 916 arcs in 408 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 42 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (3089 resets) in 3063 ms. (13 steps per ms) remains 13/16 properties
FORMULA DNAwalker-PT-12ringLLLarge-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DNAwalker-PT-12ringLLLarge-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DNAwalker-PT-12ringLLLarge-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (227 resets) in 479 ms. (83 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (233 resets) in 203 ms. (196 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (199 resets) in 170 ms. (233 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40000 steps (500 resets) in 142 ms. (279 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (221 resets) in 92 ms. (430 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (193 resets) in 101 ms. (392 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (232 resets) in 101 ms. (392 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (231 resets) in 377 ms. (105 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (244 resets) in 556 ms. (71 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (427 resets) in 387 ms. (103 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (240 resets) in 1065 ms. (37 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (229 resets) in 164 ms. (242 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (192 resets) in 83 ms. (476 steps per ms) remains 13/13 properties
[2024-05-24 02:44:33] [INFO ] Flow matrix only has 311 transitions (discarded 1 similar events)
// Phase 1: matrix 311 rows 33 cols
[2024-05-24 02:44:33] [INFO ] Computed 0 invariants in 23 ms
[2024-05-24 02:44:33] [INFO ] State equation strengthened by 71 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Problem DNAwalker-PT-12ringLLLarge-ReachabilityCardinality-2024-02 is UNSAT
FORMULA DNAwalker-PT-12ringLLLarge-ReachabilityCardinality-2024-02 FALSE TECHNIQUES SMT_REFINEMENT
Problem DNAwalker-PT-12ringLLLarge-ReachabilityCardinality-2024-05 is UNSAT
FORMULA DNAwalker-PT-12ringLLLarge-ReachabilityCardinality-2024-05 FALSE TECHNIQUES SMT_REFINEMENT
Problem DNAwalker-PT-12ringLLLarge-ReachabilityCardinality-2024-08 is UNSAT
FORMULA DNAwalker-PT-12ringLLLarge-ReachabilityCardinality-2024-08 FALSE TECHNIQUES SMT_REFINEMENT
Problem DNAwalker-PT-12ringLLLarge-ReachabilityCardinality-2024-14 is UNSAT
FORMULA DNAwalker-PT-12ringLLLarge-ReachabilityCardinality-2024-14 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (OVERLAPS) 310/342 variables, 32/32 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/342 variables, 70/102 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/342 variables, 0/102 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 1/343 variables, 1/103 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/343 variables, 0/103 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 1/344 variables, 1/104 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/344 variables, 0/104 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 0/344 variables, 0/104 constraints. Problems are: Problem set: 4 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 344/344 variables, and 104 constraints, problems are : Problem set: 4 solved, 9 unsolved in 1473 ms.
Refiners :[State Equation: 33/33 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 307/337 variables, 30/30 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/337 variables, 70/100 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/337 variables, 2/102 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/337 variables, 0/102 constraints. Problems are: Problem set: 4 solved, 9 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 343/344 variables, and 105 constraints, problems are : Problem set: 4 solved, 9 unsolved in 5012 ms.
Refiners :[State Equation: 33/33 constraints, ReadFeed: 70/71 constraints, PredecessorRefiner: 2/13 constraints, Known Traps: 0/0 constraints]
After SMT, in 6765ms problems are : Problem set: 4 solved, 9 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 30 out of 33 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 33/33 places, 312/312 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 33 transition count 309
Applied a total of 3 rules in 37 ms. Remains 33 /33 variables (removed 0) and now considering 309/312 (removed 3) transitions.
Running 280 sub problems to find dead transitions.
// Phase 1: matrix 309 rows 33 cols
[2024-05-24 02:44:39] [INFO ] Computed 0 invariants in 8 ms
[2024-05-24 02:44:39] [INFO ] State equation strengthened by 70 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 1 (OVERLAPS) 304/331 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/331 variables, 70/97 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/331 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 4 (OVERLAPS) 11/342 variables, 6/103 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/342 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 6 (OVERLAPS) 0/342 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 280 unsolved
No progress, stopping.
After SMT solving in domain Real declared 342/342 variables, and 103 constraints, problems are : Problem set: 0 solved, 280 unsolved in 15402 ms.
Refiners :[State Equation: 33/33 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 280/280 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 280 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 1 (OVERLAPS) 304/331 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/331 variables, 70/97 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/331 variables, 280/377 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/331 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 5 (OVERLAPS) 11/342 variables, 6/383 constraints. Problems are: Problem set: 0 solved, 280 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 342/342 variables, and 383 constraints, problems are : Problem set: 0 solved, 280 unsolved in 20037 ms.
Refiners :[State Equation: 33/33 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 280/280 constraints, Known Traps: 0/0 constraints]
After SMT, in 36198ms problems are : Problem set: 0 solved, 280 unsolved
Search for dead transitions found 0 dead transitions in 36228ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36297 ms. Remains : 33/33 places, 309/312 transitions.
RANDOM walk for 40000 steps (3092 resets) in 518 ms. (77 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (223 resets) in 126 ms. (314 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (233 resets) in 90 ms. (439 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (537 resets) in 84 ms. (470 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (218 resets) in 75 ms. (526 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (223 resets) in 71 ms. (555 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (246 resets) in 151 ms. (263 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (465 resets) in 215 ms. (185 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (230 resets) in 233 ms. (170 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (224 resets) in 95 ms. (416 steps per ms) remains 9/9 properties
Interrupted probabilistic random walk after 581022 steps, run timeout after 3001 ms. (steps per millisecond=193 ) properties seen :0 out of 9
Probabilistic random walk after 581022 steps, saw 88763 distinct states, run finished after 3020 ms. (steps per millisecond=192 ) properties seen :0
[2024-05-24 02:45:19] [INFO ] Invariant cache hit.
[2024-05-24 02:45:19] [INFO ] State equation strengthened by 70 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 307/337 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/337 variables, 70/100 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/337 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 5/342 variables, 3/103 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/342 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 0/342 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 342/342 variables, and 103 constraints, problems are : Problem set: 0 solved, 9 unsolved in 731 ms.
Refiners :[State Equation: 33/33 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 307/337 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/337 variables, 70/100 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/337 variables, 2/102 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/337 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 342/342 variables, and 105 constraints, problems are : Problem set: 0 solved, 9 unsolved in 45006 ms.
Refiners :[State Equation: 33/33 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 2/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 45774ms problems are : Problem set: 0 solved, 9 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 30 out of 33 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 33/33 places, 309/309 transitions.
Applied a total of 0 rules in 11 ms. Remains 33 /33 variables (removed 0) and now considering 309/309 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 33/33 places, 309/309 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 33/33 places, 309/309 transitions.
Applied a total of 0 rules in 9 ms. Remains 33 /33 variables (removed 0) and now considering 309/309 (removed 0) transitions.
[2024-05-24 02:46:05] [INFO ] Invariant cache hit.
[2024-05-24 02:46:05] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-05-24 02:46:05] [INFO ] Invariant cache hit.
[2024-05-24 02:46:05] [INFO ] State equation strengthened by 70 read => feed constraints.
[2024-05-24 02:46:05] [INFO ] Implicit Places using invariants and state equation in 189 ms returned []
Implicit Place search using SMT with State Equation took 247 ms to find 0 implicit places.
[2024-05-24 02:46:05] [INFO ] Redundant transitions in 19 ms returned []
Running 280 sub problems to find dead transitions.
[2024-05-24 02:46:05] [INFO ] Invariant cache hit.
[2024-05-24 02:46:05] [INFO ] State equation strengthened by 70 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 1 (OVERLAPS) 304/331 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/331 variables, 70/97 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/331 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 4 (OVERLAPS) 11/342 variables, 6/103 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/342 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 6 (OVERLAPS) 0/342 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 280 unsolved
No progress, stopping.
After SMT solving in domain Real declared 342/342 variables, and 103 constraints, problems are : Problem set: 0 solved, 280 unsolved in 19174 ms.
Refiners :[State Equation: 33/33 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 280/280 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 280 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 1 (OVERLAPS) 304/331 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/331 variables, 70/97 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/331 variables, 280/377 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/331 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 5 (OVERLAPS) 11/342 variables, 6/383 constraints. Problems are: Problem set: 0 solved, 280 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 342/342 variables, and 383 constraints, problems are : Problem set: 0 solved, 280 unsolved in 30021 ms.
Refiners :[State Equation: 33/33 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 280/280 constraints, Known Traps: 0/0 constraints]
After SMT, in 49505ms problems are : Problem set: 0 solved, 280 unsolved
Search for dead transitions found 0 dead transitions in 49509ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49799 ms. Remains : 33/33 places, 309/309 transitions.
[2024-05-24 02:46:55] [INFO ] Export to MCC of 9 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 8 ms.
[2024-05-24 02:46:55] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 33 places, 309 transitions and 911 arcs took 12 ms.
[2024-05-24 02:46:55] [INFO ] Flatten gal took : 74 ms
Total runtime 145503 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running DNAwalker-PT-12ringLLLarge

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/410/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 33
TRANSITIONS: 309
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.008s, Sys 0.000s]


SAVING FILE /home/mcc/execution/410/model (.net / .def) ...
EXPORT TIME: [User 0.001s, 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: 573
MODEL NAME: /home/mcc/execution/410/model
33 places, 309 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 DNAwalker-PT-12ringLLLarge-ReachabilityCardinality-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA DNAwalker-PT-12ringLLLarge-ReachabilityCardinality-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA DNAwalker-PT-12ringLLLarge-ReachabilityCardinality-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA DNAwalker-PT-12ringLLLarge-ReachabilityCardinality-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA DNAwalker-PT-12ringLLLarge-ReachabilityCardinality-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA DNAwalker-PT-12ringLLLarge-ReachabilityCardinality-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA DNAwalker-PT-12ringLLLarge-ReachabilityCardinality-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA DNAwalker-PT-12ringLLLarge-ReachabilityCardinality-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA DNAwalker-PT-12ringLLLarge-ReachabilityCardinality-2024-12 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716518822984

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

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

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="DNAwalker-PT-12ringLLLarge"
export BK_EXAMINATION="ReachabilityCardinality"
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 DNAwalker-PT-12ringLLLarge, 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 r113-smll-171624275000462"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DNAwalker-PT-12ringLLLarge.tgz
mv DNAwalker-PT-12ringLLLarge 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 ;