About the Execution of 2024-gold for ShieldPPPt-PT-020B
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
15676.460 | 1800000.00 | 5483862.00 | 2659.90 | [undef] | Time out reached |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r210-tall-174894547800551.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool gold2024
Input is ShieldPPPt-PT-020B, examination is ReachabilityDeadlock
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r210-tall-174894547800551
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 812K
-rw-r--r-- 1 mcc users 6.5K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.9K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.9K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 84K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 99K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:33 equiv_col
-rw-r--r-- 1 mcc users 5 May 29 14:33 instance
-rw-r--r-- 1 mcc users 6 May 29 14:33 iscolored
-rw-r--r-- 1 mcc users 376K May 29 14:33 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
FORMULA_NAME ReachabilityDeadlock
=== Now, execution of the tool begins
BK_START 1749029251079
Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=ReachabilityDeadlock
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=ShieldPPPt-PT-020B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-06-04 09:27:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityDeadlock, -timeout, 180, -rebuildPNML]
[2025-06-04 09:27:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-04 09:27:32] [INFO ] Load time of PNML (sax parser for PT used): 139 ms
[2025-06-04 09:27:32] [INFO ] Transformed 1563 places.
[2025-06-04 09:27:32] [INFO ] Transformed 1423 transitions.
[2025-06-04 09:27:32] [INFO ] Found NUPN structural information;
[2025-06-04 09:27:32] [INFO ] Parsed PT model containing 1563 places and 1423 transitions and 3566 arcs in 283 ms.
Parsed 1 properties from file /home/mcc/execution/ReachabilityDeadlock.xml in 4 ms.
Working with output stream class java.io.PrintStream
Built sparse matrix representations for Structural reductions in 5 ms.28511KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 1563/1563 places, 1423/1423 transitions.
Computed a total of 400 stabilizing places and 400 stable transitions
Computed a total of 400 stabilizing places and 400 stable transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 383 transitions
Trivial Post-agglo rules discarded 383 transitions
Performed 383 trivial Post agglomeration. Transition count delta: 383
Iterating post reduction 0 with 383 rules applied. Total rules applied 383 place count 1563 transition count 1040
Reduce places removed 383 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Computed a total of 240 stabilizing places and 240 stable transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 385 rules applied. Total rules applied 768 place count 1180 transition count 1038
Reduce places removed 1 places and 0 transitions.
Computed a total of 240 stabilizing places and 240 stable transitions
Iterating post reduction 2 with 1 rules applied. Total rules applied 769 place count 1179 transition count 1038
Computed a total of 240 stabilizing places and 240 stable transitions
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 80 Pre rules applied. Total rules applied 769 place count 1179 transition count 958
Deduced a syphon composed of 80 places in 2 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 3 with 160 rules applied. Total rules applied 929 place count 1099 transition count 958
Computed a total of 240 stabilizing places and 240 stable transitions
Discarding 140 places :
Symmetric choice reduction at 3 with 140 rule applications. Total rules 1069 place count 959 transition count 818
Iterating global reduction 3 with 140 rules applied. Total rules applied 1209 place count 959 transition count 818
Computed a total of 160 stabilizing places and 160 stable transitions
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 60 Pre rules applied. Total rules applied 1209 place count 959 transition count 758
Deduced a syphon composed of 60 places in 3 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 3 with 120 rules applied. Total rules applied 1329 place count 899 transition count 758
Computed a total of 161 stabilizing places and 160 stable transitions
Performed 339 Post agglomeration using F-continuation condition.Transition count delta: 339
Deduced a syphon composed of 339 places in 2 ms
Reduce places removed 339 places and 0 transitions.
Iterating global reduction 3 with 678 rules applied. Total rules applied 2007 place count 560 transition count 419
Computed a total of 2 stabilizing places and 1 stable transitions
Renaming transitions due to excessive name length > 1024 char.
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 59 places in 1 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 3 with 118 rules applied. Total rules applied 2125 place count 501 transition count 419
Computed a total of 2 stabilizing places and 1 stable transitions
Computed a total of 2 stabilizing places and 1 stable transitions
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 2126 place count 500 transition count 418
Reduce places removed 1 places and 0 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Iterating post reduction 3 with 1 rules applied. Total rules applied 2127 place count 499 transition count 418
Computed a total of 0 stabilizing places and 0 stable transitions
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 2127 place count 499 transition count 416
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 2131 place count 497 transition count 416
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 2131 rules in 522 ms. Remains 497 /1563 variables (removed 1066) and now considering 416/1423 (removed 1007) transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 536 ms. Remains : 497/1563 places, 416/1423 transitions.
Random walk for 1250000 steps, including 0 resets, run took 4897 ms (no deadlock found). (steps per millisecond=255 )
Random directed walk for 1250001 steps, including 0 resets, run took 3354 ms (no deadlock found). (steps per millisecond=372 )
// Phase 1: matrix 416 rows 497 cols
[2025-06-04 09:27:41] [INFO ] Computed 220 invariants in 16 ms
[2025-06-04 09:27:41] [INFO ] [Real]Absence check using 220 positive place invariants in 79 ms returned sat
[2025-06-04 09:27:42] [INFO ] [Real]Absence check using state equation in 500 ms returned sat
[2025-06-04 09:27:42] [INFO ] Solution in real domain found non-integer solution.
[2025-06-04 09:27:42] [INFO ] [Nat]Absence check using 220 positive place invariants in 78 ms returned sat
[2025-06-04 09:27:43] [INFO ] [Nat]Absence check using state equation in 356 ms returned sat
[2025-06-04 09:27:43] [INFO ] Computed and/alt/rep : 412/649/412 causal constraints (skipped 0 transitions) in 29 ms.
[2025-06-04 09:27:46] [INFO ] Added : 382 causal constraints over 77 iterations in 3224 ms. Result :sat
Parikh directed walk for 170400 steps, including 1001 resets, run took 711 ms. (steps per millisecond=239 )
Random directed walk for 500001 steps, including 0 resets, run took 1349 ms (no deadlock found). (steps per millisecond=370 )
Random walk for 500000 steps, including 0 resets, run took 1868 ms (no deadlock found). (steps per millisecond=267 )
Random directed walk for 500004 steps, including 0 resets, run took 1312 ms (no deadlock found). (steps per millisecond=381 )
Random walk for 500000 steps, including 0 resets, run took 1877 ms (no deadlock found). (steps per millisecond=266 )
Starting structural reductions in DEADLOCK mode, iteration 0 : 497/497 places, 416/416 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 17 ms. Remains 497 /497 variables (removed 0) and now considering 416/416 (removed 0) transitions.
[2025-06-04 09:27:53] [INFO ] Invariant cache hit.
[2025-06-04 09:27:53] [INFO ] Implicit Places using invariants in 267 ms returned [480, 484]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 270 ms to find 2 implicit places.
Starting structural reductions in DEADLOCK mode, iteration 1 : 495/497 places, 416/416 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 493 transition count 414
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 4 rules in 30 ms. Remains 493 /495 variables (removed 2) and now considering 414/416 (removed 2) transitions.
// Phase 1: matrix 414 rows 493 cols
[2025-06-04 09:27:53] [INFO ] Computed 218 invariants in 7 ms
[2025-06-04 09:27:54] [INFO ] Implicit Places using invariants in 249 ms returned []
[2025-06-04 09:27:54] [INFO ] Invariant cache hit.
[2025-06-04 09:27:54] [INFO ] Implicit Places using invariants and state equation in 414 ms returned []
Implicit Place search using SMT with State Equation took 669 ms to find 0 implicit places.
Starting structural reductions in DEADLOCK mode, iteration 2 : 493/497 places, 414/416 transitions.
Finished structural reductions in DEADLOCK mode , in 2 iterations and 989 ms. Remains : 493/497 places, 414/416 transitions.
Random walk for 1250000 steps, including 0 resets, run took 4641 ms (no deadlock found). (steps per millisecond=269 )
Random directed walk for 1250003 steps, including 0 resets, run took 3258 ms (no deadlock found). (steps per millisecond=383 )
[2025-06-04 09:28:02] [INFO ] Invariant cache hit.
[2025-06-04 09:28:02] [INFO ] [Real]Absence check using 218 positive place invariants in 62 ms returned sat
[2025-06-04 09:28:02] [INFO ] [Real]Absence check using state equation in 379 ms returned sat
[2025-06-04 09:28:02] [INFO ] Solution in real domain found non-integer solution.
[2025-06-04 09:28:03] [INFO ] [Nat]Absence check using 218 positive place invariants in 70 ms returned sat
[2025-06-04 09:28:03] [INFO ] [Nat]Absence check using state equation in 383 ms returned sat
[2025-06-04 09:28:03] [INFO ] Computed and/alt/rep : 410/643/410 causal constraints (skipped 0 transitions) in 22 ms.
[2025-06-04 09:28:06] [INFO ] Added : 366 causal constraints over 74 iterations in 2730 ms. Result :sat
Parikh directed walk for 213200 steps, including 444 resets, run took 952 ms. (steps per millisecond=223 )
Random directed walk for 500000 steps, including 0 resets, run took 1309 ms (no deadlock found). (steps per millisecond=381 )
Random walk for 500000 steps, including 0 resets, run took 1887 ms (no deadlock found). (steps per millisecond=264 )
Random directed walk for 500001 steps, including 0 resets, run took 1311 ms (no deadlock found). (steps per millisecond=381 )
Random walk for 500000 steps, including 0 resets, run took 1875 ms (no deadlock found). (steps per millisecond=266 )
[2025-06-04 09:28:13] [INFO ] Flatten gal took : 136 ms
[2025-06-04 09:28:13] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityDeadlock.sr.xml took 1 ms.
[2025-06-04 09:28:13] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1563 places, 1423 transitions and 3566 arcs took 12 ms.
Total runtime 41537 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running ShieldPPPt-PT-020B
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/402/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 1563
TRANSITIONS: 1423
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.020s, Sys 0.004s]
SAVING FILE /home/mcc/execution/402/model (.net / .def) ...
EXPORT TIME: [User 0.004s, 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: 527
MODEL NAME: /home/mcc/execution/402/model
1563 places, 1423 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.
BK_TIME_CONFINEMENT_REACHED
--------------------
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 ReachabilityDeadlock -timeout 180 -rebuildPNML
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="ShieldPPPt-PT-020B"
export BK_EXAMINATION="ReachabilityDeadlock"
export BK_TOOL="gold2024"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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-5832"
echo " Executing tool gold2024"
echo " Input is ShieldPPPt-PT-020B, examination is ReachabilityDeadlock"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r210-tall-174894547800551"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPt-PT-020B.tgz
mv ShieldPPPt-PT-020B execution
cd execution
if [ "ReachabilityDeadlock" = "ReachabilityDeadlock" ] || [ "ReachabilityDeadlock" = "UpperBounds" ] || [ "ReachabilityDeadlock" = "QuasiLiveness" ] || [ "ReachabilityDeadlock" = "StableMarking" ] || [ "ReachabilityDeadlock" = "Liveness" ] || [ "ReachabilityDeadlock" = "OneSafe" ] || [ "ReachabilityDeadlock" = "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 [ "ReachabilityDeadlock" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityDeadlock" != "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 "ReachabilityDeadlock.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 '
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityDeadlock" = "ReachabilityDeadlock" ] || [ "ReachabilityDeadlock" = "QuasiLiveness" ] || [ "ReachabilityDeadlock" = "StableMarking" ] || [ "ReachabilityDeadlock" = "Liveness" ] || [ "ReachabilityDeadlock" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityDeadlock"
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 ;