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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 7.4K Feb 25 16:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Feb 25 16:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Feb 25 16:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K 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.6K Feb 25 15:38 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K 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 16K Feb 25 15:38 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 16:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 123K Feb 25 16:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Feb 25 16:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 25 16:51 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 63K 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-03-ReachabilityCardinality-00
FORMULA_NAME BusinessProcesses-PT-03-ReachabilityCardinality-01
FORMULA_NAME BusinessProcesses-PT-03-ReachabilityCardinality-02
FORMULA_NAME BusinessProcesses-PT-03-ReachabilityCardinality-03
FORMULA_NAME BusinessProcesses-PT-03-ReachabilityCardinality-04
FORMULA_NAME BusinessProcesses-PT-03-ReachabilityCardinality-05
FORMULA_NAME BusinessProcesses-PT-03-ReachabilityCardinality-06
FORMULA_NAME BusinessProcesses-PT-03-ReachabilityCardinality-07
FORMULA_NAME BusinessProcesses-PT-03-ReachabilityCardinality-08
FORMULA_NAME BusinessProcesses-PT-03-ReachabilityCardinality-09
FORMULA_NAME BusinessProcesses-PT-03-ReachabilityCardinality-10
FORMULA_NAME BusinessProcesses-PT-03-ReachabilityCardinality-11
FORMULA_NAME BusinessProcesses-PT-03-ReachabilityCardinality-12
FORMULA_NAME BusinessProcesses-PT-03-ReachabilityCardinality-13
FORMULA_NAME BusinessProcesses-PT-03-ReachabilityCardinality-14
FORMULA_NAME BusinessProcesses-PT-03-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678789917175

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-03
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-14 10:31:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-14 10:31:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 10:31:59] [INFO ] Load time of PNML (sax parser for PT used): 77 ms
[2023-03-14 10:31:59] [INFO ] Transformed 274 places.
[2023-03-14 10:31:59] [INFO ] Transformed 237 transitions.
[2023-03-14 10:31:59] [INFO ] Found NUPN structural information;
[2023-03-14 10:31:59] [INFO ] Parsed PT model containing 274 places and 237 transitions and 632 arcs in 189 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 16 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-03-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-03-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 119 resets, run finished after 540 ms. (steps per millisecond=18 ) properties (out of 14) seen :4
FORMULA BusinessProcesses-PT-03-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-03-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-03-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-03-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 17 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 10) seen :1
FORMULA BusinessProcesses-PT-03-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 236 rows 273 cols
[2023-03-14 10:32:00] [INFO ] Computed 43 place invariants in 11 ms
[2023-03-14 10:32:01] [INFO ] After 458ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-14 10:32:01] [INFO ] [Nat]Absence check using 31 positive place invariants in 19 ms returned sat
[2023-03-14 10:32:01] [INFO ] [Nat]Absence check using 31 positive and 12 generalized place invariants in 4 ms returned sat
[2023-03-14 10:32:01] [INFO ] After 316ms SMT Verify possible using state equation in natural domain returned unsat :5 sat :4
[2023-03-14 10:32:02] [INFO ] Deduced a trap composed of 8 places in 136 ms of which 7 ms to minimize.
[2023-03-14 10:32:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 157 ms
[2023-03-14 10:32:02] [INFO ] Deduced a trap composed of 11 places in 84 ms of which 1 ms to minimize.
[2023-03-14 10:32:02] [INFO ] Deduced a trap composed of 14 places in 67 ms of which 2 ms to minimize.
[2023-03-14 10:32:02] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 1 ms to minimize.
[2023-03-14 10:32:02] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 1 ms to minimize.
[2023-03-14 10:32:02] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2023-03-14 10:32:02] [INFO ] Deduced a trap composed of 31 places in 70 ms of which 0 ms to minimize.
[2023-03-14 10:32:02] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 492 ms
[2023-03-14 10:32:02] [INFO ] Deduced a trap composed of 20 places in 161 ms of which 1 ms to minimize.
[2023-03-14 10:32:02] [INFO ] Deduced a trap composed of 18 places in 72 ms of which 1 ms to minimize.
[2023-03-14 10:32:03] [INFO ] Deduced a trap composed of 20 places in 78 ms of which 1 ms to minimize.
[2023-03-14 10:32:03] [INFO ] Deduced a trap composed of 40 places in 77 ms of which 1 ms to minimize.
[2023-03-14 10:32:03] [INFO ] Deduced a trap composed of 42 places in 163 ms of which 1 ms to minimize.
[2023-03-14 10:32:03] [INFO ] Deduced a trap composed of 72 places in 93 ms of which 1 ms to minimize.
[2023-03-14 10:32:03] [INFO ] Deduced a trap composed of 19 places in 85 ms of which 0 ms to minimize.
[2023-03-14 10:32:03] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 838 ms
[2023-03-14 10:32:03] [INFO ] After 1969ms SMT Verify possible using trap constraints in natural domain returned unsat :6 sat :3
Attempting to minimize the solution found.
Minimization took 70 ms.
[2023-03-14 10:32:03] [INFO ] After 2352ms SMT Verify possible using all constraints in natural domain returned unsat :6 sat :3
FORMULA BusinessProcesses-PT-03-ReachabilityCardinality-09 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-03-ReachabilityCardinality-07 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-03-ReachabilityCardinality-06 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-03-ReachabilityCardinality-03 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-03-ReachabilityCardinality-02 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-03-ReachabilityCardinality-01 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 9 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 39 ms.
Support contains 26 out of 273 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 273/273 places, 236/236 transitions.
Graph (trivial) has 141 edges and 273 vertex of which 8 / 273 are part of one of the 1 SCC in 5 ms
Free SCC test removed 7 places
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (complete) has 512 edges and 266 vertex of which 263 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 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 48 rules applied. Total rules applied 50 place count 263 transition count 177
Reduce places removed 47 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 51 rules applied. Total rules applied 101 place count 216 transition count 173
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 105 place count 212 transition count 173
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 32 Pre rules applied. Total rules applied 105 place count 212 transition count 141
Deduced a syphon composed of 32 places in 2 ms
Ensure Unique test removed 7 places
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 3 with 71 rules applied. Total rules applied 176 place count 173 transition count 141
Discarding 32 places :
Symmetric choice reduction at 3 with 32 rule applications. Total rules 208 place count 141 transition count 109
Iterating global reduction 3 with 32 rules applied. Total rules applied 240 place count 141 transition count 109
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 240 place count 141 transition count 108
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 242 place count 140 transition count 108
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 3 with 72 rules applied. Total rules applied 314 place count 104 transition count 72
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 315 place count 103 transition count 71
Applied a total of 315 rules in 88 ms. Remains 103 /273 variables (removed 170) and now considering 71/236 (removed 165) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 90 ms. Remains : 103/273 places, 71/236 transitions.
Incomplete random walk after 10000 steps, including 211 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 3) seen :2
FORMULA BusinessProcesses-PT-03-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-03-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Finished Best-First random walk after 718 steps, including 5 resets, run visited all 1 properties in 3 ms. (steps per millisecond=239 )
FORMULA BusinessProcesses-PT-03-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
All properties solved without resorting to model-checking.
Total runtime 4663 ms.
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running BusinessProcesses (PT), instance 03
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: 274 places, 237 transitions, 632 arcs.
Final Score: 6959.629
Took : 6 seconds
Reachability Cardinality file is: ReachabilityCardinality.xml
READY TO PARSE. BS
PROPERTY: BusinessProcesses-PT-03-ReachabilityCardinality-00 (reachable &!potential( ( (! ( ( 1 ) <= (tk(P190)) )) | (! ( ( ( ( (tk(P214)) <= (tk(P110)) ) | ( (! ( ( 1 ) <= (tk(P100)) )) | ( ( ( 1 ) <= (tk(P199)) ) & ( ( 1 ) <= (tk(P30)) ) ) ) ) & (! ( ( (tk(P153)) <= ( 0 ) ) & ( ( (tk(P224)) <= (tk(P236)) ) | ( ( 1 ) <= (tk(P188)) ) ) )) ) & ( (tk(P196)) <= (tk(P187)) ) )) )))
PROPERTY: BusinessProcesses-PT-03-ReachabilityCardinality-01 (reachable & potential(( ( ( (tk(P126)) <= (tk(P62)) ) & ( ( 1 ) <= (tk(P224)) ) ) & ( ( ( ( ( ( (tk(P184)) <= ( 0 ) ) & ( (! ( (tk(P193)) <= (tk(P252)) )) | (! ( (tk(P67)) <= (tk(P142)) )) ) ) & ( ( ( ( ( (tk(P53)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P55)) ) ) & ( ( (tk(P70)) <= (tk(P5)) ) & ( ( 1 ) <= (tk(P249)) ) ) ) | (! ( ( 1 ) <= (tk(P249)) )) ) | ( (tk(P6)) <= (tk(P63)) ) ) ) | ( (! ( (tk(P49)) <= (tk(P205)) )) | ( (! ( ( (tk(P179)) <= (tk(P22)) ) | ( ( 1 ) <= (tk(P91)) ) )) | ( (tk(P216)) <= (tk(P3)) ) ) ) ) & ( ( 1 ) <= (tk(P6)) ) ) | ( (! ( (tk(P162)) <= (tk(P74)) )) & (! ( (tk(P6)) <= ( 0 ) )) ) ) )))
PROPERTY: BusinessProcesses-PT-03-ReachabilityCardinality-02 (reachable & potential(( ( ( 1 ) <= (tk(P6)) ) & (! ( ( ( ( (! ( ( ( 1 ) <= (tk(P113)) ) | ( (tk(P259)) <= (tk(P228)) ) )) | ( ( (! ( (tk(P159)) <= ( 1 ) )) | ( ( (tk(P218)) <= (tk(P268)) ) | ( (tk(P259)) <= ( 0 ) ) ) ) & (! ( ( (tk(P129)) <= (tk(P29)) ) | ( (tk(P274)) <= ( 1 ) ) )) ) ) & ( ( ( ( ( (tk(P199)) <= ( 0 ) ) | ( ( 1 ) <= (tk(P129)) ) ) | ( (tk(P99)) <= (tk(P112)) ) ) & (! ( ( 1 ) <= (tk(P221)) )) ) | ( ( ( ( ( 1 ) <= (tk(P170)) ) | ( ( 1 ) <= (tk(P72)) ) ) & ( ( (tk(P112)) <= (tk(P38)) ) | ( (tk(P175)) <= ( 1 ) ) ) ) | ( ( ( (tk(P123)) <= ( 1 ) ) & ( (tk(P180)) <= ( 1 ) ) ) | ( (tk(P132)) <= ( 0 ) ) ) ) ) ) | ( ( ( 1 ) <= (tk(P4)) ) & (! ( (tk(P29)) <= ( 0 ) )) ) ) | ( ( ( (! ( ( ( 1 ) <= (tk(P141)) ) & ( ( ( 1 ) <= (tk(P86)) ) & ( (tk(P189)) <= (tk(P189)) ) ) )) & ( (! ( ( (tk(P155)) <= (tk(P175)) ) & ( (tk(P86)) <= (tk(P46)) ) )) | ( ( ( (tk(P62)) <= ( 1 ) ) & ( (tk(P23)) <= ( 1 ) ) ) | ( (tk(P223)) <= ( 0 ) ) ) ) ) | ( ( 1 ) <= (tk(P56)) ) ) | ( ( 1 ) <= (tk(P5)) ) ) )) )))
PROPERTY: BusinessProcesses-PT-03-ReachabilityCardinality-03 (reachable &!potential( (! ( (! ( ( ( (! ( ( 1 ) <= (tk(P260)) )) & (! ( ( ( 1 ) <= (tk(P102)) ) & ( (tk(P73)) <= (tk(P7)) ) )) ) | ( (! ( ( ( ( 1 ) <= (tk(P215)) ) & ( (tk(P62)) <= (tk(P204)) ) ) & ( (tk(P6)) <= (tk(P123)) ) )) | ( (tk(P250)) <= (tk(P39)) ) ) ) & ( ( ( ( ( ( ( 1 ) <= (tk(P234)) ) | ( ( 1 ) <= (tk(P213)) ) ) & ( ( ( 1 ) <= (tk(P106)) ) & ( ( 1 ) <= (tk(P77)) ) ) ) & ( ( ( (tk(P199)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P173)) ) ) & ( ( 1 ) <= (tk(P257)) ) ) ) & (! ( ( (tk(P266)) <= (tk(P193)) ) & ( (tk(P59)) <= (tk(P50)) ) )) ) | ( ( (! ( ( 1 ) <= (tk(P18)) )) | ( ( ( (tk(P76)) <= ( 1 ) ) | ( ( 1 ) <= (tk(P17)) ) ) & (! ( ( 1 ) <= (tk(P182)) )) ) ) | ( (! ( ( (tk(P248)) <= (tk(P261)) ) & ( (tk(P143)) <= (tk(P239)) ) )) | ( ( (tk(P184)) <= ( 0 ) ) | ( (tk(P116)) <= ( 1 ) ) ) ) ) ) )) | ( (! ( ( (tk(P228)) <= ( 1 ) ) & ( ( (tk(P159)) <= ( 0 ) ) & (! ( (! ( (tk(P232)) <= ( 0 ) )) & ( (tk(P96)) <= (tk(P101)) ) )) ) )) & ( ( ( (tk(P62)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P106)) ) ) & (! ( ( (tk(P54)) <= (tk(P221)) ) | (! ( (tk(P254)) <= ( 0 ) )) )) ) ) ))))
PROPERTY: BusinessProcesses-PT-03-ReachabilityCardinality-04 (reachable &!potential( ( (tk(P92)) <= (tk(P221)) )))
PROPERTY: BusinessProcesses-PT-03-ReachabilityCardinality-05 (reachable & potential((! ( (! ( ( ( (! ( ( ( 1 ) <= (tk(P194)) ) | ( (tk(P211)) <= ( 0 ) ) )) & ( ( ( (tk(P6)) <= ( 1 ) ) | ( ( 1 ) <= (tk(P136)) ) ) | ( ( ( 1 ) <= (tk(P55)) ) | ( (tk(P201)) <= (tk(P143)) ) ) ) ) & ( (! ( ( ( 1 ) <= (tk(P56)) ) | ( ( 1 ) <= (tk(P102)) ) )) | ( (! ( ( 1 ) <= (tk(P248)) )) & ( ( (tk(P84)) <= ( 0 ) ) & ( (tk(P71)) <= (tk(P228)) ) ) ) ) ) & ( ( ( 1 ) <= (tk(P119)) ) & ( ( ( ( (tk(P227)) <= (tk(P3)) ) & ( (tk(P245)) <= ( 0 ) ) ) & ( (tk(P29)) <= (tk(P3)) ) ) & ( ( ( (tk(P144)) <= ( 0 ) ) & ( ( 1 ) <= (tk(P160)) ) ) & ( ( (tk(P233)) <= ( 1 ) ) | ( (tk(P130)) <= ( 0 ) ) ) ) ) ) )) & (! ( (! ( ( ( 1 ) <= (tk(P193)) ) & (! ( ( 1 ) <= (tk(P269)) )) )) & ( ( ( 1 ) <= (tk(P32)) ) & ( ( (! ( ( 1 ) <= (tk(P102)) )) & ( (tk(P194)) <= (tk(P259)) ) ) & ( ( ( ( 1 ) <= (tk(P132)) ) | ( (tk(P92)) <= (tk(P97)) ) ) & (! ( (tk(P147)) <= ( 0 ) )) ) ) ) )) ))))
PROPERTY: BusinessProcesses-PT-03-ReachabilityCardinality-06 (reachable &!potential( ( (! ( (! ( ( ( 1 ) <= (tk(P101)) ) | ( ( ( ( (tk(P69)) <= (tk(P166)) ) | ( ( 1 ) <= (tk(P204)) ) ) & ( ( ( 1 ) <= (tk(P114)) ) | ( (tk(P85)) <= ( 1 ) ) ) ) | ( (! ( (tk(P23)) <= ( 0 ) )) & ( ( (tk(P11)) <= ( 0 ) ) | ( ( 1 ) <= (tk(P144)) ) ) ) ) )) & ( (tk(P123)) <= (tk(P87)) ) )) | (! ( ( ( ( ( ( (! ( (tk(P19)) <= ( 0 ) )) | ( ( 1 ) <= (tk(P225)) ) ) | ( ( 1 ) <= (tk(P98)) ) ) | ( ( ( ( ( 1 ) <= (tk(P256)) ) & ( (tk(P258)) <= ( 0 ) ) ) & ( ( (tk(P80)) <= (tk(P152)) ) & ( (tk(P76)) <= ( 1 ) ) ) ) & ( ( 1 ) <= (tk(P79)) ) ) ) & ( ( (tk(P238)) <= (tk(P71)) ) & ( ( ( (tk(P270)) <= (tk(P246)) ) | (! ( (tk(P161)) <= ( 1 ) )) ) | ( ( 1 ) <= (tk(P25)) ) ) ) ) & (! ( ( (tk(P250)) <= (tk(P11)) ) | ( (tk(P215)) <= (tk(P17)) ) )) ) | (! ( (tk(P270)) <= (tk(P250)) )) )) )))
PROPERTY: BusinessProcesses-PT-03-ReachabilityCardinality-07 (reachable & potential((! ( ( (tk(P142)) <= ( 1 ) ) & (! ( ( ( ( 1 ) <= (tk(P31)) ) | ( ( (! ( ( (tk(P11)) <= (tk(P192)) ) | ( (tk(P55)) <= ( 0 ) ) )) & (! ( ( (tk(P83)) <= (tk(P127)) ) & ( (tk(P198)) <= (tk(P119)) ) )) ) & ( (tk(P54)) <= (tk(P175)) ) ) ) & ( ( 1 ) <= (tk(P190)) ) )) ))))
PROPERTY: BusinessProcesses-PT-03-ReachabilityCardinality-08 (reachable &!potential( (! ( ( 1 ) <= (tk(P236)) ))))
PROPERTY: BusinessProcesses-PT-03-ReachabilityCardinality-09 (reachable &!potential( (! ( ( ( ( 1 ) <= (tk(P221)) ) | ( ( ( ( (! ( ( ( 1 ) <= (tk(P57)) ) & ( ( 1 ) <= (tk(P122)) ) )) & (! ( (tk(P96)) <= ( 1 ) )) ) & (! ( ( 1 ) <= (tk(P247)) )) ) | (! ( (tk(P132)) <= ( 0 ) )) ) | ( ( (tk(P78)) <= ( 0 ) ) | (! ( ( ( ( (tk(P44)) <= (tk(P257)) ) & ( (tk(P223)) <= (tk(P108)) ) ) | ( (tk(P66)) <= (tk(P55)) ) ) | ( ( ( (tk(P46)) <= ( 0 ) ) | ( (tk(P97)) <= (tk(P79)) ) ) | ( ( 1 ) <= (tk(P85)) ) ) )) ) ) ) & ( ( (! ( (tk(P11)) <= (tk(P119)) )) & ( ( ( ( (tk(P146)) <= ( 1 ) ) | ( ( 1 ) <= (tk(P50)) ) ) | ( (! ( ( (tk(P76)) <= ( 0 ) ) | ( ( 1 ) <= (tk(P230)) ) )) | ( ( (tk(P165)) <= ( 0 ) ) | ( ( 1 ) <= (tk(P35)) ) ) ) ) | ( (! ( (! ( ( 1 ) <= (tk(P238)) )) & ( ( (tk(P25)) <= (tk(P207)) ) & ( ( 1 ) <= (tk(P113)) ) ) )) & ( (! ( ( 1 ) <= (tk(P109)) )) | ( (tk(P56)) <= ( 0 ) ) ) ) ) ) & (! ( ( ( ( (! ( (tk(P232)) <= (tk(P154)) )) & (! ( (tk(P44)) <= (tk(P180)) )) ) & ( (tk(P135)) <= ( 1 ) ) ) & (! ( ( 1 ) <= (tk(P81)) )) ) | ( ( (tk(P69)) <= (tk(P124)) ) | ( (! ( ( (tk(P221)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P248)) ) )) & ( (tk(P271)) <= (tk(P1)) ) ) ) )) ) ))))
PROPERTY: BusinessProcesses-PT-03-ReachabilityCardinality-10 (reachable &!potential( ( (tk(P75)) <= (tk(P108)) )))
PROPERTY: BusinessProcesses-PT-03-ReachabilityCardinality-11 (reachable & potential(( ( 1 ) <= (tk(P272)) )))
PROPERTY: BusinessProcesses-PT-03-ReachabilityCardinality-12 (reachable &!potential( ( ( ( (tk(P96)) <= (tk(P213)) ) | ( ( ( 1 ) <= (tk(P227)) ) & ( ( 1 ) <= (tk(P102)) ) ) ) & ( ( (tk(P262)) <= (tk(P64)) ) & ( ( (! ( (! ( ( ( 1 ) <= (tk(P125)) ) | ( (tk(P77)) <= ( 1 ) ) )) | ( (! ( ( (tk(P272)) <= (tk(P65)) ) & ( ( 1 ) <= (tk(P239)) ) )) & ( ( (tk(P162)) <= ( 1 ) ) & ( ( (tk(P107)) <= (tk(P189)) ) & ( ( 1 ) <= (tk(P60)) ) ) ) ) )) & ( ( ( (tk(P62)) <= (tk(P89)) ) & ( (tk(P251)) <= (tk(P234)) ) ) | ( (! ( ( (tk(P210)) <= (tk(P178)) ) | ( ( ( 1 ) <= (tk(P215)) ) | ( (tk(P197)) <= (tk(P154)) ) ) )) & ( ( ( 1 ) <= (tk(P189)) ) & ( ( ( ( 1 ) <= (tk(P97)) ) & ( ( 1 ) <= (tk(P122)) ) ) | ( ( 1 ) <= (tk(P180)) ) ) ) ) ) ) | ( ( ( ( ( ( 1 ) <= (tk(P204)) ) | ( ( ( (tk(P200)) <= ( 1 ) ) | ( (tk(P53)) <= ( 0 ) ) ) & ( (tk(P38)) <= ( 1 ) ) ) ) & ( ( ( ( (tk(P117)) <= ( 1 ) ) | ( (tk(P64)) <= ( 0 ) ) ) & ( ( (tk(P160)) <= (tk(P157)) ) & ( (tk(P33)) <= ( 1 ) ) ) ) & (! ( (tk(P232)) <= (tk(P242)) )) ) ) & ( ( ( (tk(P201)) <= ( 0 ) ) & ( (! ( ( 1 ) <= (tk(P6)) )) & ( ( (tk(P221)) <= (tk(P246)) ) | ( (tk(P184)) <= (tk(P17)) ) ) ) ) & ( ( (tk(P141)) <= (tk(P253)) ) & (! ( ( (tk(P151)) <= ( 1 ) ) | ( ( 1 ) <= (tk(P199)) ) )) ) ) ) & ( (! ( ( ( ( ( 1 ) <= (tk(P59)) ) | ( ( 1 ) <= (tk(P146)) ) ) & (! ( (tk(P204)) <= ( 1 ) )) ) & (! ( (tk(P30)) <= (tk(P174)) )) )) & ( (tk(P208)) <= ( 1 ) ) ) ) ) ) )))
PROPERTY: BusinessProcesses-PT-03-ReachabilityCardinality-13 (reachable &!potential( ( (! ( ( (tk(P146)) <= ( 1 ) ) & ( ( ( (tk(P153)) <= (tk(P135)) ) | ( ( ( ( ( (tk(P116)) <= ( 0 ) ) & ( (tk(P156)) <= ( 1 ) ) ) & ( ( ( 1 ) <= (tk(P83)) ) & ( (tk(P171)) <= ( 0 ) ) ) ) | ( ( ( (tk(P85)) <= (tk(P255)) ) | ( (tk(P143)) <= (tk(P53)) ) ) | (! ( (tk(P96)) <= ( 0 ) )) ) ) | ( (tk(P225)) <= (tk(P255)) ) ) ) | (! ( (tk(P42)) <= ( 0 ) )) ) )) | ( (tk(P130)) <= ( 1 ) ) )))
PROPERTY: BusinessProcesses-PT-03-ReachabilityCardinality-14 (reachable &!potential( ( ( (tk(P22)) <= (tk(P5)) ) | ( (tk(P201)) <= ( 1 ) ) )))
PROPERTY: BusinessProcesses-PT-03-ReachabilityCardinality-15 (reachable & potential(( (! ( (tk(P121)) <= (tk(P159)) )) | ( ( 1 ) <= (tk(P59)) ) )))
FORMULA BusinessProcesses-PT-03-ReachabilityCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA BusinessProcesses-PT-03-ReachabilityCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA BusinessProcesses-PT-03-ReachabilityCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA BusinessProcesses-PT-03-ReachabilityCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA BusinessProcesses-PT-03-ReachabilityCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA BusinessProcesses-PT-03-ReachabilityCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA BusinessProcesses-PT-03-ReachabilityCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA BusinessProcesses-PT-03-ReachabilityCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA BusinessProcesses-PT-03-ReachabilityCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA BusinessProcesses-PT-03-ReachabilityCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA BusinessProcesses-PT-03-ReachabilityCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA BusinessProcesses-PT-03-ReachabilityCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA BusinessProcesses-PT-03-ReachabilityCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA BusinessProcesses-PT-03-ReachabilityCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA BusinessProcesses-PT-03-ReachabilityCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA BusinessProcesses-PT-03-ReachabilityCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS

BK_STOP 1678790003101

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ 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

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-03"
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-03, 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-167813696900470"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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