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-167903727800307.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 ShieldPPPs-PT-040B, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r409-oct2-167903727800307
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 5.5K Feb 26 01:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 51K Feb 26 01:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Feb 26 01:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 72K Feb 26 01:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 01:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 115K Feb 26 01:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Feb 26 01:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 26 01:58 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:59 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 708K 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 QuasiLiveness

=== Now, execution of the tool begins

BK_START 1679772554424

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=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=ShieldPPPs-PT-040B
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-25 19:29:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2023-03-25 19:29:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-25 19:29:17] [INFO ] Load time of PNML (sax parser for PT used): 222 ms
[2023-03-25 19:29:17] [INFO ] Transformed 2723 places.
[2023-03-25 19:29:17] [INFO ] Transformed 2523 transitions.
[2023-03-25 19:29:17] [INFO ] Found NUPN structural information;
[2023-03-25 19:29:17] [INFO ] Parsed PT model containing 2723 places and 2523 transitions and 6966 arcs in 523 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 2723/2723 places, 2523/2523 transitions.
Drop transitions removed 282 transitions
Trivial Post-agglo rules discarded 282 transitions
Performed 282 trivial Post agglomeration. Transition count delta: 282
Iterating post reduction 0 with 282 rules applied. Total rules applied 282 place count 2723 transition count 2241
Reduce places removed 282 places and 0 transitions.
Iterating post reduction 1 with 282 rules applied. Total rules applied 564 place count 2441 transition count 2241
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 200 Pre rules applied. Total rules applied 564 place count 2441 transition count 2041
Deduced a syphon composed of 200 places in 22 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 2 with 400 rules applied. Total rules applied 964 place count 2241 transition count 2041
Performed 960 Post agglomeration using F-continuation condition.Transition count delta: 960
Deduced a syphon composed of 960 places in 4 ms
Reduce places removed 960 places and 0 transitions.
Iterating global reduction 2 with 1920 rules applied. Total rules applied 2884 place count 1281 transition count 1081
Renaming transitions due to excessive name length > 1024 char.
Applied a total of 2884 rules in 305 ms. Remains 1281 /2723 variables (removed 1442) and now considering 1081/2523 (removed 1442) transitions.
// Phase 1: matrix 1081 rows 1281 cols
[2023-03-25 19:29:18] [INFO ] Computed 441 place invariants in 17 ms
[2023-03-25 19:29:19] [INFO ] Implicit Places using invariants in 1742 ms returned []
[2023-03-25 19:29:19] [INFO ] Invariant cache hit.
[2023-03-25 19:29:22] [INFO ] Implicit Places using invariants and state equation in 2693 ms returned []
Implicit Place search using SMT with State Equation took 4493 ms to find 0 implicit places.
[2023-03-25 19:29:22] [INFO ] Invariant cache hit.
[2023-03-25 19:29:23] [INFO ] Dead Transitions using invariants and state equation in 948 ms found 0 transitions.
Starting structural reductions in LIVENESS mode, iteration 1 : 1281/2723 places, 1081/2523 transitions.
Finished structural reductions in LIVENESS mode , in 1 iterations and 5759 ms. Remains : 1281/2723 places, 1081/2523 transitions.
Discarding 240 transitions out of 1081. Remains 841
Initial state reduction rules removed 1 formulas.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 708 ms. (steps per millisecond=14 ) properties (out of 840) seen :835
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-25 19:29:24] [INFO ] Invariant cache hit.
[2023-03-25 19:29:25] [INFO ] [Real]Absence check using 441 positive place invariants in 124 ms returned sat
[2023-03-25 19:29:26] [INFO ] After 1079ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:3
[2023-03-25 19:29:26] [INFO ] Deduced a trap composed of 4 places in 332 ms of which 7 ms to minimize.
[2023-03-25 19:29:27] [INFO ] Deduced a trap composed of 4 places in 219 ms of which 2 ms to minimize.
[2023-03-25 19:29:27] [INFO ] Deduced a trap composed of 4 places in 185 ms of which 2 ms to minimize.
[2023-03-25 19:29:27] [INFO ] Deduced a trap composed of 4 places in 205 ms of which 1 ms to minimize.
[2023-03-25 19:29:27] [INFO ] Deduced a trap composed of 4 places in 212 ms of which 1 ms to minimize.
[2023-03-25 19:29:28] [INFO ] Deduced a trap composed of 4 places in 248 ms of which 1 ms to minimize.
[2023-03-25 19:29:28] [INFO ] Deduced a trap composed of 4 places in 196 ms of which 1 ms to minimize.
[2023-03-25 19:29:28] [INFO ] Deduced a trap composed of 4 places in 184 ms of which 0 ms to minimize.
[2023-03-25 19:29:28] [INFO ] Deduced a trap composed of 4 places in 196 ms of which 1 ms to minimize.
[2023-03-25 19:29:29] [INFO ] Deduced a trap composed of 4 places in 232 ms of which 1 ms to minimize.
[2023-03-25 19:29:29] [INFO ] Deduced a trap composed of 4 places in 466 ms of which 2 ms to minimize.
[2023-03-25 19:29:29] [INFO ] Trap strengthening procedure interrupted after too many repetitions 3244 ms
[2023-03-25 19:29:29] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 3245 ms
[2023-03-25 19:29:30] [INFO ] Deduced a trap composed of 4 places in 233 ms of which 1 ms to minimize.
[2023-03-25 19:29:30] [INFO ] Deduced a trap composed of 4 places in 265 ms of which 1 ms to minimize.
[2023-03-25 19:29:30] [INFO ] Deduced a trap composed of 4 places in 241 ms of which 1 ms to minimize.
[2023-03-25 19:29:30] [INFO ] Deduced a trap composed of 4 places in 205 ms of which 0 ms to minimize.
[2023-03-25 19:29:31] [INFO ] Deduced a trap composed of 4 places in 170 ms of which 1 ms to minimize.
[2023-03-25 19:29:31] [INFO ] Deduced a trap composed of 4 places in 185 ms of which 1 ms to minimize.
[2023-03-25 19:29:31] [INFO ] Deduced a trap composed of 4 places in 207 ms of which 0 ms to minimize.
[2023-03-25 19:29:31] [INFO ] Deduced a trap composed of 11 places in 214 ms of which 1 ms to minimize.
[2023-03-25 19:29:32] [INFO ] Deduced a trap composed of 4 places in 182 ms of which 0 ms to minimize.
[2023-03-25 19:29:32] [INFO ] Deduced a trap composed of 4 places in 184 ms of which 1 ms to minimize.
[2023-03-25 19:29:32] [INFO ] Deduced a trap composed of 8 places in 205 ms of which 26 ms to minimize.
[2023-03-25 19:29:32] [INFO ] Deduced a trap composed of 4 places in 160 ms of which 0 ms to minimize.
[2023-03-25 19:29:33] [INFO ] Deduced a trap composed of 8 places in 222 ms of which 1 ms to minimize.
[2023-03-25 19:29:33] [INFO ] Deduced a trap composed of 11 places in 149 ms of which 0 ms to minimize.
[2023-03-25 19:29:33] [INFO ] Deduced a trap composed of 18 places in 154 ms of which 1 ms to minimize.
[2023-03-25 19:29:33] [INFO ] Deduced a trap composed of 11 places in 147 ms of which 0 ms to minimize.
[2023-03-25 19:29:34] [INFO ] Deduced a trap composed of 18 places in 119 ms of which 1 ms to minimize.
[2023-03-25 19:29:34] [INFO ] Deduced a trap composed of 24 places in 141 ms of which 1 ms to minimize.
[2023-03-25 19:29:34] [INFO ] Deduced a trap composed of 30 places in 99 ms of which 0 ms to minimize.
[2023-03-25 19:29:34] [INFO ] Deduced a trap composed of 29 places in 191 ms of which 0 ms to minimize.
[2023-03-25 19:29:34] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 4988 ms
[2023-03-25 19:29:34] [INFO ] After 9406ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-25 19:29:34] [INFO ] After 10111ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-25 19:29:36] [INFO ] [Nat]Absence check using 441 positive place invariants in 710 ms returned sat
[2023-03-25 19:29:37] [INFO ] After 1235ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-25 19:29:37] [INFO ] Deduced a trap composed of 4 places in 270 ms of which 1 ms to minimize.
[2023-03-25 19:29:38] [INFO ] Deduced a trap composed of 4 places in 319 ms of which 1 ms to minimize.
[2023-03-25 19:29:38] [INFO ] Deduced a trap composed of 4 places in 221 ms of which 3 ms to minimize.
[2023-03-25 19:29:38] [INFO ] Deduced a trap composed of 4 places in 284 ms of which 0 ms to minimize.
[2023-03-25 19:29:38] [INFO ] Deduced a trap composed of 4 places in 192 ms of which 0 ms to minimize.
[2023-03-25 19:29:39] [INFO ] Deduced a trap composed of 4 places in 215 ms of which 1 ms to minimize.
[2023-03-25 19:29:39] [INFO ] Deduced a trap composed of 4 places in 192 ms of which 0 ms to minimize.
[2023-03-25 19:29:39] [INFO ] Deduced a trap composed of 8 places in 261 ms of which 4 ms to minimize.
[2023-03-25 19:29:40] [INFO ] Deduced a trap composed of 8 places in 239 ms of which 2 ms to minimize.
[2023-03-25 19:29:40] [INFO ] Deduced a trap composed of 4 places in 394 ms of which 3 ms to minimize.
[2023-03-25 19:29:40] [INFO ] Deduced a trap composed of 4 places in 272 ms of which 0 ms to minimize.
[2023-03-25 19:29:41] [INFO ] Deduced a trap composed of 4 places in 191 ms of which 1 ms to minimize.
[2023-03-25 19:29:41] [INFO ] Deduced a trap composed of 4 places in 172 ms of which 1 ms to minimize.
[2023-03-25 19:29:41] [INFO ] Deduced a trap composed of 4 places in 252 ms of which 0 ms to minimize.
[2023-03-25 19:29:42] [INFO ] Deduced a trap composed of 4 places in 377 ms of which 1 ms to minimize.
[2023-03-25 19:29:42] [INFO ] Deduced a trap composed of 4 places in 214 ms of which 0 ms to minimize.
[2023-03-25 19:29:42] [INFO ] Deduced a trap composed of 4 places in 264 ms of which 1 ms to minimize.
[2023-03-25 19:29:42] [INFO ] Deduced a trap composed of 4 places in 163 ms of which 1 ms to minimize.
[2023-03-25 19:29:43] [INFO ] Deduced a trap composed of 8 places in 171 ms of which 0 ms to minimize.
[2023-03-25 19:29:43] [INFO ] Deduced a trap composed of 4 places in 199 ms of which 2 ms to minimize.
[2023-03-25 19:29:43] [INFO ] Deduced a trap composed of 4 places in 138 ms of which 1 ms to minimize.
[2023-03-25 19:29:43] [INFO ] Deduced a trap composed of 11 places in 102 ms of which 1 ms to minimize.
[2023-03-25 19:29:43] [INFO ] Deduced a trap composed of 12 places in 131 ms of which 0 ms to minimize.
[2023-03-25 19:29:43] [INFO ] Deduced a trap composed of 11 places in 134 ms of which 0 ms to minimize.
[2023-03-25 19:29:44] [INFO ] Deduced a trap composed of 12 places in 157 ms of which 12 ms to minimize.
[2023-03-25 19:29:44] [INFO ] Deduced a trap composed of 4 places in 105 ms of which 1 ms to minimize.
[2023-03-25 19:29:44] [INFO ] Deduced a trap composed of 45 places in 157 ms of which 1 ms to minimize.
[2023-03-25 19:29:44] [INFO ] Deduced a trap composed of 8 places in 152 ms of which 0 ms to minimize.
[2023-03-25 19:29:44] [INFO ] Deduced a trap composed of 12 places in 108 ms of which 1 ms to minimize.
[2023-03-25 19:29:45] [INFO ] Deduced a trap composed of 26 places in 126 ms of which 1 ms to minimize.
[2023-03-25 19:29:45] [INFO ] Deduced a trap composed of 12 places in 163 ms of which 1 ms to minimize.
[2023-03-25 19:29:45] [INFO ] Deduced a trap composed of 8 places in 121 ms of which 0 ms to minimize.
[2023-03-25 19:29:45] [INFO ] Deduced a trap composed of 50 places in 128 ms of which 26 ms to minimize.
[2023-03-25 19:29:45] [INFO ] Deduced a trap composed of 18 places in 119 ms of which 0 ms to minimize.
[2023-03-25 19:29:45] [INFO ] Deduced a trap composed of 24 places in 140 ms of which 0 ms to minimize.
[2023-03-25 19:29:45] [INFO ] Deduced a trap composed of 20 places in 110 ms of which 1 ms to minimize.
[2023-03-25 19:29:46] [INFO ] Deduced a trap composed of 24 places in 150 ms of which 15 ms to minimize.
[2023-03-25 19:29:46] [INFO ] Deduced a trap composed of 32 places in 80 ms of which 1 ms to minimize.
[2023-03-25 19:29:46] [INFO ] Trap strengthening (SAT) tested/added 39/38 trap constraints in 9005 ms
[2023-03-25 19:29:46] [INFO ] Deduced a trap composed of 24 places in 129 ms of which 2 ms to minimize.
[2023-03-25 19:29:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 275 ms
[2023-03-25 19:29:47] [INFO ] After 11077ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 380 ms.
[2023-03-25 19:29:47] [INFO ] After 12786ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 5 Parikh solutions to 4 different solutions.
Finished Parikh walk after 53448 steps, including 858 resets, run visited all 2 properties in 752 ms. (steps per millisecond=71 )
Parikh walk visited 5 properties in 1955 ms.
Able to resolve query QuasiLiveness after proving 841 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK PARIKH_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 32276 ms.
ITS solved all properties within timeout

BK_STOP 1679772589818

--------------------
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.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /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="ShieldPPPs-PT-040B"
export BK_EXAMINATION="QuasiLiveness"
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 ShieldPPPs-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 r409-oct2-167903727800307"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPs-PT-040B.tgz
mv ShieldPPPs-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.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property QuasiLiveness.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -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 '' QuasiLiveness.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;