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.r231-tall-167856416100469.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 lolaxred
Input is LeafsetExtension-PT-S08C4, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r231-tall-167856416100469
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 720K
-rw-r--r-- 1 mcc users 13K Feb 25 16:56 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K Feb 25 16:56 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.6K Feb 25 16:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 25 16:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.4K Feb 25 16:20 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Feb 25 16:20 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.3K Feb 25 16:20 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Feb 25 16:20 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Feb 25 16:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 109K Feb 25 16:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 25 16:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 25 16:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:20 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.2K Feb 25 16:20 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 254K Mar 5 18:22 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 LeafsetExtension-PT-S08C4-UpperBounds-00
FORMULA_NAME LeafsetExtension-PT-S08C4-UpperBounds-01
FORMULA_NAME LeafsetExtension-PT-S08C4-UpperBounds-02
FORMULA_NAME LeafsetExtension-PT-S08C4-UpperBounds-03
FORMULA_NAME LeafsetExtension-PT-S08C4-UpperBounds-04
FORMULA_NAME LeafsetExtension-PT-S08C4-UpperBounds-05
FORMULA_NAME LeafsetExtension-PT-S08C4-UpperBounds-06
FORMULA_NAME LeafsetExtension-PT-S08C4-UpperBounds-07
FORMULA_NAME LeafsetExtension-PT-S08C4-UpperBounds-08
FORMULA_NAME LeafsetExtension-PT-S08C4-UpperBounds-09
FORMULA_NAME LeafsetExtension-PT-S08C4-UpperBounds-10
FORMULA_NAME LeafsetExtension-PT-S08C4-UpperBounds-11
FORMULA_NAME LeafsetExtension-PT-S08C4-UpperBounds-12
FORMULA_NAME LeafsetExtension-PT-S08C4-UpperBounds-13
FORMULA_NAME LeafsetExtension-PT-S08C4-UpperBounds-14
FORMULA_NAME LeafsetExtension-PT-S08C4-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1679458662808

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=lolaxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LeafsetExtension-PT-S08C4
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-22 04:17:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-22 04:17:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 04:17:44] [INFO ] Load time of PNML (sax parser for PT used): 61 ms
[2023-03-22 04:17:44] [INFO ] Transformed 462 places.
[2023-03-22 04:17:44] [INFO ] Transformed 409 transitions.
[2023-03-22 04:17:44] [INFO ] Parsed PT model containing 462 places and 409 transitions and 1324 arcs in 126 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 4 ms.
// Phase 1: matrix 409 rows 462 cols
[2023-03-22 04:17:44] [INFO ] Computed 53 place invariants in 36 ms
Incomplete random walk after 10000 steps, including 294 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 16) seen :17
FORMULA LeafsetExtension-PT-S08C4-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S08C4-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S08C4-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S08C4-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S08C4-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S08C4-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S08C4-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S08C4-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 8) seen :8
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 8) seen :7
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 8) seen :7
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 8) seen :6
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 8) seen :8
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 8) seen :8
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 8) seen :8
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 8) seen :8
[2023-03-22 04:17:44] [INFO ] Invariant cache hit.
[2023-03-22 04:17:45] [INFO ] [Real]Absence check using 11 positive place invariants in 14 ms returned sat
[2023-03-22 04:17:45] [INFO ] [Real]Absence check using 11 positive and 42 generalized place invariants in 14 ms returned unsat
[2023-03-22 04:17:45] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2023-03-22 04:17:45] [INFO ] [Real]Absence check using 11 positive and 42 generalized place invariants in 12 ms returned unsat
[2023-03-22 04:17:45] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2023-03-22 04:17:45] [INFO ] [Real]Absence check using 11 positive and 42 generalized place invariants in 12 ms returned sat
[2023-03-22 04:17:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 04:17:45] [INFO ] [Real]Absence check using state equation in 111 ms returned sat
[2023-03-22 04:17:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 04:17:45] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2023-03-22 04:17:45] [INFO ] [Nat]Absence check using 11 positive and 42 generalized place invariants in 14 ms returned sat
[2023-03-22 04:17:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 04:17:45] [INFO ] [Nat]Absence check using state equation in 110 ms returned sat
[2023-03-22 04:17:45] [INFO ] Deduced a trap composed of 64 places in 139 ms of which 3 ms to minimize.
[2023-03-22 04:17:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 186 ms
[2023-03-22 04:17:45] [INFO ] Computed and/alt/rep : 398/600/398 causal constraints (skipped 2 transitions) in 35 ms.
[2023-03-22 04:17:45] [INFO ] Added : 15 causal constraints over 4 iterations in 181 ms. Result :sat
Minimization took 33 ms.
[2023-03-22 04:17:46] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2023-03-22 04:17:46] [INFO ] [Real]Absence check using 11 positive and 42 generalized place invariants in 13 ms returned unsat
[2023-03-22 04:17:46] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2023-03-22 04:17:46] [INFO ] [Real]Absence check using 11 positive and 42 generalized place invariants in 7 ms returned unsat
[2023-03-22 04:17:46] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2023-03-22 04:17:46] [INFO ] [Real]Absence check using 11 positive and 42 generalized place invariants in 8 ms returned unsat
[2023-03-22 04:17:46] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2023-03-22 04:17:46] [INFO ] [Real]Absence check using 11 positive and 42 generalized place invariants in 9 ms returned unsat
[2023-03-22 04:17:46] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2023-03-22 04:17:46] [INFO ] [Real]Absence check using 11 positive and 42 generalized place invariants in 7 ms returned unsat
Current structural bounds on expressions (after SMT) : [1, 1, -1, 1, 1, 1, 1, 1] Max seen :[1, 1, 2, 1, 1, 1, 1, 1]
FORMULA LeafsetExtension-PT-S08C4-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LeafsetExtension-PT-S08C4-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LeafsetExtension-PT-S08C4-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LeafsetExtension-PT-S08C4-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LeafsetExtension-PT-S08C4-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LeafsetExtension-PT-S08C4-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LeafsetExtension-PT-S08C4-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 1 out of 462 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 462/462 places, 409/409 transitions.
Graph (complete) has 849 edges and 462 vertex of which 31 are kept as prefixes of interest. Removing 431 places using SCC suffix rule.1 ms
Discarding 431 places :
Also discarding 293 output transitions
Drop transitions removed 293 transitions
Drop transitions removed 82 transitions
Reduce isomorphic transitions removed 82 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
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 90 rules applied. Total rules applied 91 place count 27 transition count 30
Reduce places removed 6 places and 0 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 1 with 10 rules applied. Total rules applied 101 place count 21 transition count 26
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 105 place count 17 transition count 26
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 105 place count 17 transition count 25
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 107 place count 16 transition count 25
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 110 place count 13 transition count 22
Iterating global reduction 3 with 3 rules applied. Total rules applied 113 place count 13 transition count 22
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 3 with 4 rules applied. Total rules applied 117 place count 13 transition count 18
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 121 place count 9 transition count 18
Applied a total of 121 rules in 89 ms. Remains 9 /462 variables (removed 453) and now considering 18/409 (removed 391) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 89 ms. Remains : 9/462 places, 18/409 transitions.
Successfully produced net in file /tmp/petri1000_10783870480506590749.dot
Successfully produced net in file /tmp/petri1001_11167884317016001167.dot
Successfully produced net in file /tmp/petri1002_15511007823379637945.dot
Successfully produced net in file /tmp/petri1003_6964574307158196495.dot
Successfully produced net in file /tmp/petri1004_14456166502858162696.dot
Successfully produced net in file /tmp/petri1005_12627708268556316466.dot
Drop transitions removed 6 transitions
Dominated transitions for bounds rules discarded 6 transitions
Normalized transition count is 9 out of 12 initially.
// Phase 1: matrix 9 rows 9 cols
[2023-03-22 04:17:46] [INFO ] Computed 3 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 81918 resets, run finished after 396 ms. (steps per millisecond=2525 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 1000001 steps, including 25126 resets, run finished after 275 ms. (steps per millisecond=3636 ) properties (out of 1) seen :4
[2023-03-22 04:17:47] [INFO ] Flow matrix only has 9 transitions (discarded 3 similar events)
// Phase 1: matrix 9 rows 9 cols
[2023-03-22 04:17:47] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-22 04:17:47] [INFO ] [Real]Absence check using 0 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-22 04:17:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 04:17:47] [INFO ] [Real]Absence check using state equation in 3 ms returned unsat
Current structural bounds on expressions (after SMT) : [4] Max seen :[4]
FORMULA LeafsetExtension-PT-S08C4-UpperBounds-05 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 2941 ms.
ITS solved all properties within timeout

BK_STOP 1679458668060

--------------------
content from stderr:

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML

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="LeafsetExtension-PT-S08C4"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="lolaxred"
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 lolaxred"
echo " Input is LeafsetExtension-PT-S08C4, 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 r231-tall-167856416100469"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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