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.r024-tall-165251918700549.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 CANConstruction-PT-080, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r024-tall-165251918700549
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 9.8M
-rw-r--r-- 1 mcc users 11K Apr 29 12:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 91K Apr 29 12:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Apr 29 12:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Apr 29 12:03 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.1K May 9 07:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 9 07:11 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 9 07:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 07:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 9 07:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K May 9 07:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 9.5M May 10 09:33 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 CANConstruction-PT-080-UpperBounds-00
FORMULA_NAME CANConstruction-PT-080-UpperBounds-01
FORMULA_NAME CANConstruction-PT-080-UpperBounds-02
FORMULA_NAME CANConstruction-PT-080-UpperBounds-03
FORMULA_NAME CANConstruction-PT-080-UpperBounds-04
FORMULA_NAME CANConstruction-PT-080-UpperBounds-05
FORMULA_NAME CANConstruction-PT-080-UpperBounds-06
FORMULA_NAME CANConstruction-PT-080-UpperBounds-07
FORMULA_NAME CANConstruction-PT-080-UpperBounds-08
FORMULA_NAME CANConstruction-PT-080-UpperBounds-09
FORMULA_NAME CANConstruction-PT-080-UpperBounds-10
FORMULA_NAME CANConstruction-PT-080-UpperBounds-11
FORMULA_NAME CANConstruction-PT-080-UpperBounds-12
FORMULA_NAME CANConstruction-PT-080-UpperBounds-13
FORMULA_NAME CANConstruction-PT-080-UpperBounds-14
FORMULA_NAME CANConstruction-PT-080-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1652657412693

Running Version 202205111006
[2022-05-15 23:30:13] [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-15 23:30:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 23:30:14] [INFO ] Load time of PNML (sax parser for PT used): 522 ms
[2022-05-15 23:30:14] [INFO ] Transformed 13762 places.
[2022-05-15 23:30:14] [INFO ] Transformed 26240 transitions.
[2022-05-15 23:30:14] [INFO ] Parsed PT model containing 13762 places and 26240 transitions in 711 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 9 ms.
// Phase 1: matrix 26240 rows 13762 cols
[2022-05-15 23:30:15] [INFO ] Computed 161 place invariants in 365 ms
Incomplete random walk after 10000 steps, including 7 resets, run finished after 292 ms. (steps per millisecond=34 ) properties (out of 16) seen :3
FORMULA CANConstruction-PT-080-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-080-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 14) seen :0
// Phase 1: matrix 26240 rows 13762 cols
[2022-05-15 23:30:16] [INFO ] Computed 161 place invariants in 210 ms
[2022-05-15 23:30:17] [INFO ] [Real]Absence check using 81 positive place invariants in 415 ms returned sat
[2022-05-15 23:30:17] [INFO ] [Real]Absence check using 81 positive and 80 generalized place invariants in 88 ms returned sat
[2022-05-15 23:30:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 23:30:21] [INFO ] [Real]Absence check using state equation in 3148 ms returned unknown
[2022-05-15 23:30:22] [INFO ] [Real]Absence check using 81 positive place invariants in 391 ms returned sat
[2022-05-15 23:30:22] [INFO ] [Real]Absence check using 81 positive and 80 generalized place invariants in 69 ms returned sat
[2022-05-15 23:30:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 23:30:26] [INFO ] [Real]Absence check using state equation in 3331 ms returned unknown
[2022-05-15 23:30:27] [INFO ] [Real]Absence check using 81 positive place invariants in 401 ms returned sat
[2022-05-15 23:30:27] [INFO ] [Real]Absence check using 81 positive and 80 generalized place invariants in 80 ms returned sat
[2022-05-15 23:30:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 23:30:31] [INFO ] [Real]Absence check using state equation in 3329 ms returned unknown
[2022-05-15 23:30:32] [INFO ] [Real]Absence check using 81 positive place invariants in 381 ms returned sat
[2022-05-15 23:30:32] [INFO ] [Real]Absence check using 81 positive and 80 generalized place invariants in 82 ms returned sat
[2022-05-15 23:30:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 23:30:36] [INFO ] [Real]Absence check using state equation in 3346 ms returned unknown
[2022-05-15 23:30:37] [INFO ] [Real]Absence check using 81 positive place invariants in 376 ms returned sat
[2022-05-15 23:30:37] [INFO ] [Real]Absence check using 81 positive and 80 generalized place invariants in 80 ms returned sat
[2022-05-15 23:30:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 23:30:41] [INFO ] [Real]Absence check using state equation in 3349 ms returned unknown
[2022-05-15 23:30:42] [INFO ] [Real]Absence check using 81 positive place invariants in 365 ms returned sat
[2022-05-15 23:30:42] [INFO ] [Real]Absence check using 81 positive and 80 generalized place invariants in 78 ms returned sat
[2022-05-15 23:30:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 23:30:46] [INFO ] [Real]Absence check using state equation in 3366 ms returned unknown
[2022-05-15 23:30:47] [INFO ] [Real]Absence check using 81 positive place invariants in 368 ms returned sat
[2022-05-15 23:30:47] [INFO ] [Real]Absence check using 81 positive and 80 generalized place invariants in 80 ms returned sat
[2022-05-15 23:30:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 23:30:51] [INFO ] [Real]Absence check using state equation in 3375 ms returned unknown
[2022-05-15 23:30:52] [INFO ] [Real]Absence check using 81 positive place invariants in 379 ms returned sat
[2022-05-15 23:30:52] [INFO ] [Real]Absence check using 81 positive and 80 generalized place invariants in 79 ms returned sat
[2022-05-15 23:30:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 23:30:56] [INFO ] [Real]Absence check using state equation in 3364 ms returned unknown
[2022-05-15 23:30:57] [INFO ] [Real]Absence check using 81 positive place invariants in 370 ms returned sat
[2022-05-15 23:30:57] [INFO ] [Real]Absence check using 81 positive and 80 generalized place invariants in 87 ms returned sat
[2022-05-15 23:30:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 23:31:01] [INFO ] [Real]Absence check using state equation in 3321 ms returned unknown
[2022-05-15 23:31:02] [INFO ] [Real]Absence check using 81 positive place invariants in 362 ms returned sat
[2022-05-15 23:31:02] [INFO ] [Real]Absence check using 81 positive and 80 generalized place invariants in 83 ms returned unsat
[2022-05-15 23:31:04] [INFO ] [Real]Absence check using 81 positive place invariants in 370 ms returned sat
[2022-05-15 23:31:04] [INFO ] [Real]Absence check using 81 positive and 80 generalized place invariants in 81 ms returned sat
[2022-05-15 23:31:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 23:31:07] [INFO ] [Real]Absence check using state equation in 3349 ms returned unknown
[2022-05-15 23:31:09] [INFO ] [Real]Absence check using 81 positive place invariants in 366 ms returned sat
[2022-05-15 23:31:09] [INFO ] [Real]Absence check using 81 positive and 80 generalized place invariants in 80 ms returned sat
[2022-05-15 23:31:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 23:31:12] [INFO ] [Real]Absence check using state equation in 3382 ms returned unknown
[2022-05-15 23:31:14] [INFO ] [Real]Absence check using 81 positive place invariants in 365 ms returned sat
[2022-05-15 23:31:14] [INFO ] [Real]Absence check using 81 positive and 80 generalized place invariants in 79 ms returned sat
[2022-05-15 23:31:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 23:31:17] [INFO ] [Real]Absence check using state equation in 3359 ms returned unknown
[2022-05-15 23:31:19] [INFO ] [Real]Absence check using 81 positive place invariants in 363 ms returned sat
[2022-05-15 23:31:19] [INFO ] [Real]Absence check using 81 positive and 80 generalized place invariants in 83 ms returned sat
[2022-05-15 23:31:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 23:31:22] [INFO ] [Real]Absence check using state equation in 3342 ms returned unknown
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0]
FORMULA CANConstruction-PT-080-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 13 out of 13762 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 13762/13762 places, 26240/26240 transitions.
Drop transitions removed 560 transitions
Trivial Post-agglo rules discarded 560 transitions
Performed 560 trivial Post agglomeration. Transition count delta: 560
Iterating post reduction 0 with 560 rules applied. Total rules applied 560 place count 13762 transition count 25680
Reduce places removed 560 places and 0 transitions.
Iterating post reduction 1 with 560 rules applied. Total rules applied 1120 place count 13202 transition count 25680
Discarding 6235 places :
Symmetric choice reduction at 2 with 6235 rule applications. Total rules 7355 place count 6967 transition count 13210
Iterating global reduction 2 with 6235 rules applied. Total rules applied 13590 place count 6967 transition count 13210
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 5 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 13750 place count 6887 transition count 13130
Free-agglomeration rule applied 150 times.
Iterating global reduction 2 with 150 rules applied. Total rules applied 13900 place count 6887 transition count 12980
Reduce places removed 150 places and 0 transitions.
Iterating post reduction 2 with 150 rules applied. Total rules applied 14050 place count 6737 transition count 12980
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 3 with 10 rules applied. Total rules applied 14060 place count 6737 transition count 12980
Applied a total of 14060 rules in 8831 ms. Remains 6737 /13762 variables (removed 7025) and now considering 12980/26240 (removed 13260) transitions.
Finished structural reductions, in 1 iterations. Remains : 6737/13762 places, 12980/26240 transitions.
// Phase 1: matrix 12980 rows 6737 cols
[2022-05-15 23:31:31] [INFO ] Computed 161 place invariants in 86 ms
Incomplete random walk after 1000000 steps, including 1807 resets, run finished after 20945 ms. (steps per millisecond=47 ) properties (out of 13) seen :13
FORMULA CANConstruction-PT-080-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-080-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-080-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-080-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-080-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-080-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-080-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-080-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-080-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-080-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-080-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-080-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-080-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 99115 ms.

BK_STOP 1652657512978

--------------------
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="CANConstruction-PT-080"
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 CANConstruction-PT-080, 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 r024-tall-165251918700549"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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