Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r409-oct2-167903727900388.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................
=====================================================================
Generated by BenchKit 2-5348
Executing tool smartxred
Input is ShieldPPPt-PT-010B, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r409-oct2-167903727900388
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 572K
-rw-r--r-- 1 mcc users 6.0K Feb 25 21:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Feb 25 21:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 25 21:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 25 21:05 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.2K Feb 25 17:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 17:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 17:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 21:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 116K Feb 25 21:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 25 21:05 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 34K Feb 25 21:05 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:00 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 185K Mar 5 18:23 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 StableMarking

=== Now, execution of the tool begins

BK_START 1679773337333

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=smartxred
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=ShieldPPPt-PT-010B
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-25 19:42:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2023-03-25 19:42:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-25 19:42:21] [INFO ] Load time of PNML (sax parser for PT used): 183 ms
[2023-03-25 19:42:21] [INFO ] Transformed 783 places.
[2023-03-25 19:42:21] [INFO ] Transformed 713 transitions.
[2023-03-25 19:42:21] [INFO ] Found NUPN structural information;
[2023-03-25 19:42:21] [INFO ] Parsed PT model containing 783 places and 713 transitions and 1786 arcs in 368 ms.
Structural test allowed to assert that 284 places are NOT stable. Took 56 ms.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 647 ms. (steps per millisecond=15 ) properties (out of 499) seen :460
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 39) seen :0
Running SMT prover for 39 properties.
// Phase 1: matrix 713 rows 783 cols
[2023-03-25 19:42:22] [INFO ] Computed 111 place invariants in 23 ms
[2023-03-25 19:42:23] [INFO ] After 1401ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:39
[2023-03-25 19:42:25] [INFO ] [Nat]Absence check using 111 positive place invariants in 45 ms returned sat
[2023-03-25 19:42:28] [INFO ] After 2316ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :39
[2023-03-25 19:42:28] [INFO ] Deduced a trap composed of 24 places in 332 ms of which 20 ms to minimize.
[2023-03-25 19:42:29] [INFO ] Deduced a trap composed of 22 places in 513 ms of which 1 ms to minimize.
[2023-03-25 19:42:29] [INFO ] Deduced a trap composed of 21 places in 281 ms of which 1 ms to minimize.
[2023-03-25 19:42:29] [INFO ] Deduced a trap composed of 20 places in 198 ms of which 2 ms to minimize.
[2023-03-25 19:42:30] [INFO ] Deduced a trap composed of 19 places in 239 ms of which 16 ms to minimize.
[2023-03-25 19:42:30] [INFO ] Deduced a trap composed of 21 places in 147 ms of which 1 ms to minimize.
[2023-03-25 19:42:30] [INFO ] Deduced a trap composed of 21 places in 129 ms of which 0 ms to minimize.
[2023-03-25 19:42:30] [INFO ] Deduced a trap composed of 20 places in 183 ms of which 13 ms to minimize.
[2023-03-25 19:42:30] [INFO ] Deduced a trap composed of 28 places in 156 ms of which 1 ms to minimize.
[2023-03-25 19:42:31] [INFO ] Deduced a trap composed of 22 places in 841 ms of which 0 ms to minimize.
[2023-03-25 19:42:32] [INFO ] Deduced a trap composed of 24 places in 170 ms of which 0 ms to minimize.
[2023-03-25 19:42:32] [INFO ] Deduced a trap composed of 18 places in 145 ms of which 0 ms to minimize.
[2023-03-25 19:42:32] [INFO ] Deduced a trap composed of 20 places in 126 ms of which 13 ms to minimize.
[2023-03-25 19:42:32] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 0 ms to minimize.
[2023-03-25 19:42:32] [INFO ] Deduced a trap composed of 28 places in 93 ms of which 1 ms to minimize.
[2023-03-25 19:42:32] [INFO ] Deduced a trap composed of 25 places in 88 ms of which 1 ms to minimize.
[2023-03-25 19:42:32] [INFO ] Deduced a trap composed of 23 places in 128 ms of which 1 ms to minimize.
[2023-03-25 19:42:33] [INFO ] Deduced a trap composed of 25 places in 169 ms of which 1 ms to minimize.
[2023-03-25 19:42:33] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 4675 ms
[2023-03-25 19:42:35] [INFO ] Deduced a trap composed of 26 places in 82 ms of which 0 ms to minimize.
[2023-03-25 19:42:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 169 ms
[2023-03-25 19:42:36] [INFO ] After 9995ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :39
Attempting to minimize the solution found.
Minimization took 1590 ms.
[2023-03-25 19:42:37] [INFO ] After 13760ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :39
Fused 39 Parikh solutions to 30 different solutions.
Parikh walk visited 0 properties in 5427 ms.
Support contains 39 out of 783 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 783/783 places, 713/713 transitions.
Drop transitions removed 183 transitions
Trivial Post-agglo rules discarded 183 transitions
Performed 183 trivial Post agglomeration. Transition count delta: 183
Iterating post reduction 0 with 183 rules applied. Total rules applied 183 place count 783 transition count 530
Reduce places removed 183 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 185 rules applied. Total rules applied 368 place count 600 transition count 528
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 369 place count 599 transition count 528
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 40 Pre rules applied. Total rules applied 369 place count 599 transition count 488
Deduced a syphon composed of 40 places in 4 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 449 place count 559 transition count 488
Discarding 61 places :
Symmetric choice reduction at 3 with 61 rule applications. Total rules 510 place count 498 transition count 427
Iterating global reduction 3 with 61 rules applied. Total rules applied 571 place count 498 transition count 427
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 24 Pre rules applied. Total rules applied 571 place count 498 transition count 403
Deduced a syphon composed of 24 places in 3 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 619 place count 474 transition count 403
Performed 168 Post agglomeration using F-continuation condition.Transition count delta: 168
Deduced a syphon composed of 168 places in 1 ms
Reduce places removed 168 places and 0 transitions.
Iterating global reduction 3 with 336 rules applied. Total rules applied 955 place count 306 transition count 235
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 1005 place count 281 transition count 235
Free-agglomeration rule applied 4 times.
Iterating global reduction 3 with 4 rules applied. Total rules applied 1009 place count 281 transition count 231
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 1013 place count 277 transition count 231
Partial Free-agglomeration rule applied 27 times.
Drop transitions removed 27 transitions
Iterating global reduction 4 with 27 rules applied. Total rules applied 1040 place count 277 transition count 231
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1041 place count 276 transition count 230
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1042 place count 275 transition count 230
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 1042 place count 275 transition count 228
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 1046 place count 273 transition count 228
Applied a total of 1046 rules in 257 ms. Remains 273 /783 variables (removed 510) and now considering 228/713 (removed 485) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 258 ms. Remains : 273/783 places, 228/713 transitions.
Finished random walk after 3034 steps, including 0 resets, run visited all 39 properties in 64 ms. (steps per millisecond=47 )
Able to resolve query StableMarking after proving 500 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK MARKED_SUFFIX_TEST TOPOLOGICAL
Total runtime 22497 ms.
ITS solved all properties within timeout

BK_STOP 1679773363710

--------------------
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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination StableMarking -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="ShieldPPPt-PT-010B"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="smartxred"
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-5348"
echo " Executing tool smartxred"
echo " Input is ShieldPPPt-PT-010B, examination is StableMarking"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r409-oct2-167903727900388"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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