About the Execution of 2022-gold for Referendum-PT-0200
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r351-tall-167889220900064.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool gold2022
Input is Referendum-PT-0200, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r351-tall-167889220900064
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 7.8M
-rw-r--r-- 1 mcc users 200K Feb 26 17:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 966K Feb 26 17:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 67K Feb 26 17:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 500K Feb 26 17:36 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 96K Feb 25 16:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 331K Feb 25 16:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 44K Feb 25 16:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 230K Feb 25 16:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 529K Feb 26 18:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 2.5M Feb 26 18:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 253K Feb 26 17:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.9M Feb 26 17:58 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 24K Feb 25 16:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 58K Feb 25 16:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 228K Mar 5 18:23 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 Referendum-PT-0200-UpperBounds-00
FORMULA_NAME Referendum-PT-0200-UpperBounds-01
FORMULA_NAME Referendum-PT-0200-UpperBounds-02
FORMULA_NAME Referendum-PT-0200-UpperBounds-03
FORMULA_NAME Referendum-PT-0200-UpperBounds-04
FORMULA_NAME Referendum-PT-0200-UpperBounds-05
FORMULA_NAME Referendum-PT-0200-UpperBounds-06
FORMULA_NAME Referendum-PT-0200-UpperBounds-07
FORMULA_NAME Referendum-PT-0200-UpperBounds-08
FORMULA_NAME Referendum-PT-0200-UpperBounds-09
FORMULA_NAME Referendum-PT-0200-UpperBounds-10
FORMULA_NAME Referendum-PT-0200-UpperBounds-11
FORMULA_NAME Referendum-PT-0200-UpperBounds-12
FORMULA_NAME Referendum-PT-0200-UpperBounds-13
FORMULA_NAME Referendum-PT-0200-UpperBounds-14
FORMULA_NAME Referendum-PT-0200-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1679137302554
Running Version 202205111006
[2023-03-18 11:01: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]
[2023-03-18 11:01:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 11:01:44] [INFO ] Load time of PNML (sax parser for PT used): 117 ms
[2023-03-18 11:01:44] [INFO ] Transformed 601 places.
[2023-03-18 11:01:44] [INFO ] Transformed 401 transitions.
[2023-03-18 11:01:44] [INFO ] Found NUPN structural information;
[2023-03-18 11:01:44] [INFO ] Parsed PT model containing 601 places and 401 transitions in 248 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 19 ms.
FORMULA Referendum-PT-0200-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0200-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 401 rows 601 cols
[2023-03-18 11:01:44] [INFO ] Computed 200 place invariants in 20 ms
Incomplete random walk after 10000 steps, including 49 resets, run finished after 696 ms. (steps per millisecond=14 ) properties (out of 14) seen :1207
FORMULA Referendum-PT-0200-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Referendum-PT-0200-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Referendum-PT-0200-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Referendum-PT-0200-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Referendum-PT-0200-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Referendum-PT-0200-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Referendum-PT-0200-UpperBounds-03 200 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Referendum-PT-0200-UpperBounds-02 200 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Referendum-PT-0200-UpperBounds-00 200 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 5) seen :36
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 5) seen :36
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 5) seen :36
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 5) seen :9
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 5) seen :36
// Phase 1: matrix 401 rows 601 cols
[2023-03-18 11:01:45] [INFO ] Computed 200 place invariants in 3 ms
[2023-03-18 11:01:45] [INFO ] [Real]Absence check using 200 positive place invariants in 55 ms returned sat
[2023-03-18 11:01:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 11:01:45] [INFO ] [Real]Absence check using state equation in 153 ms returned sat
[2023-03-18 11:01:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 11:01:47] [INFO ] [Nat]Absence check using 200 positive place invariants in 39 ms returned sat
[2023-03-18 11:01:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 11:01:47] [INFO ] [Nat]Absence check using state equation in 208 ms returned sat
[2023-03-18 11:01:47] [INFO ] Computed and/alt/rep : 400/400/400 causal constraints (skipped 0 transitions) in 33 ms.
[2023-03-18 11:01:48] [INFO ] Added : 151 causal constraints over 31 iterations in 1018 ms. Result :sat
Minimization took 186 ms.
[2023-03-18 11:01:48] [INFO ] [Real]Absence check using 200 positive place invariants in 29 ms returned sat
[2023-03-18 11:01:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 11:01:49] [INFO ] [Real]Absence check using state equation in 236 ms returned sat
[2023-03-18 11:01:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 11:01:50] [INFO ] [Nat]Absence check using 200 positive place invariants in 48 ms returned sat
[2023-03-18 11:01:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 11:01:50] [INFO ] [Nat]Absence check using state equation in 130 ms returned sat
[2023-03-18 11:01:50] [INFO ] Computed and/alt/rep : 400/400/400 causal constraints (skipped 0 transitions) in 41 ms.
[2023-03-18 11:01:51] [INFO ] Added : 151 causal constraints over 31 iterations in 896 ms. Result :sat
Minimization took 182 ms.
[2023-03-18 11:01:52] [INFO ] [Real]Absence check using 200 positive place invariants in 40 ms returned sat
[2023-03-18 11:01:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 11:01:52] [INFO ] [Real]Absence check using state equation in 123 ms returned sat
[2023-03-18 11:01:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 11:01:53] [INFO ] [Nat]Absence check using 200 positive place invariants in 34 ms returned sat
[2023-03-18 11:01:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 11:01:53] [INFO ] [Nat]Absence check using state equation in 116 ms returned sat
[2023-03-18 11:01:53] [INFO ] Computed and/alt/rep : 400/400/400 causal constraints (skipped 0 transitions) in 30 ms.
[2023-03-18 11:01:54] [INFO ] Added : 151 causal constraints over 31 iterations in 835 ms. Result :sat
Minimization took 184 ms.
[2023-03-18 11:01:55] [INFO ] [Real]Absence check using 200 positive place invariants in 40 ms returned sat
[2023-03-18 11:01:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 11:01:55] [INFO ] [Real]Absence check using state equation in 121 ms returned sat
[2023-03-18 11:01:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 11:01:58] [INFO ] [Real]Absence check using 200 positive place invariants in 40 ms returned sat
[2023-03-18 11:01:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 11:01:58] [INFO ] [Real]Absence check using state equation in 128 ms returned sat
[2023-03-18 11:01:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 11:02:00] [INFO ] [Nat]Absence check using 200 positive place invariants in 39 ms returned sat
[2023-03-18 11:02:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 11:02:00] [INFO ] [Nat]Absence check using state equation in 138 ms returned sat
[2023-03-18 11:02:00] [INFO ] Computed and/alt/rep : 400/400/400 causal constraints (skipped 0 transitions) in 24 ms.
[2023-03-18 11:02:01] [INFO ] Added : 151 causal constraints over 31 iterations in 916 ms. Result :sat
Minimization took 198 ms.
Current structural bounds on expressions (after SMT) : [200, 200, 200, 200, 200] Max seen :[120, 120, 120, 121, 120]
FORMULA Referendum-PT-0200-UpperBounds-07 200 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Referendum-PT-0200-UpperBounds-05 200 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Referendum-PT-0200-UpperBounds-04 200 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Referendum-PT-0200-UpperBounds-01 200 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 200 out of 601 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 601/601 places, 401/401 transitions.
Graph (complete) has 600 edges and 601 vertex of which 401 are kept as prefixes of interest. Removing 200 places using SCC suffix rule.4 ms
Discarding 200 places :
Also discarding 0 output transitions
Drop transitions removed 200 transitions
Reduce isomorphic transitions removed 200 transitions.
Iterating post reduction 0 with 200 rules applied. Total rules applied 201 place count 401 transition count 201
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 202 place count 400 transition count 200
Applied a total of 202 rules in 57 ms. Remains 400 /601 variables (removed 201) and now considering 200/401 (removed 201) transitions.
Finished structural reductions, in 1 iterations. Remains : 400/601 places, 200/401 transitions.
// Phase 1: matrix 200 rows 400 cols
[2023-03-18 11:02:03] [INFO ] Computed 200 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 4975 resets, run finished after 16397 ms. (steps per millisecond=60 ) properties (out of 1) seen :200
FORMULA Referendum-PT-0200-UpperBounds-06 200 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 36018 ms.
BK_STOP 1679137339927
--------------------
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="Referendum-PT-0200"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2022"
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-5348"
echo " Executing tool gold2022"
echo " Input is Referendum-PT-0200, 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 r351-tall-167889220900064"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Referendum-PT-0200.tgz
mv Referendum-PT-0200 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 ;