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.r043-tajo-167813697000527.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 BusinessProcesses-PT-10, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r043-tajo-167813697000527
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 580K
-rw-r--r-- 1 mcc users 6.2K Feb 25 16:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Feb 25 16:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 25 16:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 25 16:50 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Feb 25 15:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 15:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 25 16:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 149K Feb 25 16:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Feb 25 16:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 25 16:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:39 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 131K 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 BusinessProcesses-PT-10-ReachabilityFireability-00
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityFireability-01
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityFireability-02
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityFireability-03
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityFireability-04
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityFireability-05
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityFireability-06
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityFireability-07
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityFireability-08
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityFireability-09
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityFireability-10
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityFireability-11
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityFireability-12
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityFireability-13
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityFireability-14
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678791555878

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=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-10
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-14 10:59:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-14 10:59:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 10:59:17] [INFO ] Load time of PNML (sax parser for PT used): 69 ms
[2023-03-14 10:59:17] [INFO ] Transformed 518 places.
[2023-03-14 10:59:17] [INFO ] Transformed 471 transitions.
[2023-03-14 10:59:17] [INFO ] Found NUPN structural information;
[2023-03-14 10:59:17] [INFO ] Parsed PT model containing 518 places and 471 transitions and 1415 arcs in 148 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 81 resets, run finished after 433 ms. (steps per millisecond=23 ) properties (out of 16) seen :9
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 7) seen :1
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 6) seen :1
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 471 rows 518 cols
[2023-03-14 10:59:18] [INFO ] Computed 85 place invariants in 20 ms
[2023-03-14 10:59:19] [INFO ] After 308ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-14 10:59:19] [INFO ] [Nat]Absence check using 48 positive place invariants in 13 ms returned sat
[2023-03-14 10:59:19] [INFO ] [Nat]Absence check using 48 positive and 37 generalized place invariants in 14 ms returned sat
[2023-03-14 10:59:19] [INFO ] After 665ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :2
[2023-03-14 10:59:20] [INFO ] Deduced a trap composed of 9 places in 168 ms of which 5 ms to minimize.
[2023-03-14 10:59:20] [INFO ] Deduced a trap composed of 8 places in 120 ms of which 1 ms to minimize.
[2023-03-14 10:59:20] [INFO ] Deduced a trap composed of 11 places in 116 ms of which 1 ms to minimize.
[2023-03-14 10:59:20] [INFO ] Deduced a trap composed of 22 places in 114 ms of which 1 ms to minimize.
[2023-03-14 10:59:20] [INFO ] Deduced a trap composed of 16 places in 114 ms of which 1 ms to minimize.
[2023-03-14 10:59:20] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 762 ms
[2023-03-14 10:59:21] [INFO ] Deduced a trap composed of 35 places in 117 ms of which 3 ms to minimize.
[2023-03-14 10:59:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 192 ms
[2023-03-14 10:59:21] [INFO ] After 1755ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :2
Attempting to minimize the solution found.
Minimization took 219 ms.
[2023-03-14 10:59:21] [INFO ] After 2156ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :2
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-04 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-01 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-00 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 33 ms.
Support contains 58 out of 518 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 518/518 places, 471/471 transitions.
Graph (complete) has 1071 edges and 518 vertex of which 516 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 0 with 52 rules applied. Total rules applied 53 place count 516 transition count 418
Reduce places removed 52 places and 0 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Iterating post reduction 1 with 63 rules applied. Total rules applied 116 place count 464 transition count 407
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 127 place count 453 transition count 407
Performed 94 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 94 Pre rules applied. Total rules applied 127 place count 453 transition count 313
Deduced a syphon composed of 94 places in 2 ms
Ensure Unique test removed 11 places
Reduce places removed 105 places and 0 transitions.
Iterating global reduction 3 with 199 rules applied. Total rules applied 326 place count 348 transition count 313
Discarding 53 places :
Symmetric choice reduction at 3 with 53 rule applications. Total rules 379 place count 295 transition count 260
Iterating global reduction 3 with 53 rules applied. Total rules applied 432 place count 295 transition count 260
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 70
Deduced a syphon composed of 70 places in 0 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 3 with 140 rules applied. Total rules applied 572 place count 225 transition count 190
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 573 place count 225 transition count 189
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 578 place count 225 transition count 189
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 579 place count 224 transition count 188
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 580 place count 223 transition count 188
Applied a total of 580 rules in 166 ms. Remains 223 /518 variables (removed 295) and now considering 188/471 (removed 283) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 168 ms. Remains : 223/518 places, 188/471 transitions.
Incomplete random walk after 10000 steps, including 282 resets, run finished after 137 ms. (steps per millisecond=72 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 65 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 54 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1423593 steps, run timeout after 3001 ms. (steps per millisecond=474 ) properties seen :{1=1}
Probabilistic random walk after 1423593 steps, saw 201507 distinct states, run finished after 3004 ms. (steps per millisecond=473 ) properties seen :1
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 1 properties.
// Phase 1: matrix 188 rows 223 cols
[2023-03-14 10:59:24] [INFO ] Computed 72 place invariants in 10 ms
[2023-03-14 10:59:24] [INFO ] After 60ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-14 10:59:24] [INFO ] [Nat]Absence check using 43 positive place invariants in 11 ms returned sat
[2023-03-14 10:59:24] [INFO ] [Nat]Absence check using 43 positive and 29 generalized place invariants in 7 ms returned sat
[2023-03-14 10:59:24] [INFO ] After 60ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-14 10:59:25] [INFO ] Deduced a trap composed of 47 places in 81 ms of which 4 ms to minimize.
[2023-03-14 10:59:25] [INFO ] Deduced a trap composed of 42 places in 47 ms of which 1 ms to minimize.
[2023-03-14 10:59:25] [INFO ] Deduced a trap composed of 5 places in 91 ms of which 1 ms to minimize.
[2023-03-14 10:59:25] [INFO ] Deduced a trap composed of 7 places in 60 ms of which 0 ms to minimize.
[2023-03-14 10:59:25] [INFO ] Deduced a trap composed of 51 places in 67 ms of which 1 ms to minimize.
[2023-03-14 10:59:25] [INFO ] Deduced a trap composed of 7 places in 58 ms of which 0 ms to minimize.
[2023-03-14 10:59:25] [INFO ] Deduced a trap composed of 22 places in 88 ms of which 1 ms to minimize.
[2023-03-14 10:59:25] [INFO ] Deduced a trap composed of 5 places in 69 ms of which 1 ms to minimize.
[2023-03-14 10:59:25] [INFO ] Deduced a trap composed of 42 places in 62 ms of which 0 ms to minimize.
[2023-03-14 10:59:25] [INFO ] Deduced a trap composed of 44 places in 68 ms of which 1 ms to minimize.
[2023-03-14 10:59:25] [INFO ] Deduced a trap composed of 36 places in 90 ms of which 1 ms to minimize.
[2023-03-14 10:59:26] [INFO ] Deduced a trap composed of 35 places in 62 ms of which 0 ms to minimize.
[2023-03-14 10:59:26] [INFO ] Deduced a trap composed of 32 places in 86 ms of which 1 ms to minimize.
[2023-03-14 10:59:26] [INFO ] Deduced a trap composed of 32 places in 76 ms of which 0 ms to minimize.
[2023-03-14 10:59:26] [INFO ] Deduced a trap composed of 32 places in 66 ms of which 1 ms to minimize.
[2023-03-14 10:59:26] [INFO ] Deduced a trap composed of 48 places in 68 ms of which 0 ms to minimize.
[2023-03-14 10:59:26] [INFO ] Deduced a trap composed of 32 places in 54 ms of which 0 ms to minimize.
[2023-03-14 10:59:26] [INFO ] Deduced a trap composed of 43 places in 54 ms of which 1 ms to minimize.
[2023-03-14 10:59:26] [INFO ] Deduced a trap composed of 33 places in 54 ms of which 1 ms to minimize.
[2023-03-14 10:59:26] [INFO ] Deduced a trap composed of 33 places in 53 ms of which 0 ms to minimize.
[2023-03-14 10:59:26] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 1739 ms
[2023-03-14 10:59:26] [INFO ] After 1818ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 18 ms.
[2023-03-14 10:59:26] [INFO ] After 1907ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 12 out of 223 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 223/223 places, 188/188 transitions.
Graph (trivial) has 50 edges and 223 vertex of which 2 / 223 are part of one of the 1 SCC in 5 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 222 transition count 174
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 25 place count 210 transition count 174
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 25 place count 210 transition count 163
Deduced a syphon composed of 11 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 49 place count 197 transition count 163
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 52 place count 194 transition count 160
Iterating global reduction 2 with 3 rules applied. Total rules applied 55 place count 194 transition count 160
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 47 rules applied. Total rules applied 102 place count 170 transition count 137
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 106 place count 168 transition count 153
Free-agglomeration rule applied 4 times.
Iterating global reduction 2 with 4 rules applied. Total rules applied 110 place count 168 transition count 149
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 115 place count 163 transition count 149
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 116 place count 163 transition count 148
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 117 place count 162 transition count 148
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 118 place count 161 transition count 147
Applied a total of 118 rules in 92 ms. Remains 161 /223 variables (removed 62) and now considering 147/188 (removed 41) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 92 ms. Remains : 161/223 places, 147/188 transitions.
Incomplete random walk after 10000 steps, including 219 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 53 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1231267 steps, run timeout after 3001 ms. (steps per millisecond=410 ) properties seen :{}
Probabilistic random walk after 1231267 steps, saw 647575 distinct states, run finished after 3001 ms. (steps per millisecond=410 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 147 rows 161 cols
[2023-03-14 10:59:29] [INFO ] Computed 68 place invariants in 5 ms
[2023-03-14 10:59:29] [INFO ] After 47ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-14 10:59:29] [INFO ] [Nat]Absence check using 45 positive place invariants in 8 ms returned sat
[2023-03-14 10:59:29] [INFO ] [Nat]Absence check using 45 positive and 23 generalized place invariants in 6 ms returned sat
[2023-03-14 10:59:30] [INFO ] After 67ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-14 10:59:30] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 1 ms to minimize.
[2023-03-14 10:59:30] [INFO ] Deduced a trap composed of 5 places in 60 ms of which 1 ms to minimize.
[2023-03-14 10:59:30] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 153 ms
[2023-03-14 10:59:30] [INFO ] After 236ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-14 10:59:30] [INFO ] After 305ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 190 steps, including 20 resets, run visited all 1 properties in 1 ms. (steps per millisecond=190 )
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 0 ms.
All properties solved without resorting to model-checking.
Total runtime 12455 ms.
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running BusinessProcesses (PT), instance 10
Examination ReachabilityFireability
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/Fireability.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//rem_exec//smart

GOT IT HERE. BS
Petri model created: 518 places, 471 transitions, 1415 arcs.
Final Score: 23199.643
Took : 17 seconds
Reachability Fireability file is: ReachabilityFireability.xml
READY TO PARSE. BS
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 14423932 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16105628 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
Caught signal 15, terminating.

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="BusinessProcesses-PT-10"
export BK_EXAMINATION="ReachabilityFireability"
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 BusinessProcesses-PT-10, 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 r043-tajo-167813697000527"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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