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.r170-tall-167838857600663.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 marciexred
Input is FunctionPointer-PT-b002, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r170-tall-167838857600663
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 848K
-rw-r--r-- 1 mcc users 7.5K Feb 25 11:56 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Feb 25 11:56 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 25 11:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 25 11:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 16:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 16:08 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:08 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:08 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 11:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 111K Feb 25 11:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 11:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 94K Feb 25 11:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:08 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:08 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 391K 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 FunctionPointer-PT-b002-ReachabilityFireability-00
FORMULA_NAME FunctionPointer-PT-b002-ReachabilityFireability-01
FORMULA_NAME FunctionPointer-PT-b002-ReachabilityFireability-02
FORMULA_NAME FunctionPointer-PT-b002-ReachabilityFireability-03
FORMULA_NAME FunctionPointer-PT-b002-ReachabilityFireability-04
FORMULA_NAME FunctionPointer-PT-b002-ReachabilityFireability-05
FORMULA_NAME FunctionPointer-PT-b002-ReachabilityFireability-06
FORMULA_NAME FunctionPointer-PT-b002-ReachabilityFireability-07
FORMULA_NAME FunctionPointer-PT-b002-ReachabilityFireability-08
FORMULA_NAME FunctionPointer-PT-b002-ReachabilityFireability-09
FORMULA_NAME FunctionPointer-PT-b002-ReachabilityFireability-10
FORMULA_NAME FunctionPointer-PT-b002-ReachabilityFireability-11
FORMULA_NAME FunctionPointer-PT-b002-ReachabilityFireability-12
FORMULA_NAME FunctionPointer-PT-b002-ReachabilityFireability-13
FORMULA_NAME FunctionPointer-PT-b002-ReachabilityFireability-14
FORMULA_NAME FunctionPointer-PT-b002-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678598142614

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=FunctionPointer-PT-b002
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-12 05:15:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-12 05:15:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 05:15:44] [INFO ] Load time of PNML (sax parser for PT used): 87 ms
[2023-03-12 05:15:44] [INFO ] Transformed 306 places.
[2023-03-12 05:15:44] [INFO ] Transformed 840 transitions.
[2023-03-12 05:15:44] [INFO ] Parsed PT model containing 306 places and 840 transitions and 3392 arcs in 154 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 84 places in 5 ms
Reduce places removed 84 places and 192 transitions.
FORMULA FunctionPointer-PT-b002-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b002-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b002-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b002-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 20 resets, run finished after 320 ms. (steps per millisecond=31 ) properties (out of 12) seen :9
FORMULA FunctionPointer-PT-b002-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-b002-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-b002-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-b002-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-b002-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-b002-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-b002-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-b002-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-b002-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-12 05:15:45] [INFO ] Flow matrix only has 414 transitions (discarded 234 similar events)
// Phase 1: matrix 414 rows 222 cols
[2023-03-12 05:15:45] [INFO ] Computed 4 place invariants in 19 ms
[2023-03-12 05:15:45] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-12 05:15:45] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-12 05:15:45] [INFO ] After 217ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:2
[2023-03-12 05:15:45] [INFO ] [Nat]Absence check using 3 positive place invariants in 8 ms returned sat
[2023-03-12 05:15:45] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-12 05:15:45] [INFO ] After 163ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :1
[2023-03-12 05:15:45] [INFO ] State equation strengthened by 65 read => feed constraints.
[2023-03-12 05:15:45] [INFO ] After 87ms SMT Verify possible using 65 Read/Feed constraints in natural domain returned unsat :2 sat :1
[2023-03-12 05:15:45] [INFO ] After 191ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :1
Attempting to minimize the solution found.
Minimization took 78 ms.
[2023-03-12 05:15:45] [INFO ] After 516ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :1
FORMULA FunctionPointer-PT-b002-ReachabilityFireability-11 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA FunctionPointer-PT-b002-ReachabilityFireability-00 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 18 ms.
Support contains 28 out of 222 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 222/222 places, 648/648 transitions.
Graph (complete) has 932 edges and 222 vertex of which 212 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.3 ms
Discarding 10 places :
Also discarding 0 output transitions
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 22 place count 191 transition count 584
Iterating global reduction 0 with 21 rules applied. Total rules applied 43 place count 191 transition count 584
Ensure Unique test removed 76 transitions
Reduce isomorphic transitions removed 76 transitions.
Iterating post reduction 0 with 76 rules applied. Total rules applied 119 place count 191 transition count 508
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 128 place count 182 transition count 490
Iterating global reduction 1 with 9 rules applied. Total rules applied 137 place count 182 transition count 490
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 165 place count 182 transition count 462
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 171 place count 176 transition count 450
Iterating global reduction 2 with 6 rules applied. Total rules applied 177 place count 176 transition count 450
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 182 place count 171 transition count 430
Iterating global reduction 2 with 5 rules applied. Total rules applied 187 place count 171 transition count 430
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 192 place count 166 transition count 420
Iterating global reduction 2 with 5 rules applied. Total rules applied 197 place count 166 transition count 420
Drop transitions removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 2 with 16 rules applied. Total rules applied 213 place count 166 transition count 404
Applied a total of 213 rules in 115 ms. Remains 166 /222 variables (removed 56) and now considering 404/648 (removed 244) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 115 ms. Remains : 166/222 places, 404/648 transitions.
Incomplete random walk after 10001 steps, including 30 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1273349 steps, run timeout after 3001 ms. (steps per millisecond=424 ) properties seen :{}
Probabilistic random walk after 1273349 steps, saw 837121 distinct states, run finished after 3002 ms. (steps per millisecond=424 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 05:15:49] [INFO ] Flow matrix only has 275 transitions (discarded 129 similar events)
// Phase 1: matrix 275 rows 166 cols
[2023-03-12 05:15:49] [INFO ] Computed 2 place invariants in 10 ms
[2023-03-12 05:15:49] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-12 05:15:49] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-12 05:15:49] [INFO ] After 91ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 05:15:49] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-12 05:15:49] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-12 05:15:49] [INFO ] After 101ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 05:15:49] [INFO ] State equation strengthened by 59 read => feed constraints.
[2023-03-12 05:15:49] [INFO ] After 54ms SMT Verify possible using 59 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 05:15:49] [INFO ] After 126ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 64 ms.
[2023-03-12 05:15:49] [INFO ] After 391ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 28 out of 166 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 166/166 places, 404/404 transitions.
Applied a total of 0 rules in 12 ms. Remains 166 /166 variables (removed 0) and now considering 404/404 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 166/166 places, 404/404 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 166/166 places, 404/404 transitions.
Applied a total of 0 rules in 26 ms. Remains 166 /166 variables (removed 0) and now considering 404/404 (removed 0) transitions.
[2023-03-12 05:15:49] [INFO ] Flow matrix only has 275 transitions (discarded 129 similar events)
[2023-03-12 05:15:49] [INFO ] Invariant cache hit.
[2023-03-12 05:15:49] [INFO ] Implicit Places using invariants in 210 ms returned []
[2023-03-12 05:15:49] [INFO ] Flow matrix only has 275 transitions (discarded 129 similar events)
[2023-03-12 05:15:49] [INFO ] Invariant cache hit.
[2023-03-12 05:15:50] [INFO ] State equation strengthened by 59 read => feed constraints.
[2023-03-12 05:15:50] [INFO ] Implicit Places using invariants and state equation in 491 ms returned []
Implicit Place search using SMT with State Equation took 703 ms to find 0 implicit places.
[2023-03-12 05:15:50] [INFO ] Redundant transitions in 23 ms returned []
[2023-03-12 05:15:50] [INFO ] Flow matrix only has 275 transitions (discarded 129 similar events)
[2023-03-12 05:15:50] [INFO ] Invariant cache hit.
[2023-03-12 05:15:50] [INFO ] Dead Transitions using invariants and state equation in 192 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 953 ms. Remains : 166/166 places, 404/404 transitions.
Graph (trivial) has 198 edges and 166 vertex of which 21 / 166 are part of one of the 7 SCC in 6 ms
Free SCC test removed 14 places
Drop transitions removed 35 transitions
Ensure Unique test removed 115 transitions
Reduce isomorphic transitions removed 150 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 8 place count 152 transition count 247
Reduce places removed 7 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 11 rules applied. Total rules applied 19 place count 145 transition count 243
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 23 place count 141 transition count 243
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 27 Pre rules applied. Total rules applied 23 place count 141 transition count 216
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 54 rules applied. Total rules applied 77 place count 114 transition count 216
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 83 place count 108 transition count 210
Iterating global reduction 3 with 6 rules applied. Total rules applied 89 place count 108 transition count 210
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 101 place count 108 transition count 198
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 4 with 38 rules applied. Total rules applied 139 place count 89 transition count 179
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 145 place count 83 transition count 167
Iterating global reduction 4 with 6 rules applied. Total rules applied 151 place count 83 transition count 167
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 155 place count 79 transition count 159
Iterating global reduction 4 with 4 rules applied. Total rules applied 159 place count 79 transition count 159
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 163 place count 75 transition count 151
Iterating global reduction 4 with 4 rules applied. Total rules applied 167 place count 75 transition count 151
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 171 place count 75 transition count 147
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 179 place count 71 transition count 147
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 5 with 7 rules applied. Total rules applied 186 place count 71 transition count 140
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 187 place count 71 transition count 140
Applied a total of 187 rules in 59 ms. Remains 71 /166 variables (removed 95) and now considering 140/404 (removed 264) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 140 rows 71 cols
[2023-03-12 05:15:50] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-12 05:15:50] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-12 05:15:50] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-12 05:15:50] [INFO ] After 47ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 05:15:50] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-12 05:15:50] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 05:15:50] [INFO ] After 94ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 05:15:50] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 05:15:50] [INFO ] After 50ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 05:15:50] [INFO ] After 114ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 34 ms.
[2023-03-12 05:15:51] [INFO ] After 291ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-12 05:15:51] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 9 ms.
[2023-03-12 05:15:51] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 166 places, 404 transitions and 1628 arcs took 4 ms.
[2023-03-12 05:15:51] [INFO ] Flatten gal took : 63 ms
Total runtime 7058 ms.
There are residual formulas that ITS could not solve within timeout
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: FuncPointer_2
(NrP: 166 NrTr: 404 NrArc: 1628)

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

net check time: 0m 0.000sec

init dd package: 0m 2.768sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 7119676 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16102764 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.000sec

21071 38561 61208 77109 103062 114806 141652 158198 185053 191051 222096 236874 267044 267296 306634 315550 349035 343541 388183 394226 431041 433140 469732 472902 513032 511816

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="FunctionPointer-PT-b002"
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 FunctionPointer-PT-b002, 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 r170-tall-167838857600663"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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