Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r043-tajo-167813696800390.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool smartxred
Input is BugTracking-PT-q8m002, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r043-tajo-167813696800390
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 11K Feb 26 07:33 CTLCardinality.txt
-rw-r--r-- 1 mcc users 94K Feb 26 07:33 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Feb 26 07:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Feb 26 07:18 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.4K Feb 25 15:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 15:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 08:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K Feb 26 08:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Feb 26 08:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 26 08:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 15:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 15:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 16M 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 BugTracking-PT-q8m002-ReachabilityCardinality-00
FORMULA_NAME BugTracking-PT-q8m002-ReachabilityCardinality-01
FORMULA_NAME BugTracking-PT-q8m002-ReachabilityCardinality-02
FORMULA_NAME BugTracking-PT-q8m002-ReachabilityCardinality-03
FORMULA_NAME BugTracking-PT-q8m002-ReachabilityCardinality-04
FORMULA_NAME BugTracking-PT-q8m002-ReachabilityCardinality-05
FORMULA_NAME BugTracking-PT-q8m002-ReachabilityCardinality-06
FORMULA_NAME BugTracking-PT-q8m002-ReachabilityCardinality-07
FORMULA_NAME BugTracking-PT-q8m002-ReachabilityCardinality-08
FORMULA_NAME BugTracking-PT-q8m002-ReachabilityCardinality-09
FORMULA_NAME BugTracking-PT-q8m002-ReachabilityCardinality-10
FORMULA_NAME BugTracking-PT-q8m002-ReachabilityCardinality-11
FORMULA_NAME BugTracking-PT-q8m002-ReachabilityCardinality-12
FORMULA_NAME BugTracking-PT-q8m002-ReachabilityCardinality-13
FORMULA_NAME BugTracking-PT-q8m002-ReachabilityCardinality-14
FORMULA_NAME BugTracking-PT-q8m002-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678786741515

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=smartxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BugTracking-PT-q8m002
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-14 09:39:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-14 09:39:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 09:39:04] [INFO ] Load time of PNML (sax parser for PT used): 893 ms
[2023-03-14 09:39:04] [INFO ] Transformed 754 places.
[2023-03-14 09:39:04] [INFO ] Transformed 27370 transitions.
[2023-03-14 09:39:04] [INFO ] Parsed PT model containing 754 places and 27370 transitions and 136172 arcs in 1063 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 474 places in 93 ms
Reduce places removed 474 places and 23466 transitions.
FORMULA BugTracking-PT-q8m002-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m002-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m002-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m002-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m002-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m002-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m002-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m002-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m002-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 210 resets, run finished after 395 ms. (steps per millisecond=25 ) properties (out of 7) seen :1
FORMULA BugTracking-PT-q8m002-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 57 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 68 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 56 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 61 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 71 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2023-03-14 09:39:05] [INFO ] Flow matrix only has 3729 transitions (discarded 175 similar events)
// Phase 1: matrix 3729 rows 280 cols
[2023-03-14 09:39:05] [INFO ] Computed 10 place invariants in 63 ms
[2023-03-14 09:39:05] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2023-03-14 09:39:05] [INFO ] After 248ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-14 09:39:05] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-14 09:39:06] [INFO ] After 859ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :5
[2023-03-14 09:39:06] [INFO ] State equation strengthened by 303 read => feed constraints.
[2023-03-14 09:39:07] [INFO ] After 1093ms SMT Verify possible using 303 Read/Feed constraints in natural domain returned unsat :1 sat :5
[2023-03-14 09:39:08] [INFO ] Deduced a trap composed of 88 places in 562 ms of which 17 ms to minimize.
[2023-03-14 09:39:08] [INFO ] Deduced a trap composed of 12 places in 194 ms of which 1 ms to minimize.
[2023-03-14 09:39:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 920 ms
[2023-03-14 09:39:09] [INFO ] Deduced a trap composed of 11 places in 461 ms of which 2 ms to minimize.
[2023-03-14 09:39:09] [INFO ] Deduced a trap composed of 66 places in 378 ms of which 2 ms to minimize.
[2023-03-14 09:39:10] [INFO ] Deduced a trap composed of 33 places in 346 ms of which 0 ms to minimize.
[2023-03-14 09:39:10] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1627 ms
[2023-03-14 09:39:10] [INFO ] Deduced a trap composed of 65 places in 324 ms of which 0 ms to minimize.
[2023-03-14 09:39:11] [INFO ] Deduced a trap composed of 23 places in 238 ms of which 1 ms to minimize.
[2023-03-14 09:39:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 867 ms
[2023-03-14 09:39:11] [INFO ] Deduced a trap composed of 37 places in 389 ms of which 2 ms to minimize.
[2023-03-14 09:39:12] [INFO ] Deduced a trap composed of 18 places in 297 ms of which 0 ms to minimize.
[2023-03-14 09:39:12] [INFO ] Deduced a trap composed of 11 places in 267 ms of which 0 ms to minimize.
[2023-03-14 09:39:13] [INFO ] Deduced a trap composed of 31 places in 239 ms of which 0 ms to minimize.
[2023-03-14 09:39:13] [INFO ] Deduced a trap composed of 18 places in 268 ms of which 0 ms to minimize.
[2023-03-14 09:39:13] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2094 ms
[2023-03-14 09:39:13] [INFO ] After 7122ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :4
Attempting to minimize the solution found.
Minimization took 435 ms.
[2023-03-14 09:39:14] [INFO ] After 8551ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :4
FORMULA BugTracking-PT-q8m002-ReachabilityCardinality-05 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BugTracking-PT-q8m002-ReachabilityCardinality-00 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 6 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 166 ms.
Support contains 6 out of 280 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 280/280 places, 3904/3904 transitions.
Graph (complete) has 4653 edges and 280 vertex of which 278 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.13 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 277 transition count 3871
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 277 transition count 3871
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 7 place count 275 transition count 3877
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 13 place count 275 transition count 3871
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 19 place count 269 transition count 3871
Applied a total of 19 rules in 383 ms. Remains 269 /280 variables (removed 11) and now considering 3871/3904 (removed 33) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 384 ms. Remains : 269/280 places, 3871/3904 transitions.
Incomplete random walk after 10001 steps, including 2 resets, run finished after 206 ms. (steps per millisecond=48 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 132855 steps, run timeout after 3001 ms. (steps per millisecond=44 ) properties seen :{}
Probabilistic random walk after 132855 steps, saw 53504 distinct states, run finished after 3002 ms. (steps per millisecond=44 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-14 09:39:18] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-14 09:39:18] [INFO ] Computed 8 place invariants in 16 ms
[2023-03-14 09:39:18] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-14 09:39:18] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-14 09:39:18] [INFO ] After 661ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-14 09:39:18] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-14 09:39:19] [INFO ] After 641ms SMT Verify possible using 283 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-14 09:39:20] [INFO ] Deduced a trap composed of 14 places in 382 ms of which 1 ms to minimize.
[2023-03-14 09:39:20] [INFO ] Deduced a trap composed of 7 places in 390 ms of which 0 ms to minimize.
[2023-03-14 09:39:20] [INFO ] Deduced a trap composed of 5 places in 62 ms of which 0 ms to minimize.
[2023-03-14 09:39:20] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1280 ms
[2023-03-14 09:39:21] [INFO ] Deduced a trap composed of 10 places in 96 ms of which 1 ms to minimize.
[2023-03-14 09:39:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 313 ms
[2023-03-14 09:39:21] [INFO ] Deduced a trap composed of 26 places in 275 ms of which 1 ms to minimize.
[2023-03-14 09:39:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 511 ms
[2023-03-14 09:39:22] [INFO ] After 3203ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 512 ms.
[2023-03-14 09:39:22] [INFO ] After 4451ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 6 ms.
Support contains 6 out of 269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 101 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 101 ms. Remains : 269/269 places, 3871/3871 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 77 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2023-03-14 09:39:22] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-14 09:39:22] [INFO ] Invariant cache hit.
[2023-03-14 09:39:23] [INFO ] Implicit Places using invariants in 541 ms returned []
[2023-03-14 09:39:23] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-14 09:39:23] [INFO ] Invariant cache hit.
[2023-03-14 09:39:24] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-14 09:39:25] [INFO ] Implicit Places using invariants and state equation in 1937 ms returned []
Implicit Place search using SMT with State Equation took 2483 ms to find 0 implicit places.
[2023-03-14 09:39:25] [INFO ] Redundant transitions in 461 ms returned []
[2023-03-14 09:39:25] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-14 09:39:25] [INFO ] Invariant cache hit.
[2023-03-14 09:39:26] [INFO ] Dead Transitions using invariants and state equation in 1121 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4154 ms. Remains : 269/269 places, 3871/3871 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 167 transitions
Reduce isomorphic transitions removed 173 transitions.
Iterating post reduction 0 with 173 rules applied. Total rules applied 173 place count 269 transition count 3698
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 175 place count 268 transition count 3697
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 176 place count 268 transition count 3696
Free-agglomeration rule applied 5 times.
Iterating global reduction 1 with 5 rules applied. Total rules applied 181 place count 268 transition count 3691
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 186 place count 263 transition count 3691
Applied a total of 186 rules in 367 ms. Remains 263 /269 variables (removed 6) and now considering 3691/3871 (removed 180) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 3691 rows 263 cols
[2023-03-14 09:39:27] [INFO ] Computed 9 place invariants in 25 ms
[2023-03-14 09:39:27] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-14 09:39:27] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2023-03-14 09:39:28] [INFO ] After 1037ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-14 09:39:29] [INFO ] After 1738ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 359 ms.
[2023-03-14 09:39:29] [INFO ] After 2194ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
[2023-03-14 09:39:29] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 5 ms.
[2023-03-14 09:39:29] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 269 places, 3871 transitions and 19045 arcs took 36 ms.
[2023-03-14 09:39:30] [INFO ] Flatten gal took : 413 ms
Total runtime 27262 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running BugTracking (PT), instance q8m002
Examination ReachabilityCardinality
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/Cardinality.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//rem_exec//smart

GOT IT HERE. BS
Petri model created: 269 places, 3871 transitions, 19045 arcs.
Final Score: 53301.543
Took : 90 seconds
Reachability Cardinality file is: ReachabilityCardinality.xml
READY TO PARSE. BS
PROPERTY: BugTracking-PT-q8m002-ReachabilityCardinality-01 (reachable &!potential( ( (tk(P245)) <= (tk(P244)) )))
PROPERTY: BugTracking-PT-q8m002-ReachabilityCardinality-11 (reachable & potential(( ( 2 ) <= (tk(P231)) )))
PROPERTY: BugTracking-PT-q8m002-ReachabilityCardinality-14 (reachable &!potential( ( (tk(P83)) <= (tk(P179)) )))
PROPERTY: BugTracking-PT-q8m002-ReachabilityCardinality-15 (reachable &!potential( ( (tk(P238)) <= ( 0 ) )))

BK_STOP 1678787653297

--------------------
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 ReachabilityCardinality -timeout 360 -rebuildPNML
/home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//smart.sh: line 116: 605 Killed ${SMART}/smart ${INPUT_SM}

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="BugTracking-PT-q8m002"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="smartxred"
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 smartxred"
echo " Input is BugTracking-PT-q8m002, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r043-tajo-167813696800390"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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