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-167813696900486.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-05, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r043-tajo-167813696900486
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 492K
-rw-r--r-- 1 mcc users 6.2K Feb 25 16:45 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Feb 25 16:45 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Feb 25 16:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 25 16:45 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.4K Feb 25 15:38 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 15:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:38 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:38 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.7K Feb 25 16:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 87K Feb 25 16:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Feb 25 16:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 76K Feb 25 16:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:38 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:38 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 85K 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-05-ReachabilityCardinality-00
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityCardinality-01
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityCardinality-02
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityCardinality-03
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityCardinality-04
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityCardinality-05
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityCardinality-06
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityCardinality-07
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityCardinality-08
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityCardinality-09
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityCardinality-10
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityCardinality-11
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityCardinality-12
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityCardinality-13
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityCardinality-14
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678790110392

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=BusinessProcesses-PT-05
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-14 10:35:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-14 10:35:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 10:35:12] [INFO ] Load time of PNML (sax parser for PT used): 70 ms
[2023-03-14 10:35:12] [INFO ] Transformed 368 places.
[2023-03-14 10:35:12] [INFO ] Transformed 319 transitions.
[2023-03-14 10:35:12] [INFO ] Found NUPN structural information;
[2023-03-14 10:35:12] [INFO ] Parsed PT model containing 368 places and 319 transitions and 854 arcs in 136 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 1 transitions.
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 96 resets, run finished after 480 ms. (steps per millisecond=20 ) properties (out of 13) seen :5
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 18 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 17 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 8) seen :2
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 6) seen :2
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 318 rows 367 cols
[2023-03-14 10:35:13] [INFO ] Computed 57 place invariants in 23 ms
[2023-03-14 10:35:13] [INFO ] After 260ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-14 10:35:13] [INFO ] [Nat]Absence check using 41 positive place invariants in 14 ms returned sat
[2023-03-14 10:35:13] [INFO ] [Nat]Absence check using 41 positive and 16 generalized place invariants in 3 ms returned sat
[2023-03-14 10:35:14] [INFO ] After 285ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-14 10:35:14] [INFO ] Deduced a trap composed of 8 places in 121 ms of which 7 ms to minimize.
[2023-03-14 10:35:14] [INFO ] Deduced a trap composed of 30 places in 95 ms of which 1 ms to minimize.
[2023-03-14 10:35:14] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 0 ms to minimize.
[2023-03-14 10:35:14] [INFO ] Deduced a trap composed of 13 places in 116 ms of which 2 ms to minimize.
[2023-03-14 10:35:14] [INFO ] Deduced a trap composed of 12 places in 82 ms of which 1 ms to minimize.
[2023-03-14 10:35:14] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 0 ms to minimize.
[2023-03-14 10:35:14] [INFO ] Deduced a trap composed of 18 places in 79 ms of which 1 ms to minimize.
[2023-03-14 10:35:14] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 1 ms to minimize.
[2023-03-14 10:35:14] [INFO ] Deduced a trap composed of 26 places in 66 ms of which 0 ms to minimize.
[2023-03-14 10:35:15] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 0 ms to minimize.
[2023-03-14 10:35:15] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 1 ms to minimize.
[2023-03-14 10:35:15] [INFO ] Deduced a trap composed of 27 places in 69 ms of which 1 ms to minimize.
[2023-03-14 10:35:15] [INFO ] Deduced a trap composed of 32 places in 71 ms of which 1 ms to minimize.
[2023-03-14 10:35:15] [INFO ] Deduced a trap composed of 38 places in 80 ms of which 0 ms to minimize.
[2023-03-14 10:35:15] [INFO ] Deduced a trap composed of 28 places in 61 ms of which 0 ms to minimize.
[2023-03-14 10:35:15] [INFO ] Deduced a trap composed of 29 places in 54 ms of which 0 ms to minimize.
[2023-03-14 10:35:15] [INFO ] Deduced a trap composed of 38 places in 50 ms of which 0 ms to minimize.
[2023-03-14 10:35:15] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 1 ms to minimize.
[2023-03-14 10:35:15] [INFO ] Deduced a trap composed of 46 places in 48 ms of which 0 ms to minimize.
[2023-03-14 10:35:15] [INFO ] Deduced a trap composed of 49 places in 44 ms of which 1 ms to minimize.
[2023-03-14 10:35:15] [INFO ] Deduced a trap composed of 48 places in 52 ms of which 0 ms to minimize.
[2023-03-14 10:35:15] [INFO ] Deduced a trap composed of 51 places in 59 ms of which 0 ms to minimize.
[2023-03-14 10:35:15] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 1912 ms
[2023-03-14 10:35:16] [INFO ] Deduced a trap composed of 21 places in 139 ms of which 1 ms to minimize.
[2023-03-14 10:35:16] [INFO ] Deduced a trap composed of 92 places in 90 ms of which 0 ms to minimize.
[2023-03-14 10:35:16] [INFO ] Deduced a trap composed of 94 places in 83 ms of which 1 ms to minimize.
[2023-03-14 10:35:16] [INFO ] Deduced a trap composed of 32 places in 82 ms of which 0 ms to minimize.
[2023-03-14 10:35:16] [INFO ] Deduced a trap composed of 93 places in 79 ms of which 0 ms to minimize.
[2023-03-14 10:35:16] [INFO ] Deduced a trap composed of 94 places in 81 ms of which 1 ms to minimize.
[2023-03-14 10:35:16] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 725 ms
[2023-03-14 10:35:17] [INFO ] Deduced a trap composed of 17 places in 93 ms of which 0 ms to minimize.
[2023-03-14 10:35:17] [INFO ] Deduced a trap composed of 11 places in 67 ms of which 1 ms to minimize.
[2023-03-14 10:35:17] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 1 ms to minimize.
[2023-03-14 10:35:17] [INFO ] Deduced a trap composed of 11 places in 105 ms of which 1 ms to minimize.
[2023-03-14 10:35:17] [INFO ] Deduced a trap composed of 25 places in 87 ms of which 1 ms to minimize.
[2023-03-14 10:35:17] [INFO ] Deduced a trap composed of 38 places in 93 ms of which 2 ms to minimize.
[2023-03-14 10:35:17] [INFO ] Deduced a trap composed of 46 places in 84 ms of which 3 ms to minimize.
[2023-03-14 10:35:18] [INFO ] Deduced a trap composed of 46 places in 84 ms of which 1 ms to minimize.
[2023-03-14 10:35:18] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1115 ms
[2023-03-14 10:35:18] [INFO ] After 4438ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 375 ms.
[2023-03-14 10:35:18] [INFO ] After 4958ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 41 ms.
Support contains 96 out of 367 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 367/367 places, 318/318 transitions.
Graph (trivial) has 142 edges and 367 vertex of which 8 / 367 are part of one of the 1 SCC in 4 ms
Free SCC test removed 7 places
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (complete) has 700 edges and 360 vertex of which 357 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 43 transitions
Trivial Post-agglo rules discarded 43 transitions
Performed 43 trivial Post agglomeration. Transition count delta: 43
Iterating post reduction 0 with 44 rules applied. Total rules applied 46 place count 357 transition count 263
Reduce places removed 43 places and 0 transitions.
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Iterating post reduction 1 with 56 rules applied. Total rules applied 102 place count 314 transition count 250
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 115 place count 301 transition count 250
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 27 Pre rules applied. Total rules applied 115 place count 301 transition count 223
Deduced a syphon composed of 27 places in 3 ms
Ensure Unique test removed 1 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 55 rules applied. Total rules applied 170 place count 273 transition count 223
Discarding 30 places :
Symmetric choice reduction at 3 with 30 rule applications. Total rules 200 place count 243 transition count 193
Iterating global reduction 3 with 30 rules applied. Total rules applied 230 place count 243 transition count 193
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 1 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 70 rules applied. Total rules applied 300 place count 208 transition count 158
Applied a total of 300 rules in 94 ms. Remains 208 /367 variables (removed 159) and now considering 158/318 (removed 160) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 96 ms. Remains : 208/367 places, 158/318 transitions.
Incomplete random walk after 10000 steps, including 94 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 3) seen :1
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 2) seen :1
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Finished Best-First random walk after 454 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=454 )
FORMULA BusinessProcesses-PT-05-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
All properties solved without resorting to model-checking.
Total runtime 6806 ms.
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running BusinessProcesses (PT), instance 05
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: 368 places, 319 transitions, 854 arcs.
Final Score: 11976.738
Took : 10 seconds
Reachability Cardinality file is: ReachabilityCardinality.xml
READY TO PARSE. BS
PROPERTY: BusinessProcesses-PT-05-ReachabilityCardinality-00 (reachable & potential((! ( (tk(P341)) <= ( 0 ) ))))
PROPERTY: BusinessProcesses-PT-05-ReachabilityCardinality-01 (reachable &!potential( ( (tk(P334)) <= (tk(P136)) )))
PROPERTY: BusinessProcesses-PT-05-ReachabilityCardinality-02 (reachable &!potential( ( ( (tk(P312)) <= ( 0 ) ) & (! ( ( (! ( ( (tk(P155)) <= ( 1 ) ) | ( ( ( 1 ) <= (tk(P229)) ) | (! ( (tk(P230)) <= ( 0 ) )) ) )) & (! ( ( ( ( (tk(P322)) <= ( 0 ) ) | ( (tk(P239)) <= (tk(P292)) ) ) | ( ( ( (tk(P112)) <= ( 1 ) ) & ( (tk(P35)) <= ( 0 ) ) ) & ( (tk(P61)) <= (tk(P29)) ) ) ) & ( (tk(P200)) <= (tk(P183)) ) )) ) & ( ( 1 ) <= (tk(P59)) ) )) )))
PROPERTY: BusinessProcesses-PT-05-ReachabilityCardinality-03 (reachable &!potential( ( ( ( ( ( 1 ) <= (tk(P207)) ) | ( ( (tk(P89)) <= ( 1 ) ) & ( ( ( (tk(P252)) <= (tk(P163)) ) | ( ( (tk(P286)) <= ( 1 ) ) | ( ( ( (tk(P172)) <= ( 0 ) ) | ( (tk(P202)) <= (tk(P24)) ) ) | ( ( (tk(P359)) <= (tk(P130)) ) | ( ( 1 ) <= (tk(P109)) ) ) ) ) ) | (! ( (tk(P315)) <= (tk(P219)) )) ) ) ) | ( ( (! ( ( ( ( 1 ) <= (tk(P284)) ) | (! ( ( (tk(P27)) <= (tk(P85)) ) | ( (tk(P262)) <= ( 0 ) ) )) ) | (! ( ( ( 1 ) <= (tk(P10)) ) & ( (tk(P354)) <= ( 1 ) ) )) )) & ( (tk(P105)) <= (tk(P364)) ) ) & (! ( (tk(P300)) <= ( 0 ) )) ) ) | (! ( (tk(P327)) <= ( 1 ) )) )))
PROPERTY: BusinessProcesses-PT-05-ReachabilityCardinality-04 (reachable &!potential( ( (tk(P302)) <= ( 0 ) )))
PROPERTY: BusinessProcesses-PT-05-ReachabilityCardinality-05 (reachable & potential((! ( (tk(P365)) <= ( 1 ) ))))
PROPERTY: BusinessProcesses-PT-05-ReachabilityCardinality-06 (reachable & potential(( (! ( ( (! ( (! ( (tk(P17)) <= (tk(P15)) )) | (! ( (tk(P194)) <= ( 0 ) )) )) | (! ( ( ( (tk(P109)) <= (tk(P290)) ) & (! ( (tk(P94)) <= ( 0 ) )) ) | ( (! ( ( (tk(P86)) <= ( 0 ) ) | ( ( 1 ) <= (tk(P196)) ) )) & ( ( ( ( 1 ) <= (tk(P157)) ) | ( ( 1 ) <= (tk(P195)) ) ) & (! ( (tk(P179)) <= (tk(P164)) )) ) ) )) ) | (! ( ( (tk(P286)) <= (tk(P9)) ) & ( ( (! ( ( (tk(P135)) <= (tk(P229)) ) & ( (tk(P362)) <= ( 1 ) ) )) & ( ( ( 1 ) <= (tk(P19)) ) | ( ( ( 1 ) <= (tk(P140)) ) & ( (tk(P56)) <= (tk(P222)) ) ) ) ) | ( ( ( ( ( 1 ) <= (tk(P330)) ) | ( (tk(P246)) <= (tk(P54)) ) ) & (! ( (tk(P231)) <= ( 0 ) )) ) & ( ( ( (tk(P22)) <= (tk(P189)) ) & ( ( 1 ) <= (tk(P325)) ) ) | ( ( ( 1 ) <= (tk(P319)) ) | ( (tk(P262)) <= ( 0 ) ) ) ) ) ) )) )) & ( ( (tk(P303)) <= (tk(P71)) ) & ( ( (tk(P353)) <= (tk(P84)) ) | ( (tk(P199)) <= (tk(P67)) ) ) ) )))
PROPERTY: BusinessProcesses-PT-05-ReachabilityCardinality-07 (reachable & potential((! ( (tk(P31)) <= (tk(P31)) ))))
PROPERTY: BusinessProcesses-PT-05-ReachabilityCardinality-08 (reachable &!potential( (! ( ( 1 ) <= (tk(P118)) ))))
PROPERTY: BusinessProcesses-PT-05-ReachabilityCardinality-09 (reachable &!potential( ( ( (tk(P277)) <= ( 1 ) ) & ( (tk(P285)) <= ( 0 ) ) )))
PROPERTY: BusinessProcesses-PT-05-ReachabilityCardinality-10 (reachable &!potential( ( (tk(P317)) <= ( 0 ) )))
PROPERTY: BusinessProcesses-PT-05-ReachabilityCardinality-11 (reachable &!potential( ( ( ( (tk(P312)) <= ( 1 ) ) & ( (tk(P26)) <= (tk(P178)) ) ) | ( (! ( ( (tk(P10)) <= (tk(P107)) ) | (! ( (tk(P61)) <= (tk(P121)) )) )) & ( (tk(P45)) <= ( 0 ) ) ) )))
PROPERTY: BusinessProcesses-PT-05-ReachabilityCardinality-12 (reachable &!potential( ( ( ( ( (! ( ( ( ( 1 ) <= (tk(P309)) ) | (! ( (tk(P321)) <= ( 0 ) )) ) & ( (tk(P14)) <= (tk(P30)) ) )) | ( (tk(P153)) <= (tk(P22)) ) ) & ( ( ( ( ( ( (tk(P24)) <= ( 0 ) ) | ( ( (tk(P345)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P145)) ) ) ) & ( ( ( 1 ) <= (tk(P308)) ) | ( (tk(P109)) <= ( 0 ) ) ) ) | ( ( (! ( ( 1 ) <= (tk(P88)) )) | ( ( (tk(P120)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P107)) ) ) ) & ( (tk(P300)) <= (tk(P1)) ) ) ) | (! ( (! ( (tk(P105)) <= ( 0 ) )) & ( ( 1 ) <= (tk(P56)) ) )) ) & ( ( (! ( ( ( (tk(P193)) <= (tk(P136)) ) & ( (tk(P307)) <= ( 1 ) ) ) & ( ( ( 1 ) <= (tk(P361)) ) & ( ( 1 ) <= (tk(P283)) ) ) )) | ( ( 1 ) <= (tk(P82)) ) ) & ( (tk(P332)) <= (tk(P135)) ) ) ) ) | ( ( (tk(P325)) <= (tk(P46)) ) & ( ( ( ( 1 ) <= (tk(P291)) ) | ( (tk(P6)) <= ( 1 ) ) ) | ( ( (! ( ( (tk(P274)) <= (tk(P62)) ) & (! ( ( 1 ) <= (tk(P39)) )) )) | ( ( (tk(P232)) <= (tk(P165)) ) & ( (tk(P44)) <= ( 0 ) ) ) ) | ( ( 1 ) <= (tk(P285)) ) ) ) ) ) & ( ( ( (! ( (! ( ( ( (tk(P300)) <= ( 0 ) ) | ( (tk(P94)) <= (tk(P215)) ) ) & (! ( (tk(P84)) <= (tk(P65)) )) )) | ( ( 1 ) <= (tk(P292)) ) )) & ( ( ( ( ( ( (tk(P264)) <= ( 0 ) ) | ( (tk(P96)) <= (tk(P132)) ) ) & ( (tk(P261)) <= (tk(P350)) ) ) | (! ( ( (tk(P357)) <= (tk(P308)) ) | ( (tk(P7)) <= (tk(P362)) ) )) ) & (! ( ( ( (tk(P256)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P76)) ) ) & ( ( (tk(P145)) <= (tk(P355)) ) | ( (tk(P316)) <= (tk(P170)) ) ) )) ) & ( (! ( (tk(P323)) <= (tk(P220)) )) | (! ( (tk(P71)) <= ( 0 ) )) ) ) ) & (! ( ( 1 ) <= (tk(P71)) )) ) | ( (! ( (tk(P345)) <= ( 1 ) )) | ( ( ( ( ( 1 ) <= (tk(P288)) ) | ( ( (! ( (tk(P342)) <= (tk(P320)) )) & ( ( ( 1 ) <= (tk(P101)) ) | ( ( 1 ) <= (tk(P61)) ) ) ) & ( ( (tk(P156)) <= (tk(P25)) ) | ( ( 1 ) <= (tk(P95)) ) ) ) ) & ( ( ( ( ( (tk(P356)) <= ( 0 ) ) | ( ( 1 ) <= (tk(P48)) ) ) | ( (tk(P17)) <= (tk(P85)) ) ) | ( ( 1 ) <= (tk(P135)) ) ) | ( ( 1 ) <= (tk(P8)) ) ) ) | ( (! ( ( 1 ) <= (tk(P322)) )) | ( (! ( (tk(P181)) <= (tk(P211)) )) | ( ( 1 ) <= (tk(P338)) ) ) ) ) ) ) )))
PROPERTY: BusinessProcesses-PT-05-ReachabilityCardinality-13 (reachable &!potential( ( ( ( ( (! ( (tk(P243)) <= (tk(P79)) )) & ( (! ( (! ( (tk(P254)) <= ( 1 ) )) | (! ( ( 1 ) <= (tk(P119)) )) )) & ( (! ( ( ( 1 ) <= (tk(P114)) ) & ( ( (tk(P271)) <= (tk(P84)) ) | ( ( 1 ) <= (tk(P70)) ) ) )) & ( (tk(P4)) <= (tk(P229)) ) ) ) ) & (! ( ( 1 ) <= (tk(P313)) )) ) & (! ( (tk(P207)) <= (tk(P253)) )) ) | ( (tk(P195)) <= (tk(P246)) ) )))
PROPERTY: BusinessProcesses-PT-05-ReachabilityCardinality-14 (reachable & potential((! ( ( (tk(P191)) <= (tk(P22)) ) & ( (! ( ( (! ( (tk(P151)) <= ( 1 ) )) & ( ( ( (tk(P95)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P125)) ) ) & ( ( (tk(P105)) <= ( 1 ) ) | ( (tk(P230)) <= ( 0 ) ) ) ) ) | (! ( (tk(P148)) <= ( 0 ) )) )) | ( ( ( (tk(P153)) <= ( 1 ) ) | (! ( ( ( ( 1 ) <= (tk(P39)) ) | ( (tk(P38)) <= (tk(P319)) ) ) | (! ( (tk(P220)) <= ( 0 ) )) )) ) & (! ( ( ( ( (tk(P315)) <= (tk(P197)) ) & ( (tk(P359)) <= (tk(P257)) ) ) | ( ( (tk(P83)) <= ( 0 ) ) & ( (tk(P157)) <= ( 0 ) ) ) ) & (! ( (tk(P61)) <= (tk(P36)) )) )) ) ) ))))
PROPERTY: BusinessProcesses-PT-05-ReachabilityCardinality-15 (reachable &!potential( ( ( (! ( ( ( 1 ) <= (tk(P312)) ) & (! ( ( ( (! ( (tk(P116)) <= (tk(P244)) )) & (! ( (tk(P237)) <= ( 1 ) )) ) & (! ( ( ( 1 ) <= (tk(P268)) ) | ( (tk(P17)) <= ( 1 ) ) )) ) & ( ( ( ( ( 1 ) <= (tk(P135)) ) & ( (tk(P48)) <= (tk(P7)) ) ) & ( ( (tk(P273)) <= ( 0 ) ) & ( (tk(P147)) <= (tk(P326)) ) ) ) & ( (tk(P11)) <= (tk(P53)) ) ) )) )) & (! ( ( ( ( 1 ) <= (tk(P195)) ) & ( ( ( (tk(P104)) <= (tk(P5)) ) & ( ( 1 ) <= (tk(P320)) ) ) | ( ( ( 1 ) <= (tk(P223)) ) | ( (! ( ( 1 ) <= (tk(P327)) )) | ( (tk(P109)) <= ( 0 ) ) ) ) ) ) & (! ( (tk(P192)) <= (tk(P70)) )) )) ) | (! ( ( 1 ) <= (tk(P217)) )) )))
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393352 kB
MemFree: 6446168 kB
After kill :
MemTotal: 16393352 kB
MemFree: 16107704 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 ReachabilityCardinality -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-05"
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 BusinessProcesses-PT-05, 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-167813696900486"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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