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.r327-tall-167889200000773.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 ResAllocation-PT-R100C002, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r327-tall-167889200000773
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 820K
-rw-r--r-- 1 mcc users 8.8K Feb 25 15:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K Feb 25 15:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 25 15:34 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 25 15:34 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.0K Feb 25 16:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Feb 25 16:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.6K Feb 25 15:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 55K Feb 25 15:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Feb 25 15:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K Feb 25 15:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:45 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:45 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 9 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 422K 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 ResAllocation-PT-R100C002-UpperBounds-00
FORMULA_NAME ResAllocation-PT-R100C002-UpperBounds-01
FORMULA_NAME ResAllocation-PT-R100C002-UpperBounds-02
FORMULA_NAME ResAllocation-PT-R100C002-UpperBounds-03
FORMULA_NAME ResAllocation-PT-R100C002-UpperBounds-04
FORMULA_NAME ResAllocation-PT-R100C002-UpperBounds-05
FORMULA_NAME ResAllocation-PT-R100C002-UpperBounds-06
FORMULA_NAME ResAllocation-PT-R100C002-UpperBounds-07
FORMULA_NAME ResAllocation-PT-R100C002-UpperBounds-08
FORMULA_NAME ResAllocation-PT-R100C002-UpperBounds-09
FORMULA_NAME ResAllocation-PT-R100C002-UpperBounds-10
FORMULA_NAME ResAllocation-PT-R100C002-UpperBounds-11
FORMULA_NAME ResAllocation-PT-R100C002-UpperBounds-12
FORMULA_NAME ResAllocation-PT-R100C002-UpperBounds-13
FORMULA_NAME ResAllocation-PT-R100C002-UpperBounds-14
FORMULA_NAME ResAllocation-PT-R100C002-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1679057284826

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=ResAllocation-PT-R100C002
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-17 12:48:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-17 12:48:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-17 12:48:06] [INFO ] Load time of PNML (sax parser for PT used): 83 ms
[2023-03-17 12:48:06] [INFO ] Transformed 400 places.
[2023-03-17 12:48:06] [INFO ] Transformed 202 transitions.
[2023-03-17 12:48:06] [INFO ] Parsed PT model containing 400 places and 202 transitions and 1000 arcs in 148 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 4 ms.
// Phase 1: matrix 202 rows 400 cols
[2023-03-17 12:48:06] [INFO ] Computed 200 place invariants in 19 ms
FORMULA ResAllocation-PT-R100C002-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R100C002-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R100C002-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R100C002-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R100C002-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R100C002-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R100C002-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 3 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 9) seen :2
FORMULA ResAllocation-PT-R100C002-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ResAllocation-PT-R100C002-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 7) 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 7) 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 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 7) seen :0
[2023-03-17 12:48:07] [INFO ] Invariant cache hit.
[2023-03-17 12:48:07] [INFO ] [Real]Absence check using 200 positive place invariants in 29 ms returned sat
[2023-03-17 12:48:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 12:48:07] [INFO ] [Real]Absence check using state equation in 122 ms returned sat
[2023-03-17 12:48:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 12:48:07] [INFO ] [Nat]Absence check using 200 positive place invariants in 30 ms returned sat
[2023-03-17 12:48:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 12:48:07] [INFO ] [Nat]Absence check using state equation in 121 ms returned sat
[2023-03-17 12:48:07] [INFO ] Computed and/alt/rep : 200/200/200 causal constraints (skipped 0 transitions) in 14 ms.
[2023-03-17 12:48:08] [INFO ] Added : 189 causal constraints over 38 iterations in 788 ms. Result :sat
Minimization took 151 ms.
[2023-03-17 12:48:08] [INFO ] [Real]Absence check using 200 positive place invariants in 37 ms returned sat
[2023-03-17 12:48:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 12:48:08] [INFO ] [Real]Absence check using state equation in 87 ms returned sat
[2023-03-17 12:48:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 12:48:09] [INFO ] [Nat]Absence check using 200 positive place invariants in 25 ms returned sat
[2023-03-17 12:48:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 12:48:09] [INFO ] [Nat]Absence check using state equation in 99 ms returned sat
[2023-03-17 12:48:09] [INFO ] Computed and/alt/rep : 200/200/200 causal constraints (skipped 0 transitions) in 12 ms.
[2023-03-17 12:48:09] [INFO ] Added : 98 causal constraints over 20 iterations in 334 ms. Result :sat
Minimization took 30 ms.
[2023-03-17 12:48:09] [INFO ] [Real]Absence check using 200 positive place invariants in 25 ms returned sat
[2023-03-17 12:48:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 12:48:09] [INFO ] [Real]Absence check using state equation in 100 ms returned sat
[2023-03-17 12:48:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 12:48:09] [INFO ] [Nat]Absence check using 200 positive place invariants in 25 ms returned sat
[2023-03-17 12:48:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 12:48:09] [INFO ] [Nat]Absence check using state equation in 100 ms returned sat
[2023-03-17 12:48:09] [INFO ] Computed and/alt/rep : 200/200/200 causal constraints (skipped 0 transitions) in 16 ms.
[2023-03-17 12:48:10] [INFO ] Added : 171 causal constraints over 35 iterations in 580 ms. Result :sat
Minimization took 38 ms.
[2023-03-17 12:48:10] [INFO ] [Real]Absence check using 200 positive place invariants in 35 ms returned sat
[2023-03-17 12:48:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 12:48:10] [INFO ] [Real]Absence check using state equation in 102 ms returned sat
[2023-03-17 12:48:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 12:48:10] [INFO ] [Nat]Absence check using 200 positive place invariants in 23 ms returned sat
[2023-03-17 12:48:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 12:48:10] [INFO ] [Nat]Absence check using state equation in 109 ms returned sat
[2023-03-17 12:48:10] [INFO ] Computed and/alt/rep : 200/200/200 causal constraints (skipped 0 transitions) in 12 ms.
[2023-03-17 12:48:11] [INFO ] Added : 186 causal constraints over 38 iterations in 703 ms. Result :sat
Minimization took 41 ms.
[2023-03-17 12:48:11] [INFO ] [Real]Absence check using 200 positive place invariants in 25 ms returned sat
[2023-03-17 12:48:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 12:48:11] [INFO ] [Real]Absence check using state equation in 101 ms returned sat
[2023-03-17 12:48:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 12:48:12] [INFO ] [Nat]Absence check using 200 positive place invariants in 26 ms returned sat
[2023-03-17 12:48:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 12:48:12] [INFO ] [Nat]Absence check using state equation in 102 ms returned sat
[2023-03-17 12:48:12] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 6 ms to minimize.
[2023-03-17 12:48:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 80 ms
[2023-03-17 12:48:12] [INFO ] Computed and/alt/rep : 200/200/200 causal constraints (skipped 0 transitions) in 13 ms.
[2023-03-17 12:48:12] [INFO ] Added : 172 causal constraints over 35 iterations in 610 ms. Result :sat
Minimization took 40 ms.
[2023-03-17 12:48:12] [INFO ] [Real]Absence check using 200 positive place invariants in 25 ms returned sat
[2023-03-17 12:48:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 12:48:13] [INFO ] [Real]Absence check using state equation in 89 ms returned sat
[2023-03-17 12:48:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 12:48:13] [INFO ] [Nat]Absence check using 200 positive place invariants in 23 ms returned sat
[2023-03-17 12:48:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 12:48:13] [INFO ] [Nat]Absence check using state equation in 87 ms returned sat
[2023-03-17 12:48:13] [INFO ] Computed and/alt/rep : 200/200/200 causal constraints (skipped 0 transitions) in 10 ms.
[2023-03-17 12:48:13] [INFO ] Added : 98 causal constraints over 20 iterations in 303 ms. Result :sat
Minimization took 31 ms.
[2023-03-17 12:48:13] [INFO ] [Real]Absence check using 200 positive place invariants in 24 ms returned sat
[2023-03-17 12:48:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 12:48:13] [INFO ] [Real]Absence check using state equation in 89 ms returned sat
[2023-03-17 12:48:13] [INFO ] Computed and/alt/rep : 200/200/200 causal constraints (skipped 0 transitions) in 12 ms.
[2023-03-17 12:48:14] [INFO ] Added : 98 causal constraints over 20 iterations in 397 ms. Result :sat
Minimization took 45 ms.
[2023-03-17 12:48:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 12:48:14] [INFO ] [Nat]Absence check using 200 positive place invariants in 25 ms returned sat
[2023-03-17 12:48:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 12:48:14] [INFO ] [Nat]Absence check using state equation in 85 ms returned sat
[2023-03-17 12:48:14] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2023-03-17 12:48:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 49 ms
[2023-03-17 12:48:14] [INFO ] Computed and/alt/rep : 200/200/200 causal constraints (skipped 0 transitions) in 12 ms.
[2023-03-17 12:48:14] [INFO ] Added : 98 causal constraints over 20 iterations in 304 ms. Result :sat
Minimization took 39 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0]
FORMULA ResAllocation-PT-R100C002-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ResAllocation-PT-R100C002-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ResAllocation-PT-R100C002-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ResAllocation-PT-R100C002-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ResAllocation-PT-R100C002-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ResAllocation-PT-R100C002-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ResAllocation-PT-R100C002-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.
Total runtime 9067 ms.
ITS solved all properties within timeout

BK_STOP 1679057296190

--------------------
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="ResAllocation-PT-R100C002"
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 ResAllocation-PT-R100C002, 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 r327-tall-167889200000773"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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