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-171624275100503.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-17redondantChoiceL, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r113-smll-171624275100503
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 696K
-rw-r--r-- 1 mcc users 6.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 69K 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 4.0K Apr 22 14:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:39 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:13 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 13 13:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 118K Apr 13 13:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 13 13:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K Apr 13 13:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 22 14:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K 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 19 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 211K 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-17redondantChoiceL-ReachabilityFireability-2024-00
FORMULA_NAME DNAwalker-PT-17redondantChoiceL-ReachabilityFireability-2024-01
FORMULA_NAME DNAwalker-PT-17redondantChoiceL-ReachabilityFireability-2024-02
FORMULA_NAME DNAwalker-PT-17redondantChoiceL-ReachabilityFireability-2024-03
FORMULA_NAME DNAwalker-PT-17redondantChoiceL-ReachabilityFireability-2024-04
FORMULA_NAME DNAwalker-PT-17redondantChoiceL-ReachabilityFireability-2024-05
FORMULA_NAME DNAwalker-PT-17redondantChoiceL-ReachabilityFireability-2024-06
FORMULA_NAME DNAwalker-PT-17redondantChoiceL-ReachabilityFireability-2024-07
FORMULA_NAME DNAwalker-PT-17redondantChoiceL-ReachabilityFireability-2024-08
FORMULA_NAME DNAwalker-PT-17redondantChoiceL-ReachabilityFireability-2024-09
FORMULA_NAME DNAwalker-PT-17redondantChoiceL-ReachabilityFireability-2024-10
FORMULA_NAME DNAwalker-PT-17redondantChoiceL-ReachabilityFireability-2024-11
FORMULA_NAME DNAwalker-PT-17redondantChoiceL-ReachabilityFireability-2024-12
FORMULA_NAME DNAwalker-PT-17redondantChoiceL-ReachabilityFireability-2024-13
FORMULA_NAME DNAwalker-PT-17redondantChoiceL-ReachabilityFireability-2024-14
FORMULA_NAME DNAwalker-PT-17redondantChoiceL-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716561197568

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DNAwalker-PT-17redondantChoiceL
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-24 14:33:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-24 14:33:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 14:33:20] [INFO ] Load time of PNML (sax parser for PT used): 214 ms
[2024-05-24 14:33:20] [INFO ] Transformed 43 places.
[2024-05-24 14:33:20] [INFO ] Transformed 490 transitions.
[2024-05-24 14:33:20] [INFO ] Parsed PT model containing 43 places and 490 transitions and 1438 arcs in 445 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 38 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (1537 resets) in 3373 ms. (11 steps per ms) remains 10/16 properties
FORMULA DNAwalker-PT-17redondantChoiceL-ReachabilityFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DNAwalker-PT-17redondantChoiceL-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DNAwalker-PT-17redondantChoiceL-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DNAwalker-PT-17redondantChoiceL-ReachabilityFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DNAwalker-PT-17redondantChoiceL-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DNAwalker-PT-17redondantChoiceL-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (103 resets) in 483 ms. (82 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (107 resets) in 1781 ms. (22 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (114 resets) in 250 ms. (159 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (116 resets) in 237 ms. (168 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (104 resets) in 174 ms. (228 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (110 resets) in 266 ms. (149 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (102 resets) in 175 ms. (227 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (106 resets) in 119 ms. (333 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (112 resets) in 223 ms. (178 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (101 resets) in 186 ms. (213 steps per ms) remains 10/10 properties
[2024-05-24 14:33:22] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
// Phase 1: matrix 489 rows 43 cols
[2024-05-24 14:33:22] [INFO ] Computed 0 invariants in 19 ms
[2024-05-24 14:33:22] [INFO ] State equation strengthened by 161 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Problem DNAwalker-PT-17redondantChoiceL-ReachabilityFireability-2024-07 is UNSAT
FORMULA DNAwalker-PT-17redondantChoiceL-ReachabilityFireability-2024-07 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (OVERLAPS) 484/523 variables, 39/39 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/523 variables, 160/199 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/523 variables, 0/199 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 8/531 variables, 4/203 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/531 variables, 0/203 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 1/532 variables, 1/204 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/532 variables, 0/204 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 0/532 variables, 0/204 constraints. Problems are: Problem set: 1 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 532/532 variables, and 204 constraints, problems are : Problem set: 1 solved, 9 unsolved in 4490 ms.
Refiners :[State Equation: 43/43 constraints, ReadFeed: 161/161 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 9 unsolved
[2024-05-24 14:33:28] [INFO ] Deduced a trap composed of 1 places in 53 ms of which 17 ms to minimize.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 484/523 variables, 39/40 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/523 variables, 160/200 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/523 variables, 9/209 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/523 variables, 0/209 constraints. Problems are: Problem set: 1 solved, 9 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 531/532 variables, and 213 constraints, problems are : Problem set: 1 solved, 9 unsolved in 5009 ms.
Refiners :[State Equation: 43/43 constraints, ReadFeed: 160/161 constraints, PredecessorRefiner: 9/10 constraints, Known Traps: 1/1 constraints]
After SMT, in 10596ms problems are : Problem set: 1 solved, 9 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 39 out of 43 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 43/43 places, 490/490 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 43 transition count 484
Applied a total of 6 rules in 39 ms. Remains 43 /43 variables (removed 0) and now considering 484/490 (removed 6) transitions.
Running 464 sub problems to find dead transitions.
// Phase 1: matrix 484 rows 43 cols
[2024-05-24 14:33:33] [INFO ] Computed 0 invariants in 8 ms
[2024-05-24 14:33:33] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 1 (OVERLAPS) 478/511 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/511 variables, 160/193 constraints. Problems are: Problem set: 0 solved, 464 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/511 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 4 (OVERLAPS) 16/527 variables, 10/203 constraints. Problems are: Problem set: 0 solved, 464 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 527/527 variables, and 203 constraints, problems are : Problem set: 0 solved, 464 unsolved in 20030 ms.
Refiners :[State Equation: 43/43 constraints, ReadFeed: 160/160 constraints, PredecessorRefiner: 464/464 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 464 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 1 (OVERLAPS) 478/511 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/511 variables, 160/193 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/511 variables, 464/657 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/511 variables, 0/657 constraints. Problems are: Problem set: 0 solved, 464 unsolved
SMT process timed out in 40949ms, After SMT, problems are : Problem set: 0 solved, 464 unsolved
Search for dead transitions found 0 dead transitions in 40959ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41022 ms. Remains : 43/43 places, 484/490 transitions.
RANDOM walk for 40000 steps (1457 resets) in 736 ms. (54 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (110 resets) in 343 ms. (116 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (110 resets) in 383 ms. (104 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (113 resets) in 248 ms. (160 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (118 resets) in 287 ms. (138 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (103 resets) in 277 ms. (143 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (96 resets) in 198 ms. (201 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (106 resets) in 134 ms. (296 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (115 resets) in 276 ms. (144 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (102 resets) in 207 ms. (192 steps per ms) remains 9/9 properties
Interrupted probabilistic random walk after 360030 steps, run timeout after 3001 ms. (steps per millisecond=119 ) properties seen :0 out of 9
Probabilistic random walk after 360030 steps, saw 55535 distinct states, run finished after 3008 ms. (steps per millisecond=119 ) properties seen :0
[2024-05-24 14:34:18] [INFO ] Invariant cache hit.
[2024-05-24 14:34:18] [INFO ] State equation strengthened by 160 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 484/523 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/523 variables, 160/199 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/523 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 4/527 variables, 4/203 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/527 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 0/527 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 527/527 variables, and 203 constraints, problems are : Problem set: 0 solved, 9 unsolved in 4601 ms.
Refiners :[State Equation: 43/43 constraints, ReadFeed: 160/160 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
[2024-05-24 14:34:23] [INFO ] Deduced a trap composed of 1 places in 19 ms of which 2 ms to minimize.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 484/523 variables, 39/40 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/523 variables, 160/200 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/523 variables, 9/209 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/523 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 527/527 variables, and 213 constraints, problems are : Problem set: 0 solved, 9 unsolved in 45009 ms.
Refiners :[State Equation: 43/43 constraints, ReadFeed: 160/160 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 1/1 constraints]
After SMT, in 49874ms problems are : Problem set: 0 solved, 9 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 39 out of 43 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 43/43 places, 484/484 transitions.
Applied a total of 0 rules in 21 ms. Remains 43 /43 variables (removed 0) and now considering 484/484 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 43/43 places, 484/484 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 43/43 places, 484/484 transitions.
Applied a total of 0 rules in 13 ms. Remains 43 /43 variables (removed 0) and now considering 484/484 (removed 0) transitions.
[2024-05-24 14:35:08] [INFO ] Invariant cache hit.
[2024-05-24 14:35:08] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-05-24 14:35:08] [INFO ] Invariant cache hit.
[2024-05-24 14:35:08] [INFO ] State equation strengthened by 160 read => feed constraints.
[2024-05-24 14:35:08] [INFO ] Implicit Places using invariants and state equation in 232 ms returned []
Implicit Place search using SMT with State Equation took 266 ms to find 0 implicit places.
[2024-05-24 14:35:08] [INFO ] Redundant transitions in 38 ms returned []
Running 464 sub problems to find dead transitions.
[2024-05-24 14:35:08] [INFO ] Invariant cache hit.
[2024-05-24 14:35:08] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 1 (OVERLAPS) 478/511 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/511 variables, 160/193 constraints. Problems are: Problem set: 0 solved, 464 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/511 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 4 (OVERLAPS) 16/527 variables, 10/203 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/527 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 464 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 527/527 variables, and 203 constraints, problems are : Problem set: 0 solved, 464 unsolved in 30019 ms.
Refiners :[State Equation: 43/43 constraints, ReadFeed: 160/160 constraints, PredecessorRefiner: 464/464 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 464 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 1 (OVERLAPS) 478/511 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/511 variables, 160/193 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/511 variables, 464/657 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/511 variables, 0/657 constraints. Problems are: Problem set: 0 solved, 464 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 527/527 variables, and 667 constraints, problems are : Problem set: 0 solved, 464 unsolved in 30034 ms.
Refiners :[State Equation: 43/43 constraints, ReadFeed: 160/160 constraints, PredecessorRefiner: 464/464 constraints, Known Traps: 0/0 constraints]
After SMT, in 60541ms problems are : Problem set: 0 solved, 464 unsolved
Search for dead transitions found 0 dead transitions in 60546ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60873 ms. Remains : 43/43 places, 484/484 transitions.
[2024-05-24 14:36:09] [INFO ] Export to MCC of 9 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 10 ms.
[2024-05-24 14:36:09] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 43 places, 484 transitions and 1430 arcs took 11 ms.
[2024-05-24 14:36:09] [INFO ] Flatten gal took : 86 ms
Total runtime 169616 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running DNAwalker-PT-17redondantChoiceL

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: 43
TRANSITIONS: 484
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.012s, Sys 0.000s]


SAVING FILE /home/mcc/execution/412/model (.net / .def) ...
EXPORT TIME: [User 0.002s, 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: 590
MODEL NAME: /home/mcc/execution/412/model
43 places, 484 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-17redondantChoiceL-ReachabilityFireability-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA DNAwalker-PT-17redondantChoiceL-ReachabilityFireability-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA DNAwalker-PT-17redondantChoiceL-ReachabilityFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA DNAwalker-PT-17redondantChoiceL-ReachabilityFireability-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA DNAwalker-PT-17redondantChoiceL-ReachabilityFireability-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA DNAwalker-PT-17redondantChoiceL-ReachabilityFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA DNAwalker-PT-17redondantChoiceL-ReachabilityFireability-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA DNAwalker-PT-17redondantChoiceL-ReachabilityFireability-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA DNAwalker-PT-17redondantChoiceL-ReachabilityFireability-2024-14 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716561468237

--------------------
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 ReachabilityFireability -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-17redondantChoiceL"
export BK_EXAMINATION="ReachabilityFireability"
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-17redondantChoiceL, examination is ReachabilityFireability"
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-171624275100503"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DNAwalker-PT-17redondantChoiceL.tgz
mv DNAwalker-PT-17redondantChoiceL execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;