Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r041-tajo-167813694600366.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 ltsminxred
Input is BugTracking-PT-q3m064, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r041-tajo-167813694600366
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 9.2K Feb 26 06:43 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Feb 26 06:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Feb 26 06:10 CTLFireability.txt
-rw-r--r-- 1 mcc users 36K Feb 26 06:10 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.5K 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 14K Feb 26 07:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 111K Feb 26 07:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Feb 26 07:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K Feb 26 07: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-q3m064-ReachabilityCardinality-00
FORMULA_NAME BugTracking-PT-q3m064-ReachabilityCardinality-01
FORMULA_NAME BugTracking-PT-q3m064-ReachabilityCardinality-02
FORMULA_NAME BugTracking-PT-q3m064-ReachabilityCardinality-03
FORMULA_NAME BugTracking-PT-q3m064-ReachabilityCardinality-04
FORMULA_NAME BugTracking-PT-q3m064-ReachabilityCardinality-05
FORMULA_NAME BugTracking-PT-q3m064-ReachabilityCardinality-06
FORMULA_NAME BugTracking-PT-q3m064-ReachabilityCardinality-07
FORMULA_NAME BugTracking-PT-q3m064-ReachabilityCardinality-08
FORMULA_NAME BugTracking-PT-q3m064-ReachabilityCardinality-09
FORMULA_NAME BugTracking-PT-q3m064-ReachabilityCardinality-10
FORMULA_NAME BugTracking-PT-q3m064-ReachabilityCardinality-11
FORMULA_NAME BugTracking-PT-q3m064-ReachabilityCardinality-12
FORMULA_NAME BugTracking-PT-q3m064-ReachabilityCardinality-13
FORMULA_NAME BugTracking-PT-q3m064-ReachabilityCardinality-14
FORMULA_NAME BugTracking-PT-q3m064-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678630719838

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=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BugTracking-PT-q3m064
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 14:18:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-12 14:18:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 14:18:43] [INFO ] Load time of PNML (sax parser for PT used): 758 ms
[2023-03-12 14:18:43] [INFO ] Transformed 754 places.
[2023-03-12 14:18:43] [INFO ] Transformed 27370 transitions.
[2023-03-12 14:18:43] [INFO ] Parsed PT model containing 754 places and 27370 transitions and 136172 arcs in 1042 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 31 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 514 places in 120 ms
Reduce places removed 514 places and 24601 transitions.
FORMULA BugTracking-PT-q3m064-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m064-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m064-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m064-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m064-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m064-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m064-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m064-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m064-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m064-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m064-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 11 resets, run finished after 296 ms. (steps per millisecond=33 ) properties (out of 5) seen :1
FORMULA BugTracking-PT-q3m064-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 4) seen :1
FORMULA BugTracking-PT-q3m064-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-12 14:18:44] [INFO ] Flow matrix only has 2642 transitions (discarded 127 similar events)
// Phase 1: matrix 2642 rows 240 cols
[2023-03-12 14:18:44] [INFO ] Computed 10 place invariants in 37 ms
[2023-03-12 14:18:44] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2023-03-12 14:18:45] [INFO ] After 983ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 14:18:45] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2023-03-12 14:18:45] [INFO ] After 672ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 14:18:45] [INFO ] State equation strengthened by 255 read => feed constraints.
[2023-03-12 14:18:46] [INFO ] After 474ms SMT Verify possible using 255 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-12 14:18:47] [INFO ] Deduced a trap composed of 51 places in 397 ms of which 10 ms to minimize.
[2023-03-12 14:18:47] [INFO ] Deduced a trap composed of 11 places in 373 ms of which 1 ms to minimize.
[2023-03-12 14:18:47] [INFO ] Deduced a trap composed of 17 places in 293 ms of which 1 ms to minimize.
[2023-03-12 14:18:48] [INFO ] Deduced a trap composed of 12 places in 331 ms of which 2 ms to minimize.
[2023-03-12 14:18:48] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1819 ms
[2023-03-12 14:18:48] [INFO ] Deduced a trap composed of 20 places in 319 ms of which 0 ms to minimize.
[2023-03-12 14:18:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 383 ms
[2023-03-12 14:18:49] [INFO ] Deduced a trap composed of 9 places in 136 ms of which 0 ms to minimize.
[2023-03-12 14:18:49] [INFO ] Deduced a trap composed of 11 places in 61 ms of which 1 ms to minimize.
[2023-03-12 14:18:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 414 ms
[2023-03-12 14:18:49] [INFO ] After 3544ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 321 ms.
[2023-03-12 14:18:49] [INFO ] After 4675ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
FORMULA BugTracking-PT-q3m064-ReachabilityCardinality-06 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 246 ms.
Support contains 8 out of 240 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 240/240 places, 2769/2769 transitions.
Graph (complete) has 3422 edges and 240 vertex of which 238 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.9 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 237 transition count 2750
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 237 transition count 2750
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 7 place count 235 transition count 2753
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 13 place count 235 transition count 2747
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 19 place count 229 transition count 2747
Applied a total of 19 rules in 318 ms. Remains 229 /240 variables (removed 11) and now considering 2747/2769 (removed 22) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 319 ms. Remains : 229/240 places, 2747/2769 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 141376 steps, run timeout after 3001 ms. (steps per millisecond=47 ) properties seen :{}
Probabilistic random walk after 141376 steps, saw 58282 distinct states, run finished after 3005 ms. (steps per millisecond=47 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-12 14:18:53] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2023-03-12 14:18:53] [INFO ] Computed 8 place invariants in 28 ms
[2023-03-12 14:18:53] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-12 14:18:54] [INFO ] After 626ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 14:18:54] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-12 14:18:54] [INFO ] After 648ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 14:18:54] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-12 14:18:55] [INFO ] After 426ms SMT Verify possible using 241 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 14:18:55] [INFO ] Deduced a trap composed of 23 places in 182 ms of which 0 ms to minimize.
[2023-03-12 14:18:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 298 ms
[2023-03-12 14:18:55] [INFO ] After 990ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 256 ms.
[2023-03-12 14:18:56] [INFO ] After 1983ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 5 ms.
Support contains 8 out of 229 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 94 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 95 ms. Remains : 229/229 places, 2747/2747 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 68 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
[2023-03-12 14:18:56] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-12 14:18:56] [INFO ] Invariant cache hit.
[2023-03-12 14:18:56] [INFO ] Implicit Places using invariants in 388 ms returned []
[2023-03-12 14:18:56] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-12 14:18:56] [INFO ] Invariant cache hit.
[2023-03-12 14:18:57] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-12 14:18:58] [INFO ] Implicit Places using invariants and state equation in 1451 ms returned []
Implicit Place search using SMT with State Equation took 1841 ms to find 0 implicit places.
[2023-03-12 14:18:58] [INFO ] Redundant transitions in 215 ms returned []
[2023-03-12 14:18:58] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-12 14:18:58] [INFO ] Invariant cache hit.
[2023-03-12 14:18:59] [INFO ] Dead Transitions using invariants and state equation in 956 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3089 ms. Remains : 229/229 places, 2747/2747 transitions.
Ensure Unique test removed 129 transitions
Reduce isomorphic transitions removed 129 transitions.
Iterating post reduction 0 with 129 rules applied. Total rules applied 129 place count 229 transition count 2618
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 131 place count 228 transition count 2617
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 132 place count 228 transition count 2616
Free-agglomeration rule applied 4 times.
Iterating global reduction 1 with 4 rules applied. Total rules applied 136 place count 228 transition count 2612
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 140 place count 224 transition count 2612
Applied a total of 140 rules in 175 ms. Remains 224 /229 variables (removed 5) and now considering 2612/2747 (removed 135) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 2612 rows 224 cols
[2023-03-12 14:18:59] [INFO ] Computed 8 place invariants in 20 ms
[2023-03-12 14:18:59] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-12 14:19:00] [INFO ] After 798ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 14:19:00] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-12 14:19:01] [INFO ] After 584ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 14:19:01] [INFO ] After 892ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 185 ms.
[2023-03-12 14:19:01] [INFO ] After 1160ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2023-03-12 14:19:01] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 8 ms.
[2023-03-12 14:19:01] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 229 places, 2747 transitions and 13485 arcs took 29 ms.
[2023-03-12 14:19:02] [INFO ] Flatten gal took : 273 ms
Total runtime 19974 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --invariant=/tmp/533/inv_0_ --invariant=/tmp/533/inv_1_ --inv-par
TIME LIMIT: Killed by timeout after 3570 seconds
MemTotal: 16393340 kB
MemFree: 15207672 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16081948 kB
Could not compute solution for formula : BugTracking-PT-q3m064-ReachabilityCardinality-02
Could not compute solution for formula : BugTracking-PT-q3m064-ReachabilityCardinality-11

BK_STOP 1678634313586

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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
mcc2023
rfs formula name BugTracking-PT-q3m064-ReachabilityCardinality-02
rfs formula type AG
rfs formula formula --invariant=/tmp/533/inv_0_
rfs formula name BugTracking-PT-q3m064-ReachabilityCardinality-11
rfs formula type AG
rfs formula formula --invariant=/tmp/533/inv_1_
pnml2lts-sym: Exploration order is bfs-prev
pnml2lts-sym: Saturation strategy is sat
pnml2lts-sym: Guided search strategy is unguided
pnml2lts-sym: Attractor strategy is default
pnml2lts-sym: opening model.pnml
pnml2lts-sym: Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-sym: Petri net has 229 places, 2747 transitions and 13485 arcs
pnml2lts-sym: Petri net BugTracking_PT_q3 analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 0.030 real 0.030 user 0.000 sys
pnml2lts-sym: Initializing regrouping layer
pnml2lts-sym: Regroup specification: bs,w2W,ru,hf
pnml2lts-sym: Regroup Boost's Sloan
pnml2lts-sym: Regroup over-approximate must-write to may-write
pnml2lts-sym: Regroup Row sUbsume
pnml2lts-sym: Reqroup Horizontal Flip
pnml2lts-sym: Regrouping: 2747->2609 groups
pnml2lts-sym: Regrouping took 1.360 real 1.360 user 0.000 sys
pnml2lts-sym: state vector length is 229; there are 2609 groups
pnml2lts-sym: Creating a multi-core ListDD domain.
pnml2lts-sym: Sylvan allocates 15.000 GB virtual memory for nodes table and operation cache.
pnml2lts-sym: Initial nodes table and operation cache requires 60.00 MB.
pnml2lts-sym: Using GBgetTransitionsShortR2W as next-state function
pnml2lts-sym: got initial state
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
Killing (15) : 539
Killing (9) : 539

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-q3m064"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is BugTracking-PT-q3m064, 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 r041-tajo-167813694600366"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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