About the Execution of ITS-Tools for GPPP-PT-C1000N0000000100
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2022-input.r096-smll-165260576000285.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is GPPP-PT-C1000N0000000100, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r096-smll-165260576000285
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 240K
-rw-r--r-- 1 mcc users 7.1K Apr 29 18:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Apr 29 18:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Apr 29 18:39 CTLFireability.txt
-rw-r--r-- 1 mcc users 35K Apr 29 18:39 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.0K May 9 07:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 9 07:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 9 07:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 07:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 07:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 17 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 1 May 10 09:34 large_marking
-rw-r--r-- 1 mcc users 21K May 10 09:34 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 GPPP-PT-C1000N0000000100-UpperBounds-00
FORMULA_NAME GPPP-PT-C1000N0000000100-UpperBounds-01
FORMULA_NAME GPPP-PT-C1000N0000000100-UpperBounds-02
FORMULA_NAME GPPP-PT-C1000N0000000100-UpperBounds-03
FORMULA_NAME GPPP-PT-C1000N0000000100-UpperBounds-04
FORMULA_NAME GPPP-PT-C1000N0000000100-UpperBounds-05
FORMULA_NAME GPPP-PT-C1000N0000000100-UpperBounds-06
FORMULA_NAME GPPP-PT-C1000N0000000100-UpperBounds-07
FORMULA_NAME GPPP-PT-C1000N0000000100-UpperBounds-08
FORMULA_NAME GPPP-PT-C1000N0000000100-UpperBounds-09
FORMULA_NAME GPPP-PT-C1000N0000000100-UpperBounds-10
FORMULA_NAME GPPP-PT-C1000N0000000100-UpperBounds-11
FORMULA_NAME GPPP-PT-C1000N0000000100-UpperBounds-12
FORMULA_NAME GPPP-PT-C1000N0000000100-UpperBounds-13
FORMULA_NAME GPPP-PT-C1000N0000000100-UpperBounds-14
FORMULA_NAME GPPP-PT-C1000N0000000100-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1652712122674
Running Version 202205111006
[2022-05-16 14:42:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-16 14:42:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 14:42:04] [INFO ] Load time of PNML (sax parser for PT used): 76 ms
[2022-05-16 14:42:04] [INFO ] Transformed 33 places.
[2022-05-16 14:42:04] [INFO ] Transformed 22 transitions.
[2022-05-16 14:42:04] [INFO ] Parsed PT model containing 33 places and 22 transitions in 241 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 10 ms.
// Phase 1: matrix 22 rows 33 cols
[2022-05-16 14:42:05] [INFO ] Invariants computation overflowed in 11 ms
Incomplete random walk after 10021 steps, including 3 resets, run finished after 21 ms. (steps per millisecond=477 ) properties (out of 16) seen :19936
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 16) seen :12369
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 :19490
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 16) seen :19439
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 16) seen :19434
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 :19633
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 16) seen :19449
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 16) seen :19402
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 :19426
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 :12427
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 :19451
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 :19424
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 16) seen :12394
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 16) seen :19412
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 16) seen :12425
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 16) seen :12442
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 16) seen :19408
// Phase 1: matrix 22 rows 33 cols
[2022-05-16 14:42:05] [INFO ] Invariants computation overflowed in 12 ms
[2022-05-16 14:42:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 14:42:05] [INFO ] [Real]Absence check using state equation in 46 ms returned unsat
[2022-05-16 14:42:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 14:42:05] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2022-05-16 14:42:05] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 14:42:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 14:42:05] [INFO ] [Nat]Absence check using state equation in 82 ms returned unsat
[2022-05-16 14:42:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 14:42:05] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2022-05-16 14:42:05] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 14:42:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 14:42:05] [INFO ] [Nat]Absence check using state equation in 44 ms returned unsat
[2022-05-16 14:42:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 14:42:05] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2022-05-16 14:42:06] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 14:42:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 14:42:06] [INFO ] [Nat]Absence check using state equation in 48 ms returned unsat
[2022-05-16 14:42:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 14:42:06] [INFO ] [Real]Absence check using state equation in 16 ms returned unsat
[2022-05-16 14:42:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 14:42:06] [INFO ] [Real]Absence check using state equation in 16 ms returned unsat
[2022-05-16 14:42:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 14:42:06] [INFO ] [Real]Absence check using state equation in 11 ms returned unsat
[2022-05-16 14:42:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 14:42:06] [INFO ] [Real]Absence check using state equation in 21 ms returned unsat
[2022-05-16 14:42:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 14:42:06] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2022-05-16 14:42:06] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 14:42:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 14:42:06] [INFO ] [Nat]Absence check using state equation in 33 ms returned unsat
[2022-05-16 14:42:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 14:42:06] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2022-05-16 14:42:06] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 14:42:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 14:42:06] [INFO ] [Nat]Absence check using state equation in 41 ms returned unsat
[2022-05-16 14:42:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 14:42:06] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2022-05-16 14:42:06] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 14:42:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 14:42:06] [INFO ] [Nat]Absence check using state equation in 38 ms returned unsat
[2022-05-16 14:42:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 14:42:06] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2022-05-16 14:42:06] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 14:42:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 14:42:06] [INFO ] [Nat]Absence check using state equation in 28 ms returned unsat
[2022-05-16 14:42:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 14:42:06] [INFO ] [Real]Absence check using state equation in 25 ms returned unsat
[2022-05-16 14:42:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 14:42:06] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2022-05-16 14:42:06] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 14:42:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 14:42:06] [INFO ] [Nat]Absence check using state equation in 29 ms returned unsat
[2022-05-16 14:42:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 14:42:07] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2022-05-16 14:42:07] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 14:42:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 14:42:07] [INFO ] [Nat]Absence check using state equation in 22 ms returned unsat
[2022-05-16 14:42:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 14:42:07] [INFO ] [Real]Absence check using state equation in 20 ms returned unsat
Current structural bounds on expressions (after SMT) : [2000, 7, 3, 7, 200, 100, 200, 3000, 7, 7, 3, 1, 7000, 407, 7, 7000] Max seen :[2000, 7, 3, 7, 200, 100, 200, 3000, 7, 7, 3, 1, 7000, 407, 7, 7000]
FORMULA GPPP-PT-C1000N0000000100-UpperBounds-15 7000 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C1000N0000000100-UpperBounds-14 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C1000N0000000100-UpperBounds-13 407 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C1000N0000000100-UpperBounds-12 7000 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C1000N0000000100-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C1000N0000000100-UpperBounds-10 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C1000N0000000100-UpperBounds-09 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C1000N0000000100-UpperBounds-08 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C1000N0000000100-UpperBounds-07 3000 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C1000N0000000100-UpperBounds-06 200 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C1000N0000000100-UpperBounds-05 100 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C1000N0000000100-UpperBounds-04 200 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C1000N0000000100-UpperBounds-03 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C1000N0000000100-UpperBounds-02 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C1000N0000000100-UpperBounds-01 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C1000N0000000100-UpperBounds-00 2000 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 2461 ms.
BK_STOP 1652712127245
--------------------
content from stderr:
+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="GPPP-PT-C1000N0000000100"
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-4028"
echo " Executing tool itstools"
echo " Input is GPPP-PT-C1000N0000000100, 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 r096-smll-165260576000285"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/GPPP-PT-C1000N0000000100.tgz
mv GPPP-PT-C1000N0000000100 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 ;