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.r538-tall-171690547800228.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 ltsminxred
Input is StigmergyElection-PT-09a, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r538-tall-171690547800228
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 17M
-rw-r--r-- 1 mcc users 8.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 91K 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 42K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 23 08:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 08:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 23 08:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 08:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 11 19:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 122K Apr 11 19:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Apr 11 19:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 11 19:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 08:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 08:00 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 17M 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

FORMULA_NAME StableMarking

=== Now, execution of the tool begins

BK_START 1717229214324

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=StigmergyElection-PT-09a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 08:06:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2024-06-01 08:06:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 08:06:56] [INFO ] Load time of PNML (sax parser for PT used): 844 ms
[2024-06-01 08:06:56] [INFO ] Transformed 128 places.
[2024-06-01 08:06:56] [INFO ] Transformed 18490 transitions.
[2024-06-01 08:06:56] [INFO ] Found NUPN structural information;
[2024-06-01 08:06:56] [INFO ] Parsed PT model containing 128 places and 18490 transitions and 329609 arcs in 1063 ms.
Structural test allowed to assert that 20 places are NOT stable. Took 24 ms.
Ensure Unique test removed 17295 transitions
Reduce redundant transitions removed 17295 transitions.
RANDOM walk for 40000 steps (22 resets) in 3314 ms. (12 steps per ms) remains 5/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 72 ms. (548 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 63 ms. (625 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 49 ms. (800 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 83 ms. (476 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 64 ms. (615 steps per ms) remains 5/5 properties
[2024-06-01 08:06:57] [INFO ] Flow matrix only has 1168 transitions (discarded 27 similar events)
// Phase 1: matrix 1168 rows 128 cols
[2024-06-01 08:06:57] [INFO ] Computed 10 invariants in 24 ms
[2024-06-01 08:06:58] [INFO ] State equation strengthened by 1066 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 38/43 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 38/46 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 85/128 variables, 7/53 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 85/138 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/128 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 1167/1295 variables, 128/266 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1295 variables, 1065/1331 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1295 variables, 0/1331 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 1/1296 variables, 1/1332 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1296 variables, 0/1332 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 0/1296 variables, 0/1332 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1296/1296 variables, and 1332 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1207 ms.
Refiners :[Domain max(s): 128/128 constraints, Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 128/128 constraints, ReadFeed: 1066/1066 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 38/43 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 38/46 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 08:06:59] [INFO ] Deduced a trap composed of 12 places in 117 ms of which 8 ms to minimize.
[2024-06-01 08:06:59] [INFO ] Deduced a trap composed of 12 places in 113 ms of which 4 ms to minimize.
[2024-06-01 08:06:59] [INFO ] Deduced a trap composed of 12 places in 102 ms of which 1 ms to minimize.
[2024-06-01 08:06:59] [INFO ] Deduced a trap composed of 12 places in 79 ms of which 1 ms to minimize.
[2024-06-01 08:06:59] [INFO ] Deduced a trap composed of 12 places in 77 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 5/51 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 08:06:59] [INFO ] Deduced a trap composed of 12 places in 65 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/43 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 85/128 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/128 variables, 85/144 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 08:07:00] [INFO ] Deduced a trap composed of 12 places in 207 ms of which 1 ms to minimize.
[2024-06-01 08:07:00] [INFO ] Deduced a trap composed of 12 places in 202 ms of which 1 ms to minimize.
[2024-06-01 08:07:00] [INFO ] Deduced a trap composed of 12 places in 169 ms of which 1 ms to minimize.
[2024-06-01 08:07:00] [INFO ] Deduced a trap composed of 12 places in 165 ms of which 1 ms to minimize.
[2024-06-01 08:07:00] [INFO ] Deduced a trap composed of 12 places in 162 ms of which 1 ms to minimize.
[2024-06-01 08:07:01] [INFO ] Deduced a trap composed of 12 places in 163 ms of which 0 ms to minimize.
[2024-06-01 08:07:01] [INFO ] Deduced a trap composed of 12 places in 142 ms of which 2 ms to minimize.
[2024-06-01 08:07:01] [INFO ] Deduced a trap composed of 13 places in 136 ms of which 1 ms to minimize.
[2024-06-01 08:07:01] [INFO ] Deduced a trap composed of 12 places in 112 ms of which 1 ms to minimize.
[2024-06-01 08:07:01] [INFO ] Deduced a trap composed of 12 places in 137 ms of which 1 ms to minimize.
[2024-06-01 08:07:01] [INFO ] Deduced a trap composed of 12 places in 147 ms of which 3 ms to minimize.
[2024-06-01 08:07:01] [INFO ] Deduced a trap composed of 13 places in 144 ms of which 1 ms to minimize.
[2024-06-01 08:07:02] [INFO ] Deduced a trap composed of 12 places in 118 ms of which 1 ms to minimize.
[2024-06-01 08:07:02] [INFO ] Deduced a trap composed of 12 places in 92 ms of which 1 ms to minimize.
[2024-06-01 08:07:02] [INFO ] Deduced a trap composed of 12 places in 130 ms of which 5 ms to minimize.
[2024-06-01 08:07:02] [INFO ] Deduced a trap composed of 12 places in 117 ms of which 1 ms to minimize.
[2024-06-01 08:07:02] [INFO ] Deduced a trap composed of 12 places in 90 ms of which 1 ms to minimize.
[2024-06-01 08:07:02] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 1 ms to minimize.
[2024-06-01 08:07:02] [INFO ] Deduced a trap composed of 12 places in 180 ms of which 2 ms to minimize.
[2024-06-01 08:07:02] [INFO ] Deduced a trap composed of 12 places in 141 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/128 variables, 20/164 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 08:07:03] [INFO ] Deduced a trap composed of 13 places in 170 ms of which 1 ms to minimize.
[2024-06-01 08:07:03] [INFO ] Deduced a trap composed of 13 places in 169 ms of which 1 ms to minimize.
[2024-06-01 08:07:03] [INFO ] Deduced a trap composed of 12 places in 138 ms of which 1 ms to minimize.
[2024-06-01 08:07:03] [INFO ] Deduced a trap composed of 12 places in 116 ms of which 0 ms to minimize.
[2024-06-01 08:07:03] [INFO ] Deduced a trap composed of 12 places in 92 ms of which 1 ms to minimize.
[2024-06-01 08:07:03] [INFO ] Deduced a trap composed of 12 places in 111 ms of which 1 ms to minimize.
[2024-06-01 08:07:03] [INFO ] Deduced a trap composed of 12 places in 127 ms of which 1 ms to minimize.
[2024-06-01 08:07:03] [INFO ] Deduced a trap composed of 12 places in 90 ms of which 1 ms to minimize.
[2024-06-01 08:07:04] [INFO ] Deduced a trap composed of 12 places in 95 ms of which 2 ms to minimize.
[2024-06-01 08:07:04] [INFO ] Deduced a trap composed of 12 places in 73 ms of which 0 ms to minimize.
[2024-06-01 08:07:04] [INFO ] Deduced a trap composed of 13 places in 112 ms of which 1 ms to minimize.
[2024-06-01 08:07:04] [INFO ] Deduced a trap composed of 12 places in 108 ms of which 0 ms to minimize.
SMT process timed out in 6475ms, After SMT, problems are : Problem set: 0 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 5 out of 128 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 128/128 places, 1195/1195 transitions.
Graph (complete) has 424 edges and 128 vertex of which 120 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.13 ms
Discarding 8 places :
Also discarding 8 output transitions
Drop transitions (Output transitions of discarded places.) removed 8 transitions
Drop transitions (Empty/Sink Transition effects.) removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 46 rules applied. Total rules applied 47 place count 120 transition count 1141
Reduce places removed 18 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 45 rules applied. Total rules applied 92 place count 102 transition count 1114
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 101 place count 93 transition count 1114
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 15 Pre rules applied. Total rules applied 101 place count 93 transition count 1099
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 131 place count 78 transition count 1099
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 147 place count 62 transition count 1083
Iterating global reduction 3 with 16 rules applied. Total rules applied 163 place count 62 transition count 1083
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 179 place count 46 transition count 1067
Iterating global reduction 3 with 16 rules applied. Total rules applied 195 place count 46 transition count 1067
Ensure Unique test removed 517 transitions
Reduce isomorphic transitions removed 517 transitions.
Iterating post reduction 3 with 517 rules applied. Total rules applied 712 place count 46 transition count 550
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 730 place count 37 transition count 541
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 739 place count 28 transition count 532
Iterating global reduction 4 with 9 rules applied. Total rules applied 748 place count 28 transition count 532
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 749 place count 28 transition count 531
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 750 place count 28 transition count 531
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 751 place count 27 transition count 530
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 752 place count 26 transition count 530
Performed 9 Post agglomeration using F-continuation condition with reduction of 501 identical transitions.
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 5 with 24 rules applied. Total rules applied 776 place count 11 transition count 20
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 5 with 9 rules applied. Total rules applied 785 place count 11 transition count 11
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 786 place count 11 transition count 11
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 787 place count 11 transition count 10
Applied a total of 787 rules in 360 ms. Remains 11 /128 variables (removed 117) and now considering 10/1195 (removed 1185) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 371 ms. Remains : 11/128 places, 10/1195 transitions.
RANDOM walk for 47 steps (5 resets) in 7 ms. (5 steps per ms) remains 0/5 properties
Able to resolve query StableMarking after proving 109 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK MARKED_SUFFIX_TEST TOPOLOGICAL
Total runtime 9366 ms.
ITS solved all properties within timeout

BK_STOP 1717229224807

--------------------
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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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="StigmergyElection-PT-09a"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="ltsminxred"
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-5568"
echo " Executing tool ltsminxred"
echo " Input is StigmergyElection-PT-09a, 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 r538-tall-171690547800228"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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