About the Execution of ITS-Tools for HouseConstruction-PT-00200
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.r197-smll-167840344400565.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 itstools
Input is HouseConstruction-PT-00200, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r197-smll-167840344400565
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 464K
-rw-r--r-- 1 mcc users 5.8K Feb 25 13:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Feb 25 13:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Feb 25 13:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 66K Feb 25 13:03 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 16:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 16:16 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:16 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:16 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 13:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K Feb 25 13:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Feb 25 13:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K Feb 25 13:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 13K Mar 5 18:22 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 HouseConstruction-PT-00200-UpperBounds-00
FORMULA_NAME HouseConstruction-PT-00200-UpperBounds-01
FORMULA_NAME HouseConstruction-PT-00200-UpperBounds-02
FORMULA_NAME HouseConstruction-PT-00200-UpperBounds-03
FORMULA_NAME HouseConstruction-PT-00200-UpperBounds-04
FORMULA_NAME HouseConstruction-PT-00200-UpperBounds-05
FORMULA_NAME HouseConstruction-PT-00200-UpperBounds-06
FORMULA_NAME HouseConstruction-PT-00200-UpperBounds-07
FORMULA_NAME HouseConstruction-PT-00200-UpperBounds-08
FORMULA_NAME HouseConstruction-PT-00200-UpperBounds-09
FORMULA_NAME HouseConstruction-PT-00200-UpperBounds-10
FORMULA_NAME HouseConstruction-PT-00200-UpperBounds-11
FORMULA_NAME HouseConstruction-PT-00200-UpperBounds-12
FORMULA_NAME HouseConstruction-PT-00200-UpperBounds-13
FORMULA_NAME HouseConstruction-PT-00200-UpperBounds-14
FORMULA_NAME HouseConstruction-PT-00200-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1678643366093
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=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HouseConstruction-PT-00200
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202303021504
[2023-03-12 17:49:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-12 17:49:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 17:49:29] [INFO ] Load time of PNML (sax parser for PT used): 52 ms
[2023-03-12 17:49:29] [INFO ] Transformed 26 places.
[2023-03-12 17:49:29] [INFO ] Transformed 18 transitions.
[2023-03-12 17:49:29] [INFO ] Parsed PT model containing 26 places and 18 transitions and 51 arcs in 192 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 11 ms.
// Phase 1: matrix 18 rows 26 cols
[2023-03-12 17:49:29] [INFO ] Computed 8 place invariants in 9 ms
Incomplete random walk after 10052 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=670 ) properties (out of 16) seen :3200
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 16) seen :129
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 16) seen :215
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 16) seen :115
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 16) seen :158
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 16) seen :388
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 16) seen :149
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 16) seen :121
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 16) seen :123
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 16) seen :115
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 16) seen :136
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 16) seen :146
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 16) seen :215
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 16) seen :111
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 16) seen :132
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 16) seen :112
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 16) seen :179
[2023-03-12 17:49:29] [INFO ] Invariant cache hit.
[2023-03-12 17:49:29] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 13 ms returned sat
[2023-03-12 17:49:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 17:49:29] [INFO ] [Real]Absence check using state equation in 34 ms returned unsat
[2023-03-12 17:49:30] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 6 ms returned sat
[2023-03-12 17:49:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 17:49:30] [INFO ] [Real]Absence check using state equation in 16 ms returned unsat
[2023-03-12 17:49:30] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 6 ms returned sat
[2023-03-12 17:49:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 17:49:30] [INFO ] [Real]Absence check using state equation in 27 ms returned unsat
[2023-03-12 17:49:30] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 5 ms returned sat
[2023-03-12 17:49:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 17:49:30] [INFO ] [Real]Absence check using state equation in 16 ms returned unsat
[2023-03-12 17:49:30] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-12 17:49:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 17:49:30] [INFO ] [Real]Absence check using state equation in 19 ms returned unsat
[2023-03-12 17:49:30] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-12 17:49:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 17:49:30] [INFO ] [Real]Absence check using state equation in 21 ms returned unsat
[2023-03-12 17:49:30] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 4 ms returned sat
[2023-03-12 17:49:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 17:49:30] [INFO ] [Real]Absence check using state equation in 20 ms returned unsat
[2023-03-12 17:49:30] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 4 ms returned sat
[2023-03-12 17:49:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 17:49:30] [INFO ] [Real]Absence check using state equation in 12 ms returned unsat
[2023-03-12 17:49:30] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-12 17:49:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 17:49:30] [INFO ] [Real]Absence check using state equation in 22 ms returned unsat
[2023-03-12 17:49:30] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 5 ms returned sat
[2023-03-12 17:49:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 17:49:30] [INFO ] [Real]Absence check using state equation in 20 ms returned unsat
[2023-03-12 17:49:30] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 5 ms returned sat
[2023-03-12 17:49:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 17:49:30] [INFO ] [Real]Absence check using state equation in 16 ms returned unsat
[2023-03-12 17:49:30] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 5 ms returned sat
[2023-03-12 17:49:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 17:49:30] [INFO ] [Real]Absence check using state equation in 11 ms returned unsat
[2023-03-12 17:49:30] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 5 ms returned sat
[2023-03-12 17:49:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 17:49:30] [INFO ] [Real]Absence check using state equation in 9 ms returned unsat
[2023-03-12 17:49:30] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 4 ms returned sat
[2023-03-12 17:49:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 17:49:30] [INFO ] [Real]Absence check using state equation in 23 ms returned unsat
[2023-03-12 17:49:30] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 4 ms returned sat
[2023-03-12 17:49:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 17:49:30] [INFO ] [Real]Absence check using state equation in 8 ms returned unsat
[2023-03-12 17:49:30] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 4 ms returned sat
[2023-03-12 17:49:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 17:49:30] [INFO ] [Real]Absence check using state equation in 9 ms returned unsat
Current structural bounds on expressions (after SMT) : [200, 200, 200, 200, 200, 200, 200, 200, 200, 200, 200, 200, 200, 200, 200, 200] Max seen :[200, 200, 200, 200, 200, 200, 200, 200, 200, 200, 200, 200, 200, 200, 200, 200]
FORMULA HouseConstruction-PT-00200-UpperBounds-15 200 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA HouseConstruction-PT-00200-UpperBounds-14 200 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA HouseConstruction-PT-00200-UpperBounds-13 200 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA HouseConstruction-PT-00200-UpperBounds-12 200 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA HouseConstruction-PT-00200-UpperBounds-11 200 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA HouseConstruction-PT-00200-UpperBounds-10 200 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA HouseConstruction-PT-00200-UpperBounds-09 200 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA HouseConstruction-PT-00200-UpperBounds-08 200 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA HouseConstruction-PT-00200-UpperBounds-07 200 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA HouseConstruction-PT-00200-UpperBounds-06 200 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA HouseConstruction-PT-00200-UpperBounds-05 200 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA HouseConstruction-PT-00200-UpperBounds-04 200 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA HouseConstruction-PT-00200-UpperBounds-03 200 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA HouseConstruction-PT-00200-UpperBounds-02 200 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA HouseConstruction-PT-00200-UpperBounds-01 200 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA HouseConstruction-PT-00200-UpperBounds-00 200 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 1812 ms.
BK_STOP 1678643371873
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
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="HouseConstruction-PT-00200"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
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 itstools"
echo " Input is HouseConstruction-PT-00200, 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 r197-smll-167840344400565"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/HouseConstruction-PT-00200.tgz
mv HouseConstruction-PT-00200 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 '
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 ;