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.r042-tajo-167813695800494.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 marciexred
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 r042-tajo-167813695800494
=====================================================================

--------------------
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 1678728982823

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=marciexred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-06
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 17:36:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-13 17:36:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 17:36:24] [INFO ] Load time of PNML (sax parser for PT used): 53 ms
[2023-03-13 17:36:24] [INFO ] Transformed 376 places.
[2023-03-13 17:36:24] [INFO ] Transformed 297 transitions.
[2023-03-13 17:36:24] [INFO ] Found NUPN structural information;
[2023-03-13 17:36:24] [INFO ] Parsed PT model containing 376 places and 297 transitions and 830 arcs in 114 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 13 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 102 resets, run finished after 363 ms. (steps per millisecond=27 ) properties (out of 13) seen :8
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-07 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-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 18 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 5) seen :1
FORMULA BusinessProcesses-PT-06-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 296 rows 375 cols
[2023-03-13 17:36:25] [INFO ] Computed 81 place invariants in 23 ms
[2023-03-13 17:36:25] [INFO ] After 275ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-13 17:36:25] [INFO ] [Nat]Absence check using 42 positive place invariants in 13 ms returned sat
[2023-03-13 17:36:25] [INFO ] [Nat]Absence check using 42 positive and 39 generalized place invariants in 13 ms returned sat
[2023-03-13 17:36:25] [INFO ] After 216ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2023-03-13 17:36:26] [INFO ] Deduced a trap composed of 9 places in 157 ms of which 7 ms to minimize.
[2023-03-13 17:36:26] [INFO ] Deduced a trap composed of 18 places in 101 ms of which 1 ms to minimize.
[2023-03-13 17:36:26] [INFO ] Deduced a trap composed of 25 places in 138 ms of which 2 ms to minimize.
[2023-03-13 17:36:26] [INFO ] Deduced a trap composed of 89 places in 122 ms of which 2 ms to minimize.
[2023-03-13 17:36:26] [INFO ] Deduced a trap composed of 19 places in 123 ms of which 1 ms to minimize.
[2023-03-13 17:36:26] [INFO ] Deduced a trap composed of 8 places in 95 ms of which 1 ms to minimize.
[2023-03-13 17:36:26] [INFO ] Deduced a trap composed of 76 places in 88 ms of which 0 ms to minimize.
[2023-03-13 17:36:26] [INFO ] Deduced a trap composed of 76 places in 81 ms of which 1 ms to minimize.
[2023-03-13 17:36:27] [INFO ] Deduced a trap composed of 80 places in 93 ms of which 1 ms to minimize.
[2023-03-13 17:36:27] [INFO ] Deduced a trap composed of 80 places in 92 ms of which 1 ms to minimize.
[2023-03-13 17:36:27] [INFO ] Deduced a trap composed of 77 places in 116 ms of which 1 ms to minimize.
[2023-03-13 17:36:27] [INFO ] Deduced a trap composed of 89 places in 88 ms of which 0 ms to minimize.
[2023-03-13 17:36:27] [INFO ] Deduced a trap composed of 78 places in 97 ms of which 0 ms to minimize.
[2023-03-13 17:36:27] [INFO ] Deduced a trap composed of 81 places in 112 ms of which 1 ms to minimize.
[2023-03-13 17:36:27] [INFO ] Deduced a trap composed of 78 places in 88 ms of which 0 ms to minimize.
[2023-03-13 17:36:27] [INFO ] Deduced a trap composed of 85 places in 127 ms of which 1 ms to minimize.
[2023-03-13 17:36:28] [INFO ] Deduced a trap composed of 18 places in 126 ms of which 0 ms to minimize.
[2023-03-13 17:36:28] [INFO ] Deduced a trap composed of 89 places in 88 ms of which 1 ms to minimize.
[2023-03-13 17:36:28] [INFO ] Deduced a trap composed of 89 places in 161 ms of which 2 ms to minimize.
[2023-03-13 17:36:28] [INFO ] Deduced a trap composed of 86 places in 125 ms of which 1 ms to minimize.
[2023-03-13 17:36:28] [INFO ] Deduced a trap composed of 86 places in 118 ms of which 1 ms to minimize.
[2023-03-13 17:36:28] [INFO ] Deduced a trap composed of 82 places in 98 ms of which 0 ms to minimize.
[2023-03-13 17:36:28] [INFO ] Deduced a trap composed of 81 places in 104 ms of which 0 ms to minimize.
[2023-03-13 17:36:29] [INFO ] Deduced a trap composed of 23 places in 136 ms of which 1 ms to minimize.
[2023-03-13 17:36:29] [INFO ] Deduced a trap composed of 83 places in 118 ms of which 0 ms to minimize.
[2023-03-13 17:36:29] [INFO ] Deduced a trap composed of 80 places in 93 ms of which 0 ms to minimize.
[2023-03-13 17:36:29] [INFO ] Deduced a trap composed of 86 places in 80 ms of which 0 ms to minimize.
[2023-03-13 17:36:29] [INFO ] Deduced a trap composed of 85 places in 106 ms of which 0 ms to minimize.
[2023-03-13 17:36:29] [INFO ] Deduced a trap composed of 74 places in 93 ms of which 1 ms to minimize.
[2023-03-13 17:36:30] [INFO ] Deduced a trap composed of 20 places in 108 ms of which 1 ms to minimize.
[2023-03-13 17:36:30] [INFO ] Deduced a trap composed of 85 places in 106 ms of which 1 ms to minimize.
[2023-03-13 17:36:30] [INFO ] Deduced a trap composed of 23 places in 100 ms of which 1 ms to minimize.
[2023-03-13 17:36:30] [INFO ] Deduced a trap composed of 84 places in 94 ms of which 0 ms to minimize.
[2023-03-13 17:36:30] [INFO ] Deduced a trap composed of 82 places in 89 ms of which 1 ms to minimize.
[2023-03-13 17:36:30] [INFO ] Deduced a trap composed of 16 places in 108 ms of which 4 ms to minimize.
[2023-03-13 17:36:30] [INFO ] Deduced a trap composed of 79 places in 86 ms of which 1 ms to minimize.
[2023-03-13 17:36:30] [INFO ] Deduced a trap composed of 78 places in 76 ms of which 0 ms to minimize.
[2023-03-13 17:36:30] [INFO ] Deduced a trap composed of 81 places in 79 ms of which 1 ms to minimize.
[2023-03-13 17:36:31] [INFO ] Deduced a trap composed of 79 places in 77 ms of which 1 ms to minimize.
[2023-03-13 17:36:31] [INFO ] Deduced a trap composed of 79 places in 79 ms of which 1 ms to minimize.
[2023-03-13 17:36:31] [INFO ] Deduced a trap composed of 75 places in 89 ms of which 1 ms to minimize.
[2023-03-13 17:36:31] [INFO ] Deduced a trap composed of 81 places in 100 ms of which 0 ms to minimize.
[2023-03-13 17:36:31] [INFO ] Deduced a trap composed of 82 places in 83 ms of which 1 ms to minimize.
[2023-03-13 17:36:31] [INFO ] Deduced a trap composed of 89 places in 119 ms of which 0 ms to minimize.
[2023-03-13 17:36:31] [INFO ] Deduced a trap composed of 87 places in 90 ms of which 0 ms to minimize.
[2023-03-13 17:36:32] [INFO ] Deduced a trap composed of 87 places in 99 ms of which 0 ms to minimize.
[2023-03-13 17:36:32] [INFO ] Deduced a trap composed of 85 places in 80 ms of which 1 ms to minimize.
[2023-03-13 17:36:32] [INFO ] Deduced a trap composed of 83 places in 104 ms of which 1 ms to minimize.
[2023-03-13 17:36:32] [INFO ] Deduced a trap composed of 82 places in 86 ms of which 0 ms to minimize.
[2023-03-13 17:36:32] [INFO ] Deduced a trap composed of 77 places in 100 ms of which 0 ms to minimize.
[2023-03-13 17:36:32] [INFO ] Deduced a trap composed of 87 places in 104 ms of which 2 ms to minimize.
[2023-03-13 17:36:32] [INFO ] Deduced a trap composed of 87 places in 75 ms of which 0 ms to minimize.
[2023-03-13 17:36:32] [INFO ] Deduced a trap composed of 87 places in 107 ms of which 0 ms to minimize.
[2023-03-13 17:36:33] [INFO ] Deduced a trap composed of 87 places in 93 ms of which 1 ms to minimize.
[2023-03-13 17:36:33] [INFO ] Deduced a trap composed of 85 places in 98 ms of which 1 ms to minimize.
[2023-03-13 17:36:33] [INFO ] Deduced a trap composed of 89 places in 70 ms of which 1 ms to minimize.
[2023-03-13 17:36:33] [INFO ] Deduced a trap composed of 79 places in 79 ms of which 1 ms to minimize.
[2023-03-13 17:36:33] [INFO ] Deduced a trap composed of 81 places in 65 ms of which 0 ms to minimize.
[2023-03-13 17:36:33] [INFO ] Deduced a trap composed of 82 places in 63 ms of which 1 ms to minimize.
[2023-03-13 17:36:33] [INFO ] Deduced a trap composed of 86 places in 87 ms of which 0 ms to minimize.
[2023-03-13 17:36:33] [INFO ] Deduced a trap composed of 87 places in 78 ms of which 0 ms to minimize.
[2023-03-13 17:36:33] [INFO ] Deduced a trap composed of 77 places in 73 ms of which 0 ms to minimize.
[2023-03-13 17:36:34] [INFO ] Deduced a trap composed of 96 places in 72 ms of which 0 ms to minimize.
[2023-03-13 17:36:34] [INFO ] Deduced a trap composed of 86 places in 123 ms of which 2 ms to minimize.
[2023-03-13 17:36:34] [INFO ] Deduced a trap composed of 84 places in 92 ms of which 0 ms to minimize.
[2023-03-13 17:36:34] [INFO ] Deduced a trap composed of 87 places in 123 ms of which 2 ms to minimize.
[2023-03-13 17:36:34] [INFO ] Deduced a trap composed of 75 places in 118 ms of which 2 ms to minimize.
[2023-03-13 17:36:35] [INFO ] Deduced a trap composed of 83 places in 92 ms of which 2 ms to minimize.
[2023-03-13 17:36:35] [INFO ] Deduced a trap composed of 23 places in 106 ms of which 1 ms to minimize.
[2023-03-13 17:36:35] [INFO ] Deduced a trap composed of 88 places in 77 ms of which 0 ms to minimize.
[2023-03-13 17:36:35] [INFO ] Deduced a trap composed of 82 places in 90 ms of which 0 ms to minimize.
[2023-03-13 17:36:36] [INFO ] Deduced a trap composed of 85 places in 106 ms of which 1 ms to minimize.
[2023-03-13 17:36:36] [INFO ] Deduced a trap composed of 20 places in 118 ms of which 1 ms to minimize.
[2023-03-13 17:36:36] [INFO ] Deduced a trap composed of 82 places in 117 ms of which 1 ms to minimize.
[2023-03-13 17:36:36] [INFO ] Deduced a trap composed of 85 places in 108 ms of which 1 ms to minimize.
[2023-03-13 17:36:36] [INFO ] Deduced a trap composed of 82 places in 110 ms of which 0 ms to minimize.
[2023-03-13 17:36:37] [INFO ] Deduced a trap composed of 86 places in 116 ms of which 0 ms to minimize.
[2023-03-13 17:36:37] [INFO ] Deduced a trap composed of 79 places in 110 ms of which 1 ms to minimize.
[2023-03-13 17:36:37] [INFO ] Deduced a trap composed of 83 places in 101 ms of which 0 ms to minimize.
[2023-03-13 17:36:37] [INFO ] Deduced a trap composed of 20 places in 115 ms of which 0 ms to minimize.
[2023-03-13 17:36:37] [INFO ] Deduced a trap composed of 82 places in 117 ms of which 1 ms to minimize.
[2023-03-13 17:36:38] [INFO ] Deduced a trap composed of 84 places in 116 ms of which 1 ms to minimize.
[2023-03-13 17:36:38] [INFO ] Deduced a trap composed of 83 places in 114 ms of which 0 ms to minimize.
[2023-03-13 17:36:38] [INFO ] Deduced a trap composed of 86 places in 112 ms of which 1 ms to minimize.
[2023-03-13 17:36:38] [INFO ] Deduced a trap composed of 78 places in 100 ms of which 0 ms to minimize.
[2023-03-13 17:36:38] [INFO ] Deduced a trap composed of 88 places in 116 ms of which 0 ms to minimize.
[2023-03-13 17:36:38] [INFO ] Deduced a trap composed of 89 places in 132 ms of which 1 ms to minimize.
[2023-03-13 17:36:38] [INFO ] Deduced a trap composed of 83 places in 107 ms of which 0 ms to minimize.
[2023-03-13 17:36:39] [INFO ] Deduced a trap composed of 85 places in 112 ms of which 0 ms to minimize.
[2023-03-13 17:36:39] [INFO ] Deduced a trap composed of 84 places in 79 ms of which 0 ms to minimize.
[2023-03-13 17:36:39] [INFO ] Deduced a trap composed of 78 places in 100 ms of which 0 ms to minimize.
[2023-03-13 17:36:39] [INFO ] Deduced a trap composed of 84 places in 98 ms of which 1 ms to minimize.
[2023-03-13 17:36:39] [INFO ] Deduced a trap composed of 85 places in 95 ms of which 0 ms to minimize.
[2023-03-13 17:36:39] [INFO ] Deduced a trap composed of 81 places in 116 ms of which 0 ms to minimize.
[2023-03-13 17:36:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 94 trap constraints in 14205 ms
[2023-03-13 17:36:40] [INFO ] Deduced a trap composed of 19 places in 115 ms of which 1 ms to minimize.
[2023-03-13 17:36:40] [INFO ] Deduced a trap composed of 81 places in 83 ms of which 0 ms to minimize.
[2023-03-13 17:36:40] [INFO ] Deduced a trap composed of 84 places in 73 ms of which 1 ms to minimize.
[2023-03-13 17:36:40] [INFO ] Deduced a trap composed of 73 places in 86 ms of which 0 ms to minimize.
[2023-03-13 17:36:40] [INFO ] Deduced a trap composed of 80 places in 103 ms of which 0 ms to minimize.
[2023-03-13 17:36:41] [INFO ] Deduced a trap composed of 19 places in 87 ms of which 1 ms to minimize.
[2023-03-13 17:36:41] [INFO ] Deduced a trap composed of 21 places in 86 ms of which 1 ms to minimize.
[2023-03-13 17:36:42] [INFO ] Deduced a trap composed of 21 places in 98 ms of which 0 ms to minimize.
[2023-03-13 17:36:42] [INFO ] Deduced a trap composed of 83 places in 81 ms of which 1 ms to minimize.
[2023-03-13 17:36:42] [INFO ] Deduced a trap composed of 82 places in 96 ms of which 1 ms to minimize.
[2023-03-13 17:36:42] [INFO ] Deduced a trap composed of 77 places in 79 ms of which 1 ms to minimize.
[2023-03-13 17:36:42] [INFO ] Deduced a trap composed of 82 places in 72 ms of which 1 ms to minimize.
[2023-03-13 17:36:42] [INFO ] Deduced a trap composed of 85 places in 101 ms of which 1 ms to minimize.
[2023-03-13 17:36:42] [INFO ] Deduced a trap composed of 80 places in 103 ms of which 0 ms to minimize.
[2023-03-13 17:36:42] [INFO ] Deduced a trap composed of 79 places in 107 ms of which 1 ms to minimize.
[2023-03-13 17:36:43] [INFO ] Deduced a trap composed of 80 places in 80 ms of which 0 ms to minimize.
[2023-03-13 17:36:43] [INFO ] Deduced a trap composed of 80 places in 104 ms of which 1 ms to minimize.
[2023-03-13 17:36:43] [INFO ] Deduced a trap composed of 25 places in 114 ms of which 1 ms to minimize.
[2023-03-13 17:36:43] [INFO ] Deduced a trap composed of 87 places in 117 ms of which 0 ms to minimize.
[2023-03-13 17:36:43] [INFO ] Deduced a trap composed of 27 places in 115 ms of which 1 ms to minimize.
[2023-03-13 17:36:44] [INFO ] Deduced a trap composed of 83 places in 108 ms of which 0 ms to minimize.
[2023-03-13 17:36:44] [INFO ] Deduced a trap composed of 90 places in 122 ms of which 0 ms to minimize.
[2023-03-13 17:36:44] [INFO ] Deduced a trap composed of 89 places in 120 ms of which 0 ms to minimize.
[2023-03-13 17:36:44] [INFO ] Deduced a trap composed of 13 places in 124 ms of which 1 ms to minimize.
[2023-03-13 17:36:44] [INFO ] Deduced a trap composed of 81 places in 107 ms of which 1 ms to minimize.
[2023-03-13 17:36:44] [INFO ] Deduced a trap composed of 29 places in 85 ms of which 1 ms to minimize.
[2023-03-13 17:36:45] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 1 ms to minimize.
[2023-03-13 17:36:45] [INFO ] Deduced a trap composed of 79 places in 84 ms of which 0 ms to minimize.
[2023-03-13 17:36:45] [INFO ] Deduced a trap composed of 82 places in 93 ms of which 0 ms to minimize.
[2023-03-13 17:36:45] [INFO ] Deduced a trap composed of 80 places in 93 ms of which 1 ms to minimize.
[2023-03-13 17:36:45] [INFO ] Deduced a trap composed of 76 places in 100 ms of which 0 ms to minimize.
[2023-03-13 17:36:45] [INFO ] Deduced a trap composed of 74 places in 108 ms of which 0 ms to minimize.
[2023-03-13 17:36:46] [INFO ] Deduced a trap composed of 72 places in 111 ms of which 1 ms to minimize.
[2023-03-13 17:36:46] [INFO ] Deduced a trap composed of 88 places in 103 ms of which 1 ms to minimize.
[2023-03-13 17:36:46] [INFO ] Deduced a trap composed of 81 places in 98 ms of which 0 ms to minimize.
[2023-03-13 17:36:46] [INFO ] Deduced a trap composed of 78 places in 104 ms of which 0 ms to minimize.
[2023-03-13 17:36:47] [INFO ] Deduced a trap composed of 93 places in 106 ms of which 0 ms to minimize.
[2023-03-13 17:36:47] [INFO ] Deduced a trap composed of 88 places in 84 ms of which 1 ms to minimize.
[2023-03-13 17:36:47] [INFO ] Deduced a trap composed of 81 places in 102 ms of which 0 ms to minimize.
[2023-03-13 17:36:48] [INFO ] Deduced a trap composed of 20 places in 95 ms of which 1 ms to minimize.
[2023-03-13 17:36:48] [INFO ] Deduced a trap composed of 80 places in 106 ms of which 1 ms to minimize.
[2023-03-13 17:36:49] [INFO ] Deduced a trap composed of 83 places in 106 ms of which 0 ms to minimize.
[2023-03-13 17:36:49] [INFO ] Deduced a trap composed of 15 places in 91 ms of which 0 ms to minimize.
[2023-03-13 17:36:49] [INFO ] Deduced a trap composed of 78 places in 106 ms of which 1 ms to minimize.
[2023-03-13 17:36:49] [INFO ] Deduced a trap composed of 86 places in 114 ms of which 0 ms to minimize.
[2023-03-13 17:36:50] [INFO ] Deduced a trap composed of 87 places in 89 ms of which 0 ms to minimize.
[2023-03-13 17:36:50] [INFO ] Deduced a trap composed of 83 places in 112 ms of which 0 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-13 17:36:50] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-13 17:36:50] [INFO ] After 25026ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:4
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 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 13 ms.
Support contains 31 out of 375 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 375/375 places, 296/296 transitions.
Graph (trivial) has 165 edges and 375 vertex of which 4 / 375 are part of one of the 1 SCC in 4 ms
Free SCC test removed 3 places
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 688 edges and 372 vertex of which 369 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 55 transitions
Trivial Post-agglo rules discarded 55 transitions
Performed 55 trivial Post agglomeration. Transition count delta: 55
Iterating post reduction 0 with 56 rules applied. Total rules applied 58 place count 369 transition count 235
Reduce places removed 55 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 61 rules applied. Total rules applied 119 place count 314 transition count 229
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 125 place count 308 transition count 229
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 50 Pre rules applied. Total rules applied 125 place count 308 transition count 179
Deduced a syphon composed of 50 places in 1 ms
Ensure Unique test removed 6 places
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 3 with 106 rules applied. Total rules applied 231 place count 252 transition count 179
Discarding 35 places :
Symmetric choice reduction at 3 with 35 rule applications. Total rules 266 place count 217 transition count 144
Iterating global reduction 3 with 35 rules applied. Total rules applied 301 place count 217 transition count 144
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 3 with 121 rules applied. Total rules applied 422 place count 156 transition count 84
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 424 place count 156 transition count 82
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 426 place count 154 transition count 82
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 427 place count 153 transition count 81
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 428 place count 152 transition count 81
Applied a total of 428 rules in 108 ms. Remains 152 /375 variables (removed 223) and now considering 81/296 (removed 215) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 108 ms. Remains : 152/375 places, 81/296 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 2) seen :1
FORMULA BusinessProcesses-PT-06-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 81 rows 152 cols
[2023-03-13 17:36:50] [INFO ] Computed 72 place invariants in 3 ms
[2023-03-13 17:36:50] [INFO ] After 33ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 17:36:50] [INFO ] [Nat]Absence check using 40 positive place invariants in 13 ms returned sat
[2023-03-13 17:36:50] [INFO ] [Nat]Absence check using 40 positive and 32 generalized place invariants in 6 ms returned sat
[2023-03-13 17:36:50] [INFO ] After 54ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-13 17:36:50] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 1 ms to minimize.
[2023-03-13 17:36:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 55 ms
[2023-03-13 17:36:50] [INFO ] After 125ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 31 ms.
[2023-03-13 17:36:50] [INFO ] After 213ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 14 out of 152 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 152/152 places, 81/81 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 152 transition count 78
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 149 transition count 78
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 6 place count 149 transition count 68
Deduced a syphon composed of 10 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 21 rules applied. Total rules applied 27 place count 138 transition count 68
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 28 place count 137 transition count 67
Iterating global reduction 2 with 1 rules applied. Total rules applied 29 place count 137 transition count 67
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 47 place count 126 transition count 60
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 49 place count 126 transition count 60
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 50 place count 125 transition count 59
Iterating global reduction 2 with 1 rules applied. Total rules applied 51 place count 125 transition count 59
Applied a total of 51 rules in 33 ms. Remains 125 /152 variables (removed 27) and now considering 59/81 (removed 22) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 125/152 places, 59/81 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Finished probabilistic random walk after 372 steps, run visited all 1 properties in 11 ms. (steps per millisecond=33 )
Probabilistic random walk after 372 steps, saw 225 distinct states, run finished after 12 ms. (steps per millisecond=31 ) properties seen :1
FORMULA BusinessProcesses-PT-06-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
All properties solved without resorting to model-checking.
Total runtime 26723 ms.
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=ReachabilityCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: BusinessProcesses_PT_06
(NrP: 376 NrTr: 297 NrArc: 830)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.010sec

net check time: 0m 0.000sec

init dd package: 0m 3.031sec


before gc: list nodes free: 1224111

after gc: idd nodes used:51737450, unused:12262550; list nodes free:53217773

RS generation: 42m30.245sec


-> last computed set: #nodes 51737077 (5.2e+07) #states 234,862,913,131 (11)


CANNOT_COMPUTE


BK_STOP 1678731595201

--------------------
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
check for maximal unmarked siphon
found
The net has a maximal unmarked siphon:
p278

The net has transition(s) that can never fire:
t75

check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.000sec

idd.cc:820: DD Exception: No free nodes

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="marciexred"
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 marciexred"
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 r042-tajo-167813695800494"
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 ;