About the Execution of 2022-gold for PermAdmissibility-PT-50
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.r287-smll-167863553800069.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 PermAdmissibility-PT-50, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r287-smll-167863553800069
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 11K Feb 26 01:18 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K Feb 26 01:18 CTLCardinality.xml
-rw-r--r-- 1 mcc users 76K Feb 26 01:17 CTLFireability.txt
-rw-r--r-- 1 mcc users 407K Feb 26 01:17 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.6K Feb 25 16:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Feb 25 16:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 23K Feb 25 16:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 92K Feb 25 16:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 22K Feb 26 01:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 190K Feb 26 01:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 36K Feb 26 01:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 166K Feb 26 01:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 16:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.7K Feb 25 16:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 340K 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 PermAdmissibility-PT-50-UpperBounds-00
FORMULA_NAME PermAdmissibility-PT-50-UpperBounds-01
FORMULA_NAME PermAdmissibility-PT-50-UpperBounds-02
FORMULA_NAME PermAdmissibility-PT-50-UpperBounds-03
FORMULA_NAME PermAdmissibility-PT-50-UpperBounds-04
FORMULA_NAME PermAdmissibility-PT-50-UpperBounds-05
FORMULA_NAME PermAdmissibility-PT-50-UpperBounds-06
FORMULA_NAME PermAdmissibility-PT-50-UpperBounds-07
FORMULA_NAME PermAdmissibility-PT-50-UpperBounds-08
FORMULA_NAME PermAdmissibility-PT-50-UpperBounds-09
FORMULA_NAME PermAdmissibility-PT-50-UpperBounds-10
FORMULA_NAME PermAdmissibility-PT-50-UpperBounds-11
FORMULA_NAME PermAdmissibility-PT-50-UpperBounds-12
FORMULA_NAME PermAdmissibility-PT-50-UpperBounds-13
FORMULA_NAME PermAdmissibility-PT-50-UpperBounds-14
FORMULA_NAME PermAdmissibility-PT-50-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1678918346387
Running Version 202205111006
[2023-03-15 22:12:28] [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-15 22:12:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 22:12:29] [INFO ] Load time of PNML (sax parser for PT used): 292 ms
[2023-03-15 22:12:29] [INFO ] Transformed 168 places.
[2023-03-15 22:12:29] [INFO ] Transformed 592 transitions.
[2023-03-15 22:12:29] [INFO ] Parsed PT model containing 168 places and 592 transitions in 554 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 32 ms.
// Phase 1: matrix 592 rows 168 cols
[2023-03-15 22:12:29] [INFO ] Computed 32 place invariants in 82 ms
Incomplete random walk after 10008 steps, including 12 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 16) seen :950
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 16) seen :394
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 16) seen :375
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 16) seen :383
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 16) seen :383
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 16) seen :406
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 16) seen :374
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 16) seen :382
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 16) seen :396
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 16) seen :379
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 16) seen :385
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 16) seen :418
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 16) seen :378
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 16) seen :393
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 16) seen :384
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 16) seen :387
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 16) seen :373
// Phase 1: matrix 592 rows 168 cols
[2023-03-15 22:12:30] [INFO ] Computed 32 place invariants in 19 ms
[2023-03-15 22:12:30] [INFO ] [Real]Absence check using 0 positive and 32 generalized place invariants in 16 ms returned unsat
[2023-03-15 22:12:30] [INFO ] [Real]Absence check using 0 positive and 32 generalized place invariants in 28 ms returned unsat
[2023-03-15 22:12:30] [INFO ] [Real]Absence check using 0 positive and 32 generalized place invariants in 31 ms returned unsat
[2023-03-15 22:12:31] [INFO ] [Real]Absence check using 0 positive and 32 generalized place invariants in 29 ms returned unsat
[2023-03-15 22:12:31] [INFO ] [Real]Absence check using 0 positive and 32 generalized place invariants in 16 ms returned unsat
[2023-03-15 22:12:31] [INFO ] [Real]Absence check using 0 positive and 32 generalized place invariants in 22 ms returned unsat
[2023-03-15 22:12:31] [INFO ] [Real]Absence check using 0 positive and 32 generalized place invariants in 21 ms returned unsat
[2023-03-15 22:12:31] [INFO ] [Real]Absence check using 0 positive and 32 generalized place invariants in 11 ms returned unsat
[2023-03-15 22:12:31] [INFO ] [Real]Absence check using 0 positive and 32 generalized place invariants in 22 ms returned unsat
[2023-03-15 22:12:31] [INFO ] [Real]Absence check using 0 positive and 32 generalized place invariants in 25 ms returned unsat
[2023-03-15 22:12:31] [INFO ] [Real]Absence check using 0 positive and 32 generalized place invariants in 18 ms returned unsat
[2023-03-15 22:12:31] [INFO ] [Real]Absence check using 0 positive and 32 generalized place invariants in 27 ms returned unsat
[2023-03-15 22:12:31] [INFO ] [Real]Absence check using 0 positive and 32 generalized place invariants in 21 ms returned unsat
[2023-03-15 22:12:31] [INFO ] [Real]Absence check using 0 positive and 32 generalized place invariants in 13 ms returned unsat
[2023-03-15 22:12:31] [INFO ] [Real]Absence check using 0 positive and 32 generalized place invariants in 34 ms returned sat
[2023-03-15 22:12:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 22:12:32] [INFO ] [Real]Absence check using state equation in 329 ms returned sat
[2023-03-15 22:12:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 22:12:32] [INFO ] [Nat]Absence check using 0 positive and 32 generalized place invariants in 24 ms returned sat
[2023-03-15 22:12:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 22:12:32] [INFO ] [Nat]Absence check using state equation in 300 ms returned sat
[2023-03-15 22:12:33] [INFO ] Computed and/alt/rep : 28/176/28 causal constraints (skipped 560 transitions) in 218 ms.
[2023-03-15 22:12:33] [INFO ] Added : 21 causal constraints over 7 iterations in 924 ms. Result :sat
Minimization took 260 ms.
[2023-03-15 22:12:34] [INFO ] [Real]Absence check using 0 positive and 32 generalized place invariants in 17 ms returned unsat
Current structural bounds on expressions (after SMT) : [50, 100, 50, 50, 100, 50, 100, 100, 50, 50, 50, 50, 50, 50, -1, 50] Max seen :[50, 100, 50, 50, 100, 50, 100, 100, 50, 50, 50, 50, 50, 50, 4, 50]
FORMULA PermAdmissibility-PT-50-UpperBounds-15 50 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PermAdmissibility-PT-50-UpperBounds-13 50 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PermAdmissibility-PT-50-UpperBounds-12 50 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PermAdmissibility-PT-50-UpperBounds-11 50 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PermAdmissibility-PT-50-UpperBounds-10 50 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PermAdmissibility-PT-50-UpperBounds-09 50 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PermAdmissibility-PT-50-UpperBounds-08 50 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PermAdmissibility-PT-50-UpperBounds-07 100 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PermAdmissibility-PT-50-UpperBounds-06 100 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PermAdmissibility-PT-50-UpperBounds-05 50 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PermAdmissibility-PT-50-UpperBounds-04 100 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PermAdmissibility-PT-50-UpperBounds-03 50 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PermAdmissibility-PT-50-UpperBounds-02 50 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PermAdmissibility-PT-50-UpperBounds-01 100 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PermAdmissibility-PT-50-UpperBounds-00 50 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 1 out of 168 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 168/168 places, 592/592 transitions.
Graph (complete) has 1615 edges and 168 vertex of which 86 are kept as prefixes of interest. Removing 82 places using SCC suffix rule.12 ms
Discarding 82 places :
Also discarding 128 output transitions
Drop transitions removed 128 transitions
Drop transitions removed 56 transitions
Reduce isomorphic transitions removed 56 transitions.
Iterating post reduction 0 with 56 rules applied. Total rules applied 57 place count 86 transition count 408
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 70 place count 73 transition count 339
Iterating global reduction 1 with 13 rules applied. Total rules applied 83 place count 73 transition count 339
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 109 place count 47 transition count 93
Iterating global reduction 1 with 26 rules applied. Total rules applied 135 place count 47 transition count 93
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 141 place count 41 transition count 55
Iterating global reduction 1 with 6 rules applied. Total rules applied 147 place count 41 transition count 55
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 149 place count 41 transition count 53
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 151 place count 39 transition count 53
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 152 place count 39 transition count 53
Applied a total of 152 rules in 98 ms. Remains 39 /168 variables (removed 129) and now considering 53/592 (removed 539) transitions.
// Phase 1: matrix 53 rows 39 cols
[2023-03-15 22:12:34] [INFO ] Computed 14 place invariants in 2 ms
[2023-03-15 22:12:34] [INFO ] Dead Transitions using invariants and state equation in 88 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 39/168 places, 53/592 transitions.
// Phase 1: matrix 53 rows 39 cols
[2023-03-15 22:12:34] [INFO ] Computed 14 place invariants in 1 ms
Incomplete random walk after 1000020 steps, including 1908 resets, run finished after 658 ms. (steps per millisecond=1519 ) properties (out of 1) seen :50
Incomplete Best-First random walk after 1000000 steps, including 88 resets, run finished after 893 ms. (steps per millisecond=1119 ) properties (out of 1) seen :30
// Phase 1: matrix 53 rows 39 cols
[2023-03-15 22:12:36] [INFO ] Computed 14 place invariants in 5 ms
[2023-03-15 22:12:36] [INFO ] [Real]Absence check using 0 positive and 14 generalized place invariants in 5 ms returned sat
[2023-03-15 22:12:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 22:12:36] [INFO ] [Real]Absence check using state equation in 23 ms returned unsat
Current structural bounds on expressions (after SMT) : [50] Max seen :[50]
FORMULA PermAdmissibility-PT-50-UpperBounds-14 50 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 7346 ms.
BK_STOP 1678918356322
--------------------
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="PermAdmissibility-PT-50"
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 PermAdmissibility-PT-50, 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 r287-smll-167863553800069"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PermAdmissibility-PT-50.tgz
mv PermAdmissibility-PT-50 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 ;