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.r132-tall-165271820700301.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 Kanban-PT-02000, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r132-tall-165271820700301
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 236K
-rw-r--r-- 1 mcc users 7.0K Apr 29 17:35 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Apr 29 17:35 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Apr 29 17:34 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Apr 29 17:34 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K May 9 08:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 08:09 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 08:09 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 08:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 9 08:09 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 6 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 14K 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 Kanban-PT-02000-UpperBounds-00
FORMULA_NAME Kanban-PT-02000-UpperBounds-01
FORMULA_NAME Kanban-PT-02000-UpperBounds-02
FORMULA_NAME Kanban-PT-02000-UpperBounds-03
FORMULA_NAME Kanban-PT-02000-UpperBounds-04
FORMULA_NAME Kanban-PT-02000-UpperBounds-05
FORMULA_NAME Kanban-PT-02000-UpperBounds-06
FORMULA_NAME Kanban-PT-02000-UpperBounds-07
FORMULA_NAME Kanban-PT-02000-UpperBounds-08
FORMULA_NAME Kanban-PT-02000-UpperBounds-09
FORMULA_NAME Kanban-PT-02000-UpperBounds-10
FORMULA_NAME Kanban-PT-02000-UpperBounds-11
FORMULA_NAME Kanban-PT-02000-UpperBounds-12
FORMULA_NAME Kanban-PT-02000-UpperBounds-13
FORMULA_NAME Kanban-PT-02000-UpperBounds-14
FORMULA_NAME Kanban-PT-02000-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1652769574836

Running Version 202205111006
[2022-05-17 06:39:35] [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-17 06:39:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-17 06:39:36] [INFO ] Load time of PNML (sax parser for PT used): 46 ms
[2022-05-17 06:39:36] [INFO ] Transformed 16 places.
[2022-05-17 06:39:36] [INFO ] Transformed 16 transitions.
[2022-05-17 06:39:36] [INFO ] Parsed PT model containing 16 places and 16 transitions in 143 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
// Phase 1: matrix 16 rows 16 cols
[2022-05-17 06:39:36] [INFO ] Computed 5 place invariants in 10 ms
FORMULA Kanban-PT-02000-UpperBounds-15 2000 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Kanban-PT-02000-UpperBounds-14 2000 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Kanban-PT-02000-UpperBounds-13 2000 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Kanban-PT-02000-UpperBounds-10 2000 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Kanban-PT-02000-UpperBounds-05 2000 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Kanban-PT-02000-UpperBounds-04 2000 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Kanban-PT-02000-UpperBounds-01 2000 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10007 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 9) seen :8000
FORMULA Kanban-PT-02000-UpperBounds-12 2000 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Kanban-PT-02000-UpperBounds-07 2000 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Kanban-PT-02000-UpperBounds-06 2000 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Kanban-PT-02000-UpperBounds-02 2000 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 5) seen :52
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 5) seen :54
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 5) seen :64
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 5) seen :44
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 5) seen :134
// Phase 1: matrix 16 rows 16 cols
[2022-05-17 06:39:36] [INFO ] Computed 5 place invariants in 8 ms
[2022-05-17 06:39:36] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2022-05-17 06:39:36] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-17 06:39:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 06:39:36] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2022-05-17 06:39:36] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 5 ms.
[2022-05-17 06:39:36] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 06:39:36] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2022-05-17 06:39:36] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-17 06:39:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 06:39:36] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2022-05-17 06:39:36] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-17 06:39:36] [INFO ] Added : 6 causal constraints over 2 iterations in 21 ms. Result :sat
Minimization took 4 ms.
[2022-05-17 06:39:36] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-17 06:39:36] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-17 06:39:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 06:39:36] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2022-05-17 06:39:36] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-17 06:39:36] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 06:39:36] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-17 06:39:36] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 0 ms returned sat
[2022-05-17 06:39:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 06:39:36] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2022-05-17 06:39:36] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-17 06:39:36] [INFO ] Added : 7 causal constraints over 2 iterations in 8 ms. Result :sat
Minimization took 4 ms.
[2022-05-17 06:39:36] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-17 06:39:36] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-17 06:39:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 06:39:36] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2022-05-17 06:39:36] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-17 06:39:36] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 06:39:36] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-17 06:39:36] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-17 06:39:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 06:39:36] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2022-05-17 06:39:36] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-17 06:39:36] [INFO ] Added : 4 causal constraints over 2 iterations in 18 ms. Result :sat
Minimization took 3 ms.
[2022-05-17 06:39:36] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-17 06:39:36] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 0 ms returned sat
[2022-05-17 06:39:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 06:39:36] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2022-05-17 06:39:36] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-17 06:39:36] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 06:39:36] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-17 06:39:36] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 2 ms returned sat
[2022-05-17 06:39:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 06:39:36] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2022-05-17 06:39:36] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-17 06:39:36] [INFO ] Added : 13 causal constraints over 4 iterations in 16 ms. Result :sat
Minimization took 4 ms.
[2022-05-17 06:39:36] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-17 06:39:36] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 0 ms returned sat
[2022-05-17 06:39:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 06:39:36] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2022-05-17 06:39:36] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-17 06:39:36] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 06:39:36] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-17 06:39:36] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-17 06:39:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 06:39:36] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2022-05-17 06:39:36] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-17 06:39:36] [INFO ] Added : 4 causal constraints over 2 iterations in 6 ms. Result :sat
Minimization took 3 ms.
Current structural bounds on expressions (after SMT) : [2000, 2000, 2000, 2000, 6000] Max seen :[42, 52, 54, 16, 60]
FORMULA Kanban-PT-02000-UpperBounds-08 2000 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Kanban-PT-02000-UpperBounds-00 2000 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Kanban-PT-02000-UpperBounds-09 2000 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Kanban-PT-02000-UpperBounds-03 2000 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 1 out of 16 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 16/16 places, 16/16 transitions.
Graph (trivial) has 11 edges and 16 vertex of which 6 / 16 are part of one of the 3 SCC in 3 ms
Free SCC test removed 3 places
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Ensure Unique test removed 1 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 12 transition count 8
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 6 place count 10 transition count 8
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 6 place count 10 transition count 6
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 11 place count 7 transition count 6
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 14 place count 5 transition count 5
Applied a total of 14 rules in 15 ms. Remains 5 /16 variables (removed 11) and now considering 5/16 (removed 11) transitions.
Finished structural reductions, in 1 iterations. Remains : 5/16 places, 5/16 transitions.
// Phase 1: matrix 5 rows 5 cols
[2022-05-17 06:39:39] [INFO ] Computed 2 place invariants in 1 ms
FORMULA Kanban-PT-02000-UpperBounds-11 2000 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 1000518 steps, including 2 resets, run finished after 133 ms. (steps per millisecond=7522 ) properties (out of 0) seen :0
All properties solved without resorting to model-checking.
Total runtime 3225 ms.

BK_STOP 1652769579199

--------------------
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
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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="Kanban-PT-02000"
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 Kanban-PT-02000, 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 r132-tall-165271820700301"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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