About the Execution of 2024-gold for ShieldIIPs-PT-040B
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
15687.580 | 9815.00 | 23792.00 | 156.50 | T | normal |
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-174894547300242.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 ShieldIIPs-PT-040B, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r210-tall-174894547300242
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 6.7K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.8K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 74K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K 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:32 equiv_col
-rw-r--r-- 1 mcc users 5 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 675K May 29 14:32 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 QuasiLiveness
=== Now, execution of the tool begins
BK_START 1749025688209
Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=ShieldIIPs-PT-040B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-06-04 08:28:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2025-06-04 08:28:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-04 08:28:09] [INFO ] Load time of PNML (sax parser for PT used): 222 ms
[2025-06-04 08:28:09] [INFO ] Transformed 2403 places.
[2025-06-04 08:28:09] [INFO ] Transformed 2363 transitions.
[2025-06-04 08:28:09] [INFO ] Found NUPN structural information;
[2025-06-04 08:28:09] [INFO ] Parsed PT model containing 2403 places and 2363 transitions and 7126 arcs in 434 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 2403/2403 places, 2363/2363 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 201 transitions
Trivial Post-agglo rules discarded 201 transitions
Performed 201 trivial Post agglomeration. Transition count delta: 201
Iterating post reduction 0 with 201 rules applied. Total rules applied 201 place count 2403 transition count 2162
Reduce places removed 201 places and 0 transitions.
Iterating post reduction 1 with 201 rules applied. Total rules applied 402 place count 2202 transition count 2162
Performed 201 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 201 Pre rules applied. Total rules applied 402 place count 2202 transition count 1961
Deduced a syphon composed of 201 places in 23 ms
Reduce places removed 201 places and 0 transitions.
Iterating global reduction 2 with 402 rules applied. Total rules applied 804 place count 2001 transition count 1961
Performed 960 Post agglomeration using F-continuation condition.Transition count delta: 960
Deduced a syphon composed of 960 places in 5 ms
Reduce places removed 960 places and 0 transitions.
Iterating global reduction 2 with 1920 rules applied. Total rules applied 2724 place count 1041 transition count 1001
Renaming transitions due to excessive name length > 1024 char.
Applied a total of 2724 rules in 460 ms. Remains 1041 /2403 variables (removed 1362) and now considering 1001/2363 (removed 1362) transitions.
// Phase 1: matrix 1001 rows 1041 cols
[2025-06-04 08:28:10] [INFO ] Computed 361 invariants in 30 ms
[2025-06-04 08:28:11] [INFO ] Implicit Places using invariants in 823 ms returned [1026]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 852 ms to find 1 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 1040/2403 places, 1001/2363 transitions.
Applied a total of 0 rules in 18 ms. Remains 1040 /1040 variables (removed 0) and now considering 1001/1001 (removed 0) transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 1348 ms. Remains : 1040/2403 places, 1001/2363 transitions.
Discarding 240 transitions out of 1001. Remains 761
Initial state reduction rules removed 1 formulas.
RANDOM walk for 40000 steps (16 resets) in 2368 ms. (16 steps per ms) remains 2/760 properties
BEST_FIRST walk for 40004 steps (8 resets) in 420 ms. (95 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 302 ms. (132 steps per ms) remains 2/2 properties
// Phase 1: matrix 1001 rows 1040 cols
[2025-06-04 08:28:12] [INFO ] Computed 360 invariants in 6 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 15/21 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 15/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1019/1040 variables, 354/381 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1040 variables, 1019/1400 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-04 08:28:12] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 5 ms to minimize.
[2025-06-04 08:28:12] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 2 ms to minimize.
[2025-06-04 08:28:13] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 2 ms to minimize.
[2025-06-04 08:28:13] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 1 ms to minimize.
[2025-06-04 08:28:13] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 1 ms to minimize.
[2025-06-04 08:28:13] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 1 ms to minimize.
[2025-06-04 08:28:13] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 1 ms to minimize.
[2025-06-04 08:28:13] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 1 ms to minimize.
[2025-06-04 08:28:13] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 1 ms to minimize.
[2025-06-04 08:28:13] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 0 ms to minimize.
[2025-06-04 08:28:13] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 1 ms to minimize.
[2025-06-04 08:28:13] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 1 ms to minimize.
[2025-06-04 08:28:13] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 1 ms to minimize.
[2025-06-04 08:28:13] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
[2025-06-04 08:28:13] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
[2025-06-04 08:28:13] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
[2025-06-04 08:28:13] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 0 ms to minimize.
[2025-06-04 08:28:14] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1040 variables, 18/1418 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1040 variables, 0/1418 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1001/2041 variables, 1040/2458 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-04 08:28:14] [INFO ] Deduced a trap composed of 4 places in 160 ms of which 3 ms to minimize.
[2025-06-04 08:28:14] [INFO ] Deduced a trap composed of 4 places in 158 ms of which 3 ms to minimize.
[2025-06-04 08:28:14] [INFO ] Deduced a trap composed of 4 places in 149 ms of which 3 ms to minimize.
[2025-06-04 08:28:15] [INFO ] Deduced a trap composed of 4 places in 153 ms of which 3 ms to minimize.
[2025-06-04 08:28:15] [INFO ] Deduced a trap composed of 12 places in 133 ms of which 2 ms to minimize.
[2025-06-04 08:28:15] [INFO ] Deduced a trap composed of 4 places in 131 ms of which 3 ms to minimize.
[2025-06-04 08:28:15] [INFO ] Deduced a trap composed of 4 places in 141 ms of which 3 ms to minimize.
[2025-06-04 08:28:15] [INFO ] Deduced a trap composed of 4 places in 143 ms of which 3 ms to minimize.
[2025-06-04 08:28:15] [INFO ] Deduced a trap composed of 4 places in 134 ms of which 2 ms to minimize.
[2025-06-04 08:28:16] [INFO ] Deduced a trap composed of 4 places in 132 ms of which 2 ms to minimize.
[2025-06-04 08:28:16] [INFO ] Deduced a trap composed of 14 places in 136 ms of which 2 ms to minimize.
[2025-06-04 08:28:16] [INFO ] Deduced a trap composed of 18 places in 124 ms of which 2 ms to minimize.
[2025-06-04 08:28:16] [INFO ] Deduced a trap composed of 4 places in 130 ms of which 3 ms to minimize.
[2025-06-04 08:28:16] [INFO ] Deduced a trap composed of 11 places in 125 ms of which 2 ms to minimize.
[2025-06-04 08:28:16] [INFO ] Deduced a trap composed of 4 places in 134 ms of which 3 ms to minimize.
[2025-06-04 08:28:17] [INFO ] Deduced a trap composed of 11 places in 139 ms of which 6 ms to minimize.
[2025-06-04 08:28:17] [INFO ] Deduced a trap composed of 11 places in 127 ms of which 2 ms to minimize.
[2025-06-04 08:28:17] [INFO ] Deduced a trap composed of 18 places in 119 ms of which 3 ms to minimize.
[2025-06-04 08:28:17] [INFO ] Deduced a trap composed of 11 places in 124 ms of which 2 ms to minimize.
SMT process timed out in 5134ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 6 out of 1040 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1040/1040 places, 1001/1001 transitions.
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 40 place count 1000 transition count 961
Iterating global reduction 0 with 40 rules applied. Total rules applied 80 place count 1000 transition count 961
Partial Free-agglomeration rule applied 274 times.
Drop transitions (Partial Free agglomeration) removed 274 transitions
Iterating global reduction 0 with 274 rules applied. Total rules applied 354 place count 1000 transition count 961
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 355 place count 999 transition count 960
Applied a total of 355 rules in 257 ms. Remains 999 /1040 variables (removed 41) and now considering 960/1001 (removed 41) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 258 ms. Remains : 999/1040 places, 960/1001 transitions.
RANDOM walk for 21849 steps (3 resets) in 313 ms. (69 steps per ms) remains 0/2 properties
Able to resolve query QuasiLiveness after proving 761 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 8511 ms.
ITS solved all properties within timeout
BK_STOP 1749025698024
--------------------
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 QuasiLiveness -timeout 180 -rebuildPNML
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldIIPs-PT-040B"
export BK_EXAMINATION="QuasiLiveness"
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 ShieldIIPs-PT-040B, examination is QuasiLiveness"
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-174894547300242"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPs-PT-040B.tgz
mv ShieldIIPs-PT-040B execution
cd execution
if [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "UpperBounds" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] || [ "QuasiLiveness" = "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 [ "QuasiLiveness" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "QuasiLiveness" != "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 "QuasiLiveness.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 [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] ; then
echo "FORMULA_NAME QuasiLiveness"
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 ;