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.r305-smll-165463878500157.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 AutonomousCar-PT-01b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r305-smll-165463878500157
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 600K
-rw-r--r-- 1 mcc users 9.0K Jun 7 15:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 107K Jun 7 15:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Jun 7 15:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Jun 7 15:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Jun 3 16:18 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Jun 3 16:18 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Jun 3 16:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 3 16:18 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 3 16:02 NewModel
-rw-r--r-- 1 mcc users 15K Jun 7 15:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 175K Jun 7 15:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Jun 7 15:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 102K Jun 7 15:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Jun 3 16:18 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Jun 3 16:18 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 3 16:02 equiv_col
-rw-r--r-- 1 mcc users 4 Jun 3 16:02 instance
-rw-r--r-- 1 mcc users 6 Jun 3 16:02 iscolored
-rw-r--r-- 1 mcc users 31K Jun 3 16:02 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 AutonomousCar-PT-01b-UpperBounds-00
FORMULA_NAME AutonomousCar-PT-01b-UpperBounds-01
FORMULA_NAME AutonomousCar-PT-01b-UpperBounds-02
FORMULA_NAME AutonomousCar-PT-01b-UpperBounds-03
FORMULA_NAME AutonomousCar-PT-01b-UpperBounds-04
FORMULA_NAME AutonomousCar-PT-01b-UpperBounds-05
FORMULA_NAME AutonomousCar-PT-01b-UpperBounds-06
FORMULA_NAME AutonomousCar-PT-01b-UpperBounds-07
FORMULA_NAME AutonomousCar-PT-01b-UpperBounds-08
FORMULA_NAME AutonomousCar-PT-01b-UpperBounds-09
FORMULA_NAME AutonomousCar-PT-01b-UpperBounds-10
FORMULA_NAME AutonomousCar-PT-01b-UpperBounds-11
FORMULA_NAME AutonomousCar-PT-01b-UpperBounds-12
FORMULA_NAME AutonomousCar-PT-01b-UpperBounds-13
FORMULA_NAME AutonomousCar-PT-01b-UpperBounds-14
FORMULA_NAME AutonomousCar-PT-01b-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1654735620759

Running Version 0
[2022-06-09 00:47: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-06-09 00:47:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-09 00:47:04] [INFO ] Load time of PNML (sax parser for PT used): 93 ms
[2022-06-09 00:47:04] [INFO ] Transformed 119 places.
[2022-06-09 00:47:04] [INFO ] Transformed 132 transitions.
[2022-06-09 00:47:04] [INFO ] Found NUPN structural information;
[2022-06-09 00:47:04] [INFO ] Parsed PT model containing 119 places and 132 transitions in 182 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 15 ms.
// Phase 1: matrix 132 rows 119 cols
[2022-06-09 00:47:04] [INFO ] Computed 6 place invariants in 17 ms
Incomplete random walk after 10000 steps, including 4 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 16) seen :9
FORMULA AutonomousCar-PT-01b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-01b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-01b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-01b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-01b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-01b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-01b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-01b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-01b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 4 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 7) seen :2
FORMULA AutonomousCar-PT-01b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA AutonomousCar-PT-01b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 5) seen :3
FORMULA AutonomousCar-PT-01b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA AutonomousCar-PT-01b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA AutonomousCar-PT-01b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 132 rows 119 cols
[2022-06-09 00:47:04] [INFO ] Computed 6 place invariants in 10 ms
[2022-06-09 00:47:05] [INFO ] [Real]Absence check using 6 positive place invariants in 15 ms returned sat
[2022-06-09 00:47:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 00:47:05] [INFO ] [Real]Absence check using state equation in 115 ms returned sat
[2022-06-09 00:47:05] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 00:47:05] [INFO ] [Nat]Absence check using 6 positive place invariants in 8 ms returned sat
[2022-06-09 00:47:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 00:47:05] [INFO ] [Nat]Absence check using state equation in 103 ms returned sat
[2022-06-09 00:47:05] [INFO ] Deduced a trap composed of 6 places in 127 ms of which 5 ms to minimize.
[2022-06-09 00:47:05] [INFO ] Deduced a trap composed of 22 places in 107 ms of which 2 ms to minimize.
[2022-06-09 00:47:05] [INFO ] Deduced a trap composed of 8 places in 69 ms of which 3 ms to minimize.
[2022-06-09 00:47:05] [INFO ] Deduced a trap composed of 31 places in 57 ms of which 2 ms to minimize.
[2022-06-09 00:47:05] [INFO ] Deduced a trap composed of 38 places in 65 ms of which 2 ms to minimize.
[2022-06-09 00:47:05] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 527 ms
[2022-06-09 00:47:05] [INFO ] Computed and/alt/rep : 129/252/129 causal constraints (skipped 2 transitions) in 20 ms.
[2022-06-09 00:47:06] [INFO ] Added : 108 causal constraints over 22 iterations in 545 ms. Result :sat
Minimization took 80 ms.
[2022-06-09 00:47:06] [INFO ] [Real]Absence check using 6 positive place invariants in 7 ms returned sat
[2022-06-09 00:47:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 00:47:06] [INFO ] [Real]Absence check using state equation in 70 ms returned sat
[2022-06-09 00:47:06] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 00:47:06] [INFO ] [Nat]Absence check using 6 positive place invariants in 7 ms returned sat
[2022-06-09 00:47:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 00:47:06] [INFO ] [Nat]Absence check using state equation in 72 ms returned sat
[2022-06-09 00:47:06] [INFO ] Computed and/alt/rep : 129/252/129 causal constraints (skipped 2 transitions) in 16 ms.
[2022-06-09 00:47:07] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 1 ms to minimize.
[2022-06-09 00:47:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 87 ms
[2022-06-09 00:47:07] [INFO ] Added : 103 causal constraints over 23 iterations in 537 ms. Result :sat
Minimization took 59 ms.
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
Incomplete Parikh walk after 2800 steps, including 96 resets, run finished after 11 ms. (steps per millisecond=254 ) properties (out of 2) seen :1 could not realise parikh vector
FORMULA AutonomousCar-PT-01b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 4800 steps, including 184 resets, run finished after 17 ms. (steps per millisecond=282 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 119 places. Attempting structural reductions.
Drop transitions removed 1 transitions
Starting structural reductions, iteration 0 : 119/119 places, 131/131 transitions.
Graph (trivial) has 110 edges and 119 vertex of which 4 / 119 are part of one of the 2 SCC in 6 ms
Free SCC test removed 2 places
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 202 edges and 117 vertex of which 110 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.3 ms
Discarding 7 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 53 transitions
Trivial Post-agglo rules discarded 53 transitions
Performed 53 trivial Post agglomeration. Transition count delta: 53
Iterating post reduction 0 with 55 rules applied. Total rules applied 57 place count 110 transition count 67
Reduce places removed 53 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 64 rules applied. Total rules applied 121 place count 57 transition count 56
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 126 place count 52 transition count 56
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 126 place count 52 transition count 51
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 136 place count 47 transition count 51
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 146 place count 37 transition count 41
Iterating global reduction 3 with 10 rules applied. Total rules applied 156 place count 37 transition count 41
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 160 place count 37 transition count 37
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 160 place count 37 transition count 35
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 164 place count 35 transition count 35
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 166 place count 33 transition count 33
Iterating global reduction 4 with 2 rules applied. Total rules applied 168 place count 33 transition count 33
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 170 place count 33 transition count 31
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 171 place count 32 transition count 31
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 6 with 26 rules applied. Total rules applied 197 place count 19 transition count 18
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 198 place count 18 transition count 16
Iterating global reduction 6 with 1 rules applied. Total rules applied 199 place count 18 transition count 16
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 200 place count 18 transition count 16
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 201 place count 17 transition count 15
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 202 place count 16 transition count 15
Applied a total of 202 rules in 84 ms. Remains 16 /119 variables (removed 103) and now considering 15/131 (removed 116) transitions.
Finished structural reductions, in 1 iterations. Remains : 16/119 places, 15/131 transitions.
Normalized transition count is 14 out of 15 initially.
// Phase 1: matrix 14 rows 16 cols
[2022-06-09 00:47:07] [INFO ] Computed 5 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 133888 resets, run finished after 1241 ms. (steps per millisecond=805 ) properties (out of 1) seen :1
FORMULA AutonomousCar-PT-01b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.

BK_STOP 1654735629966

--------------------
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="AutonomousCar-PT-01b"
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 AutonomousCar-PT-01b, 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 r305-smll-165463878500157"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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