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-167813599300637.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-07b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r010-oct2-167813599300637
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 780K
-rw-r--r-- 1 mcc users 6.6K Feb 25 12:56 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Feb 25 12:56 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 25 12:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Feb 25 12:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 15:34 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Feb 25 15:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 12:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 111K Feb 25 12:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 12:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 95K Feb 25 12:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:34 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:34 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 334K 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-07b-UpperBounds-00
FORMULA_NAME AutonomousCar-PT-07b-UpperBounds-01
FORMULA_NAME AutonomousCar-PT-07b-UpperBounds-02
FORMULA_NAME AutonomousCar-PT-07b-UpperBounds-03
FORMULA_NAME AutonomousCar-PT-07b-UpperBounds-04
FORMULA_NAME AutonomousCar-PT-07b-UpperBounds-05
FORMULA_NAME AutonomousCar-PT-07b-UpperBounds-06
FORMULA_NAME AutonomousCar-PT-07b-UpperBounds-07
FORMULA_NAME AutonomousCar-PT-07b-UpperBounds-08
FORMULA_NAME AutonomousCar-PT-07b-UpperBounds-09
FORMULA_NAME AutonomousCar-PT-07b-UpperBounds-10
FORMULA_NAME AutonomousCar-PT-07b-UpperBounds-11
FORMULA_NAME AutonomousCar-PT-07b-UpperBounds-12
FORMULA_NAME AutonomousCar-PT-07b-UpperBounds-13
FORMULA_NAME AutonomousCar-PT-07b-UpperBounds-14
FORMULA_NAME AutonomousCar-PT-07b-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678700439930

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-07b
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 09:40:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-13 09:40:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 09:40:42] [INFO ] Load time of PNML (sax parser for PT used): 118 ms
[2023-03-13 09:40:42] [INFO ] Transformed 323 places.
[2023-03-13 09:40:42] [INFO ] Transformed 846 transitions.
[2023-03-13 09:40:42] [INFO ] Found NUPN structural information;
[2023-03-13 09:40:42] [INFO ] Parsed PT model containing 323 places and 846 transitions and 5865 arcs in 237 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
// Phase 1: matrix 846 rows 323 cols
[2023-03-13 09:40:42] [INFO ] Computed 12 place invariants in 14 ms
Incomplete random walk after 10000 steps, including 20 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 16) seen :14
FORMULA AutonomousCar-PT-07b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-07b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-07b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-07b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-07b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-07b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-07b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-07b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-07b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-07b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-07b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-07b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-07b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-07b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 2) seen :0
[2023-03-13 09:40:42] [INFO ] Invariant cache hit.
[2023-03-13 09:40:42] [INFO ] [Real]Absence check using 12 positive place invariants in 18 ms returned sat
[2023-03-13 09:40:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 09:40:43] [INFO ] [Real]Absence check using state equation in 390 ms returned sat
[2023-03-13 09:40:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 09:40:43] [INFO ] [Nat]Absence check using 12 positive place invariants in 19 ms returned sat
[2023-03-13 09:40:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 09:40:44] [INFO ] [Nat]Absence check using state equation in 498 ms returned unsat
[2023-03-13 09:40:44] [INFO ] [Real]Absence check using 12 positive place invariants in 9 ms returned sat
[2023-03-13 09:40:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 09:40:44] [INFO ] [Real]Absence check using state equation in 242 ms returned sat
[2023-03-13 09:40:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 09:40:44] [INFO ] [Nat]Absence check using 12 positive place invariants in 8 ms returned sat
[2023-03-13 09:40:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 09:40:44] [INFO ] [Nat]Absence check using state equation in 229 ms returned sat
[2023-03-13 09:40:45] [INFO ] Deduced a trap composed of 7 places in 431 ms of which 40 ms to minimize.
[2023-03-13 09:40:45] [INFO ] Deduced a trap composed of 35 places in 391 ms of which 1 ms to minimize.
[2023-03-13 09:40:45] [INFO ] Deduced a trap composed of 35 places in 189 ms of which 0 ms to minimize.
[2023-03-13 09:40:46] [INFO ] Deduced a trap composed of 47 places in 112 ms of which 1 ms to minimize.
[2023-03-13 09:40:46] [INFO ] Deduced a trap composed of 49 places in 307 ms of which 15 ms to minimize.
[2023-03-13 09:40:46] [INFO ] Deduced a trap composed of 46 places in 461 ms of which 0 ms to minimize.
[2023-03-13 09:40:47] [INFO ] Deduced a trap composed of 45 places in 371 ms of which 1 ms to minimize.
[2023-03-13 09:40:47] [INFO ] Deduced a trap composed of 46 places in 149 ms of which 3 ms to minimize.
[2023-03-13 09:40:47] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2712 ms
[2023-03-13 09:40:47] [INFO ] Computed and/alt/rep : 263/303/263 causal constraints (skipped 582 transitions) in 133 ms.
[2023-03-13 09:40:49] [INFO ] Added : 179 causal constraints over 36 iterations in 1891 ms. Result :sat
Minimization took 82 ms.
Current structural bounds on expressions (after SMT) : [0, 1] Max seen :[0, 0]
FORMULA AutonomousCar-PT-07b-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 1 out of 323 places. Attempting structural reductions.
Drop transitions removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 323/323 places, 845/845 transitions.
Graph (trivial) has 308 edges and 323 vertex of which 4 / 323 are part of one of the 2 SCC in 4 ms
Free SCC test removed 2 places
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 1180 edges and 321 vertex of which 314 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.5 ms
Discarding 7 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 143 transitions
Trivial Post-agglo rules discarded 143 transitions
Performed 143 trivial Post agglomeration. Transition count delta: 143
Iterating post reduction 0 with 145 rules applied. Total rules applied 147 place count 314 transition count 691
Reduce places removed 143 places and 0 transitions.
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Drop transitions removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 1 with 187 rules applied. Total rules applied 334 place count 171 transition count 647
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 359 place count 146 transition count 647
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 359 place count 146 transition count 642
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 369 place count 141 transition count 642
Discarding 27 places :
Symmetric choice reduction at 3 with 27 rule applications. Total rules 396 place count 114 transition count 615
Iterating global reduction 3 with 27 rules applied. Total rules applied 423 place count 114 transition count 615
Ensure Unique test removed 196 transitions
Reduce isomorphic transitions removed 196 transitions.
Iterating post reduction 3 with 196 rules applied. Total rules applied 619 place count 114 transition count 419
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 619 place count 114 transition count 417
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 623 place count 112 transition count 417
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 630 place count 105 transition count 374
Iterating global reduction 4 with 7 rules applied. Total rules applied 637 place count 105 transition count 374
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 4 with 12 rules applied. Total rules applied 649 place count 105 transition count 362
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 655 place count 99 transition count 362
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 6 with 72 rules applied. Total rules applied 727 place count 63 transition count 326
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 734 place count 56 transition count 270
Iterating global reduction 6 with 7 rules applied. Total rules applied 741 place count 56 transition count 270
Free-agglomeration rule applied 8 times.
Iterating global reduction 6 with 8 rules applied. Total rules applied 749 place count 56 transition count 262
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 757 place count 48 transition count 262
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 758 place count 48 transition count 262
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 759 place count 47 transition count 261
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 760 place count 46 transition count 261
Applied a total of 760 rules in 136 ms. Remains 46 /323 variables (removed 277) and now considering 261/845 (removed 584) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 136 ms. Remains : 46/323 places, 261/845 transitions.
// Phase 1: matrix 261 rows 46 cols
[2023-03-13 09:40:49] [INFO ] Computed 11 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 6575 resets, run finished after 3062 ms. (steps per millisecond=326 ) properties (out of 1) seen :1
FORMULA AutonomousCar-PT-07b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 10599 ms.
ITS solved all properties within timeout

BK_STOP 1678700453018

--------------------
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-07b"
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-07b, 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-167813599300637"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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