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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 7.2K Feb 25 12:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Feb 25 12:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Feb 25 12:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 25 12:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:34 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K 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 19K Feb 25 15:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.9K Feb 25 12:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 104K Feb 25 12:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Feb 25 12:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 49K 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 865K 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 booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME AutonomousCar-PT-09b-ReachabilityFireability-00
FORMULA_NAME AutonomousCar-PT-09b-ReachabilityFireability-01
FORMULA_NAME AutonomousCar-PT-09b-ReachabilityFireability-02
FORMULA_NAME AutonomousCar-PT-09b-ReachabilityFireability-03
FORMULA_NAME AutonomousCar-PT-09b-ReachabilityFireability-04
FORMULA_NAME AutonomousCar-PT-09b-ReachabilityFireability-05
FORMULA_NAME AutonomousCar-PT-09b-ReachabilityFireability-06
FORMULA_NAME AutonomousCar-PT-09b-ReachabilityFireability-07
FORMULA_NAME AutonomousCar-PT-09b-ReachabilityFireability-08
FORMULA_NAME AutonomousCar-PT-09b-ReachabilityFireability-09
FORMULA_NAME AutonomousCar-PT-09b-ReachabilityFireability-10
FORMULA_NAME AutonomousCar-PT-09b-ReachabilityFireability-11
FORMULA_NAME AutonomousCar-PT-09b-ReachabilityFireability-12
FORMULA_NAME AutonomousCar-PT-09b-ReachabilityFireability-13
FORMULA_NAME AutonomousCar-PT-09b-ReachabilityFireability-14
FORMULA_NAME AutonomousCar-PT-09b-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678703937313

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=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-09b
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 10:39:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-13 10:39:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 10:39:00] [INFO ] Load time of PNML (sax parser for PT used): 177 ms
[2023-03-13 10:39:00] [INFO ] Transformed 391 places.
[2023-03-13 10:39:00] [INFO ] Transformed 1554 transitions.
[2023-03-13 10:39:00] [INFO ] Found NUPN structural information;
[2023-03-13 10:39:00] [INFO ] Parsed PT model containing 391 places and 1554 transitions and 16243 arcs in 305 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 84 resets, run finished after 610 ms. (steps per millisecond=16 ) properties (out of 16) seen :5
FORMULA AutonomousCar-PT-09b-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-09b-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-09b-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-09b-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-09b-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 11) seen :1
FORMULA AutonomousCar-PT-09b-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 10) seen :1
FORMULA AutonomousCar-PT-09b-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 9) seen :1
FORMULA AutonomousCar-PT-09b-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 1554 rows 391 cols
[2023-03-13 10:39:02] [INFO ] Computed 14 place invariants in 93 ms
[2023-03-13 10:39:03] [INFO ] After 635ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-13 10:39:03] [INFO ] [Nat]Absence check using 14 positive place invariants in 11 ms returned sat
[2023-03-13 10:39:04] [INFO ] After 963ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :6
[2023-03-13 10:39:05] [INFO ] Deduced a trap composed of 15 places in 1098 ms of which 49 ms to minimize.
[2023-03-13 10:39:07] [INFO ] Deduced a trap composed of 16 places in 1085 ms of which 9 ms to minimize.
[2023-03-13 10:39:07] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 2366 ms
[2023-03-13 10:39:07] [INFO ] Deduced a trap composed of 18 places in 565 ms of which 1 ms to minimize.
[2023-03-13 10:39:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 677 ms
[2023-03-13 10:39:08] [INFO ] After 4591ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :6
Attempting to minimize the solution found.
Minimization took 513 ms.
[2023-03-13 10:39:08] [INFO ] After 5370ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :6
FORMULA AutonomousCar-PT-09b-ReachabilityFireability-08 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA AutonomousCar-PT-09b-ReachabilityFireability-01 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 8 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 195 ms.
Support contains 65 out of 391 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 391/391 places, 1554/1554 transitions.
Graph (trivial) has 257 edges and 391 vertex of which 4 / 391 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 1699 edges and 389 vertex of which 382 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.12 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 127 transitions
Trivial Post-agglo rules discarded 127 transitions
Performed 127 trivial Post agglomeration. Transition count delta: 127
Iterating post reduction 0 with 129 rules applied. Total rules applied 131 place count 382 transition count 1416
Reduce places removed 127 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 1 with 163 rules applied. Total rules applied 294 place count 255 transition count 1380
Reduce places removed 19 places and 0 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 2 with 28 rules applied. Total rules applied 322 place count 236 transition count 1371
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 3 with 13 rules applied. Total rules applied 335 place count 227 transition count 1367
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 337 place count 225 transition count 1367
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 26 Pre rules applied. Total rules applied 337 place count 225 transition count 1341
Deduced a syphon composed of 26 places in 3 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 5 with 52 rules applied. Total rules applied 389 place count 199 transition count 1341
Discarding 34 places :
Symmetric choice reduction at 5 with 34 rule applications. Total rules 423 place count 165 transition count 1307
Iterating global reduction 5 with 34 rules applied. Total rules applied 457 place count 165 transition count 1307
Ensure Unique test removed 326 transitions
Reduce isomorphic transitions removed 326 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 327 rules applied. Total rules applied 784 place count 165 transition count 980
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 785 place count 164 transition count 980
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 788 place count 161 transition count 961
Iterating global reduction 7 with 3 rules applied. Total rules applied 791 place count 161 transition count 961
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 792 place count 161 transition count 960
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 8 with 48 rules applied. Total rules applied 840 place count 137 transition count 936
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 842 place count 137 transition count 934
Free-agglomeration rule applied 21 times.
Iterating global reduction 8 with 21 rules applied. Total rules applied 863 place count 137 transition count 913
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 8 with 21 rules applied. Total rules applied 884 place count 116 transition count 913
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 885 place count 116 transition count 912
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 886 place count 116 transition count 912
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 887 place count 115 transition count 911
Applied a total of 887 rules in 641 ms. Remains 115 /391 variables (removed 276) and now considering 911/1554 (removed 643) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 643 ms. Remains : 115/391 places, 911/1554 transitions.
Incomplete random walk after 10000 steps, including 253 resets, run finished after 281 ms. (steps per millisecond=35 ) properties (out of 6) seen :2
FORMULA AutonomousCar-PT-09b-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-09b-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 4) seen :1
FORMULA AutonomousCar-PT-09b-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 3) seen :1
FORMULA AutonomousCar-PT-09b-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 2) seen :1
FORMULA AutonomousCar-PT-09b-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 1 properties.
// Phase 1: matrix 911 rows 115 cols
[2023-03-13 10:39:10] [INFO ] Computed 14 place invariants in 10 ms
[2023-03-13 10:39:10] [INFO ] After 54ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 10:39:10] [INFO ] [Nat]Absence check using 14 positive place invariants in 2 ms returned sat
[2023-03-13 10:39:11] [INFO ] After 1012ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-13 10:39:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 10:39:11] [INFO ] After 397ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-13 10:39:11] [INFO ] After 799ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 300 ms.
[2023-03-13 10:39:12] [INFO ] After 2166ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 34 out of 115 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 115/115 places, 911/911 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 115 transition count 906
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 110 transition count 906
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 10 place count 110 transition count 904
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 14 place count 108 transition count 904
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 15 place count 107 transition count 903
Iterating global reduction 2 with 1 rules applied. Total rules applied 16 place count 107 transition count 903
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 22 place count 104 transition count 900
Free-agglomeration rule applied 17 times.
Iterating global reduction 2 with 17 rules applied. Total rules applied 39 place count 104 transition count 883
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 2 with 44 rules applied. Total rules applied 83 place count 87 transition count 856
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 3 with 8 rules applied. Total rules applied 91 place count 87 transition count 856
Applied a total of 91 rules in 206 ms. Remains 87 /115 variables (removed 28) and now considering 856/911 (removed 55) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 206 ms. Remains : 87/115 places, 856/911 transitions.
Incomplete random walk after 10000 steps, including 246 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 1) seen :0
Finished Best-First random walk after 1145 steps, including 2 resets, run visited all 1 properties in 4 ms. (steps per millisecond=286 )
FORMULA AutonomousCar-PT-09b-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
All properties solved without resorting to model-checking.
Total runtime 12453 ms.
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=ReachabilityFireability.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: AutonomousCar_PT_09b
(NrP: 391 NrTr: 1554 NrArc: 16243)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.176sec

net check time: 0m 0.001sec

init dd package: 0m 2.897sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 9274032 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16099428 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
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 ReachabilityFireability -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.007sec

1628865 1631943 1632044 1632410 1651860 1652577 1646460 1646831 1645842 1656706 1659799 1672043 1669965 1661497 1662613 1670444 1670305 1662911 1664423 1664100 1665986 1672735 1692752 1692855

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-09b"
export BK_EXAMINATION="ReachabilityFireability"
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-09b, examination is ReachabilityFireability"
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-167813599400671"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/AutonomousCar-PT-09b.tgz
mv AutonomousCar-PT-09b execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;