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-171620398200434.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 BugTracking-PT-q8m128, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r047-tajo-171620398200434
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 7.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 15:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 22 14:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 12 01:10 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 119K Apr 12 01:10 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 19 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 19 15:24 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 16M 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 BugTracking-PT-q8m128-CTLFireability-2024-00
FORMULA_NAME BugTracking-PT-q8m128-CTLFireability-2024-01
FORMULA_NAME BugTracking-PT-q8m128-CTLFireability-2024-02
FORMULA_NAME BugTracking-PT-q8m128-CTLFireability-2024-03
FORMULA_NAME BugTracking-PT-q8m128-CTLFireability-2024-04
FORMULA_NAME BugTracking-PT-q8m128-CTLFireability-2024-05
FORMULA_NAME BugTracking-PT-q8m128-CTLFireability-2024-06
FORMULA_NAME BugTracking-PT-q8m128-CTLFireability-2024-07
FORMULA_NAME BugTracking-PT-q8m128-CTLFireability-2024-08
FORMULA_NAME BugTracking-PT-q8m128-CTLFireability-2024-09
FORMULA_NAME BugTracking-PT-q8m128-CTLFireability-2024-10
FORMULA_NAME BugTracking-PT-q8m128-CTLFireability-2024-11
FORMULA_NAME BugTracking-PT-q8m128-CTLFireability-2023-12
FORMULA_NAME BugTracking-PT-q8m128-CTLFireability-2023-13
FORMULA_NAME BugTracking-PT-q8m128-CTLFireability-2023-14
FORMULA_NAME BugTracking-PT-q8m128-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716300705124

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BugTracking-PT-q8m128
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 14:11:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-21 14:11:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 14:11:48] [INFO ] Load time of PNML (sax parser for PT used): 1487 ms
[2024-05-21 14:11:48] [INFO ] Transformed 754 places.
[2024-05-21 14:11:49] [INFO ] Transformed 27370 transitions.
[2024-05-21 14:11:49] [INFO ] Parsed PT model containing 754 places and 27370 transitions and 136172 arcs in 1880 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 64 ms.
Deduced a syphon composed of 474 places in 200 ms
Reduce places removed 474 places and 23466 transitions.
Initial state reduction rules removed 2 formulas.
FORMULA BugTracking-PT-q8m128-CTLFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m128-CTLFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m128-CTLFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m128-CTLFireability-2023-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 18 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 3904/3904 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 278 transition count 3904
Applied a total of 2 rules in 146 ms. Remains 278 /280 variables (removed 2) and now considering 3904/3904 (removed 0) transitions.
[2024-05-21 14:11:49] [INFO ] Flow matrix only has 3729 transitions (discarded 175 similar events)
// Phase 1: matrix 3729 rows 278 cols
[2024-05-21 14:11:50] [INFO ] Computed 8 invariants in 84 ms
[2024-05-21 14:11:50] [INFO ] Implicit Places using invariants in 907 ms returned []
[2024-05-21 14:11:50] [INFO ] Flow matrix only has 3729 transitions (discarded 175 similar events)
[2024-05-21 14:11:50] [INFO ] Invariant cache hit.
[2024-05-21 14:11:51] [INFO ] State equation strengthened by 303 read => feed constraints.
[2024-05-21 14:11:55] [INFO ] Implicit Places using invariants and state equation in 4277 ms returned []
Implicit Place search using SMT with State Equation took 5259 ms to find 0 implicit places.
Running 3902 sub problems to find dead transitions.
[2024-05-21 14:11:55] [INFO ] Flow matrix only has 3729 transitions (discarded 175 similar events)
[2024-05-21 14:11:55] [INFO ] Invariant cache hit.
[2024-05-21 14:11:55] [INFO ] State equation strengthened by 303 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/277 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 3902 unsolved
[2024-05-21 14:12:58] [INFO ] Deduced a trap composed of 10 places in 321 ms of which 14 ms to minimize.
[2024-05-21 14:12:58] [INFO ] Deduced a trap composed of 18 places in 205 ms of which 2 ms to minimize.
[2024-05-21 14:12:59] [INFO ] Deduced a trap composed of 14 places in 255 ms of which 2 ms to minimize.
[2024-05-21 14:12:59] [INFO ] Deduced a trap composed of 7 places in 106 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 277/4007 variables, and 12 constraints, problems are : Problem set: 0 solved, 3902 unsolved in 30115 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/278 constraints, ReadFeed: 0/303 constraints, PredecessorRefiner: 3902/2705 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3902 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/277 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 3902 unsolved
Problem TDEAD808 is UNSAT
Problem TDEAD809 is UNSAT
Problem TDEAD810 is UNSAT
Problem TDEAD811 is UNSAT
Problem TDEAD812 is UNSAT
Problem TDEAD813 is UNSAT
Problem TDEAD817 is UNSAT
Problem TDEAD818 is UNSAT
Problem TDEAD819 is UNSAT
Problem TDEAD2782 is UNSAT
Problem TDEAD2783 is UNSAT
Problem TDEAD2784 is UNSAT
Problem TDEAD2785 is UNSAT
Problem TDEAD2786 is UNSAT
Problem TDEAD2787 is UNSAT
Problem TDEAD2788 is UNSAT
Problem TDEAD2789 is UNSAT
Problem TDEAD2794 is UNSAT
Problem TDEAD2795 is UNSAT
Problem TDEAD2796 is UNSAT
Problem TDEAD2797 is UNSAT
Problem TDEAD2798 is UNSAT
Problem TDEAD2799 is UNSAT
Problem TDEAD2800 is UNSAT
Problem TDEAD2801 is UNSAT
Problem TDEAD2802 is UNSAT
Problem TDEAD2803 is UNSAT
Problem TDEAD2804 is UNSAT
Problem TDEAD2805 is UNSAT
Problem TDEAD3740 is UNSAT
Problem TDEAD3741 is UNSAT
Problem TDEAD3742 is UNSAT
Problem TDEAD3743 is UNSAT
Problem TDEAD3749 is UNSAT
Problem TDEAD3750 is UNSAT
Problem TDEAD3751 is UNSAT
Problem TDEAD3752 is UNSAT
Problem TDEAD3753 is UNSAT
Problem TDEAD3754 is UNSAT
Problem TDEAD3755 is UNSAT
Problem TDEAD3756 is UNSAT
Problem TDEAD3757 is UNSAT
Problem TDEAD3758 is UNSAT
Problem TDEAD3759 is UNSAT
Problem TDEAD3764 is UNSAT
Problem TDEAD3769 is UNSAT
Problem TDEAD3770 is UNSAT
Problem TDEAD3771 is UNSAT
Problem TDEAD3806 is UNSAT
Problem TDEAD3807 is UNSAT
Problem TDEAD3808 is UNSAT
Problem TDEAD3809 is UNSAT
Problem TDEAD3815 is UNSAT
Problem TDEAD3816 is UNSAT
Problem TDEAD3817 is UNSAT
Problem TDEAD3818 is UNSAT
Problem TDEAD3819 is UNSAT
Problem TDEAD3820 is UNSAT
Problem TDEAD3821 is UNSAT
Problem TDEAD3822 is UNSAT
Problem TDEAD3823 is UNSAT
Problem TDEAD3824 is UNSAT
Problem TDEAD3825 is UNSAT
Problem TDEAD3830 is UNSAT
Problem TDEAD3835 is UNSAT
Problem TDEAD3836 is UNSAT
Problem TDEAD3837 is UNSAT
Problem TDEAD3839 is UNSAT
Problem TDEAD3840 is UNSAT
Problem TDEAD3841 is UNSAT
Problem TDEAD3842 is UNSAT
Problem TDEAD3844 is UNSAT
Problem TDEAD3848 is UNSAT
Problem TDEAD3849 is UNSAT
Problem TDEAD3850 is UNSAT
Problem TDEAD3851 is UNSAT
Problem TDEAD3852 is UNSAT
Problem TDEAD3853 is UNSAT
Problem TDEAD3854 is UNSAT
Problem TDEAD3855 is UNSAT
Problem TDEAD3856 is UNSAT
Problem TDEAD3857 is UNSAT
Problem TDEAD3858 is UNSAT
Problem TDEAD3859 is UNSAT
Problem TDEAD3860 is UNSAT
Problem TDEAD3861 is UNSAT
Problem TDEAD3862 is UNSAT
Problem TDEAD3863 is UNSAT
Problem TDEAD3864 is UNSAT
Problem TDEAD3865 is UNSAT
Problem TDEAD3866 is UNSAT
Problem TDEAD3867 is UNSAT
Problem TDEAD3872 is UNSAT
Problem TDEAD3873 is UNSAT
Problem TDEAD3874 is UNSAT
Problem TDEAD3875 is UNSAT
Problem TDEAD3877 is UNSAT
Problem TDEAD3881 is UNSAT
Problem TDEAD3882 is UNSAT
Problem TDEAD3883 is UNSAT
Problem TDEAD3884 is UNSAT
Problem TDEAD3885 is UNSAT
Problem TDEAD3886 is UNSAT
Problem TDEAD3887 is UNSAT
Problem TDEAD3888 is UNSAT
Problem TDEAD3889 is UNSAT
Problem TDEAD3890 is UNSAT
Problem TDEAD3891 is UNSAT
Problem TDEAD3892 is UNSAT
Problem TDEAD3893 is UNSAT
Problem TDEAD3894 is UNSAT
Problem TDEAD3895 is UNSAT
Problem TDEAD3896 is UNSAT
Problem TDEAD3897 is UNSAT
Problem TDEAD3898 is UNSAT
Problem TDEAD3899 is UNSAT
Problem TDEAD3900 is UNSAT
Problem TDEAD3901 is UNSAT
Problem TDEAD3902 is UNSAT
Problem TDEAD3903 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/277 variables, 4/12 constraints. Problems are: Problem set: 120 solved, 3782 unsolved
[2024-05-21 14:13:23] [INFO ] Deduced a trap composed of 11 places in 67 ms of which 1 ms to minimize.
Problem TDEAD784 is UNSAT
Problem TDEAD790 is UNSAT
Problem TDEAD796 is UNSAT
Problem TDEAD802 is UNSAT
Problem TDEAD814 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 277/4007 variables, and 13 constraints, problems are : Problem set: 125 solved, 3777 unsolved in 30084 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/278 constraints, ReadFeed: 0/303 constraints, PredecessorRefiner: 1197/2705 constraints, Known Traps: 5/5 constraints]
After SMT, in 105265ms problems are : Problem set: 125 solved, 3777 unsolved
Search for dead transitions found 125 dead transitions in 105393ms
Found 125 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 125 transitions
Dead transitions reduction (with SMT) removed 125 transitions
Starting structural reductions in LTL mode, iteration 1 : 278/280 places, 3779/3904 transitions.
Reduce places removed 19 places and 600 transitions.
Iterating post reduction 0 with 19 rules applied. Total rules applied 19 place count 259 transition count 3179
Reduce places removed 16 places and 328 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 35 place count 243 transition count 2851
Reduce places removed 7 places and 133 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 42 place count 236 transition count 2718
Reduce places removed 6 places and 113 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 48 place count 230 transition count 2605
Reduce places removed 2 places and 52 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 50 place count 228 transition count 2553
Reduce places removed 1 places and 30 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 51 place count 227 transition count 2523
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 53 place count 225 transition count 2497
Deduced a syphon composed of 2 places in 3 ms
Iterating global reduction 6 with 2 rules applied. Total rules applied 55 place count 225 transition count 2497
Deduced a syphon composed of 2 places in 3 ms
Applied a total of 55 rules in 74 ms. Remains 225 /278 variables (removed 53) and now considering 2497/3779 (removed 1282) transitions.
[2024-05-21 14:13:40] [INFO ] Flow matrix only has 2386 transitions (discarded 111 similar events)
// Phase 1: matrix 2386 rows 225 cols
[2024-05-21 14:13:40] [INFO ] Computed 10 invariants in 14 ms
[2024-05-21 14:13:41] [INFO ] Implicit Places using invariants in 570 ms returned []
[2024-05-21 14:13:41] [INFO ] Flow matrix only has 2386 transitions (discarded 111 similar events)
[2024-05-21 14:13:41] [INFO ] Invariant cache hit.
[2024-05-21 14:13:41] [INFO ] State equation strengthened by 209 read => feed constraints.
[2024-05-21 14:13:42] [INFO ] Implicit Places using invariants and state equation in 1429 ms returned []
Implicit Place search using SMT with State Equation took 2013 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 225/280 places, 2497/3904 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 112970 ms. Remains : 225/280 places, 2497/3904 transitions.
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Support contains 13 out of 223 places after structural reductions.
[2024-05-21 14:13:43] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2024-05-21 14:13:43] [INFO ] Flatten gal took : 474 ms
[2024-05-21 14:13:43] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
FORMULA BugTracking-PT-q8m128-CTLFireability-2023-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m128-CTLFireability-2023-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m128-CTLFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m128-CTLFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m128-CTLFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m128-CTLFireability-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m128-CTLFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m128-CTLFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 14:13:44] [INFO ] Flatten gal took : 281 ms
[2024-05-21 14:13:44] [INFO ] Input system was already deterministic with 2497 transitions.
Support contains 0 out of 223 places (down from 13) after GAL structural reductions.
FORMULA BugTracking-PT-q8m128-CTLFireability-2023-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
[2024-05-21 14:13:45] [INFO ] Flatten gal took : 177 ms
[2024-05-21 14:13:45] [INFO ] Flatten gal took : 223 ms
[2024-05-21 14:13:45] [INFO ] Input system was already deterministic with 2497 transitions.
Computed a total of 6 stabilizing places and 131 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 223/223 places, 2497/2497 transitions.
Applied a total of 0 rules in 23 ms. Remains 223 /223 variables (removed 0) and now considering 2497/2497 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23 ms. Remains : 223/223 places, 2497/2497 transitions.
[2024-05-21 14:13:45] [INFO ] Flatten gal took : 157 ms
[2024-05-21 14:13:46] [INFO ] Flatten gal took : 179 ms
[2024-05-21 14:13:46] [INFO ] Input system was already deterministic with 2497 transitions.
Starting structural reductions in LTL mode, iteration 0 : 223/223 places, 2497/2497 transitions.
Applied a total of 0 rules in 8 ms. Remains 223 /223 variables (removed 0) and now considering 2497/2497 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 223/223 places, 2497/2497 transitions.
[2024-05-21 14:13:46] [INFO ] Flatten gal took : 141 ms
[2024-05-21 14:13:46] [INFO ] Flatten gal took : 142 ms
[2024-05-21 14:13:47] [INFO ] Input system was already deterministic with 2497 transitions.
Starting structural reductions in LTL mode, iteration 0 : 223/223 places, 2497/2497 transitions.
Applied a total of 0 rules in 12 ms. Remains 223 /223 variables (removed 0) and now considering 2497/2497 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25 ms. Remains : 223/223 places, 2497/2497 transitions.
[2024-05-21 14:13:47] [INFO ] Flatten gal took : 157 ms
[2024-05-21 14:13:47] [INFO ] Flatten gal took : 161 ms
[2024-05-21 14:13:47] [INFO ] Input system was already deterministic with 2497 transitions.
[2024-05-21 14:13:47] [INFO ] Flatten gal took : 90 ms
[2024-05-21 14:13:47] [INFO ] Flatten gal took : 104 ms
[2024-05-21 14:13:47] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/CTLFireability.sr.xml took 2 ms.
[2024-05-21 14:13:47] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 223 places, 2497 transitions and 12247 arcs took 23 ms.
Total runtime 120690 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running BugTracking-PT-q8m128

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/419/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 223
TRANSITIONS: 2497
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.089s, Sys 0.007s]


SAVING FILE /home/mcc/execution/419/model (.net / .def) ...
EXPORT TIME: [User 0.010s, 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: 606
MODEL NAME: /home/mcc/execution/419/model
223 places, 2497 transitions.
Enabling coverability test.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Building monolithic NSF...
Building monolithic NSF...
Building monolithic NSF...
Building monolithic NSF...
CANNOT_COMPUTE
EXITCODE: 87
----------------------------------------------------------------------

BK_STOP 1716301155512

--------------------
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 CTLFireability -timeout 360 -rebuildPNML
Error in allocating array of size 8388608 at unique_table.cc, line 313
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="BugTracking-PT-q8m128"
export BK_EXAMINATION="CTLFireability"
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 BugTracking-PT-q8m128, examination is CTLFireability"
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-171620398200434"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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