About the Execution of GreatSPN+red for ShieldIIPt-PT-030A
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
545.968 | 17975.00 | 35661.00 | 75.10 | FTFFFFFFFTTTFTFT | 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.r355-tall-171683758500294.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 ShieldIIPt-PT-030A, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r355-tall-171683758500294
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 596K
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 23 07:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 23 07:52 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:52 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:52 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 12 22:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 158K Apr 12 22:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Apr 12 22:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 36K Apr 12 22:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:52 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:52 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 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 159K 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 booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME ShieldIIPt-PT-030A-ReachabilityCardinality-2024-00
FORMULA_NAME ShieldIIPt-PT-030A-ReachabilityCardinality-2024-01
FORMULA_NAME ShieldIIPt-PT-030A-ReachabilityCardinality-2024-02
FORMULA_NAME ShieldIIPt-PT-030A-ReachabilityCardinality-2024-03
FORMULA_NAME ShieldIIPt-PT-030A-ReachabilityCardinality-2024-04
FORMULA_NAME ShieldIIPt-PT-030A-ReachabilityCardinality-2024-05
FORMULA_NAME ShieldIIPt-PT-030A-ReachabilityCardinality-2024-06
FORMULA_NAME ShieldIIPt-PT-030A-ReachabilityCardinality-2024-07
FORMULA_NAME ShieldIIPt-PT-030A-ReachabilityCardinality-2024-08
FORMULA_NAME ShieldIIPt-PT-030A-ReachabilityCardinality-2024-09
FORMULA_NAME ShieldIIPt-PT-030A-ReachabilityCardinality-2024-10
FORMULA_NAME ShieldIIPt-PT-030A-ReachabilityCardinality-2024-11
FORMULA_NAME ShieldIIPt-PT-030A-ReachabilityCardinality-2024-12
FORMULA_NAME ShieldIIPt-PT-030A-ReachabilityCardinality-2024-13
FORMULA_NAME ShieldIIPt-PT-030A-ReachabilityCardinality-2024-14
FORMULA_NAME ShieldIIPt-PT-030A-ReachabilityCardinality-2024-15
=== Now, execution of the tool begins
BK_START 1716935495183
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPt-PT-030A
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 22:31:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-28 22:31:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 22:31:36] [INFO ] Load time of PNML (sax parser for PT used): 109 ms
[2024-05-28 22:31:36] [INFO ] Transformed 573 places.
[2024-05-28 22:31:36] [INFO ] Transformed 423 transitions.
[2024-05-28 22:31:36] [INFO ] Found NUPN structural information;
[2024-05-28 22:31:36] [INFO ] Parsed PT model containing 573 places and 423 transitions and 1806 arcs in 214 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 23 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
FORMULA ShieldIIPt-PT-030A-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-030A-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-030A-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8 resets) in 1945 ms. (20 steps per ms) remains 9/13 properties
FORMULA ShieldIIPt-PT-030A-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-030A-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-030A-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-030A-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 402 ms. (99 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 1087 ms. (36 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 296 ms. (134 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 258 ms. (154 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 273 ms. (146 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 242 ms. (164 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 280 ms. (142 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 253 ms. (157 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 174 ms. (228 steps per ms) remains 9/9 properties
// Phase 1: matrix 422 rows 573 cols
[2024-05-28 22:31:38] [INFO ] Computed 271 invariants in 14 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 102/102 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 104/206 variables, 93/195 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 104/299 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 367/573 variables, 178/477 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/573 variables, 367/844 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/573 variables, 0/844 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 422/995 variables, 573/1417 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/995 variables, 0/1417 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 0/995 variables, 0/1417 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 995/995 variables, and 1417 constraints, problems are : Problem set: 0 solved, 9 unsolved in 1553 ms.
Refiners :[Domain max(s): 573/573 constraints, Positive P Invariants (semi-flows): 271/271 constraints, State Equation: 573/573 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 102/102 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 104/206 variables, 93/195 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 104/299 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 367/573 variables, 178/477 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/573 variables, 367/844 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/573 variables, 0/844 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 422/995 variables, 573/1417 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/995 variables, 9/1426 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/995 variables, 0/1426 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 0/995 variables, 0/1426 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 995/995 variables, and 1426 constraints, problems are : Problem set: 0 solved, 9 unsolved in 2067 ms.
Refiners :[Domain max(s): 573/573 constraints, Positive P Invariants (semi-flows): 271/271 constraints, State Equation: 573/573 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 3729ms problems are : Problem set: 0 solved, 9 unsolved
Fused 9 Parikh solutions to 7 different solutions.
FORMULA ShieldIIPt-PT-030A-ReachabilityCardinality-2024-13 TRUE TECHNIQUES PARIKH_WALK
FORMULA ShieldIIPt-PT-030A-ReachabilityCardinality-2024-14 FALSE TECHNIQUES PARIKH_WALK
FORMULA ShieldIIPt-PT-030A-ReachabilityCardinality-2024-10 TRUE TECHNIQUES PARIKH_WALK
FORMULA ShieldIIPt-PT-030A-ReachabilityCardinality-2024-08 FALSE TECHNIQUES PARIKH_WALK
FORMULA ShieldIIPt-PT-030A-ReachabilityCardinality-2024-05 FALSE TECHNIQUES PARIKH_WALK
FORMULA ShieldIIPt-PT-030A-ReachabilityCardinality-2024-02 FALSE TECHNIQUES PARIKH_WALK
FORMULA ShieldIIPt-PT-030A-ReachabilityCardinality-2024-00 FALSE TECHNIQUES PARIKH_WALK
FORMULA ShieldIIPt-PT-030A-ReachabilityCardinality-2024-15 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 8 properties in 8887 ms.
Support contains 30 out of 573 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 573/573 places, 422/422 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 573 transition count 421
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 572 transition count 421
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 571 transition count 420
Partial Free-agglomeration rule applied 52 times.
Drop transitions (Partial Free agglomeration) removed 52 transitions
Iterating global reduction 0 with 52 rules applied. Total rules applied 56 place count 571 transition count 420
Applied a total of 56 rules in 164 ms. Remains 571 /573 variables (removed 2) and now considering 420/422 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 175 ms. Remains : 571/573 places, 420/422 transitions.
RANDOM walk for 40000 steps (8 resets) in 902 ms. (44 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 275 ms. (144 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 212049 steps, run visited all 1 properties in 1509 ms. (steps per millisecond=140 )
Probabilistic random walk after 212049 steps, saw 206558 distinct states, run finished after 1513 ms. (steps per millisecond=140 ) properties seen :1
FORMULA ShieldIIPt-PT-030A-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
All properties solved without resorting to model-checking.
Total runtime 16737 ms.
ITS solved all properties within timeout
BK_STOP 1716935513158
--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -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="ShieldIIPt-PT-030A"
export BK_EXAMINATION="ReachabilityCardinality"
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 ShieldIIPt-PT-030A, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r355-tall-171683758500294"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPt-PT-030A.tgz
mv ShieldIIPt-PT-030A execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;