Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r039-tajo-167813692900677.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is CANConstruction-PT-080, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r039-tajo-167813692900677
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 10M
-rw-r--r-- 1 mcc users 11K Feb 25 22:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K Feb 25 22:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Feb 25 21:53 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 25 21:53 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.3K Feb 25 15:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Feb 25 15:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Feb 25 22:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 134K Feb 25 22:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Feb 25 22:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 90K Feb 25 22:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 15:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Feb 25 15:40 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 9.5M 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 CANConstruction-PT-080-UpperBounds-00
FORMULA_NAME CANConstruction-PT-080-UpperBounds-01
FORMULA_NAME CANConstruction-PT-080-UpperBounds-02
FORMULA_NAME CANConstruction-PT-080-UpperBounds-03
FORMULA_NAME CANConstruction-PT-080-UpperBounds-04
FORMULA_NAME CANConstruction-PT-080-UpperBounds-05
FORMULA_NAME CANConstruction-PT-080-UpperBounds-06
FORMULA_NAME CANConstruction-PT-080-UpperBounds-07
FORMULA_NAME CANConstruction-PT-080-UpperBounds-08
FORMULA_NAME CANConstruction-PT-080-UpperBounds-09
FORMULA_NAME CANConstruction-PT-080-UpperBounds-10
FORMULA_NAME CANConstruction-PT-080-UpperBounds-11
FORMULA_NAME CANConstruction-PT-080-UpperBounds-12
FORMULA_NAME CANConstruction-PT-080-UpperBounds-13
FORMULA_NAME CANConstruction-PT-080-UpperBounds-14
FORMULA_NAME CANConstruction-PT-080-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678504909174

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=CANConstruction-PT-080
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-11 03:21:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-11 03:21:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 03:21:51] [INFO ] Load time of PNML (sax parser for PT used): 441 ms
[2023-03-11 03:21:51] [INFO ] Transformed 13762 places.
[2023-03-11 03:21:51] [INFO ] Transformed 26240 transitions.
[2023-03-11 03:21:51] [INFO ] Parsed PT model containing 13762 places and 26240 transitions and 78400 arcs in 577 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
// Phase 1: matrix 26240 rows 13762 cols
[2023-03-11 03:21:52] [INFO ] Computed 161 place invariants in 302 ms
FORMULA CANConstruction-PT-080-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 7 resets, run finished after 294 ms. (steps per millisecond=34 ) properties (out of 15) seen :5
FORMULA CANConstruction-PT-080-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-080-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-080-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-080-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-080-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 10) seen :0
[2023-03-11 03:21:52] [INFO ] Invariant cache hit.
[2023-03-11 03:21:54] [INFO ] [Real]Absence check using 81 positive place invariants in 536 ms returned sat
[2023-03-11 03:21:54] [INFO ] [Real]Absence check using 81 positive and 80 generalized place invariants in 100 ms returned sat
[2023-03-11 03:21:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 03:21:57] [INFO ] [Real]Absence check using state equation in 2923 ms returned unknown
[2023-03-11 03:21:59] [INFO ] [Real]Absence check using 81 positive place invariants in 419 ms returned sat
[2023-03-11 03:21:59] [INFO ] [Real]Absence check using 81 positive and 80 generalized place invariants in 65 ms returned sat
[2023-03-11 03:21:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 03:22:02] [INFO ] [Real]Absence check using state equation in 3322 ms returned unknown
[2023-03-11 03:22:04] [INFO ] [Real]Absence check using 81 positive place invariants in 500 ms returned sat
[2023-03-11 03:22:04] [INFO ] [Real]Absence check using 81 positive and 80 generalized place invariants in 85 ms returned sat
[2023-03-11 03:22:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 03:22:07] [INFO ] [Real]Absence check using state equation in 3276 ms returned unknown
[2023-03-11 03:22:09] [INFO ] [Real]Absence check using 81 positive place invariants in 512 ms returned sat
[2023-03-11 03:22:09] [INFO ] [Real]Absence check using 81 positive and 80 generalized place invariants in 70 ms returned sat
[2023-03-11 03:22:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 03:22:12] [INFO ] [Real]Absence check using state equation in 2867 ms returned unknown
[2023-03-11 03:22:14] [INFO ] [Real]Absence check using 81 positive place invariants in 388 ms returned sat
[2023-03-11 03:22:14] [INFO ] [Real]Absence check using 81 positive and 80 generalized place invariants in 106 ms returned sat
[2023-03-11 03:22:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 03:22:17] [INFO ] [Real]Absence check using state equation in 3297 ms returned unknown
[2023-03-11 03:22:19] [INFO ] [Real]Absence check using 81 positive place invariants in 350 ms returned sat
[2023-03-11 03:22:19] [INFO ] [Real]Absence check using 81 positive and 80 generalized place invariants in 65 ms returned sat
[2023-03-11 03:22:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 03:22:22] [INFO ] [Real]Absence check using state equation in 3183 ms returned unknown
[2023-03-11 03:22:24] [INFO ] [Real]Absence check using 81 positive place invariants in 348 ms returned sat
[2023-03-11 03:22:24] [INFO ] [Real]Absence check using 81 positive and 80 generalized place invariants in 60 ms returned sat
[2023-03-11 03:22:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 03:22:27] [INFO ] [Real]Absence check using state equation in 3125 ms returned unknown
[2023-03-11 03:22:29] [INFO ] [Real]Absence check using 81 positive place invariants in 472 ms returned sat
[2023-03-11 03:22:30] [INFO ] [Real]Absence check using 81 positive and 80 generalized place invariants in 69 ms returned sat
[2023-03-11 03:22:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 03:22:32] [INFO ] [Real]Absence check using state equation in 2898 ms returned unknown
[2023-03-11 03:22:34] [INFO ] [Real]Absence check using 81 positive place invariants in 382 ms returned sat
[2023-03-11 03:22:34] [INFO ] [Real]Absence check using 81 positive and 80 generalized place invariants in 68 ms returned sat
[2023-03-11 03:22:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 03:22:37] [INFO ] [Real]Absence check using state equation in 3064 ms returned unknown
[2023-03-11 03:22:39] [INFO ] [Real]Absence check using 81 positive place invariants in 369 ms returned sat
[2023-03-11 03:22:39] [INFO ] [Real]Absence check using 81 positive and 80 generalized place invariants in 72 ms returned sat
[2023-03-11 03:22:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 03:22:42] [INFO ] [Real]Absence check using state equation in 3205 ms returned unknown
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Support contains 10 out of 13762 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 13762/13762 places, 26240/26240 transitions.
Drop transitions removed 560 transitions
Trivial Post-agglo rules discarded 560 transitions
Performed 560 trivial Post agglomeration. Transition count delta: 560
Iterating post reduction 0 with 560 rules applied. Total rules applied 560 place count 13762 transition count 25680
Reduce places removed 560 places and 0 transitions.
Iterating post reduction 1 with 560 rules applied. Total rules applied 1120 place count 13202 transition count 25680
Discarding 6235 places :
Symmetric choice reduction at 2 with 6235 rule applications. Total rules 7355 place count 6967 transition count 13210
Iterating global reduction 2 with 6235 rules applied. Total rules applied 13590 place count 6967 transition count 13210
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 6 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 13750 place count 6887 transition count 13130
Free-agglomeration rule applied 150 times.
Iterating global reduction 2 with 150 rules applied. Total rules applied 13900 place count 6887 transition count 12980
Reduce places removed 150 places and 0 transitions.
Iterating post reduction 2 with 150 rules applied. Total rules applied 14050 place count 6737 transition count 12980
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 3 with 10 rules applied. Total rules applied 14060 place count 6737 transition count 12980
Applied a total of 14060 rules in 9716 ms. Remains 6737 /13762 variables (removed 7025) and now considering 12980/26240 (removed 13260) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9718 ms. Remains : 6737/13762 places, 12980/26240 transitions.
// Phase 1: matrix 12980 rows 6737 cols
[2023-03-11 03:22:52] [INFO ] Computed 161 place invariants in 146 ms
Incomplete random walk after 1000000 steps, including 1802 resets, run finished after 20533 ms. (steps per millisecond=48 ) properties (out of 10) seen :10
FORMULA CANConstruction-PT-080-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-080-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-080-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-080-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-080-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-080-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-080-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-080-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-080-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-080-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 82546 ms.
ITS solved all properties within timeout

BK_STOP 1678504993675

--------------------
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="CANConstruction-PT-080"
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 CANConstruction-PT-080, 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 r039-tajo-167813692900677"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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