Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r047-tajo-171620397800263.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is BridgeAndVehicles-PT-V50P50N20, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r047-tajo-171620397800263
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 8.1M
-rw-r--r-- 1 mcc users 19K Apr 13 02:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 105K Apr 13 02:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 72K Apr 13 02:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 298K Apr 13 02:05 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 17K Apr 22 14:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Apr 22 14:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 65K Apr 22 14:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 209K Apr 22 14:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 26K Apr 13 03:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 157K Apr 13 03:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 1.1M Apr 13 03:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 4.0M Apr 13 03:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.8K Apr 22 14:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 10 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 2.0M 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 BridgeAndVehicles-PT-V50P50N20-ReachabilityFireability-2024-00
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-ReachabilityFireability-2024-01
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-ReachabilityFireability-2024-02
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-ReachabilityFireability-2024-03
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-ReachabilityFireability-2024-04
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-ReachabilityFireability-2024-05
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-ReachabilityFireability-2024-06
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-ReachabilityFireability-2024-07
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-ReachabilityFireability-2024-08
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-ReachabilityFireability-2024-09
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-ReachabilityFireability-2024-10
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-ReachabilityFireability-2024-11
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-ReachabilityFireability-2024-12
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-ReachabilityFireability-2024-13
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-ReachabilityFireability-2024-14
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716289181988

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BridgeAndVehicles-PT-V50P50N20
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 10:59:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-21 10:59:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 10:59:44] [INFO ] Load time of PNML (sax parser for PT used): 221 ms
[2024-05-21 10:59:44] [INFO ] Transformed 138 places.
[2024-05-21 10:59:44] [INFO ] Transformed 2348 transitions.
[2024-05-21 10:59:44] [INFO ] Parsed PT model containing 138 places and 2348 transitions and 18090 arcs in 367 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 124 ms.
Working with output stream class java.io.PrintStream
FORMULA BridgeAndVehicles-PT-V50P50N20-ReachabilityFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V50P50N20-ReachabilityFireability-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40001 steps (92 resets) in 6509 ms. (6 steps per ms) remains 9/14 properties
FORMULA BridgeAndVehicles-PT-V50P50N20-ReachabilityFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V50P50N20-ReachabilityFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V50P50N20-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V50P50N20-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V50P50N20-ReachabilityFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (29 resets) in 2033 ms. (19 steps per ms) remains 9/9 properties
BEST_FIRST walk for 34215 steps (31 resets) in 17298 ms. (1 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (37 resets) in 9875 ms. (4 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (30 resets) in 8396 ms. (4 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (36 resets) in 1668 ms. (23 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (34 resets) in 2020 ms. (19 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (36 resets) in 2065 ms. (19 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (32 resets) in 1796 ms. (22 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (35 resets) in 2003 ms. (19 steps per ms) remains 9/9 properties
[2024-05-21 11:00:01] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 138 cols
[2024-05-21 11:00:01] [INFO ] Computed 7 invariants in 27 ms
[2024-05-21 11:00:01] [INFO ] State equation strengthened by 42 read => feed constraints.
Problem BridgeAndVehicles-PT-V50P50N20-ReachabilityFireability-2024-03 is UNSAT
FORMULA BridgeAndVehicles-PT-V50P50N20-ReachabilityFireability-2024-03 TRUE TECHNIQUES SMT_REFINEMENT
Problem BridgeAndVehicles-PT-V50P50N20-ReachabilityFireability-2024-05 is UNSAT
FORMULA BridgeAndVehicles-PT-V50P50N20-ReachabilityFireability-2024-05 FALSE TECHNIQUES SMT_REFINEMENT
Problem BridgeAndVehicles-PT-V50P50N20-ReachabilityFireability-2024-06 is UNSAT
FORMULA BridgeAndVehicles-PT-V50P50N20-ReachabilityFireability-2024-06 TRUE TECHNIQUES SMT_REFINEMENT
Problem BridgeAndVehicles-PT-V50P50N20-ReachabilityFireability-2024-08 is UNSAT
FORMULA BridgeAndVehicles-PT-V50P50N20-ReachabilityFireability-2024-08 FALSE TECHNIQUES SMT_REFINEMENT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 5/5 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 0/5 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 2/138 variables, 2/7 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 0/7 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 290/428 variables, 138/145 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/428 variables, 42/187 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/428 variables, 0/187 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/428 variables, 0/187 constraints. Problems are: Problem set: 4 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 428/428 variables, and 187 constraints, problems are : Problem set: 4 solved, 5 unsolved in 2014 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 138/138 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 1/1 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 0/1 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 44/138 variables, 6/7 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 0/7 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 290/428 variables, 138/145 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/428 variables, 42/187 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/428 variables, 5/192 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/428 variables, 0/192 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 0/428 variables, 0/192 constraints. Problems are: Problem set: 4 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 428/428 variables, and 192 constraints, problems are : Problem set: 4 solved, 5 unsolved in 3643 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 138/138 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 5/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 18451ms problems are : Problem set: 4 solved, 5 unsolved
Parikh walk visited 0 properties in 8736 ms.
Support contains 94 out of 138 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 138/138 places, 2348/2348 transitions.
Graph (complete) has 1302 edges and 138 vertex of which 136 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.10 ms
Discarding 2 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 341 ms. Remains 136 /138 variables (removed 2) and now considering 2348/2348 (removed 0) transitions.
Running 2345 sub problems to find dead transitions.
[2024-05-21 11:00:28] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 136 cols
[2024-05-21 11:00:28] [INFO ] Computed 5 invariants in 5 ms
[2024-05-21 11:00:29] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2345 unsolved
[2024-05-21 11:00:59] [INFO ] Deduced a trap composed of 5 places in 492 ms of which 22 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 136/426 variables, and 6 constraints, problems are : Problem set: 0 solved, 2345 unsolved in 20088 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/136 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 2345/2345 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2345 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2345 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2345 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 136/426 variables, and 6 constraints, problems are : Problem set: 0 solved, 2345 unsolved in 20049 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/136 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 0/2345 constraints, Known Traps: 1/1 constraints]
After SMT, in 58576ms problems are : Problem set: 0 solved, 2345 unsolved
Search for dead transitions found 0 dead transitions in 58619ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59009 ms. Remains : 136/138 places, 2348/2348 transitions.
RANDOM walk for 40000 steps (92 resets) in 1066 ms. (37 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (29 resets) in 584 ms. (68 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (35 resets) in 219 ms. (181 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (36 resets) in 261 ms. (152 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (32 resets) in 222 ms. (179 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (34 resets) in 357 ms. (111 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 213936 steps, run timeout after 3001 ms. (steps per millisecond=71 ) properties seen :0 out of 5
Probabilistic random walk after 213936 steps, saw 57184 distinct states, run finished after 3005 ms. (steps per millisecond=71 ) properties seen :0
[2024-05-21 11:01:31] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2024-05-21 11:01:31] [INFO ] Invariant cache hit.
[2024-05-21 11:01:31] [INFO ] State equation strengthened by 42 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 41/135 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 290/425 variables, 135/140 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/425 variables, 42/182 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/425 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 1/426 variables, 1/183 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/426 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 0/426 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 426/426 variables, and 183 constraints, problems are : Problem set: 0 solved, 5 unsolved in 860 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 136/136 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 41/135 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-21 11:01:33] [INFO ] Deduced a trap composed of 5 places in 256 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 290/425 variables, 135/141 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/425 variables, 42/183 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/425 variables, 5/188 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/425 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 1/426 variables, 1/189 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/426 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 0/426 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 426/426 variables, and 189 constraints, problems are : Problem set: 0 solved, 5 unsolved in 4116 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 136/136 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 1/1 constraints]
After SMT, in 5129ms problems are : Problem set: 0 solved, 5 unsolved
Parikh walk visited 0 properties in 4098 ms.
Support contains 94 out of 136 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 136/136 places, 2348/2348 transitions.
Applied a total of 0 rules in 209 ms. Remains 136 /136 variables (removed 0) and now considering 2348/2348 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 212 ms. Remains : 136/136 places, 2348/2348 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 136/136 places, 2348/2348 transitions.
Applied a total of 0 rules in 216 ms. Remains 136 /136 variables (removed 0) and now considering 2348/2348 (removed 0) transitions.
[2024-05-21 11:01:41] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2024-05-21 11:01:41] [INFO ] Invariant cache hit.
[2024-05-21 11:01:41] [INFO ] Implicit Places using invariants in 130 ms returned []
[2024-05-21 11:01:41] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2024-05-21 11:01:41] [INFO ] Invariant cache hit.
[2024-05-21 11:01:41] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-21 11:01:41] [INFO ] Implicit Places using invariants and state equation in 508 ms returned []
Implicit Place search using SMT with State Equation took 645 ms to find 0 implicit places.
[2024-05-21 11:01:42] [INFO ] Redundant transitions in 147 ms returned []
Running 2345 sub problems to find dead transitions.
[2024-05-21 11:01:42] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2024-05-21 11:01:42] [INFO ] Invariant cache hit.
[2024-05-21 11:01:42] [INFO ] State equation strengthened by 42 read => feed constraints.
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running BridgeAndVehicles-PT-V50P50N20

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 138
TRANSITIONS: 2348
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.148s, Sys 0.026s]


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


----------------------------------------------------------------------
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: 610
MODEL NAME: /home/mcc/execution/model
138 places, 2348 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 BridgeAndVehicles-PT-V50P50N20-ReachabilityFireability-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-PT-V50P50N20-ReachabilityFireability-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-PT-V50P50N20-ReachabilityFireability-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-PT-V50P50N20-ReachabilityFireability-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-PT-V50P50N20-ReachabilityFireability-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-PT-V50P50N20-ReachabilityFireability-2024-12 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-PT-V50P50N20-ReachabilityFireability-2024-01 CANNOT_COMPUTE
FORMULA BridgeAndVehicles-PT-V50P50N20-ReachabilityFireability-2024-02 CANNOT_COMPUTE
FORMULA BridgeAndVehicles-PT-V50P50N20-ReachabilityFireability-2024-04 CANNOT_COMPUTE
FORMULA BridgeAndVehicles-PT-V50P50N20-ReachabilityFireability-2024-05 CANNOT_COMPUTE
FORMULA BridgeAndVehicles-PT-V50P50N20-ReachabilityFireability-2024-07 CANNOT_COMPUTE
FORMULA BridgeAndVehicles-PT-V50P50N20-ReachabilityFireability-2024-09 CANNOT_COMPUTE
FORMULA BridgeAndVehicles-PT-V50P50N20-ReachabilityFireability-2024-11 CANNOT_COMPUTE
FORMULA BridgeAndVehicles-PT-V50P50N20-ReachabilityFireability-2024-13 CANNOT_COMPUTE
FORMULA BridgeAndVehicles-PT-V50P50N20-ReachabilityFireability-2024-14 CANNOT_COMPUTE
FORMULA BridgeAndVehicles-PT-V50P50N20-ReachabilityFireability-2024-15 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716292009853

--------------------
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
MEDDLY ERROR: Insufficient memory

Error in allocating array of size 4194304 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BridgeAndVehicles-PT-V50P50N20"
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 BridgeAndVehicles-PT-V50P50N20, 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 r047-tajo-171620397800263"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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