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.r597-smll-171734926300006.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 MedleyA-PT-02, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r597-smll-171734926300006
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 6.4K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 13K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 150K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 48K Jun 2 16:33 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 MedleyA-PT-02-UpperBounds-00
FORMULA_NAME MedleyA-PT-02-UpperBounds-01
FORMULA_NAME MedleyA-PT-02-UpperBounds-02
FORMULA_NAME MedleyA-PT-02-UpperBounds-03
FORMULA_NAME MedleyA-PT-02-UpperBounds-04
FORMULA_NAME MedleyA-PT-02-UpperBounds-05
FORMULA_NAME MedleyA-PT-02-UpperBounds-06
FORMULA_NAME MedleyA-PT-02-UpperBounds-07
FORMULA_NAME MedleyA-PT-02-UpperBounds-08
FORMULA_NAME MedleyA-PT-02-UpperBounds-09
FORMULA_NAME MedleyA-PT-02-UpperBounds-10
FORMULA_NAME MedleyA-PT-02-UpperBounds-11
FORMULA_NAME MedleyA-PT-02-UpperBounds-12
FORMULA_NAME MedleyA-PT-02-UpperBounds-13
FORMULA_NAME MedleyA-PT-02-UpperBounds-14
FORMULA_NAME MedleyA-PT-02-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717361450558

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=MedleyA-PT-02
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202304061127
[2024-06-02 20:50:53] [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-06-02 20:50:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 20:50:53] [INFO ] Load time of PNML (sax parser for PT used): 89 ms
[2024-06-02 20:50:53] [INFO ] Transformed 69 places.
[2024-06-02 20:50:53] [INFO ] Transformed 168 transitions.
[2024-06-02 20:50:53] [INFO ] Found NUPN structural information;
[2024-06-02 20:50:53] [INFO ] Parsed PT model containing 69 places and 168 transitions and 765 arcs in 206 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Ensure Unique test removed 6 transitions
Reduce redundant transitions removed 6 transitions.
// Phase 1: matrix 162 rows 69 cols
[2024-06-02 20:50:53] [INFO ] Computed 9 invariants in 13 ms
Incomplete random walk after 10000 steps, including 997 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 16) seen :13
FORMULA MedleyA-PT-02-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-02-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-02-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-02-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-02-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-02-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-02-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-02-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-02-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-02-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-02-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-02-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-02-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 234 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 235 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 228 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :0
[2024-06-02 20:50:53] [INFO ] Invariant cache hit.
[2024-06-02 20:50:54] [INFO ] [Real]Absence check using 8 positive place invariants in 13 ms returned sat
[2024-06-02 20:50:54] [INFO ] [Real]Absence check using 8 positive and 1 generalized place invariants in 2 ms returned sat
[2024-06-02 20:50:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 20:50:54] [INFO ] [Real]Absence check using state equation in 110 ms returned sat
[2024-06-02 20:50:54] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 20:50:54] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2024-06-02 20:50:54] [INFO ] [Nat]Absence check using 8 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-02 20:50:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 20:50:54] [INFO ] [Nat]Absence check using state equation in 76 ms returned sat
[2024-06-02 20:50:54] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-06-02 20:50:54] [INFO ] [Nat]Added 60 Read/Feed constraints in 28 ms returned sat
[2024-06-02 20:50:54] [INFO ] Computed and/alt/rep : 113/600/113 causal constraints (skipped 48 transitions) in 42 ms.
[2024-06-02 20:50:54] [INFO ] Added : 14 causal constraints over 3 iterations in 134 ms. Result :sat
Minimization took 34 ms.
[2024-06-02 20:50:54] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-02 20:50:54] [INFO ] [Real]Absence check using 8 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-02 20:50:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 20:50:54] [INFO ] [Real]Absence check using state equation in 66 ms returned sat
[2024-06-02 20:50:54] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 20:50:54] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-06-02 20:50:54] [INFO ] [Nat]Absence check using 8 positive and 1 generalized place invariants in 2 ms returned sat
[2024-06-02 20:50:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 20:50:55] [INFO ] [Nat]Absence check using state equation in 63 ms returned sat
[2024-06-02 20:50:55] [INFO ] [Nat]Added 60 Read/Feed constraints in 36 ms returned sat
[2024-06-02 20:50:55] [INFO ] Deduced a trap composed of 12 places in 80 ms of which 9 ms to minimize.
[2024-06-02 20:50:55] [INFO ] Deduced a trap composed of 11 places in 60 ms of which 1 ms to minimize.
[2024-06-02 20:50:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 176 ms
[2024-06-02 20:50:55] [INFO ] Computed and/alt/rep : 113/600/113 causal constraints (skipped 48 transitions) in 28 ms.
[2024-06-02 20:50:55] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 2 ms to minimize.
[2024-06-02 20:50:55] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 2 ms to minimize.
[2024-06-02 20:50:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 128 ms
[2024-06-02 20:50:55] [INFO ] Added : 13 causal constraints over 3 iterations in 261 ms. Result :sat
Minimization took 35 ms.
[2024-06-02 20:50:55] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-06-02 20:50:55] [INFO ] [Real]Absence check using 8 positive and 1 generalized place invariants in 0 ms returned sat
[2024-06-02 20:50:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 20:50:55] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
[2024-06-02 20:50:55] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 20:50:55] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2024-06-02 20:50:55] [INFO ] [Nat]Absence check using 8 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-02 20:50:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 20:50:55] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2024-06-02 20:50:55] [INFO ] [Nat]Added 60 Read/Feed constraints in 12 ms returned sat
[2024-06-02 20:50:55] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 0 ms to minimize.
[2024-06-02 20:50:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 59 ms
[2024-06-02 20:50:55] [INFO ] Computed and/alt/rep : 113/600/113 causal constraints (skipped 48 transitions) in 20 ms.
[2024-06-02 20:50:55] [INFO ] Added : 20 causal constraints over 4 iterations in 110 ms. Result :sat
Minimization took 39 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1] Max seen :[0, 0, 0]
FORMULA MedleyA-PT-02-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA MedleyA-PT-02-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 1 out of 69 places. Attempting structural reductions.
Drop transitions removed 2 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 69/69 places, 160/160 transitions.
Graph (complete) has 286 edges and 69 vertex of which 67 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 16 place count 52 transition count 136
Iterating global reduction 0 with 15 rules applied. Total rules applied 31 place count 52 transition count 136
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 34 place count 49 transition count 120
Iterating global reduction 0 with 3 rules applied. Total rules applied 37 place count 49 transition count 120
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 39 place count 47 transition count 112
Iterating global reduction 0 with 2 rules applied. Total rules applied 41 place count 47 transition count 112
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 47 place count 44 transition count 109
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -37
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 59 place count 38 transition count 146
Drop transitions removed 32 transitions
Redundant transition composition rules discarded 32 transitions
Iterating global reduction 0 with 32 rules applied. Total rules applied 91 place count 38 transition count 114
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 93 place count 38 transition count 112
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 95 place count 36 transition count 112
Applied a total of 95 rules in 70 ms. Remains 36 /69 variables (removed 33) and now considering 112/160 (removed 48) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70 ms. Remains : 36/69 places, 112/160 transitions.
Successfully produced net in file /tmp/petri1000_10164709999708454156.dot
Successfully produced net in file /tmp/petri1001_13863991397890342947.dot
Successfully produced net in file /tmp/petri1002_17549777626362710247.dot
Successfully produced net in file /tmp/petri1003_15858222361614207302.dot
Successfully produced net in file /tmp/petri1004_2481442153800887038.dot
Successfully produced net in file /tmp/petri1005_17991112958282142774.dot
Successfully produced net in file /tmp/petri1006_17057858901019724648.dot
Successfully produced net in file /tmp/petri1007_9774101157286080629.dot
Successfully produced net in file /tmp/petri1008_4822752292590715202.dot
Successfully produced net in file /tmp/petri1009_14698911594819168182.dot
Successfully produced net in file /tmp/petri1010_1353735475431377373.dot
Successfully produced net in file /tmp/petri1011_14416715592358254276.dot
Drop transitions removed 12 transitions
Dominated transitions for bounds rules discarded 12 transitions
// Phase 1: matrix 100 rows 36 cols
[2024-06-02 20:50:56] [INFO ] Computed 9 invariants in 8 ms
Incomplete random walk after 1000000 steps, including 244500 resets, run finished after 2508 ms. (steps per millisecond=398 ) properties (out of 1) seen :1
FORMULA MedleyA-PT-02-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 5452 ms.

BK_STOP 1717361460183

--------------------
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="MedleyA-PT-02"
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 MedleyA-PT-02, 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 r597-smll-171734926300006"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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