About the Execution of 2023-gold for CSRepetitions-PT-10
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r087-tall-171620521600166.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is CSRepetitions-PT-10, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r087-tall-171620521600166
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 20M
-rw-r--r-- 1 mcc users 559K Apr 12 10:46 CTLCardinality.txt
-rw-r--r-- 1 mcc users 1.9M Apr 12 10:46 CTLCardinality.xml
-rw-r--r-- 1 mcc users 699K Apr 12 10:29 CTLFireability.txt
-rw-r--r-- 1 mcc users 2.9M Apr 12 10:29 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 243K Apr 22 14:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 645K Apr 22 14:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 252K Apr 22 14:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 779K Apr 22 14:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 562K Apr 12 12:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 2.0M Apr 12 12:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 1.7M Apr 12 12:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 6.8M Apr 12 12:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 34K Apr 22 14:32 UpperBounds.txt
-rw-r--r-- 1 mcc users 67K Apr 22 14:32 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 1.2M May 18 16:42 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 CSRepetitions-PT-10-UpperBounds-00
FORMULA_NAME CSRepetitions-PT-10-UpperBounds-01
FORMULA_NAME CSRepetitions-PT-10-UpperBounds-02
FORMULA_NAME CSRepetitions-PT-10-UpperBounds-03
FORMULA_NAME CSRepetitions-PT-10-UpperBounds-04
FORMULA_NAME CSRepetitions-PT-10-UpperBounds-05
FORMULA_NAME CSRepetitions-PT-10-UpperBounds-06
FORMULA_NAME CSRepetitions-PT-10-UpperBounds-07
FORMULA_NAME CSRepetitions-PT-10-UpperBounds-08
FORMULA_NAME CSRepetitions-PT-10-UpperBounds-09
FORMULA_NAME CSRepetitions-PT-10-UpperBounds-10
FORMULA_NAME CSRepetitions-PT-10-UpperBounds-11
FORMULA_NAME CSRepetitions-PT-10-UpperBounds-12
FORMULA_NAME CSRepetitions-PT-10-UpperBounds-13
FORMULA_NAME CSRepetitions-PT-10-UpperBounds-14
FORMULA_NAME CSRepetitions-PT-10-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1716247281016
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CSRepetitions-PT-10
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202304061127
[2024-05-20 23:21:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-20 23:21:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-20 23:21:22] [INFO ] Load time of PNML (sax parser for PT used): 127 ms
[2024-05-20 23:21:22] [INFO ] Transformed 1311 places.
[2024-05-20 23:21:22] [INFO ] Transformed 2300 transitions.
[2024-05-20 23:21:22] [INFO ] Parsed PT model containing 1311 places and 2300 transitions and 8700 arcs in 200 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 14 ms.
// Phase 1: matrix 2300 rows 1311 cols
[2024-05-20 23:21:22] [INFO ] Computed 110 invariants in 60 ms
FORMULA CSRepetitions-PT-10-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-PT-10-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-PT-10-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-PT-10-UpperBounds-01 100 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 52 resets, run finished after 481 ms. (steps per millisecond=20 ) properties (out of 12) seen :274
FORMULA CSRepetitions-PT-10-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CSRepetitions-PT-10-UpperBounds-03 100 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CSRepetitions-PT-10-UpperBounds-02 100 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 9) seen :40
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 9) seen :60
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 9) seen :40
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 229 ms. (steps per millisecond=43 ) properties (out of 9) seen :46
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 9) seen :60
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 9) seen :40
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 9) seen :46
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 9) seen :40
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 9) seen :46
[2024-05-20 23:21:23] [INFO ] Invariant cache hit.
[2024-05-20 23:21:24] [INFO ] [Real]Absence check using 110 positive place invariants in 37 ms returned sat
[2024-05-20 23:21:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-20 23:21:24] [INFO ] [Real]Absence check using state equation in 611 ms returned unsat
[2024-05-20 23:21:24] [INFO ] [Real]Absence check using 110 positive place invariants in 31 ms returned sat
[2024-05-20 23:21:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-20 23:21:25] [INFO ] [Real]Absence check using state equation in 571 ms returned unsat
[2024-05-20 23:21:25] [INFO ] [Real]Absence check using 110 positive place invariants in 28 ms returned sat
[2024-05-20 23:21:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-20 23:21:26] [INFO ] [Real]Absence check using state equation in 587 ms returned unsat
[2024-05-20 23:21:26] [INFO ] [Real]Absence check using 110 positive place invariants in 28 ms returned unsat
[2024-05-20 23:21:26] [INFO ] [Real]Absence check using 110 positive place invariants in 28 ms returned sat
[2024-05-20 23:21:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-20 23:21:27] [INFO ] [Real]Absence check using state equation in 578 ms returned unsat
[2024-05-20 23:21:27] [INFO ] [Real]Absence check using 110 positive place invariants in 29 ms returned sat
[2024-05-20 23:21:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-20 23:21:27] [INFO ] [Real]Absence check using state equation in 551 ms returned unsat
[2024-05-20 23:21:28] [INFO ] [Real]Absence check using 110 positive place invariants in 28 ms returned sat
[2024-05-20 23:21:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-20 23:21:28] [INFO ] [Real]Absence check using state equation in 565 ms returned sat
[2024-05-20 23:21:28] [INFO ] State equation strengthened by 100 read => feed constraints.
[2024-05-20 23:21:28] [INFO ] [Real]Added 100 Read/Feed constraints in 11 ms returned sat
[2024-05-20 23:21:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 23:21:29] [INFO ] [Nat]Absence check using 110 positive place invariants in 29 ms returned sat
[2024-05-20 23:21:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-20 23:21:29] [INFO ] [Nat]Absence check using state equation in 570 ms returned sat
[2024-05-20 23:21:29] [INFO ] [Nat]Added 100 Read/Feed constraints in 11 ms returned sat
[2024-05-20 23:21:29] [INFO ] Computed and/alt/rep : 2200/3200/2200 causal constraints (skipped 0 transitions) in 144 ms.
[2024-05-20 23:21:30] [INFO ] Added : 1 causal constraints over 1 iterations in 430 ms. Result :sat
Minimization took 159 ms.
[2024-05-20 23:21:30] [INFO ] [Real]Absence check using 110 positive place invariants in 28 ms returned sat
[2024-05-20 23:21:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-20 23:21:31] [INFO ] [Real]Absence check using state equation in 566 ms returned unsat
[2024-05-20 23:21:31] [INFO ] [Real]Absence check using 110 positive place invariants in 29 ms returned sat
[2024-05-20 23:21:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-20 23:21:31] [INFO ] [Real]Absence check using state equation in 576 ms returned sat
[2024-05-20 23:21:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 23:21:32] [INFO ] [Nat]Absence check using 110 positive place invariants in 38 ms returned sat
[2024-05-20 23:21:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-20 23:21:32] [INFO ] [Nat]Absence check using state equation in 540 ms returned sat
[2024-05-20 23:21:32] [INFO ] [Nat]Added 100 Read/Feed constraints in 11 ms returned sat
[2024-05-20 23:21:32] [INFO ] Computed and/alt/rep : 2200/3200/2200 causal constraints (skipped 0 transitions) in 119 ms.
[2024-05-20 23:21:33] [INFO ] Added : 1 causal constraints over 1 iterations in 357 ms. Result :sat
Minimization took 153 ms.
Current structural bounds on expressions (after SMT) : [10, 10, 10, 10, 10, 10, -1, 10, -1] Max seen :[10, 10, 10, 10, 10, 10, 2, 10, 1]
FORMULA CSRepetitions-PT-10-UpperBounds-12 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA CSRepetitions-PT-10-UpperBounds-09 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA CSRepetitions-PT-10-UpperBounds-07 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA CSRepetitions-PT-10-UpperBounds-06 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA CSRepetitions-PT-10-UpperBounds-05 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA CSRepetitions-PT-10-UpperBounds-04 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA CSRepetitions-PT-10-UpperBounds-00 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 2 out of 1311 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1311/1311 places, 2300/2300 transitions.
Drop transitions removed 98 transitions
Reduce isomorphic transitions removed 98 transitions.
Iterating post reduction 0 with 98 rules applied. Total rules applied 98 place count 1311 transition count 2202
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Deduced a syphon composed of 100 places in 2 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 1 with 300 rules applied. Total rules applied 398 place count 1111 transition count 2102
Discarding 990 places :
Symmetric choice reduction at 1 with 990 rule applications. Total rules 1388 place count 121 transition count 1112
Iterating global reduction 1 with 990 rules applied. Total rules applied 2378 place count 121 transition count 1112
Discarding 89 places :
Symmetric choice reduction at 1 with 89 rule applications. Total rules 2467 place count 32 transition count 222
Iterating global reduction 1 with 89 rules applied. Total rules applied 2556 place count 32 transition count 222
Ensure Unique test removed 89 transitions
Reduce isomorphic transitions removed 89 transitions.
Iterating post reduction 1 with 89 rules applied. Total rules applied 2645 place count 32 transition count 133
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 2675 place count 12 transition count 123
Ensure Unique test removed 99 transitions
Reduce isomorphic transitions removed 99 transitions.
Graph (trivial) has 18 edges and 12 vertex of which 10 / 12 are part of one of the 1 SCC in 2 ms
Free SCC test removed 9 places
Iterating post reduction 2 with 100 rules applied. Total rules applied 2775 place count 3 transition count 24
Drop transitions removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 3 with 18 rules applied. Total rules applied 2793 place count 3 transition count 6
Applied a total of 2793 rules in 359 ms. Remains 3 /1311 variables (removed 1308) and now considering 6/2300 (removed 2294) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 359 ms. Remains : 3/1311 places, 6/2300 transitions.
// Phase 1: matrix 6 rows 3 cols
[2024-05-20 23:21:33] [INFO ] Computed 0 invariants in 0 ms
Incomplete random walk after 1000000 steps, including 22409 resets, run finished after 177 ms. (steps per millisecond=5649 ) properties (out of 2) seen :20
Incomplete Best-First random walk after 1000001 steps, including 6377 resets, run finished after 177 ms. (steps per millisecond=5649 ) properties (out of 2) seen :10
Incomplete Best-First random walk after 1000000 steps, including 6378 resets, run finished after 169 ms. (steps per millisecond=5917 ) properties (out of 2) seen :10
[2024-05-20 23:21:34] [INFO ] Invariant cache hit.
[2024-05-20 23:21:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-20 23:21:34] [INFO ] [Real]Absence check using state equation in 2 ms returned unsat
[2024-05-20 23:21:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-20 23:21:34] [INFO ] [Real]Absence check using state equation in 2 ms returned unsat
Current structural bounds on expressions (after SMT) : [10, 10] Max seen :[10, 10]
FORMULA CSRepetitions-PT-10-UpperBounds-14 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA CSRepetitions-PT-10-UpperBounds-10 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 11836 ms.
BK_STOP 1716247295255
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
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="CSRepetitions-PT-10"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is CSRepetitions-PT-10, 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 r087-tall-171620521600166"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/CSRepetitions-PT-10.tgz
mv CSRepetitions-PT-10 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 ;