About the Execution of 2021-gold for Kanban-PT-02000
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.r143-tall-165271830200112.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 gold2021
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 r143-tall-165271830200112
=====================================================================
--------------------
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 1652741561911
Running Version 0
[2022-05-16 22:52:43] [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 22:52:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 22:52:43] [INFO ] Load time of PNML (sax parser for PT used): 133 ms
[2022-05-16 22:52:43] [INFO ] Transformed 16 places.
[2022-05-16 22:52:43] [INFO ] Transformed 16 transitions.
[2022-05-16 22:52:43] [INFO ] Parsed PT model containing 16 places and 16 transitions in 169 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
// Phase 1: matrix 16 rows 16 cols
[2022-05-16 22:52:43] [INFO ] Computed 5 place invariants in 5 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 10 ms. (steps per millisecond=1000 ) 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 12 ms. (steps per millisecond=833 ) properties (out of 5) seen :54
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 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 5) seen :61
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 5) seen :49
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 :113
// Phase 1: matrix 16 rows 16 cols
[2022-05-16 22:52:43] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-16 22:52:43] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2022-05-16 22:52:43] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-16 22:52:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:52:43] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2022-05-16 22:52:43] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-16 22:52:43] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:52:44] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-16 22:52:44] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-16 22:52:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:52:44] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2022-05-16 22:52:44] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 7 ms.
[2022-05-16 22:52:44] [INFO ] Added : 6 causal constraints over 2 iterations in 17 ms. Result :sat
Minimization took 4 ms.
[2022-05-16 22:52:44] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-16 22:52:44] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 12 ms returned sat
[2022-05-16 22:52:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:52:44] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2022-05-16 22:52:44] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-16 22:52:44] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:52:44] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-05-16 22:52:44] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-16 22:52:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:52:44] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2022-05-16 22:52:44] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-16 22:52:44] [INFO ] Added : 7 causal constraints over 2 iterations in 8 ms. Result :sat
Minimization took 4 ms.
[2022-05-16 22:52:44] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2022-05-16 22:52:44] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 0 ms returned sat
[2022-05-16 22:52:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:52:44] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2022-05-16 22:52:44] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-16 22:52:44] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:52:44] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-16 22:52:44] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 0 ms returned sat
[2022-05-16 22:52:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:52:44] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2022-05-16 22:52:44] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-16 22:52:44] [INFO ] Added : 4 causal constraints over 2 iterations in 14 ms. Result :sat
Minimization took 3 ms.
[2022-05-16 22:52:44] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-16 22:52:44] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-16 22:52:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:52:44] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2022-05-16 22:52:44] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-16 22:52:44] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:52:44] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-16 22:52:44] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 2 ms returned sat
[2022-05-16 22:52:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:52:44] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2022-05-16 22:52:44] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-16 22:52:44] [INFO ] Added : 13 causal constraints over 4 iterations in 15 ms. Result :sat
Minimization took 4 ms.
[2022-05-16 22:52:44] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-16 22:52:44] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 0 ms returned sat
[2022-05-16 22:52:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:52:44] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2022-05-16 22:52:44] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-16 22:52:44] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:52:44] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-16 22:52:44] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 2 ms returned sat
[2022-05-16 22:52:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:52:44] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2022-05-16 22:52:44] [INFO ] Computed and/alt/rep : 15/24/15 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-16 22:52:44] [INFO ] Added : 4 causal constraints over 2 iterations in 8 ms. Result :sat
Minimization took 3 ms.
Current structural bounds on expressions (after SMT) : [2000, 2000, 2000, 2000, 6000] Max seen :[45, 43, 50, 24, 51]
Incomplete Parikh walk after 800200 steps, including 98 resets, run finished after 631 ms. (steps per millisecond=1268 ) properties (out of 5) seen :6194 could not realise parikh vector
FORMULA Kanban-PT-02000-UpperBounds-08 2000 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Kanban-PT-02000-UpperBounds-00 2000 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 1400800 steps, including 99 resets, run finished after 738 ms. (steps per millisecond=1898 ) properties (out of 3) seen :6000 could not realise parikh vector
FORMULA Kanban-PT-02000-UpperBounds-09 2000 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Kanban-PT-02000-UpperBounds-03 2000 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 600200 steps, including 98 resets, run finished after 339 ms. (steps per millisecond=1770 ) properties (out of 1) seen :2000 could not realise parikh vector
Incomplete Parikh walk after 800400 steps, including 99 resets, run finished after 345 ms. (steps per millisecond=2320 ) properties (out of 1) seen :2000 could not realise parikh vector
Incomplete Parikh walk after 800400 steps, including 98 resets, run finished after 341 ms. (steps per millisecond=2347 ) properties (out of 1) seen :2000 could not realise parikh vector
Support contains 1 out of 16 places. Attempting structural reductions.
Starting structural reductions, 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 0 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 1 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 18 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-16 22:52:46] [INFO ] Computed 2 place invariants in 1 ms
FORMULA Kanban-PT-02000-UpperBounds-11 2000 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 1000513 steps, including 2 resets, run finished after 131 ms. (steps per millisecond=7637 ) properties (out of 0) seen :0
All properties solved without resorting to model-checking.
BK_STOP 1652741567905
--------------------
content from stderr:
+ 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
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -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=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m
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="gold2021"
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 gold2021"
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 r143-tall-165271830200112"
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 '
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 ;