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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 564K
-rw-r--r-- 1 mcc users 8.0K Feb 25 16:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K Feb 25 16:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Feb 25 16:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K 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 25K 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 12K Feb 25 16:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 130K Feb 25 16:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Feb 25 16:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K Feb 25 16:52 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-06-ReachabilityCardinality-00
FORMULA_NAME BusinessProcesses-PT-06-ReachabilityCardinality-01
FORMULA_NAME BusinessProcesses-PT-06-ReachabilityCardinality-02
FORMULA_NAME BusinessProcesses-PT-06-ReachabilityCardinality-03
FORMULA_NAME BusinessProcesses-PT-06-ReachabilityCardinality-04
FORMULA_NAME BusinessProcesses-PT-06-ReachabilityCardinality-05
FORMULA_NAME BusinessProcesses-PT-06-ReachabilityCardinality-06
FORMULA_NAME BusinessProcesses-PT-06-ReachabilityCardinality-07
FORMULA_NAME BusinessProcesses-PT-06-ReachabilityCardinality-08
FORMULA_NAME BusinessProcesses-PT-06-ReachabilityCardinality-09
FORMULA_NAME BusinessProcesses-PT-06-ReachabilityCardinality-10
FORMULA_NAME BusinessProcesses-PT-06-ReachabilityCardinality-11
FORMULA_NAME BusinessProcesses-PT-06-ReachabilityCardinality-12
FORMULA_NAME BusinessProcesses-PT-06-ReachabilityCardinality-13
FORMULA_NAME BusinessProcesses-PT-06-ReachabilityCardinality-14
FORMULA_NAME BusinessProcesses-PT-06-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678790246446

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-06
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-14 10:37:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-14 10:37:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 10:37:29] [INFO ] Load time of PNML (sax parser for PT used): 57 ms
[2023-03-14 10:37:29] [INFO ] Transformed 376 places.
[2023-03-14 10:37:29] [INFO ] Transformed 297 transitions.
[2023-03-14 10:37:29] [INFO ] Found NUPN structural information;
[2023-03-14 10:37:29] [INFO ] Parsed PT model containing 376 places and 297 transitions and 830 arcs in 130 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 1 transitions.
FORMULA BusinessProcesses-PT-06-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-06-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-06-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 100 resets, run finished after 293 ms. (steps per millisecond=34 ) properties (out of 13) seen :11
FORMULA BusinessProcesses-PT-06-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-06-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-06-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-06-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-06-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-06-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-06-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-06-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-06-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-06-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-06-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 296 rows 375 cols
[2023-03-14 10:37:29] [INFO ] Computed 81 place invariants in 37 ms
[2023-03-14 10:37:30] [INFO ] After 308ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-14 10:37:30] [INFO ] [Nat]Absence check using 42 positive place invariants in 18 ms returned sat
[2023-03-14 10:37:30] [INFO ] [Nat]Absence check using 42 positive and 39 generalized place invariants in 16 ms returned sat
[2023-03-14 10:37:30] [INFO ] After 164ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2023-03-14 10:37:30] [INFO ] Deduced a trap composed of 74 places in 115 ms of which 6 ms to minimize.
[2023-03-14 10:37:30] [INFO ] Deduced a trap composed of 8 places in 94 ms of which 0 ms to minimize.
[2023-03-14 10:37:30] [INFO ] Deduced a trap composed of 17 places in 88 ms of which 1 ms to minimize.
[2023-03-14 10:37:30] [INFO ] Deduced a trap composed of 11 places in 85 ms of which 2 ms to minimize.
[2023-03-14 10:37:30] [INFO ] Deduced a trap composed of 78 places in 79 ms of which 1 ms to minimize.
[2023-03-14 10:37:31] [INFO ] Deduced a trap composed of 83 places in 95 ms of which 1 ms to minimize.
[2023-03-14 10:37:31] [INFO ] Deduced a trap composed of 80 places in 79 ms of which 1 ms to minimize.
[2023-03-14 10:37:31] [INFO ] Deduced a trap composed of 86 places in 73 ms of which 1 ms to minimize.
[2023-03-14 10:37:31] [INFO ] Deduced a trap composed of 83 places in 79 ms of which 1 ms to minimize.
[2023-03-14 10:37:31] [INFO ] Deduced a trap composed of 82 places in 113 ms of which 1 ms to minimize.
[2023-03-14 10:37:31] [INFO ] Deduced a trap composed of 20 places in 98 ms of which 1 ms to minimize.
[2023-03-14 10:37:31] [INFO ] Deduced a trap composed of 75 places in 117 ms of which 1 ms to minimize.
[2023-03-14 10:37:31] [INFO ] Deduced a trap composed of 90 places in 117 ms of which 0 ms to minimize.
[2023-03-14 10:37:32] [INFO ] Deduced a trap composed of 82 places in 120 ms of which 1 ms to minimize.
[2023-03-14 10:37:32] [INFO ] Deduced a trap composed of 83 places in 92 ms of which 0 ms to minimize.
[2023-03-14 10:37:32] [INFO ] Deduced a trap composed of 23 places in 125 ms of which 1 ms to minimize.
[2023-03-14 10:37:32] [INFO ] Deduced a trap composed of 77 places in 124 ms of which 0 ms to minimize.
[2023-03-14 10:37:32] [INFO ] Deduced a trap composed of 86 places in 94 ms of which 1 ms to minimize.
[2023-03-14 10:37:32] [INFO ] Deduced a trap composed of 79 places in 91 ms of which 0 ms to minimize.
[2023-03-14 10:37:32] [INFO ] Deduced a trap composed of 79 places in 123 ms of which 0 ms to minimize.
[2023-03-14 10:37:33] [INFO ] Deduced a trap composed of 79 places in 100 ms of which 0 ms to minimize.
[2023-03-14 10:37:33] [INFO ] Deduced a trap composed of 77 places in 104 ms of which 0 ms to minimize.
[2023-03-14 10:37:33] [INFO ] Deduced a trap composed of 79 places in 99 ms of which 1 ms to minimize.
[2023-03-14 10:37:33] [INFO ] Deduced a trap composed of 79 places in 103 ms of which 1 ms to minimize.
[2023-03-14 10:37:33] [INFO ] Deduced a trap composed of 77 places in 90 ms of which 1 ms to minimize.
[2023-03-14 10:37:33] [INFO ] Deduced a trap composed of 23 places in 118 ms of which 0 ms to minimize.
[2023-03-14 10:37:33] [INFO ] Deduced a trap composed of 87 places in 109 ms of which 1 ms to minimize.
[2023-03-14 10:37:34] [INFO ] Deduced a trap composed of 77 places in 96 ms of which 1 ms to minimize.
[2023-03-14 10:37:34] [INFO ] Deduced a trap composed of 83 places in 88 ms of which 1 ms to minimize.
[2023-03-14 10:37:34] [INFO ] Deduced a trap composed of 81 places in 84 ms of which 0 ms to minimize.
[2023-03-14 10:37:34] [INFO ] Deduced a trap composed of 82 places in 89 ms of which 0 ms to minimize.
[2023-03-14 10:37:34] [INFO ] Deduced a trap composed of 20 places in 128 ms of which 1 ms to minimize.
[2023-03-14 10:37:34] [INFO ] Deduced a trap composed of 82 places in 90 ms of which 0 ms to minimize.
[2023-03-14 10:37:34] [INFO ] Deduced a trap composed of 82 places in 95 ms of which 0 ms to minimize.
[2023-03-14 10:37:35] [INFO ] Deduced a trap composed of 81 places in 96 ms of which 1 ms to minimize.
[2023-03-14 10:37:35] [INFO ] Deduced a trap composed of 82 places in 132 ms of which 1 ms to minimize.
[2023-03-14 10:37:35] [INFO ] Deduced a trap composed of 79 places in 89 ms of which 0 ms to minimize.
[2023-03-14 10:37:35] [INFO ] Deduced a trap composed of 86 places in 91 ms of which 1 ms to minimize.
[2023-03-14 10:37:35] [INFO ] Deduced a trap composed of 80 places in 95 ms of which 0 ms to minimize.
[2023-03-14 10:37:35] [INFO ] Deduced a trap composed of 82 places in 128 ms of which 2 ms to minimize.
[2023-03-14 10:37:35] [INFO ] Deduced a trap composed of 81 places in 122 ms of which 1 ms to minimize.
[2023-03-14 10:37:36] [INFO ] Deduced a trap composed of 78 places in 116 ms of which 1 ms to minimize.
[2023-03-14 10:37:36] [INFO ] Deduced a trap composed of 78 places in 105 ms of which 1 ms to minimize.
[2023-03-14 10:37:36] [INFO ] Deduced a trap composed of 75 places in 97 ms of which 0 ms to minimize.
[2023-03-14 10:37:36] [INFO ] Deduced a trap composed of 84 places in 93 ms of which 1 ms to minimize.
[2023-03-14 10:37:36] [INFO ] Deduced a trap composed of 83 places in 95 ms of which 0 ms to minimize.
[2023-03-14 10:37:36] [INFO ] Deduced a trap composed of 78 places in 91 ms of which 1 ms to minimize.
[2023-03-14 10:37:36] [INFO ] Deduced a trap composed of 78 places in 119 ms of which 0 ms to minimize.
[2023-03-14 10:37:37] [INFO ] Deduced a trap composed of 83 places in 106 ms of which 1 ms to minimize.
[2023-03-14 10:37:37] [INFO ] Deduced a trap composed of 78 places in 112 ms of which 0 ms to minimize.
[2023-03-14 10:37:37] [INFO ] Deduced a trap composed of 85 places in 124 ms of which 1 ms to minimize.
[2023-03-14 10:37:37] [INFO ] Deduced a trap composed of 80 places in 115 ms of which 1 ms to minimize.
[2023-03-14 10:37:37] [INFO ] Deduced a trap composed of 83 places in 122 ms of which 2 ms to minimize.
[2023-03-14 10:37:37] [INFO ] Deduced a trap composed of 80 places in 120 ms of which 0 ms to minimize.
[2023-03-14 10:37:38] [INFO ] Deduced a trap composed of 83 places in 115 ms of which 1 ms to minimize.
[2023-03-14 10:37:38] [INFO ] Deduced a trap composed of 79 places in 106 ms of which 1 ms to minimize.
[2023-03-14 10:37:38] [INFO ] Deduced a trap composed of 78 places in 91 ms of which 1 ms to minimize.
[2023-03-14 10:37:38] [INFO ] Deduced a trap composed of 81 places in 103 ms of which 0 ms to minimize.
[2023-03-14 10:37:38] [INFO ] Deduced a trap composed of 83 places in 95 ms of which 0 ms to minimize.
[2023-03-14 10:37:38] [INFO ] Deduced a trap composed of 83 places in 94 ms of which 1 ms to minimize.
[2023-03-14 10:37:38] [INFO ] Deduced a trap composed of 88 places in 108 ms of which 0 ms to minimize.
[2023-03-14 10:37:39] [INFO ] Deduced a trap composed of 83 places in 112 ms of which 1 ms to minimize.
[2023-03-14 10:37:39] [INFO ] Deduced a trap composed of 81 places in 107 ms of which 0 ms to minimize.
[2023-03-14 10:37:39] [INFO ] Deduced a trap composed of 19 places in 105 ms of which 1 ms to minimize.
[2023-03-14 10:37:39] [INFO ] Deduced a trap composed of 83 places in 138 ms of which 1 ms to minimize.
[2023-03-14 10:37:39] [INFO ] Deduced a trap composed of 80 places in 127 ms of which 4 ms to minimize.
[2023-03-14 10:37:39] [INFO ] Deduced a trap composed of 83 places in 128 ms of which 0 ms to minimize.
[2023-03-14 10:37:40] [INFO ] Deduced a trap composed of 84 places in 95 ms of which 0 ms to minimize.
[2023-03-14 10:37:40] [INFO ] Deduced a trap composed of 89 places in 120 ms of which 5 ms to minimize.
[2023-03-14 10:37:40] [INFO ] Deduced a trap composed of 80 places in 119 ms of which 0 ms to minimize.
[2023-03-14 10:37:40] [INFO ] Deduced a trap composed of 82 places in 124 ms of which 1 ms to minimize.
[2023-03-14 10:37:40] [INFO ] Deduced a trap composed of 78 places in 99 ms of which 1 ms to minimize.
[2023-03-14 10:37:40] [INFO ] Deduced a trap composed of 76 places in 101 ms of which 0 ms to minimize.
[2023-03-14 10:37:40] [INFO ] Deduced a trap composed of 84 places in 111 ms of which 0 ms to minimize.
[2023-03-14 10:37:41] [INFO ] Deduced a trap composed of 21 places in 114 ms of which 0 ms to minimize.
[2023-03-14 10:37:41] [INFO ] Deduced a trap composed of 81 places in 106 ms of which 1 ms to minimize.
[2023-03-14 10:37:41] [INFO ] Deduced a trap composed of 85 places in 101 ms of which 0 ms to minimize.
[2023-03-14 10:37:41] [INFO ] Deduced a trap composed of 81 places in 133 ms of which 1 ms to minimize.
[2023-03-14 10:37:41] [INFO ] Deduced a trap composed of 89 places in 81 ms of which 0 ms to minimize.
[2023-03-14 10:37:41] [INFO ] Deduced a trap composed of 86 places in 126 ms of which 1 ms to minimize.
[2023-03-14 10:37:42] [INFO ] Deduced a trap composed of 20 places in 124 ms of which 0 ms to minimize.
[2023-03-14 10:37:42] [INFO ] Deduced a trap composed of 86 places in 106 ms of which 0 ms to minimize.
[2023-03-14 10:37:42] [INFO ] Deduced a trap composed of 92 places in 97 ms of which 0 ms to minimize.
[2023-03-14 10:37:42] [INFO ] Deduced a trap composed of 83 places in 117 ms of which 0 ms to minimize.
[2023-03-14 10:37:42] [INFO ] Deduced a trap composed of 19 places in 120 ms of which 0 ms to minimize.
[2023-03-14 10:37:43] [INFO ] Deduced a trap composed of 85 places in 106 ms of which 1 ms to minimize.
[2023-03-14 10:37:43] [INFO ] Deduced a trap composed of 88 places in 124 ms of which 0 ms to minimize.
[2023-03-14 10:37:43] [INFO ] Deduced a trap composed of 82 places in 116 ms of which 1 ms to minimize.
[2023-03-14 10:37:43] [INFO ] Deduced a trap composed of 79 places in 119 ms of which 0 ms to minimize.
[2023-03-14 10:37:43] [INFO ] Deduced a trap composed of 89 places in 109 ms of which 1 ms to minimize.
[2023-03-14 10:37:43] [INFO ] Deduced a trap composed of 83 places in 108 ms of which 1 ms to minimize.
[2023-03-14 10:37:44] [INFO ] Deduced a trap composed of 84 places in 130 ms of which 1 ms to minimize.
[2023-03-14 10:37:45] [INFO ] Deduced a trap composed of 15 places in 116 ms of which 0 ms to minimize.
[2023-03-14 10:37:45] [INFO ] Deduced a trap composed of 80 places in 109 ms of which 1 ms to minimize.
[2023-03-14 10:37:45] [INFO ] Deduced a trap composed of 78 places in 86 ms of which 1 ms to minimize.
[2023-03-14 10:37:45] [INFO ] Deduced a trap composed of 79 places in 81 ms of which 1 ms to minimize.
[2023-03-14 10:37:45] [INFO ] Deduced a trap composed of 86 places in 98 ms of which 0 ms to minimize.
[2023-03-14 10:37:46] [INFO ] Deduced a trap composed of 88 places in 122 ms of which 0 ms to minimize.
[2023-03-14 10:37:46] [INFO ] Deduced a trap composed of 84 places in 113 ms of which 1 ms to minimize.
[2023-03-14 10:37:46] [INFO ] Deduced a trap composed of 83 places in 78 ms of which 1 ms to minimize.
[2023-03-14 10:37:46] [INFO ] Deduced a trap composed of 85 places in 114 ms of which 1 ms to minimize.
[2023-03-14 10:37:46] [INFO ] Deduced a trap composed of 85 places in 130 ms of which 0 ms to minimize.
[2023-03-14 10:37:46] [INFO ] Deduced a trap composed of 80 places in 119 ms of which 0 ms to minimize.
[2023-03-14 10:37:47] [INFO ] Deduced a trap composed of 84 places in 125 ms of which 0 ms to minimize.
[2023-03-14 10:37:47] [INFO ] Deduced a trap composed of 95 places in 102 ms of which 0 ms to minimize.
[2023-03-14 10:37:47] [INFO ] Deduced a trap composed of 80 places in 116 ms of which 1 ms to minimize.
[2023-03-14 10:37:47] [INFO ] Deduced a trap composed of 85 places in 106 ms of which 0 ms to minimize.
[2023-03-14 10:37:48] [INFO ] Deduced a trap composed of 84 places in 113 ms of which 0 ms to minimize.
[2023-03-14 10:37:48] [INFO ] Deduced a trap composed of 84 places in 115 ms of which 0 ms to minimize.
[2023-03-14 10:37:48] [INFO ] Deduced a trap composed of 83 places in 145 ms of which 1 ms to minimize.
[2023-03-14 10:37:48] [INFO ] Deduced a trap composed of 86 places in 123 ms of which 0 ms to minimize.
[2023-03-14 10:37:48] [INFO ] Deduced a trap composed of 18 places in 121 ms of which 0 ms to minimize.
[2023-03-14 10:37:49] [INFO ] Deduced a trap composed of 88 places in 110 ms of which 0 ms to minimize.
[2023-03-14 10:37:49] [INFO ] Deduced a trap composed of 88 places in 86 ms of which 0 ms to minimize.
[2023-03-14 10:37:49] [INFO ] Deduced a trap composed of 86 places in 119 ms of which 1 ms to minimize.
[2023-03-14 10:37:49] [INFO ] Deduced a trap composed of 87 places in 109 ms of which 0 ms to minimize.
[2023-03-14 10:37:49] [INFO ] Deduced a trap composed of 82 places in 107 ms of which 0 ms to minimize.
[2023-03-14 10:37:49] [INFO ] Deduced a trap composed of 83 places in 101 ms of which 1 ms to minimize.
[2023-03-14 10:37:50] [INFO ] Deduced a trap composed of 23 places in 105 ms of which 1 ms to minimize.
[2023-03-14 10:37:50] [INFO ] Deduced a trap composed of 89 places in 109 ms of which 0 ms to minimize.
[2023-03-14 10:37:50] [INFO ] Deduced a trap composed of 84 places in 117 ms of which 1 ms to minimize.
[2023-03-14 10:37:50] [INFO ] Deduced a trap composed of 82 places in 100 ms of which 0 ms to minimize.
[2023-03-14 10:37:50] [INFO ] Deduced a trap composed of 85 places in 112 ms of which 1 ms to minimize.
[2023-03-14 10:37:51] [INFO ] Deduced a trap composed of 74 places in 114 ms of which 0 ms to minimize.
[2023-03-14 10:37:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 124 trap constraints in 20808 ms
[2023-03-14 10:37:51] [INFO ] After 21044ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :0
[2023-03-14 10:37:51] [INFO ] After 21212ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
FORMULA BusinessProcesses-PT-06-ReachabilityCardinality-08 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-06-ReachabilityCardinality-02 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
All properties solved without resorting to model-checking.
Total runtime 22183 ms.
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running BusinessProcesses (PT), instance 06
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: 376 places, 297 transitions, 830 arcs.
Final Score: 11112.993
Took : 9 seconds
Reachability Cardinality file is: ReachabilityCardinality.xml
READY TO PARSE. BS
PROPERTY: BusinessProcesses-PT-06-ReachabilityCardinality-00 (reachable &!potential( ( ( (! ( (tk(P60)) <= ( 1 ) )) & ( (! ( (tk(P265)) <= (tk(P303)) )) | (! ( ( ( (tk(P143)) <= ( 0 ) ) | (! ( (tk(P298)) <= ( 0 ) )) ) & ( ( (tk(P247)) <= ( 1 ) ) | (! ( ( ( 1 ) <= (tk(P206)) ) | ( ( 1 ) <= (tk(P12)) ) )) ) )) ) ) | ( ( (! ( (! ( (tk(P158)) <= (tk(P337)) )) & ( ( (tk(P241)) <= (tk(P117)) ) & (! ( ( ( ( 1 ) <= (tk(P206)) ) & ( ( 1 ) <= (tk(P295)) ) ) | ( ( (tk(P254)) <= (tk(P358)) ) & ( (tk(P296)) <= (tk(P22)) ) ) )) ) )) | ( ( 1 ) <= (tk(P55)) ) ) | (! ( (tk(P167)) <= (tk(P39)) )) ) )))
PROPERTY: BusinessProcesses-PT-06-ReachabilityCardinality-01 (reachable & potential(( ( ( 1 ) <= (tk(P161)) ) & ( ( ( ( ( (! ( ( 1 ) <= (tk(P371)) )) | ( ( ( ( (tk(P357)) <= (tk(P181)) ) & ( (tk(P42)) <= ( 0 ) ) ) | ( (tk(P354)) <= (tk(P221)) ) ) | (! ( (tk(P75)) <= (tk(P208)) )) ) ) & (! ( (! ( ( 1 ) <= (tk(P73)) )) | ( ( 1 ) <= (tk(P133)) ) )) ) & ( ( ( ( (tk(P12)) <= ( 1 ) ) | ( ( ( (tk(P91)) <= (tk(P124)) ) & ( (tk(P60)) <= (tk(P93)) ) ) & ( ( (tk(P367)) <= (tk(P55)) ) | ( (tk(P151)) <= (tk(P21)) ) ) ) ) | ( (tk(P139)) <= (tk(P338)) ) ) & ( ( (tk(P305)) <= (tk(P299)) ) & ( ( (! ( ( 1 ) <= (tk(P190)) )) | (! ( (tk(P174)) <= ( 0 ) )) ) | ( (tk(P36)) <= ( 0 ) ) ) ) ) ) & ( (tk(P286)) <= ( 0 ) ) ) | ( (tk(P257)) <= (tk(P86)) ) ) )))
PROPERTY: BusinessProcesses-PT-06-ReachabilityCardinality-02 (reachable & potential((! ( ( ( (tk(P374)) <= ( 0 ) ) | ( (tk(P58)) <= ( 0 ) ) ) | (! ( (! ( ( ( ( (tk(P246)) <= (tk(P152)) ) & ( (tk(P28)) <= (tk(P317)) ) ) | (! ( (tk(P41)) <= ( 0 ) )) ) | ( ( ( ( 1 ) <= (tk(P326)) ) & ( (tk(P155)) <= (tk(P99)) ) ) & ( ( 1 ) <= (tk(P108)) ) ) )) & ( ( ( 1 ) <= (tk(P228)) ) | (! ( (tk(P296)) <= (tk(P214)) )) ) )) ))))
PROPERTY: BusinessProcesses-PT-06-ReachabilityCardinality-03 (reachable &!potential( (! ( ( ( ( (tk(P85)) <= ( 0 ) ) | ( ( ( ( 1 ) <= (tk(P196)) ) | ( (tk(P161)) <= (tk(P21)) ) ) & ( ( 1 ) <= (tk(P54)) ) ) ) | ( (tk(P32)) <= ( 1 ) ) ) & ( (! ( (! ( (tk(P349)) <= ( 0 ) )) | ( (tk(P283)) <= ( 1 ) ) )) | ( ( ( ( (tk(P205)) <= ( 1 ) ) & ( (tk(P239)) <= ( 1 ) ) ) & (! ( ( 1 ) <= (tk(P230)) )) ) & ( ( ( (tk(P284)) <= (tk(P119)) ) & ( (tk(P77)) <= (tk(P127)) ) ) & (! ( (tk(P82)) <= ( 0 ) )) ) ) ) ))))
PROPERTY: BusinessProcesses-PT-06-ReachabilityCardinality-04 (reachable & potential((! ( (tk(P366)) <= (tk(P242)) ))))
PROPERTY: BusinessProcesses-PT-06-ReachabilityCardinality-05 (reachable &!potential( ( (! ( ( 1 ) <= (tk(P204)) )) | ( (tk(P100)) <= (tk(P362)) ) )))
PROPERTY: BusinessProcesses-PT-06-ReachabilityCardinality-06 (reachable &!potential( ( ( (! ( ( (! ( ( ( ( 1 ) <= (tk(P88)) ) | ( ( 1 ) <= (tk(P344)) ) ) | ( ( 1 ) <= (tk(P106)) ) )) & ( ( 1 ) <= (tk(P367)) ) ) & ( ( ( (tk(P29)) <= (tk(P61)) ) & ( ( ( ( (tk(P109)) <= ( 0 ) ) & ( (tk(P342)) <= (tk(P84)) ) ) & (! ( ( 1 ) <= (tk(P210)) )) ) & ( (tk(P371)) <= (tk(P339)) ) ) ) | (! ( (! ( ( (tk(P174)) <= ( 0 ) ) & ( (tk(P18)) <= (tk(P330)) ) )) & ( ( 1 ) <= (tk(P137)) ) )) ) )) & ( ( ( 1 ) <= (tk(P262)) ) & ( (tk(P285)) <= ( 1 ) ) ) ) | (! ( ( 1 ) <= (tk(P76)) )) )))
PROPERTY: BusinessProcesses-PT-06-ReachabilityCardinality-07 (reachable &!potential( (! ( (! ( (tk(P34)) <= ( 0 ) )) | ( ( 1 ) <= (tk(P176)) ) ))))
PROPERTY: BusinessProcesses-PT-06-ReachabilityCardinality-08 (reachable &!potential( ( ( ( ( ( (tk(P366)) <= (tk(P281)) ) | ( ( 1 ) <= (tk(P218)) ) ) | ( ( (tk(P18)) <= (tk(P34)) ) & ( ( ( ( ( ( 1 ) <= (tk(P89)) ) & ( ( ( 1 ) <= (tk(P335)) ) | ( ( 1 ) <= (tk(P49)) ) ) ) | ( (tk(P125)) <= (tk(P23)) ) ) | ( (tk(P350)) <= ( 1 ) ) ) & (! ( ( ( ( ( 1 ) <= (tk(P80)) ) & ( ( 1 ) <= (tk(P293)) ) ) & ( ( ( 1 ) <= (tk(P185)) ) | ( (tk(P69)) <= (tk(P140)) ) ) ) | (! ( (tk(P188)) <= (tk(P109)) )) )) ) ) ) | (! ( (tk(P358)) <= ( 1 ) )) ) | ( (tk(P362)) <= (tk(P77)) ) )))
PROPERTY: BusinessProcesses-PT-06-ReachabilityCardinality-09 (reachable &!potential( (! ( (! ( ( ( ( (tk(P315)) <= (tk(P191)) ) | ( ( ( (tk(P108)) <= ( 1 ) ) | ( (tk(P230)) <= (tk(P231)) ) ) & ( (tk(P61)) <= (tk(P312)) ) ) ) & ( ( (tk(P28)) <= ( 1 ) ) | ( (tk(P67)) <= (tk(P203)) ) ) ) | ( ( (tk(P54)) <= ( 0 ) ) & ( ( (! ( (tk(P336)) <= (tk(P258)) )) | ( ( 1 ) <= (tk(P62)) ) ) | ( ( ( (tk(P142)) <= (tk(P132)) ) & ( (tk(P131)) <= ( 1 ) ) ) | ( ( 1 ) <= (tk(P278)) ) ) ) ) )) & ( ( ( 1 ) <= (tk(P188)) ) | ( (! ( ( 1 ) <= (tk(P359)) )) & ( (tk(P113)) <= ( 0 ) ) ) ) ))))
PROPERTY: BusinessProcesses-PT-06-ReachabilityCardinality-10 (reachable & potential((! ( ( (! ( (tk(P89)) <= ( 1 ) )) | (! ( ( ( ( ( (tk(P116)) <= ( 1 ) ) | (! ( (tk(P89)) <= ( 0 ) )) ) | ( ( ( 1 ) <= (tk(P257)) ) | ( ( (tk(P57)) <= ( 1 ) ) & ( (tk(P227)) <= (tk(P339)) ) ) ) ) & (! ( ( (tk(P87)) <= (tk(P275)) ) | ( (tk(P103)) <= (tk(P110)) ) )) ) & ( ( (! ( (tk(P135)) <= ( 1 ) )) | ( (! ( (tk(P303)) <= (tk(P154)) )) | ( ( (tk(P134)) <= (tk(P215)) ) | ( (tk(P78)) <= (tk(P201)) ) ) ) ) & ( ( ( ( 1 ) <= (tk(P208)) ) & ( (tk(P174)) <= ( 0 ) ) ) | ( ( ( (tk(P221)) <= (tk(P336)) ) | ( ( 1 ) <= (tk(P104)) ) ) | ( ( (tk(P209)) <= ( 1 ) ) | ( (tk(P23)) <= ( 0 ) ) ) ) ) ) )) ) | ( ( ( ( ( (! ( ( 1 ) <= (tk(P246)) )) & ( ( (tk(P47)) <= ( 0 ) ) | ( ( 1 ) <= (tk(P87)) ) ) ) & ( ( (tk(P43)) <= (tk(P71)) ) | ( ( ( (tk(P357)) <= (tk(P21)) ) | ( ( 1 ) <= (tk(P241)) ) ) | ( ( (tk(P62)) <= (tk(P327)) ) & ( (tk(P3)) <= ( 0 ) ) ) ) ) ) | ( ( 1 ) <= (tk(P303)) ) ) & ( ( (! ( ( ( ( 1 ) <= (tk(P256)) ) & ( (tk(P286)) <= ( 0 ) ) ) & (! ( (tk(P317)) <= (tk(P101)) )) )) & ( ( ( (tk(P150)) <= ( 0 ) ) & ( ( (tk(P46)) <= ( 1 ) ) & ( (tk(P342)) <= (tk(P94)) ) ) ) | ( (tk(P374)) <= ( 1 ) ) ) ) | ( ( (tk(P275)) <= ( 0 ) ) | ( ( ( (tk(P356)) <= ( 0 ) ) & ( (tk(P264)) <= ( 0 ) ) ) & ( (! ( (tk(P94)) <= (tk(P267)) )) | (! ( (tk(P227)) <= (tk(P249)) )) ) ) ) ) ) | ( ( (! ( (tk(P87)) <= (tk(P11)) )) & (! ( (! ( (tk(P167)) <= (tk(P115)) )) | ( ( ( 1 ) <= (tk(P21)) ) | ( ( 1 ) <= (tk(P103)) ) ) )) ) | ( (tk(P24)) <= ( 1 ) ) ) ) ))))
PROPERTY: BusinessProcesses-PT-06-ReachabilityCardinality-11 (reachable & potential(( ( ( (! ( (! ( ( ( ( 1 ) <= (tk(P75)) ) & ( ( ( 1 ) <= (tk(P346)) ) | ( (tk(P149)) <= ( 0 ) ) ) ) & ( (tk(P351)) <= (tk(P359)) ) )) | ( ( (tk(P185)) <= (tk(P283)) ) & ( (! ( ( ( 1 ) <= (tk(P344)) ) | ( (tk(P222)) <= (tk(P49)) ) )) & ( ( 1 ) <= (tk(P135)) ) ) ) )) & (! ( ( ( 1 ) <= (tk(P202)) ) & ( (! ( (tk(P321)) <= ( 1 ) )) & (! ( (tk(P315)) <= (tk(P230)) )) ) )) ) & (! ( (tk(P331)) <= ( 1 ) )) ) & ( ( (tk(P329)) <= (tk(P157)) ) | ( ( ( ( ( 1 ) <= (tk(P26)) ) & (! ( ( 1 ) <= (tk(P261)) )) ) & (! ( ( 1 ) <= (tk(P288)) )) ) | ( ( (tk(P93)) <= ( 1 ) ) | (! ( ( (! ( ( (tk(P160)) <= (tk(P26)) ) & ( ( 1 ) <= (tk(P368)) ) )) | ( (! ( ( 1 ) <= (tk(P224)) )) | ( ( 1 ) <= (tk(P43)) ) ) ) | (! ( ( (tk(P136)) <= ( 0 ) ) | ( (tk(P166)) <= (tk(P177)) ) )) )) ) ) ) )))
PROPERTY: BusinessProcesses-PT-06-ReachabilityCardinality-12 (reachable & potential(( ( ( (tk(P75)) <= (tk(P132)) ) & ( (! ( (tk(P321)) <= ( 0 ) )) & (! ( ( ( 1 ) <= (tk(P172)) ) | ( ( (tk(P240)) <= ( 0 ) ) & ( (! ( (tk(P165)) <= (tk(P198)) )) | ( ( 1 ) <= (tk(P44)) ) ) ) )) ) ) | ( ( 1 ) <= (tk(P86)) ) )))
PROPERTY: BusinessProcesses-PT-06-ReachabilityCardinality-13 (reachable & potential(( ( ( (tk(P194)) <= (tk(P334)) ) & ( (! ( (tk(P123)) <= (tk(P277)) )) & (! ( ( ( (tk(P99)) <= ( 1 ) ) & ( (! ( ( 1 ) <= (tk(P196)) )) | ( ( ( (tk(P3)) <= ( 0 ) ) | ( (tk(P68)) <= ( 1 ) ) ) | ( ( ( 1 ) <= (tk(P47)) ) | ( (tk(P180)) <= ( 1 ) ) ) ) ) ) | ( ( 1 ) <= (tk(P30)) ) )) ) ) & ( ( ( 1 ) <= (tk(P267)) ) | ( (tk(P185)) <= (tk(P122)) ) ) )))
PROPERTY: BusinessProcesses-PT-06-ReachabilityCardinality-14 (reachable &!potential( ( ( ( ( (tk(P215)) <= ( 1 ) ) & (! ( (! ( (tk(P322)) <= ( 0 ) )) | ( (! ( ( ( ( 1 ) <= (tk(P1)) ) & ( (tk(P69)) <= ( 1 ) ) ) | ( ( 1 ) <= (tk(P361)) ) )) & (! ( ( ( (tk(P80)) <= (tk(P45)) ) | ( (tk(P69)) <= ( 1 ) ) ) & ( ( 1 ) <= (tk(P48)) ) )) ) )) ) & ( (! ( ( ( ( ( 1 ) <= (tk(P102)) ) & ( (! ( (tk(P131)) <= ( 0 ) )) & ( ( ( 1 ) <= (tk(P13)) ) | ( (tk(P161)) <= ( 1 ) ) ) ) ) | ( ( ( 1 ) <= (tk(P309)) ) | ( (tk(P333)) <= ( 0 ) ) ) ) & ( ( ( ( ( (tk(P306)) <= (tk(P146)) ) & ( (tk(P275)) <= (tk(P21)) ) ) & ( ( (tk(P118)) <= ( 1 ) ) | ( ( 1 ) <= (tk(P200)) ) ) ) | ( ( (tk(P360)) <= (tk(P57)) ) & ( ( (tk(P108)) <= (tk(P183)) ) | ( (tk(P315)) <= (tk(P274)) ) ) ) ) & (! ( ( (tk(P140)) <= ( 0 ) ) & (! ( (tk(P259)) <= ( 0 ) )) )) ) )) | (! ( ( (! ( (tk(P323)) <= (tk(P258)) )) & (! ( (tk(P59)) <= (tk(P97)) )) ) & ( (! ( ( (tk(P12)) <= ( 0 ) ) & ( ( (tk(P101)) <= ( 1 ) ) | ( (tk(P274)) <= (tk(P270)) ) ) )) | ( (! ( ( ( 1 ) <= (tk(P111)) ) & ( (tk(P48)) <= ( 0 ) ) )) & (! ( ( ( 1 ) <= (tk(P83)) ) | ( (tk(P376)) <= (tk(P46)) ) )) ) ) )) ) ) | (! ( ( ( 1 ) <= (tk(P105)) ) | ( ( ( (! ( (tk(P343)) <= (tk(P321)) )) | ( ( (! ( (tk(P135)) <= ( 0 ) )) & ( ( ( 1 ) <= (tk(P306)) ) | ( ( 1 ) <= (tk(P365)) ) ) ) & ( ( (tk(P212)) <= ( 1 ) ) | ( ( (tk(P346)) <= (tk(P320)) ) & ( (tk(P274)) <= ( 0 ) ) ) ) ) ) & ( ( ( 1 ) <= (tk(P60)) ) | ( (tk(P360)) <= ( 0 ) ) ) ) & ( (tk(P176)) <= ( 1 ) ) ) )) )))
PROPERTY: BusinessProcesses-PT-06-ReachabilityCardinality-15 (reachable &!potential( ( ( (! ( (! ( ( ( (! ( ( 1 ) <= (tk(P313)) )) & (! ( ( 1 ) <= (tk(P206)) )) ) | ( ( ( ( 1 ) <= (tk(P137)) ) & ( (tk(P120)) <= ( 1 ) ) ) & ( ( (tk(P48)) <= (tk(P164)) ) & ( ( 1 ) <= (tk(P274)) ) ) ) ) | (! ( ( (tk(P289)) <= (tk(P357)) ) & ( ( 1 ) <= (tk(P332)) ) )) )) | ( ( (! ( (! ( (tk(P175)) <= ( 0 ) )) | (! ( ( 1 ) <= (tk(P310)) )) )) | ( ( ( (tk(P180)) <= ( 0 ) ) | (! ( ( 1 ) <= (tk(P277)) )) ) | (! ( (tk(P13)) <= (tk(P141)) )) ) ) & (! ( (! ( (tk(P237)) <= (tk(P137)) )) & (! ( (tk(P252)) <= (tk(P322)) )) )) ) )) | ( ( ( 1 ) <= (tk(P11)) ) | ( (tk(P54)) <= ( 0 ) ) ) ) | (! ( ( ( (tk(P65)) <= ( 0 ) ) & ( ( (tk(P48)) <= (tk(P101)) ) & ( (tk(P90)) <= (tk(P165)) ) ) ) | ( ( 1 ) <= (tk(P8)) ) )) )))
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 14910668 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16106648 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-06"
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-06, 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-167813696900494"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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