fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r157-smll-171636265100143
Last Updated
July 7, 2024

About the Execution of GreatSPN+red for Echo-PT-d05r03

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
13524.119 1091275.00 3076249.00 1790.00 FTFTTTTTTFTTT?TT normal

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.r157-smll-171636265100143.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 Echo-PT-d05r03, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r157-smll-171636265100143
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.7M
-rw-r--r-- 1 mcc users 7.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K 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 5.9K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K May 19 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 19 15:52 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:18 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.3K Apr 12 04:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 67K Apr 12 04:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Apr 12 04:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 46K Apr 12 04:34 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 2.3M 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 Echo-PT-d05r03-ReachabilityFireability-2024-00
FORMULA_NAME Echo-PT-d05r03-ReachabilityFireability-2024-01
FORMULA_NAME Echo-PT-d05r03-ReachabilityFireability-2024-02
FORMULA_NAME Echo-PT-d05r03-ReachabilityFireability-2024-03
FORMULA_NAME Echo-PT-d05r03-ReachabilityFireability-2024-04
FORMULA_NAME Echo-PT-d05r03-ReachabilityFireability-2024-05
FORMULA_NAME Echo-PT-d05r03-ReachabilityFireability-2024-06
FORMULA_NAME Echo-PT-d05r03-ReachabilityFireability-2024-07
FORMULA_NAME Echo-PT-d05r03-ReachabilityFireability-2024-08
FORMULA_NAME Echo-PT-d05r03-ReachabilityFireability-2024-09
FORMULA_NAME Echo-PT-d05r03-ReachabilityFireability-2024-10
FORMULA_NAME Echo-PT-d05r03-ReachabilityFireability-2024-11
FORMULA_NAME Echo-PT-d05r03-ReachabilityFireability-2024-12
FORMULA_NAME Echo-PT-d05r03-ReachabilityFireability-2024-13
FORMULA_NAME Echo-PT-d05r03-ReachabilityFireability-2024-14
FORMULA_NAME Echo-PT-d05r03-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716477561275

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Echo-PT-d05r03
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-23 15:19:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-23 15:19:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 15:19:24] [INFO ] Load time of PNML (sax parser for PT used): 791 ms
[2024-05-23 15:19:24] [INFO ] Transformed 3717 places.
[2024-05-23 15:19:24] [INFO ] Transformed 3222 transitions.
[2024-05-23 15:19:24] [INFO ] Found NUPN structural information;
[2024-05-23 15:19:24] [INFO ] Parsed PT model containing 3717 places and 3222 transitions and 28404 arcs in 1076 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 40 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (80 resets) in 5855 ms. (6 steps per ms) remains 1/16 properties
FORMULA Echo-PT-d05r03-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Echo-PT-d05r03-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Echo-PT-d05r03-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Echo-PT-d05r03-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Echo-PT-d05r03-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Echo-PT-d05r03-ReachabilityFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Echo-PT-d05r03-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Echo-PT-d05r03-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Echo-PT-d05r03-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Echo-PT-d05r03-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Echo-PT-d05r03-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Echo-PT-d05r03-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Echo-PT-d05r03-ReachabilityFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Echo-PT-d05r03-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Echo-PT-d05r03-ReachabilityFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 855 ms. (46 steps per ms) remains 1/1 properties
// Phase 1: matrix 3222 rows 3717 cols
[2024-05-23 15:19:26] [INFO ] Computed 1863 invariants in 413 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 60/112 variables, 14/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 60/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 30/142 variables, 7/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/142 variables, 30/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/142 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 13/155 variables, 2/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/155 variables, 13/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/155 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1423/1578 variables, 398/576 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1578 variables, 1423/1999 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1578 variables, 0/1999 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 174/1752 variables, 109/2108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1752 variables, 174/2282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1752 variables, 0/2282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 36/1788 variables, 6/2288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1788 variables, 36/2324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1788 variables, 0/2324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 6/1794 variables, 1/2325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1794 variables, 6/2331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1794 variables, 0/2331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 1683/3477 variables, 1086/3417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/3477 variables, 1683/5100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/3477 variables, 0/5100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 62/3539 variables, 62/5162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/3539 variables, 62/5224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/3539 variables, 0/5224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 178/3717 variables, 178/5402 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/3717 variables, 178/5580 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/3717 variables, 0/5580 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SMT process timed out in 5720ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 52 out of 3717 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3717/3717 places, 3222/3222 transitions.
Graph (complete) has 19042 edges and 3717 vertex of which 3454 are kept as prefixes of interest. Removing 263 places using SCC suffix rule.36 ms
Discarding 263 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 3454 transition count 3212
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 3453 transition count 3211
Applied a total of 11 rules in 951 ms. Remains 3453 /3717 variables (removed 264) and now considering 3211/3222 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 967 ms. Remains : 3453/3717 places, 3211/3222 transitions.
RANDOM walk for 40000 steps (80 resets) in 2668 ms. (14 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 778 ms. (51 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 104574 steps, run timeout after 3001 ms. (steps per millisecond=34 ) properties seen :0 out of 1
Probabilistic random walk after 104574 steps, saw 72016 distinct states, run finished after 3006 ms. (steps per millisecond=34 ) properties seen :0
// Phase 1: matrix 3211 rows 3453 cols
[2024-05-23 15:19:48] [INFO ] Invariants computation overflowed in 11196 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 424/476 variables, 52/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/476 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 2650/3126 variables, 886/990 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3126 variables, 886/1876 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3126 variables, 0/1876 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2575/5701 variables, 1674/3550 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/5701 variables, 1674/5224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/5701 variables, 0/5224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 6593/6664 variables, and 5994 constraints, problems are : Problem set: 0 solved, 1 unsolved in 16589 ms.
Refiners :[Domain max(s): 2612/3453 constraints, State Equation: 3382/3453 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 424/476 variables, 52/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/476 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 2650/3126 variables, 886/990 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3126 variables, 886/1876 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3126 variables, 1/1877 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3126 variables, 0/1877 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2575/5701 variables, 1674/3551 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/5701 variables, 1674/5225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/5701 variables, 0/5225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 892/6593 variables, 770/5995 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/6593 variables, 770/6765 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/6593 variables, 0/6765 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 71/6664 variables, 71/6836 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/6664 variables, 71/6907 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/6664 variables, 0/6907 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/6664 variables, 0/6907 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 6664/6664 variables, and 6907 constraints, problems are : Problem set: 0 solved, 1 unsolved in 12897 ms.
Refiners :[Domain max(s): 3453/3453 constraints, State Equation: 3453/3453 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 40829ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 6 ms.
Support contains 52 out of 3453 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3453/3453 places, 3211/3211 transitions.
Applied a total of 0 rules in 376 ms. Remains 3453 /3453 variables (removed 0) and now considering 3211/3211 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 376 ms. Remains : 3453/3453 places, 3211/3211 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3453/3453 places, 3211/3211 transitions.
Applied a total of 0 rules in 319 ms. Remains 3453 /3453 variables (removed 0) and now considering 3211/3211 (removed 0) transitions.
// Phase 1: matrix 3211 rows 3453 cols
[2024-05-23 15:20:29] [INFO ] Invariants computation overflowed in 10938 ms
[2024-05-23 15:20:35] [INFO ] Implicit Places using invariants in 16827 ms returned []
// Phase 1: matrix 3211 rows 3453 cols
[2024-05-23 15:20:46] [INFO ] Invariants computation overflowed in 10491 ms
[2024-05-23 15:22:41] [INFO ] Performed 1/3453 implicitness test of which 0 returned IMPLICIT in 32 seconds.
[2024-05-23 15:23:13] [INFO ] Performed 3/3453 implicitness test of which 0 returned IMPLICIT in 64 seconds.
[2024-05-23 15:23:26] [INFO ] Implicit Places using invariants and state equation in 170537 ms returned []
Implicit Place search using SMT with State Equation took 187376 ms to find 0 implicit places.
[2024-05-23 15:23:26] [INFO ] Redundant transitions in 299 ms returned []
Running 3201 sub problems to find dead transitions.
// Phase 1: matrix 3211 rows 3453 cols
[2024-05-23 15:23:38] [INFO ] Invariants computation overflowed in 12136 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3453 variables, 3453/3453 constraints. Problems are: Problem set: 0 solved, 3201 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3453/6664 variables, and 3453 constraints, problems are : Problem set: 0 solved, 3201 unsolved in 30198 ms.
Refiners :[Domain max(s): 3453/3453 constraints, State Equation: 0/3453 constraints, PredecessorRefiner: 3201/3201 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3201 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3453 variables, 3453/3453 constraints. Problems are: Problem set: 0 solved, 3201 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 Int declared 3453/6664 variables, and 3453 constraints, problems are : Problem set: 0 solved, 3201 unsolved in 30099 ms.
Refiners :[Domain max(s): 3453/3453 constraints, State Equation: 0/3453 constraints, PredecessorRefiner: 0/3201 constraints, Known Traps: 0/0 constraints]
After SMT, in 76609ms problems are : Problem set: 0 solved, 3201 unsolved
Search for dead transitions found 0 dead transitions in 76724ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 264778 ms. Remains : 3453/3453 places, 3211/3211 transitions.
[2024-05-23 15:24:43] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 8 ms.
[2024-05-23 15:24:43] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 3453 places, 3211 transitions and 26590 arcs took 72 ms.
[2024-05-23 15:24:44] [INFO ] Flatten gal took : 790 ms
Total runtime 321431 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running Echo-PT-d05r03

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/415/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 3453
TRANSITIONS: 3211
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.191s, Sys 0.010s]


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


----------------------------------------------------------------------
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: 580
MODEL NAME: /home/mcc/execution/415/model
3453 places, 3211 transitions.

No place bound informations found.
No place bound informations found.
No place bound informations found.
No place bound informations found.
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.
CANNOT_COMPUTE
EXITCODE: 87
----------------------------------------------------------------------

BK_STOP 1716478652550

--------------------
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

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="Echo-PT-d05r03"
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 Echo-PT-d05r03, 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 r157-smll-171636265100143"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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