fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r532-smll-171683811300366
Last Updated
July 7, 2024

About the Execution of LTSMin+red for SmartHome-PT-04

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
276.228 6204.00 15177.00 158.40 TTTFFTFTTFTTTFFF normal

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.r532-smll-171683811300366.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 SmartHome-PT-04, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r532-smll-171683811300366
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 564K
-rw-r--r-- 1 mcc users 7.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 23 07:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 23 07:57 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 07:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Apr 12 03:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 199K Apr 12 03:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Apr 12 03:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Apr 12 03:58 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:57 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:57 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 35K 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

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

=== Now, execution of the tool begins

BK_START 1717256700805

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SmartHome-PT-04
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 15:45:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 15:45:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 15:45:03] [INFO ] Load time of PNML (sax parser for PT used): 242 ms
[2024-06-01 15:45:03] [INFO ] Transformed 139 places.
[2024-06-01 15:45:03] [INFO ] Transformed 159 transitions.
[2024-06-01 15:45:03] [INFO ] Found NUPN structural information;
[2024-06-01 15:45:03] [INFO ] Parsed PT model containing 139 places and 159 transitions and 361 arcs in 439 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 158 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 17 places in 6 ms
Reduce places removed 17 places and 19 transitions.
FORMULA SmartHome-PT-04-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-04-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-04-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-04-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-04-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-04-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-04-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-04-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-04-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-04-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (424 resets) in 1778 ms. (22 steps per ms) remains 3/6 properties
FORMULA SmartHome-PT-04-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SmartHome-PT-04-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SmartHome-PT-04-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40002 steps (107 resets) in 405 ms. (98 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (102 resets) in 634 ms. (62 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (105 resets) in 664 ms. (60 steps per ms) remains 3/3 properties
// Phase 1: matrix 140 rows 122 cols
[2024-06-01 15:45:05] [INFO ] Computed 7 invariants in 37 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem SmartHome-PT-04-ReachabilityCardinality-2024-04 is UNSAT
FORMULA SmartHome-PT-04-ReachabilityCardinality-2024-04 FALSE TECHNIQUES SMT_REFINEMENT
Problem SmartHome-PT-04-ReachabilityCardinality-2024-14 is UNSAT
FORMULA SmartHome-PT-04-ReachabilityCardinality-2024-14 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 82/122 variables, 7/47 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 82/129 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 0/129 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 140/262 variables, 122/251 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/262 variables, 0/251 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/262 variables, 0/251 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 262/262 variables, and 251 constraints, problems are : Problem set: 2 solved, 1 unsolved in 631 ms.
Refiners :[Domain max(s): 122/122 constraints, Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 122/122 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 20/20 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/20 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 98/118 variables, 6/26 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 98/124 constraints. Problems are: Problem set: 2 solved, 1 unsolved
[2024-06-01 15:45:06] [INFO ] Deduced a trap composed of 35 places in 161 ms of which 18 ms to minimize.
[2024-06-01 15:45:06] [INFO ] Deduced a trap composed of 60 places in 148 ms of which 4 ms to minimize.
[2024-06-01 15:45:06] [INFO ] Deduced a trap composed of 62 places in 97 ms of which 2 ms to minimize.
[2024-06-01 15:45:06] [INFO ] Deduced a trap composed of 36 places in 91 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 4/128 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/118 variables, 0/128 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 4/122 variables, 1/129 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 4/133 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 0/133 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 140/262 variables, 122/255 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/262 variables, 1/256 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/262 variables, 0/256 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/262 variables, 0/256 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 262/262 variables, and 256 constraints, problems are : Problem set: 2 solved, 1 unsolved in 971 ms.
Refiners :[Domain max(s): 122/122 constraints, Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 122/122 constraints, PredecessorRefiner: 1/3 constraints, Known Traps: 4/4 constraints]
After SMT, in 1757ms problems are : Problem set: 2 solved, 1 unsolved
Parikh walk visited 0 properties in 61 ms.
Support contains 20 out of 122 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 122/122 places, 140/140 transitions.
Graph (trivial) has 90 edges and 122 vertex of which 21 / 122 are part of one of the 3 SCC in 6 ms
Free SCC test removed 18 places
Drop transitions (Empty/Sink Transition effects.) removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 30 place count 104 transition count 87
Reduce places removed 29 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 31 rules applied. Total rules applied 61 place count 75 transition count 85
Reduce places removed 1 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 2 with 11 rules applied. Total rules applied 72 place count 74 transition count 75
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 83 place count 64 transition count 74
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 83 place count 64 transition count 72
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 87 place count 62 transition count 72
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 97 place count 52 transition count 62
Iterating global reduction 4 with 10 rules applied. Total rules applied 107 place count 52 transition count 62
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 4 rules applied. Total rules applied 111 place count 52 transition count 58
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 112 place count 51 transition count 58
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 6 with 14 rules applied. Total rules applied 126 place count 44 transition count 51
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (complete) has 83 edges and 44 vertex of which 43 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 6 with 4 rules applied. Total rules applied 130 place count 43 transition count 48
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 132 place count 43 transition count 46
Free-agglomeration rule applied 5 times.
Iterating global reduction 7 with 5 rules applied. Total rules applied 137 place count 43 transition count 41
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 142 place count 38 transition count 41
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 143 place count 37 transition count 40
Applied a total of 143 rules in 123 ms. Remains 37 /122 variables (removed 85) and now considering 40/140 (removed 100) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 152 ms. Remains : 37/122 places, 40/140 transitions.
RANDOM walk for 1427 steps (0 resets) in 11 ms. (118 steps per ms) remains 0/1 properties
FORMULA SmartHome-PT-04-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 4145 ms.
ITS solved all properties within timeout

BK_STOP 1717256707009

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

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