About the Execution of GreatSPN+red for Referendum-PT-0500
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.r311-tall-171662337000629.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 Referendum-PT-0500, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r311-tall-171662337000629
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 14M
-rw-r--r-- 1 mcc users 641K Apr 11 20:11 CTLCardinality.txt
-rw-r--r-- 1 mcc users 3.0M Apr 11 20:11 CTLCardinality.xml
-rw-r--r-- 1 mcc users 191K Apr 11 17:43 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.4M Apr 11 17:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 246K Apr 23 07:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 813K Apr 23 07:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 57K Apr 23 07:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 286K Apr 23 07:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 339K Apr 12 01:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 1.5M Apr 12 01:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 614K Apr 11 23:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 4.2M Apr 11 23:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 50K Apr 23 07:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 124K Apr 23 07:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 571K May 18 16:43 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of positive values
NUM_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME Referendum-PT-0500-UpperBounds-00
FORMULA_NAME Referendum-PT-0500-UpperBounds-01
FORMULA_NAME Referendum-PT-0500-UpperBounds-02
FORMULA_NAME Referendum-PT-0500-UpperBounds-03
FORMULA_NAME Referendum-PT-0500-UpperBounds-04
FORMULA_NAME Referendum-PT-0500-UpperBounds-05
FORMULA_NAME Referendum-PT-0500-UpperBounds-06
FORMULA_NAME Referendum-PT-0500-UpperBounds-07
FORMULA_NAME Referendum-PT-0500-UpperBounds-08
FORMULA_NAME Referendum-PT-0500-UpperBounds-09
FORMULA_NAME Referendum-PT-0500-UpperBounds-10
FORMULA_NAME Referendum-PT-0500-UpperBounds-11
FORMULA_NAME Referendum-PT-0500-UpperBounds-12
FORMULA_NAME Referendum-PT-0500-UpperBounds-13
FORMULA_NAME Referendum-PT-0500-UpperBounds-14
FORMULA_NAME Referendum-PT-0500-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1716763587165
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Referendum-PT-0500
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-26 22:46:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-26 22:46:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 22:46:28] [INFO ] Load time of PNML (sax parser for PT used): 147 ms
[2024-05-26 22:46:28] [INFO ] Transformed 1501 places.
[2024-05-26 22:46:28] [INFO ] Transformed 1001 transitions.
[2024-05-26 22:46:28] [INFO ] Found NUPN structural information;
[2024-05-26 22:46:28] [INFO ] Parsed PT model containing 1501 places and 1001 transitions and 2501 arcs in 257 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 20 ms.
Reduction of identical properties reduced properties to check from 16 to 9
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 1, 0, 0, 0, 0, 0, 0] Max Struct:[500, 500, 1, 500, 1, 1, 1, 1, 1]
FORMULA Referendum-PT-0500-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0500-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0500-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0500-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[500, 500, 500, 1, 1, 1, 1, 1]
// Phase 1: matrix 1001 rows 1501 cols
[2024-05-26 22:46:28] [INFO ] Computed 500 invariants in 40 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[500, 500, 500, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (19 resets) in 1318 ms. (7 steps per ms)
FORMULA Referendum-PT-0500-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Referendum-PT-0500-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Referendum-PT-0500-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Referendum-PT-0500-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Referendum-PT-0500-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Referendum-PT-0500-UpperBounds-02 500 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Referendum-PT-0500-UpperBounds-07 500 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Referendum-PT-0500-UpperBounds-01 500 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 20002 steps (4 resets) in 364 ms. (54 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[268, 273] Max Struct:[500, 500]
[2024-05-26 22:46:30] [INFO ] Invariant cache hit.
[2024-05-26 22:46:31] [INFO ] [Real]Absence check using 500 positive place invariants in 111 ms returned sat
[2024-05-26 22:46:31] [INFO ] [Real]Absence check using state equation in 398 ms returned sat
[2024-05-26 22:46:31] [INFO ] Computed and/alt/rep : 1000/1000/1000 causal constraints (skipped 0 transitions) in 67 ms.
[2024-05-26 22:46:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 22:46:37] [INFO ] [Real]Absence check using 500 positive place invariants in 1065 ms returned sat
[2024-05-26 22:46:38] [INFO ] [Real]Absence check using state equation in 689 ms returned sat
[2024-05-26 22:46:38] [INFO ] Computed and/alt/rep : 1000/1000/1000 causal constraints (skipped 0 transitions) in 48 ms.
[2024-05-26 22:46:41] [INFO ] Solution in real domain found non-integer solution.
Current structural bounds on expressions (after SMT) : Max Seen:[268, 273] Max Struct:[500, 500]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[268, 273] Max Struct:[500, 500]
Support contains 1000 out of 1501 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1501/1501 places, 1001/1001 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 1500 transition count 1000
Applied a total of 1 rules in 162 ms. Remains 1500 /1501 variables (removed 1) and now considering 1000/1001 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 177 ms. Remains : 1500/1501 places, 1000/1001 transitions.
// Phase 1: matrix 1000 rows 1500 cols
[2024-05-26 22:46:42] [INFO ] Computed 500 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[268, 273] Max Struct:[500, 500]
RANDOM walk for 335082 steps (668 resets) in 30001 ms. (11 steps per ms)
BEST_FIRST walk for 471625 steps (0 resets) in 10013 ms. (47 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[364, 391] Max Struct:[500, 500]
[2024-05-26 22:47:22] [INFO ] Invariant cache hit.
[2024-05-26 22:47:22] [INFO ] [Real]Absence check using 500 positive place invariants in 98 ms returned sat
[2024-05-26 22:47:22] [INFO ] [Real]Absence check using state equation in 378 ms returned sat
[2024-05-26 22:47:23] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 69 ms.
[2024-05-26 22:47:23] [INFO ] Added : 0 causal constraints over 0 iterations in 165 ms. Result :sat
Minimization took 125 ms.
[2024-05-26 22:47:23] [INFO ] [Real]Absence check using 500 positive place invariants in 96 ms returned sat
[2024-05-26 22:47:24] [INFO ] [Real]Absence check using state equation in 470 ms returned sat
[2024-05-26 22:47:24] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 44 ms.
[2024-05-26 22:47:24] [INFO ] Added : 0 causal constraints over 0 iterations in 138 ms. Result :sat
Minimization took 113 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[364, 391] Max Struct:[500, 500]
FORMULA Referendum-PT-0500-UpperBounds-06 500 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[500] Max Struct:[500]
Support contains 500 out of 1500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1500/1500 places, 1000/1000 transitions.
Graph (complete) has 1000 edges and 1500 vertex of which 1000 are kept as prefixes of interest. Removing 500 places using SCC suffix rule.3 ms
Discarding 500 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 500 transitions
Reduce isomorphic transitions removed 500 transitions.
Iterating post reduction 0 with 500 rules applied. Total rules applied 501 place count 1000 transition count 500
Applied a total of 501 rules in 25 ms. Remains 1000 /1500 variables (removed 500) and now considering 500/1000 (removed 500) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 1000/1500 places, 500/1000 transitions.
// Phase 1: matrix 500 rows 1000 cols
[2024-05-26 22:47:31] [INFO ] Computed 500 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[500] Max Struct:[500]
FORMULA Referendum-PT-0500-UpperBounds-03 500 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0500-UpperBounds-04 500 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0500-UpperBounds-00 500 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (1996 resets) in 25290 ms. (39 steps per ms)
BEST_FIRST walk for 0 steps (0 resets) in 0 ms. (0 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 6 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 )
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 88211 ms.
ITS solved all properties within timeout
BK_STOP 1716763676620
--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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 UpperBounds -timeout 360 -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="Referendum-PT-0500"
export BK_EXAMINATION="UpperBounds"
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 Referendum-PT-0500, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r311-tall-171662337000629"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Referendum-PT-0500.tgz
mv Referendum-PT-0500 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "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 [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "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 "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.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 [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
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 ;