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.r010-oct2-167813599200573.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is AutonomousCar-PT-03b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r010-oct2-167813599200573
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 488K
-rw-r--r-- 1 mcc users 7.2K Feb 25 12:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Feb 25 12:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 25 12:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Feb 25 12:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Feb 25 15:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 15:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.8K Feb 25 12:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 78K Feb 25 12:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K Feb 25 12:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K Feb 25 12:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:33 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:33 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 75K 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 AutonomousCar-PT-03b-UpperBounds-00
FORMULA_NAME AutonomousCar-PT-03b-UpperBounds-01
FORMULA_NAME AutonomousCar-PT-03b-UpperBounds-02
FORMULA_NAME AutonomousCar-PT-03b-UpperBounds-03
FORMULA_NAME AutonomousCar-PT-03b-UpperBounds-04
FORMULA_NAME AutonomousCar-PT-03b-UpperBounds-05
FORMULA_NAME AutonomousCar-PT-03b-UpperBounds-06
FORMULA_NAME AutonomousCar-PT-03b-UpperBounds-07
FORMULA_NAME AutonomousCar-PT-03b-UpperBounds-08
FORMULA_NAME AutonomousCar-PT-03b-UpperBounds-09
FORMULA_NAME AutonomousCar-PT-03b-UpperBounds-10
FORMULA_NAME AutonomousCar-PT-03b-UpperBounds-11
FORMULA_NAME AutonomousCar-PT-03b-UpperBounds-12
FORMULA_NAME AutonomousCar-PT-03b-UpperBounds-13
FORMULA_NAME AutonomousCar-PT-03b-UpperBounds-14
FORMULA_NAME AutonomousCar-PT-03b-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678699081289

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=marciexred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-03b
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 09:18:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-13 09:18:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 09:18:03] [INFO ] Load time of PNML (sax parser for PT used): 99 ms
[2023-03-13 09:18:03] [INFO ] Transformed 190 places.
[2023-03-13 09:18:03] [INFO ] Transformed 273 transitions.
[2023-03-13 09:18:03] [INFO ] Found NUPN structural information;
[2023-03-13 09:18:03] [INFO ] Parsed PT model containing 190 places and 273 transitions and 1051 arcs in 189 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
// Phase 1: matrix 273 rows 190 cols
[2023-03-13 09:18:03] [INFO ] Computed 8 place invariants in 14 ms
Incomplete random walk after 10000 steps, including 8 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 16) seen :12
FORMULA AutonomousCar-PT-03b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-03b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-03b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-03b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-03b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-03b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-03b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-03b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-03b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-03b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-03b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-03b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 20 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 4) seen :2
FORMULA AutonomousCar-PT-03b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA AutonomousCar-PT-03b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 6 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :0
[2023-03-13 09:18:03] [INFO ] Invariant cache hit.
[2023-03-13 09:18:04] [INFO ] [Real]Absence check using 8 positive place invariants in 11 ms returned sat
[2023-03-13 09:18:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 09:18:04] [INFO ] [Real]Absence check using state equation in 147 ms returned sat
[2023-03-13 09:18:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 09:18:04] [INFO ] [Nat]Absence check using 8 positive place invariants in 8 ms returned sat
[2023-03-13 09:18:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 09:18:04] [INFO ] [Nat]Absence check using state equation in 85 ms returned sat
[2023-03-13 09:18:04] [INFO ] Deduced a trap composed of 8 places in 118 ms of which 5 ms to minimize.
[2023-03-13 09:18:04] [INFO ] Deduced a trap composed of 12 places in 74 ms of which 1 ms to minimize.
[2023-03-13 09:18:04] [INFO ] Deduced a trap composed of 10 places in 74 ms of which 0 ms to minimize.
[2023-03-13 09:18:05] [INFO ] Deduced a trap composed of 35 places in 52 ms of which 0 ms to minimize.
[2023-03-13 09:18:05] [INFO ] Deduced a trap composed of 35 places in 62 ms of which 0 ms to minimize.
[2023-03-13 09:18:05] [INFO ] Deduced a trap composed of 38 places in 47 ms of which 0 ms to minimize.
[2023-03-13 09:18:05] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 515 ms
[2023-03-13 09:18:05] [INFO ] Computed and/alt/rep : 186/310/186 causal constraints (skipped 86 transitions) in 24 ms.
[2023-03-13 09:18:05] [INFO ] Deduced a trap composed of 16 places in 170 ms of which 2 ms to minimize.
[2023-03-13 09:18:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 221 ms
[2023-03-13 09:18:05] [INFO ] Added : 99 causal constraints over 20 iterations in 611 ms. Result :sat
Minimization took 64 ms.
[2023-03-13 09:18:05] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-13 09:18:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 09:18:06] [INFO ] [Real]Absence check using state equation in 67 ms returned sat
[2023-03-13 09:18:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 09:18:06] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-13 09:18:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 09:18:06] [INFO ] [Nat]Absence check using state equation in 91 ms returned sat
[2023-03-13 09:18:06] [INFO ] Deduced a trap composed of 35 places in 109 ms of which 1 ms to minimize.
[2023-03-13 09:18:06] [INFO ] Deduced a trap composed of 35 places in 92 ms of which 1 ms to minimize.
[2023-03-13 09:18:06] [INFO ] Deduced a trap composed of 38 places in 93 ms of which 1 ms to minimize.
[2023-03-13 09:18:06] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 369 ms
[2023-03-13 09:18:06] [INFO ] Computed and/alt/rep : 186/310/186 causal constraints (skipped 86 transitions) in 27 ms.
[2023-03-13 09:18:07] [INFO ] Deduced a trap composed of 16 places in 149 ms of which 0 ms to minimize.
[2023-03-13 09:18:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 205 ms
[2023-03-13 09:18:07] [INFO ] Added : 101 causal constraints over 21 iterations in 870 ms. Result :sat
Minimization took 74 ms.
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
Support contains 2 out of 190 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 190/190 places, 273/273 transitions.
Graph (trivial) has 177 edges and 190 vertex of which 4 / 190 are part of one of the 2 SCC in 3 ms
Free SCC test removed 2 places
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 436 edges and 188 vertex of which 183 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 83 transitions
Trivial Post-agglo rules discarded 83 transitions
Performed 83 trivial Post agglomeration. Transition count delta: 83
Iterating post reduction 0 with 84 rules applied. Total rules applied 86 place count 183 transition count 182
Reduce places removed 83 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 102 rules applied. Total rules applied 188 place count 100 transition count 163
Reduce places removed 10 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 11 rules applied. Total rules applied 199 place count 90 transition count 162
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 200 place count 89 transition count 162
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 200 place count 89 transition count 155
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 214 place count 82 transition count 155
Discarding 16 places :
Symmetric choice reduction at 4 with 16 rule applications. Total rules 230 place count 66 transition count 139
Iterating global reduction 4 with 16 rules applied. Total rules applied 246 place count 66 transition count 139
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 4 with 36 rules applied. Total rules applied 282 place count 66 transition count 103
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 282 place count 66 transition count 101
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 286 place count 64 transition count 101
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 290 place count 60 transition count 91
Iterating global reduction 5 with 4 rules applied. Total rules applied 294 place count 60 transition count 91
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 5 with 6 rules applied. Total rules applied 300 place count 60 transition count 85
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 303 place count 57 transition count 85
Performed 21 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 7 with 42 rules applied. Total rules applied 345 place count 36 transition count 63
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 348 place count 33 transition count 51
Iterating global reduction 7 with 3 rules applied. Total rules applied 351 place count 33 transition count 51
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 355 place count 31 transition count 69
Free-agglomeration rule applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 356 place count 31 transition count 68
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 357 place count 30 transition count 68
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 358 place count 29 transition count 67
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 359 place count 28 transition count 67
Applied a total of 359 rules in 78 ms. Remains 28 /190 variables (removed 162) and now considering 67/273 (removed 206) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 78 ms. Remains : 28/190 places, 67/273 transitions.
// Phase 1: matrix 67 rows 28 cols
[2023-03-13 09:18:07] [INFO ] Computed 6 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 61241 resets, run finished after 1331 ms. (steps per millisecond=751 ) properties (out of 2) seen :2
FORMULA AutonomousCar-PT-03b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-03b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 5561 ms.
ITS solved all properties within timeout

BK_STOP 1678699089349

--------------------
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="AutonomousCar-PT-03b"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="marciexred"
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 marciexred"
echo " Input is AutonomousCar-PT-03b, 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 r010-oct2-167813599200573"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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