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.r457-smll-167912649100261.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is SmartHome-PT-14, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r457-smll-167912649100261
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 6.2K Feb 26 05:42 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Feb 26 05:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 26 05:41 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K Feb 26 05:41 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 17:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 17:09 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:10 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 17:10 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.7K Feb 26 05:43 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 102K Feb 26 05:43 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K Feb 26 05:42 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 83K Feb 26 05:42 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 17:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 101K 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 positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME SmartHome-PT-14-UpperBounds-00
FORMULA_NAME SmartHome-PT-14-UpperBounds-01
FORMULA_NAME SmartHome-PT-14-UpperBounds-02
FORMULA_NAME SmartHome-PT-14-UpperBounds-03
FORMULA_NAME SmartHome-PT-14-UpperBounds-04
FORMULA_NAME SmartHome-PT-14-UpperBounds-05
FORMULA_NAME SmartHome-PT-14-UpperBounds-06
FORMULA_NAME SmartHome-PT-14-UpperBounds-07
FORMULA_NAME SmartHome-PT-14-UpperBounds-08
FORMULA_NAME SmartHome-PT-14-UpperBounds-09
FORMULA_NAME SmartHome-PT-14-UpperBounds-10
FORMULA_NAME SmartHome-PT-14-UpperBounds-11
FORMULA_NAME SmartHome-PT-14-UpperBounds-12
FORMULA_NAME SmartHome-PT-14-UpperBounds-13
FORMULA_NAME SmartHome-PT-14-UpperBounds-14
FORMULA_NAME SmartHome-PT-14-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1679324650208

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=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SmartHome-PT-14
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-20 15:04:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-20 15:04:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 15:04:13] [INFO ] Load time of PNML (sax parser for PT used): 112 ms
[2023-03-20 15:04:13] [INFO ] Transformed 422 places.
[2023-03-20 15:04:13] [INFO ] Transformed 448 transitions.
[2023-03-20 15:04:13] [INFO ] Found NUPN structural information;
[2023-03-20 15:04:13] [INFO ] Parsed PT model containing 422 places and 448 transitions and 1026 arcs in 270 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Deduced a syphon composed of 129 places in 5 ms
Reduce places removed 129 places and 104 transitions.
FORMULA SmartHome-PT-14-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-14-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-14-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-14-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-14-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 344 rows 293 cols
[2023-03-20 15:04:13] [INFO ] Computed 14 place invariants in 28 ms
Incomplete random walk after 10000 steps, including 43 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 11) seen :10
FORMULA SmartHome-PT-14-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SmartHome-PT-14-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SmartHome-PT-14-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SmartHome-PT-14-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SmartHome-PT-14-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SmartHome-PT-14-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SmartHome-PT-14-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SmartHome-PT-14-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SmartHome-PT-14-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SmartHome-PT-14-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
[2023-03-20 15:04:13] [INFO ] Invariant cache hit.
[2023-03-20 15:04:13] [INFO ] [Real]Absence check using 14 positive place invariants in 20 ms returned sat
[2023-03-20 15:04:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 15:04:14] [INFO ] [Real]Absence check using state equation in 194 ms returned sat
[2023-03-20 15:04:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 15:04:14] [INFO ] [Nat]Absence check using 14 positive place invariants in 12 ms returned sat
[2023-03-20 15:04:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 15:04:14] [INFO ] [Nat]Absence check using state equation in 165 ms returned sat
[2023-03-20 15:04:14] [INFO ] Deduced a trap composed of 45 places in 225 ms of which 6 ms to minimize.
[2023-03-20 15:04:14] [INFO ] Deduced a trap composed of 83 places in 161 ms of which 1 ms to minimize.
[2023-03-20 15:04:15] [INFO ] Deduced a trap composed of 90 places in 114 ms of which 1 ms to minimize.
[2023-03-20 15:04:15] [INFO ] Deduced a trap composed of 63 places in 86 ms of which 1 ms to minimize.
[2023-03-20 15:04:15] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 694 ms
[2023-03-20 15:04:15] [INFO ] Computed and/alt/rep : 314/513/314 causal constraints (skipped 29 transitions) in 49 ms.
[2023-03-20 15:04:15] [INFO ] Added : 100 causal constraints over 21 iterations in 654 ms. Result :sat
Minimization took 82 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 293 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 293/293 places, 344/344 transitions.
Graph (trivial) has 297 edges and 293 vertex of which 128 / 293 are part of one of the 8 SCC in 10 ms
Free SCC test removed 120 places
Drop transitions removed 156 transitions
Reduce isomorphic transitions removed 156 transitions.
Graph (complete) has 276 edges and 173 vertex of which 151 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.1 ms
Discarding 22 places :
Also discarding 12 output transitions
Drop transitions removed 12 transitions
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 69 transitions
Trivial Post-agglo rules discarded 69 transitions
Performed 69 trivial Post agglomeration. Transition count delta: 69
Iterating post reduction 0 with 76 rules applied. Total rules applied 78 place count 151 transition count 100
Reduce places removed 69 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 83 rules applied. Total rules applied 161 place count 82 transition count 86
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 167 place count 76 transition count 86
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 167 place count 76 transition count 83
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 173 place count 73 transition count 83
Discarding 32 places :
Symmetric choice reduction at 3 with 32 rule applications. Total rules 205 place count 41 transition count 51
Iterating global reduction 3 with 32 rules applied. Total rules applied 237 place count 41 transition count 51
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 245 place count 41 transition count 43
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 245 place count 41 transition count 37
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 257 place count 35 transition count 37
Graph (complete) has 59 edges and 35 vertex of which 21 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.0 ms
Discarding 14 places :
Also discarding 15 output transitions
Drop transitions removed 15 transitions
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 4 with 4 rules applied. Total rules applied 261 place count 21 transition count 19
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 9 rules applied. Total rules applied 270 place count 18 transition count 13
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 270 place count 18 transition count 12
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 272 place count 17 transition count 12
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 280 place count 13 transition count 8
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 281 place count 12 transition count 7
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 6 with 5 rules applied. Total rules applied 286 place count 9 transition count 5
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 288 place count 7 transition count 5
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 3 Pre rules applied. Total rules applied 288 place count 7 transition count 2
Deduced a syphon composed of 3 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 7 rules applied. Total rules applied 295 place count 3 transition count 2
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 295 place count 3 transition count 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 297 place count 2 transition count 1
Applied a total of 297 rules in 55 ms. Remains 2 /293 variables (removed 291) and now considering 1/344 (removed 343) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 2/293 places, 1/344 transitions.
// Phase 1: matrix 1 rows 2 cols
[2023-03-20 15:04:16] [INFO ] Computed 1 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 500000 resets, run finished after 366 ms. (steps per millisecond=2732 ) properties (out of 1) seen :1
FORMULA SmartHome-PT-14-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 3370 ms.
ITS solved all properties within timeout

BK_STOP 1679324657468

--------------------
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 UpperBounds -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="SmartHome-PT-14"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="ltsminxred"
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-5348"
echo " Executing tool ltsminxred"
echo " Input is SmartHome-PT-14, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r457-smll-167912649100261"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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