About the Execution of 2021-gold for Parking-PT-208
| Execution Summary | |||||
| Max Memory Used (MB)  | 
      Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status  | 
   
| 233.876 | 8012.00 | 18894.00 | 340.80 | 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 | normal | 
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.r161-smll-165277002800115.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 Parking-PT-208, examination is UpperBounds
    Time confinement is 3600 seconds
    Memory confinement is 16384 MBytes
    Number of cores is 4
    Run identifier is r161-smll-165277002800115
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 240K
-rw-r--r-- 1 mcc users 5.2K Apr 30 05:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users  51K Apr 30 05:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K Apr 30 05:51 CTLFireability.txt
-rw-r--r-- 1 mcc users  38K Apr 30 05:51 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.7K May  9 08:23 LTLCardinality.txt
-rw-r--r-- 1 mcc users  27K May  9 08:23 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May  9 08:23 LTLFireability.txt
-rw-r--r-- 1 mcc users  16K May  9 08:23 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May  9 08:23 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May  9 08:23 UpperBounds.xml
-rw-r--r-- 1 mcc users    6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users    4 May 10 09:34 instance
-rw-r--r-- 1 mcc users    6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users  49K 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 Parking-PT-208-UpperBounds-00
FORMULA_NAME Parking-PT-208-UpperBounds-01
FORMULA_NAME Parking-PT-208-UpperBounds-02
FORMULA_NAME Parking-PT-208-UpperBounds-03
FORMULA_NAME Parking-PT-208-UpperBounds-04
FORMULA_NAME Parking-PT-208-UpperBounds-05
FORMULA_NAME Parking-PT-208-UpperBounds-06
FORMULA_NAME Parking-PT-208-UpperBounds-07
FORMULA_NAME Parking-PT-208-UpperBounds-08
FORMULA_NAME Parking-PT-208-UpperBounds-09
FORMULA_NAME Parking-PT-208-UpperBounds-10
FORMULA_NAME Parking-PT-208-UpperBounds-11
FORMULA_NAME Parking-PT-208-UpperBounds-12
FORMULA_NAME Parking-PT-208-UpperBounds-13
FORMULA_NAME Parking-PT-208-UpperBounds-14
FORMULA_NAME Parking-PT-208-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1652990303016
Running Version 0
[2022-05-19 19:58:26] [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-19 19:58:26] [INFO   ] Parsing pnml file : /home/mcc/execution/model.pnml 
[2022-05-19 19:58:26] [INFO   ] Load time of PNML (sax parser for PT used): 115 ms 
[2022-05-19 19:58:26] [INFO   ] Transformed 137 places. 
[2022-05-19 19:58:26] [INFO   ] Transformed 201 transitions. 
[2022-05-19 19:58:26] [INFO   ] Found NUPN structural information; 
[2022-05-19 19:58:26] [INFO   ] Parsed PT model containing 137 places and 201 transitions in 208 ms. 
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 14 ms.
Ensure Unique test removed 84 transitions
Reduce redundant transitions removed 84 transitions.
// Phase 1: matrix 117 rows 137 cols
[2022-05-19 19:58:26] [INFO   ] Computed 34 place invariants in 25 ms 
Incomplete random walk after 10000  steps, including 291 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 16) seen :14
FORMULA Parking-PT-208-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-208-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-208-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-208-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-208-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-208-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-208-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-208-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-208-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-208-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-208-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-208-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-208-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-208-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001  steps, including 26 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001  steps, including 25 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) seen :1
FORMULA Parking-PT-208-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 117 rows 137 cols
[2022-05-19 19:58:27] [INFO   ] Computed 34 place invariants in 19 ms 
[2022-05-19 19:58:27] [INFO   ] [Real]Absence check using  32 positive place invariants in 22 ms returned sat 
[2022-05-19 19:58:27] [INFO   ] [Real]Absence check using  32 positive and 2 generalized place invariants in 2 ms returned sat 
[2022-05-19 19:58:27] [INFO   ] [Real]Adding state equation constraints to refine reachable states. 
[2022-05-19 19:58:27] [INFO   ] [Real]Absence check using state equation in 122 ms returned sat 
[2022-05-19 19:58:27] [INFO   ] Solution in real domain found non-integer solution. 
[2022-05-19 19:58:27] [INFO   ] [Nat]Absence check using  32 positive place invariants in 27 ms returned sat 
[2022-05-19 19:58:27] [INFO   ] [Nat]Absence check using  32 positive and 2 generalized place invariants in 2 ms returned sat 
[2022-05-19 19:58:27] [INFO   ] [Nat]Adding state equation constraints to refine reachable states. 
[2022-05-19 19:58:27] [INFO   ] [Nat]Absence check using state equation in 117 ms returned sat 
[2022-05-19 19:58:27] [INFO   ] State equation strengthened by 26 read => feed constraints. 
[2022-05-19 19:58:27] [INFO   ] [Nat]Added 26 Read/Feed constraints in 7 ms returned sat 
[2022-05-19 19:58:27] [INFO   ] Computed and/alt/rep : 116/396/116 causal constraints (skipped 0 transitions) in 29 ms. 
[2022-05-19 19:58:28] [INFO   ] Added : 88 causal constraints over 18 iterations in 577 ms. Result :sat 
Minimization took 84 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 1700 steps, including 100 resets, run finished after 10 ms. (steps per millisecond=170 ) properties (out of 1) seen :0 could not realise parikh vector 
Support contains 1 out of 137 places. Attempting structural reductions.
Drop transitions removed 1 transitions 
Starting structural reductions, iteration 0 : 137/137 places, 116/116 transitions.
Drop transitions removed 4 transitions 
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 137 transition count 112
Reduce places removed 4 places and 0 transitions. 
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 133 transition count 112
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 8 place count 133 transition count 108
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions. 
Iterating global reduction 2 with 8 rules applied. Total rules applied 16 place count 129 transition count 108
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules  18 place count 127 transition count 106
Iterating global reduction 2 with 2 rules applied. Total rules applied 20 place count 127 transition count 106
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions. 
Iterating global reduction 2 with 12 rules applied. Total rules applied 32 place count 121 transition count 100
Free-agglomeration rule  applied 20 times.
Iterating global reduction 2 with 20 rules applied. Total rules applied 52 place count 121 transition count 80
Reduce places removed 20 places and 0 transitions. 
Graph (complete) has 213 edges and 101 vertex of which 52 are kept as prefixes of interest. Removing 49 places using SCC suffix rule.3 ms
Discarding 49 places :
Also discarding 38 output transitions 
Drop transitions removed 38 transitions 
Iterating post reduction 2 with 21 rules applied. Total rules applied 73 place count 52 transition count 42
Drop transitions removed 2 transitions 
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 75 place count 52 transition count 40
Reduce places removed 1 places and 1 transitions. 
Iterating global reduction 4 with 1 rules applied. Total rules applied 76 place count 51 transition count 39
Reduce places removed 11 places and 0 transitions. 
Drop transitions removed 18 transitions 
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 4 with 29 rules applied. Total rules applied 105 place count 40 transition count 21
Reduce places removed 18 places and 0 transitions. 
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 4 transitions 
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 5 with 24 rules applied. Total rules applied 129 place count 22 transition count 15
Reduce places removed 4 places and 0 transitions. 
Iterating post reduction 6 with 4 rules applied. Total rules applied 133 place count 18 transition count 15
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 5 Pre rules applied. Total rules applied 133 place count 18 transition count 10
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions. 
Iterating global reduction 7 with 10 rules applied. Total rules applied 143 place count 13 transition count 10
Applied a total of 143 rules in 131 ms. Remains 13 /137 variables (removed 124) and now considering 10/116 (removed 106) transitions.
Finished structural reductions, in 1 iterations. Remains : 13/137 places, 10/116 transitions.
// Phase 1: matrix 10 rows 13 cols
[2022-05-19 19:58:28] [INFO   ] Computed 7 place invariants in 2 ms 
Incomplete random walk after 1000000  steps, including 90587 resets, run finished after 1143 ms. (steps per millisecond=874 ) properties (out of 1) seen :1
FORMULA Parking-PT-208-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
BK_STOP 1652990311028
--------------------
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="Parking-PT-208"
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 Parking-PT-208, 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 r161-smll-165277002800115"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Parking-PT-208.tgz
mv Parking-PT-208 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 ;
