Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r301-smll-165463877000218.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is StigmergyElection-PT-08a, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r301-smll-165463877000218
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.8M
-rw-r--r-- 1 mcc users 7.5K May 30 14:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K May 30 14:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 30 14:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K May 30 14:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 25 13:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 25 13:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 25 13:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 25 13:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 29 12:20 NewModel
-rw-r--r-- 1 mcc users 12K May 30 15:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 131K May 30 15:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K May 30 15:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K May 30 15:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 25 13:05 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 25 13:05 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 12:20 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 12:20 instance
-rw-r--r-- 1 mcc users 6 May 29 12:20 iscolored
-rw-r--r-- 1 mcc users 5.3M May 29 12:20 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 1654653513667

Running Version 202205111006
[2022-06-08 01:58:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 1800]
[2022-06-08 01:58:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-08 01:58:37] [INFO ] Load time of PNML (sax parser for PT used): 981 ms
[2022-06-08 01:58:37] [INFO ] Transformed 114 places.
[2022-06-08 01:58:37] [INFO ] Transformed 6882 transitions.
[2022-06-08 01:58:37] [INFO ] Found NUPN structural information;
[2022-06-08 01:58:37] [INFO ] Parsed PT model containing 114 places and 6882 transitions in 1266 ms.
Structural test allowed to assert that 18 places are NOT stable. Took 29 ms.
Ensure Unique test removed 6218 transitions
Reduce redundant transitions removed 6218 transitions.
Incomplete random walk after 10000 steps, including 7 resets, run finished after 1119 ms. (steps per millisecond=8 ) properties (out of 96) seen :81
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) 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 15) 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 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) 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 15) 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 15) 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 15) 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 15) 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 15) 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 15) 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 15) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 14) 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 14) 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 14) 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 14) seen :1
Running SMT prover for 13 properties.
[2022-06-08 01:58:38] [INFO ] Flow matrix only has 640 transitions (discarded 24 similar events)
// Phase 1: matrix 640 rows 114 cols
[2022-06-08 01:58:38] [INFO ] Computed 9 place invariants in 23 ms
[2022-06-08 01:58:39] [INFO ] After 358ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2022-06-08 01:58:39] [INFO ] [Nat]Absence check using 9 positive place invariants in 7 ms returned sat
[2022-06-08 01:58:39] [INFO ] After 584ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :13
[2022-06-08 01:58:40] [INFO ] State equation strengthened by 549 read => feed constraints.
[2022-06-08 01:58:40] [INFO ] After 557ms SMT Verify possible using 549 Read/Feed constraints in natural domain returned unsat :0 sat :13
[2022-06-08 01:58:40] [INFO ] Deduced a trap composed of 13 places in 340 ms of which 8 ms to minimize.
[2022-06-08 01:58:41] [INFO ] Deduced a trap composed of 12 places in 235 ms of which 2 ms to minimize.
[2022-06-08 01:58:41] [INFO ] Deduced a trap composed of 12 places in 299 ms of which 2 ms to minimize.
[2022-06-08 01:58:41] [INFO ] Deduced a trap composed of 12 places in 245 ms of which 1 ms to minimize.
[2022-06-08 01:58:42] [INFO ] Deduced a trap composed of 13 places in 252 ms of which 1 ms to minimize.
[2022-06-08 01:58:42] [INFO ] Deduced a trap composed of 13 places in 195 ms of which 1 ms to minimize.
[2022-06-08 01:58:42] [INFO ] Deduced a trap composed of 12 places in 172 ms of which 1 ms to minimize.
[2022-06-08 01:58:42] [INFO ] Deduced a trap composed of 12 places in 167 ms of which 1 ms to minimize.
[2022-06-08 01:58:43] [INFO ] Deduced a trap composed of 12 places in 113 ms of which 0 ms to minimize.
[2022-06-08 01:58:43] [INFO ] Deduced a trap composed of 12 places in 114 ms of which 0 ms to minimize.
[2022-06-08 01:58:43] [INFO ] Deduced a trap composed of 12 places in 141 ms of which 1 ms to minimize.
[2022-06-08 01:58:43] [INFO ] Deduced a trap composed of 12 places in 115 ms of which 2 ms to minimize.
[2022-06-08 01:58:43] [INFO ] Deduced a trap composed of 12 places in 112 ms of which 1 ms to minimize.
[2022-06-08 01:58:43] [INFO ] Deduced a trap composed of 12 places in 90 ms of which 1 ms to minimize.
[2022-06-08 01:58:43] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 3138 ms
[2022-06-08 01:58:43] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 1 ms to minimize.
[2022-06-08 01:58:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 114 ms
[2022-06-08 01:58:44] [INFO ] Deduced a trap composed of 12 places in 87 ms of which 2 ms to minimize.
[2022-06-08 01:58:44] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 0 ms to minimize.
[2022-06-08 01:58:44] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 247 ms
[2022-06-08 01:58:44] [INFO ] Deduced a trap composed of 12 places in 89 ms of which 0 ms to minimize.
[2022-06-08 01:58:44] [INFO ] Deduced a trap composed of 12 places in 108 ms of which 1 ms to minimize.
[2022-06-08 01:58:44] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 343 ms
[2022-06-08 01:58:45] [INFO ] Deduced a trap composed of 12 places in 89 ms of which 1 ms to minimize.
[2022-06-08 01:58:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 157 ms
[2022-06-08 01:58:45] [INFO ] After 5210ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :13
Attempting to minimize the solution found.
Minimization took 718 ms.
[2022-06-08 01:58:45] [INFO ] After 6798ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :13
Parikh walk visited 0 properties in 4169 ms.
Support contains 13 out of 114 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 114/114 places, 664/664 transitions.
Graph (complete) has 353 edges and 114 vertex of which 109 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.15 ms
Discarding 5 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Drop transitions removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 41 rules applied. Total rules applied 42 place count 109 transition count 618
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 40 rules applied. Total rules applied 82 place count 93 transition count 594
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 90 place count 85 transition count 594
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 90 place count 85 transition count 584
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 110 place count 75 transition count 584
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 121 place count 64 transition count 573
Iterating global reduction 3 with 11 rules applied. Total rules applied 132 place count 64 transition count 573
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 143 place count 53 transition count 562
Iterating global reduction 3 with 11 rules applied. Total rules applied 154 place count 53 transition count 562
Ensure Unique test removed 257 transitions
Reduce isomorphic transitions removed 257 transitions.
Iterating post reduction 3 with 257 rules applied. Total rules applied 411 place count 53 transition count 305
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 427 place count 45 transition count 297
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 435 place count 37 transition count 289
Iterating global reduction 4 with 8 rules applied. Total rules applied 443 place count 37 transition count 289
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 444 place count 37 transition count 288
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 445 place count 37 transition count 288
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 446 place count 36 transition count 287
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 447 place count 35 transition count 287
Performed 8 Post agglomeration using F-continuation condition with reduction of 246 identical transitions.
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 5 with 18 rules applied. Total rules applied 465 place count 25 transition count 33
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 473 place count 25 transition count 25
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 474 place count 25 transition count 25
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 475 place count 25 transition count 24
Applied a total of 475 rules in 228 ms. Remains 25 /114 variables (removed 89) and now considering 24/664 (removed 640) transitions.
Finished structural reductions, in 1 iterations. Remains : 25/114 places, 24/664 transitions.
Finished random walk after 94 steps, including 4 resets, run visited all 13 properties in 6 ms. (steps per millisecond=15 )
Able to resolve query StableMarking after proving 97 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK MARKED_SUFFIX_TEST BESTFIRST_WALK TOPOLOGICAL
Total runtime 14406 ms.

BK_STOP 1654653530548

--------------------
content from stderr:

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ StableMarking = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution StableMarking -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination StableMarking -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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="StigmergyElection-PT-08a"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="itstools"
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-4028"
echo " Executing tool itstools"
echo " Input is StigmergyElection-PT-08a, 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 r301-smll-165463877000218"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/StigmergyElection-PT-08a.tgz
mv StigmergyElection-PT-08a 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 ;