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.r041-tajo-167813694800494.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 ltsminxred
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 r041-tajo-167813694800494
=====================================================================

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

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=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-06
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 17:00:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-12 17:00:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 17:00:24] [INFO ] Load time of PNML (sax parser for PT used): 53 ms
[2023-03-12 17:00:24] [INFO ] Transformed 376 places.
[2023-03-12 17:00:24] [INFO ] Transformed 297 transitions.
[2023-03-12 17:00:24] [INFO ] Found NUPN structural information;
[2023-03-12 17:00:24] [INFO ] Parsed PT model containing 376 places and 297 transitions and 830 arcs in 118 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 14 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-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 107 resets, run finished after 410 ms. (steps per millisecond=24 ) 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 16 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 5) seen :1
FORMULA BusinessProcesses-PT-06-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 296 rows 375 cols
[2023-03-12 17:00:25] [INFO ] Computed 81 place invariants in 22 ms
[2023-03-12 17:00:25] [INFO ] After 255ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-12 17:00:25] [INFO ] [Nat]Absence check using 42 positive place invariants in 12 ms returned sat
[2023-03-12 17:00:25] [INFO ] [Nat]Absence check using 42 positive and 39 generalized place invariants in 14 ms returned sat
[2023-03-12 17:00:26] [INFO ] After 166ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2023-03-12 17:00:26] [INFO ] Deduced a trap composed of 25 places in 116 ms of which 6 ms to minimize.
[2023-03-12 17:00:26] [INFO ] Deduced a trap composed of 17 places in 79 ms of which 0 ms to minimize.
[2023-03-12 17:00:26] [INFO ] Deduced a trap composed of 83 places in 65 ms of which 1 ms to minimize.
[2023-03-12 17:00:26] [INFO ] Deduced a trap composed of 82 places in 76 ms of which 2 ms to minimize.
[2023-03-12 17:00:26] [INFO ] Deduced a trap composed of 83 places in 81 ms of which 0 ms to minimize.
[2023-03-12 17:00:26] [INFO ] Deduced a trap composed of 80 places in 72 ms of which 0 ms to minimize.
[2023-03-12 17:00:26] [INFO ] Deduced a trap composed of 81 places in 76 ms of which 0 ms to minimize.
[2023-03-12 17:00:26] [INFO ] Deduced a trap composed of 83 places in 73 ms of which 1 ms to minimize.
[2023-03-12 17:00:26] [INFO ] Deduced a trap composed of 82 places in 73 ms of which 0 ms to minimize.
[2023-03-12 17:00:27] [INFO ] Deduced a trap composed of 87 places in 84 ms of which 0 ms to minimize.
[2023-03-12 17:00:27] [INFO ] Deduced a trap composed of 83 places in 75 ms of which 0 ms to minimize.
[2023-03-12 17:00:27] [INFO ] Deduced a trap composed of 83 places in 59 ms of which 0 ms to minimize.
[2023-03-12 17:00:27] [INFO ] Deduced a trap composed of 78 places in 63 ms of which 0 ms to minimize.
[2023-03-12 17:00:27] [INFO ] Deduced a trap composed of 84 places in 77 ms of which 1 ms to minimize.
[2023-03-12 17:00:27] [INFO ] Deduced a trap composed of 82 places in 77 ms of which 3 ms to minimize.
[2023-03-12 17:00:27] [INFO ] Deduced a trap composed of 78 places in 65 ms of which 1 ms to minimize.
[2023-03-12 17:00:27] [INFO ] Deduced a trap composed of 81 places in 57 ms of which 0 ms to minimize.
[2023-03-12 17:00:27] [INFO ] Deduced a trap composed of 86 places in 54 ms of which 1 ms to minimize.
[2023-03-12 17:00:27] [INFO ] Deduced a trap composed of 83 places in 58 ms of which 0 ms to minimize.
[2023-03-12 17:00:27] [INFO ] Deduced a trap composed of 80 places in 59 ms of which 0 ms to minimize.
[2023-03-12 17:00:27] [INFO ] Deduced a trap composed of 85 places in 68 ms of which 0 ms to minimize.
[2023-03-12 17:00:28] [INFO ] Deduced a trap composed of 79 places in 57 ms of which 0 ms to minimize.
[2023-03-12 17:00:28] [INFO ] Deduced a trap composed of 20 places in 72 ms of which 0 ms to minimize.
[2023-03-12 17:00:28] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 0 ms to minimize.
[2023-03-12 17:00:28] [INFO ] Deduced a trap composed of 85 places in 68 ms of which 0 ms to minimize.
[2023-03-12 17:00:28] [INFO ] Deduced a trap composed of 88 places in 69 ms of which 1 ms to minimize.
[2023-03-12 17:00:28] [INFO ] Deduced a trap composed of 85 places in 70 ms of which 0 ms to minimize.
[2023-03-12 17:00:28] [INFO ] Deduced a trap composed of 83 places in 55 ms of which 1 ms to minimize.
[2023-03-12 17:00:28] [INFO ] Deduced a trap composed of 86 places in 70 ms of which 0 ms to minimize.
[2023-03-12 17:00:28] [INFO ] Deduced a trap composed of 87 places in 63 ms of which 0 ms to minimize.
[2023-03-12 17:00:28] [INFO ] Deduced a trap composed of 80 places in 72 ms of which 0 ms to minimize.
[2023-03-12 17:00:28] [INFO ] Deduced a trap composed of 77 places in 78 ms of which 0 ms to minimize.
[2023-03-12 17:00:29] [INFO ] Deduced a trap composed of 80 places in 58 ms of which 0 ms to minimize.
[2023-03-12 17:00:29] [INFO ] Deduced a trap composed of 85 places in 70 ms of which 1 ms to minimize.
[2023-03-12 17:00:29] [INFO ] Deduced a trap composed of 83 places in 68 ms of which 3 ms to minimize.
[2023-03-12 17:00:29] [INFO ] Deduced a trap composed of 82 places in 57 ms of which 0 ms to minimize.
[2023-03-12 17:00:29] [INFO ] Deduced a trap composed of 8 places in 89 ms of which 0 ms to minimize.
[2023-03-12 17:00:29] [INFO ] Deduced a trap composed of 81 places in 79 ms of which 1 ms to minimize.
[2023-03-12 17:00:29] [INFO ] Deduced a trap composed of 86 places in 97 ms of which 1 ms to minimize.
[2023-03-12 17:00:29] [INFO ] Deduced a trap composed of 85 places in 86 ms of which 1 ms to minimize.
[2023-03-12 17:00:29] [INFO ] Deduced a trap composed of 85 places in 66 ms of which 1 ms to minimize.
[2023-03-12 17:00:30] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 0 ms to minimize.
[2023-03-12 17:00:30] [INFO ] Deduced a trap composed of 85 places in 60 ms of which 0 ms to minimize.
[2023-03-12 17:00:30] [INFO ] Deduced a trap composed of 86 places in 70 ms of which 0 ms to minimize.
[2023-03-12 17:00:30] [INFO ] Deduced a trap composed of 80 places in 72 ms of which 1 ms to minimize.
[2023-03-12 17:00:30] [INFO ] Deduced a trap composed of 81 places in 82 ms of which 0 ms to minimize.
[2023-03-12 17:00:30] [INFO ] Deduced a trap composed of 86 places in 61 ms of which 0 ms to minimize.
[2023-03-12 17:00:30] [INFO ] Deduced a trap composed of 79 places in 60 ms of which 0 ms to minimize.
[2023-03-12 17:00:30] [INFO ] Deduced a trap composed of 85 places in 60 ms of which 1 ms to minimize.
[2023-03-12 17:00:30] [INFO ] Deduced a trap composed of 86 places in 78 ms of which 0 ms to minimize.
[2023-03-12 17:00:30] [INFO ] Deduced a trap composed of 85 places in 62 ms of which 2 ms to minimize.
[2023-03-12 17:00:31] [INFO ] Deduced a trap composed of 11 places in 115 ms of which 0 ms to minimize.
[2023-03-12 17:00:31] [INFO ] Deduced a trap composed of 14 places in 80 ms of which 1 ms to minimize.
[2023-03-12 17:00:31] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 0 ms to minimize.
[2023-03-12 17:00:31] [INFO ] Deduced a trap composed of 78 places in 66 ms of which 0 ms to minimize.
[2023-03-12 17:00:31] [INFO ] Deduced a trap composed of 81 places in 92 ms of which 9 ms to minimize.
[2023-03-12 17:00:31] [INFO ] Deduced a trap composed of 83 places in 73 ms of which 1 ms to minimize.
[2023-03-12 17:00:31] [INFO ] Deduced a trap composed of 85 places in 63 ms of which 1 ms to minimize.
[2023-03-12 17:00:32] [INFO ] Deduced a trap composed of 85 places in 68 ms of which 0 ms to minimize.
[2023-03-12 17:00:32] [INFO ] Deduced a trap composed of 82 places in 69 ms of which 1 ms to minimize.
[2023-03-12 17:00:32] [INFO ] Deduced a trap composed of 26 places in 68 ms of which 0 ms to minimize.
[2023-03-12 17:00:32] [INFO ] Deduced a trap composed of 80 places in 62 ms of which 1 ms to minimize.
[2023-03-12 17:00:32] [INFO ] Deduced a trap composed of 87 places in 66 ms of which 1 ms to minimize.
[2023-03-12 17:00:32] [INFO ] Deduced a trap composed of 84 places in 60 ms of which 1 ms to minimize.
[2023-03-12 17:00:32] [INFO ] Deduced a trap composed of 83 places in 73 ms of which 0 ms to minimize.
[2023-03-12 17:00:32] [INFO ] Deduced a trap composed of 83 places in 60 ms of which 2 ms to minimize.
[2023-03-12 17:00:32] [INFO ] Deduced a trap composed of 83 places in 60 ms of which 0 ms to minimize.
[2023-03-12 17:00:32] [INFO ] Deduced a trap composed of 84 places in 64 ms of which 6 ms to minimize.
[2023-03-12 17:00:32] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 0 ms to minimize.
[2023-03-12 17:00:33] [INFO ] Deduced a trap composed of 79 places in 83 ms of which 1 ms to minimize.
[2023-03-12 17:00:33] [INFO ] Deduced a trap composed of 78 places in 76 ms of which 0 ms to minimize.
[2023-03-12 17:00:33] [INFO ] Deduced a trap composed of 77 places in 64 ms of which 1 ms to minimize.
[2023-03-12 17:00:33] [INFO ] Deduced a trap composed of 76 places in 66 ms of which 0 ms to minimize.
[2023-03-12 17:00:33] [INFO ] Deduced a trap composed of 82 places in 66 ms of which 0 ms to minimize.
[2023-03-12 17:00:33] [INFO ] Deduced a trap composed of 79 places in 64 ms of which 1 ms to minimize.
[2023-03-12 17:00:33] [INFO ] Deduced a trap composed of 85 places in 66 ms of which 0 ms to minimize.
[2023-03-12 17:00:33] [INFO ] Deduced a trap composed of 84 places in 63 ms of which 0 ms to minimize.
[2023-03-12 17:00:33] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 0 ms to minimize.
[2023-03-12 17:00:33] [INFO ] Deduced a trap composed of 79 places in 67 ms of which 0 ms to minimize.
[2023-03-12 17:00:33] [INFO ] Deduced a trap composed of 79 places in 65 ms of which 1 ms to minimize.
[2023-03-12 17:00:33] [INFO ] Deduced a trap composed of 83 places in 63 ms of which 1 ms to minimize.
[2023-03-12 17:00:34] [INFO ] Deduced a trap composed of 83 places in 67 ms of which 1 ms to minimize.
[2023-03-12 17:00:34] [INFO ] Deduced a trap composed of 78 places in 66 ms of which 0 ms to minimize.
[2023-03-12 17:00:34] [INFO ] Deduced a trap composed of 86 places in 65 ms of which 1 ms to minimize.
[2023-03-12 17:00:34] [INFO ] Deduced a trap composed of 80 places in 79 ms of which 1 ms to minimize.
[2023-03-12 17:00:34] [INFO ] Deduced a trap composed of 90 places in 73 ms of which 0 ms to minimize.
[2023-03-12 17:00:34] [INFO ] Deduced a trap composed of 78 places in 71 ms of which 1 ms to minimize.
[2023-03-12 17:00:34] [INFO ] Deduced a trap composed of 78 places in 57 ms of which 0 ms to minimize.
[2023-03-12 17:00:34] [INFO ] Deduced a trap composed of 79 places in 64 ms of which 1 ms to minimize.
[2023-03-12 17:00:34] [INFO ] Deduced a trap composed of 83 places in 57 ms of which 0 ms to minimize.
[2023-03-12 17:00:35] [INFO ] Deduced a trap composed of 80 places in 59 ms of which 0 ms to minimize.
[2023-03-12 17:00:35] [INFO ] Deduced a trap composed of 84 places in 59 ms of which 0 ms to minimize.
[2023-03-12 17:00:35] [INFO ] Deduced a trap composed of 79 places in 60 ms of which 0 ms to minimize.
[2023-03-12 17:00:35] [INFO ] Deduced a trap composed of 76 places in 60 ms of which 1 ms to minimize.
[2023-03-12 17:00:35] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 0 ms to minimize.
[2023-03-12 17:00:35] [INFO ] Deduced a trap composed of 87 places in 61 ms of which 1 ms to minimize.
[2023-03-12 17:00:35] [INFO ] Deduced a trap composed of 82 places in 61 ms of which 0 ms to minimize.
[2023-03-12 17:00:35] [INFO ] Deduced a trap composed of 86 places in 64 ms of which 0 ms to minimize.
[2023-03-12 17:00:36] [INFO ] Deduced a trap composed of 85 places in 63 ms of which 1 ms to minimize.
[2023-03-12 17:00:36] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 1 ms to minimize.
[2023-03-12 17:00:36] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 1 ms to minimize.
[2023-03-12 17:00:36] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 0 ms to minimize.
[2023-03-12 17:00:36] [INFO ] Deduced a trap composed of 81 places in 64 ms of which 1 ms to minimize.
[2023-03-12 17:00:36] [INFO ] Deduced a trap composed of 84 places in 63 ms of which 0 ms to minimize.
[2023-03-12 17:00:36] [INFO ] Deduced a trap composed of 92 places in 72 ms of which 0 ms to minimize.
[2023-03-12 17:00:36] [INFO ] Deduced a trap composed of 84 places in 61 ms of which 1 ms to minimize.
[2023-03-12 17:00:36] [INFO ] Deduced a trap composed of 87 places in 64 ms of which 1 ms to minimize.
[2023-03-12 17:00:36] [INFO ] Deduced a trap composed of 87 places in 61 ms of which 0 ms to minimize.
[2023-03-12 17:00:36] [INFO ] Deduced a trap composed of 86 places in 60 ms of which 1 ms to minimize.
[2023-03-12 17:00:36] [INFO ] Deduced a trap composed of 85 places in 75 ms of which 1 ms to minimize.
[2023-03-12 17:00:37] [INFO ] Deduced a trap composed of 87 places in 61 ms of which 1 ms to minimize.
[2023-03-12 17:00:37] [INFO ] Deduced a trap composed of 91 places in 61 ms of which 1 ms to minimize.
[2023-03-12 17:00:37] [INFO ] Deduced a trap composed of 79 places in 61 ms of which 0 ms to minimize.
[2023-03-12 17:00:37] [INFO ] Deduced a trap composed of 82 places in 64 ms of which 0 ms to minimize.
[2023-03-12 17:00:37] [INFO ] Deduced a trap composed of 88 places in 60 ms of which 1 ms to minimize.
[2023-03-12 17:00:37] [INFO ] Deduced a trap composed of 91 places in 58 ms of which 0 ms to minimize.
[2023-03-12 17:00:38] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 0 ms to minimize.
[2023-03-12 17:00:38] [INFO ] Deduced a trap composed of 88 places in 61 ms of which 1 ms to minimize.
[2023-03-12 17:00:38] [INFO ] Deduced a trap composed of 87 places in 63 ms of which 0 ms to minimize.
[2023-03-12 17:00:39] [INFO ] Deduced a trap composed of 89 places in 81 ms of which 0 ms to minimize.
[2023-03-12 17:00:39] [INFO ] Deduced a trap composed of 86 places in 71 ms of which 1 ms to minimize.
[2023-03-12 17:00:39] [INFO ] Deduced a trap composed of 78 places in 58 ms of which 0 ms to minimize.
[2023-03-12 17:00:39] [INFO ] Deduced a trap composed of 84 places in 58 ms of which 1 ms to minimize.
[2023-03-12 17:00:39] [INFO ] Deduced a trap composed of 77 places in 59 ms of which 1 ms to minimize.
[2023-03-12 17:00:39] [INFO ] Deduced a trap composed of 81 places in 61 ms of which 1 ms to minimize.
[2023-03-12 17:00:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 125 trap constraints in 13730 ms
[2023-03-12 17:00:39] [INFO ] After 14063ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :2
Attempting to minimize the solution found.
Minimization took 60 ms.
[2023-03-12 17:00:40] [INFO ] After 14308ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :2
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.
FORMULA BusinessProcesses-PT-06-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 10 ms.
Support contains 14 out of 375 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 375/375 places, 296/296 transitions.
Graph (trivial) has 184 edges and 375 vertex of which 4 / 375 are part of one of the 1 SCC in 12 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.1 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 63 transitions
Trivial Post-agglo rules discarded 63 transitions
Performed 63 trivial Post agglomeration. Transition count delta: 63
Iterating post reduction 0 with 64 rules applied. Total rules applied 66 place count 369 transition count 227
Reduce places removed 63 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 65 rules applied. Total rules applied 131 place count 306 transition count 225
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 133 place count 304 transition count 225
Performed 61 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 61 Pre rules applied. Total rules applied 133 place count 304 transition count 164
Deduced a syphon composed of 61 places in 1 ms
Ensure Unique test removed 7 places
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 3 with 129 rules applied. Total rules applied 262 place count 236 transition count 164
Discarding 39 places :
Symmetric choice reduction at 3 with 39 rule applications. Total rules 301 place count 197 transition count 125
Iterating global reduction 3 with 39 rules applied. Total rules applied 340 place count 197 transition count 125
Performed 63 Post agglomeration using F-continuation condition.Transition count delta: 63
Deduced a syphon composed of 63 places in 1 ms
Ensure Unique test removed 5 places
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 3 with 131 rules applied. Total rules applied 471 place count 129 transition count 62
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 473 place count 129 transition count 60
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 475 place count 127 transition count 60
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 476 place count 127 transition count 60
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 477 place count 126 transition count 59
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 478 place count 125 transition count 59
Applied a total of 478 rules in 110 ms. Remains 125 /375 variables (removed 250) and now considering 59/296 (removed 237) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 110 ms. Remains : 125/375 places, 59/296 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Finished probabilistic random walk after 382 steps, run visited all 1 properties in 14 ms. (steps per millisecond=27 )
Probabilistic random walk after 382 steps, saw 227 distinct states, run finished after 15 ms. (steps per millisecond=25 ) properties seen :1
FORMULA BusinessProcesses-PT-06-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
All properties solved without resorting to model-checking.
Total runtime 15648 ms.
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --invariant=/tmp/845/inv_0_ --invariant=/tmp/845/inv_1_ --invariant=/tmp/845/inv_2_ --invariant=/tmp/845/inv_3_ --invariant=/tmp/845/inv_4_ --invariant=/tmp/845/inv_5_ --invariant=/tmp/845/inv_6_ --invariant=/tmp/845/inv_7_ --invariant=/tmp/845/inv_8_ --invariant=/tmp/845/inv_9_ --invariant=/tmp/845/inv_10_ --invariant=/tmp/845/inv_11_ --invariant=/tmp/845/inv_12_ --invariant=/tmp/845/inv_13_ --invariant=/tmp/845/inv_14_ --invariant=/tmp/845/inv_15_ --inv-par
FORMULA BusinessProcesses-PT-06-ReachabilityCardinality-00 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA BusinessProcesses-PT-06-ReachabilityCardinality-01 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA BusinessProcesses-PT-06-ReachabilityCardinality-02 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA BusinessProcesses-PT-06-ReachabilityCardinality-03 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA BusinessProcesses-PT-06-ReachabilityCardinality-04 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA BusinessProcesses-PT-06-ReachabilityCardinality-05 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA BusinessProcesses-PT-06-ReachabilityCardinality-06 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA BusinessProcesses-PT-06-ReachabilityCardinality-07 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA BusinessProcesses-PT-06-ReachabilityCardinality-08 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA BusinessProcesses-PT-06-ReachabilityCardinality-09 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA BusinessProcesses-PT-06-ReachabilityCardinality-10 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA BusinessProcesses-PT-06-ReachabilityCardinality-11 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA BusinessProcesses-PT-06-ReachabilityCardinality-12 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA BusinessProcesses-PT-06-ReachabilityCardinality-13 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA BusinessProcesses-PT-06-ReachabilityCardinality-14 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA BusinessProcesses-PT-06-ReachabilityCardinality-15 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN

BK_STOP 1678640495012

--------------------
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
mcc2023
rfs formula name BusinessProcesses-PT-06-ReachabilityCardinality-00
rfs formula type AG
rfs formula formula --invariant=/tmp/845/inv_0_
rfs formula name BusinessProcesses-PT-06-ReachabilityCardinality-01
rfs formula type EF
rfs formula formula --invariant=/tmp/845/inv_1_
rfs formula name BusinessProcesses-PT-06-ReachabilityCardinality-02
rfs formula type EF
rfs formula formula --invariant=/tmp/845/inv_2_
rfs formula name BusinessProcesses-PT-06-ReachabilityCardinality-03
rfs formula type AG
rfs formula formula --invariant=/tmp/845/inv_3_
rfs formula name BusinessProcesses-PT-06-ReachabilityCardinality-04
rfs formula type EF
rfs formula formula --invariant=/tmp/845/inv_4_
rfs formula name BusinessProcesses-PT-06-ReachabilityCardinality-05
rfs formula type AG
rfs formula formula --invariant=/tmp/845/inv_5_
rfs formula name BusinessProcesses-PT-06-ReachabilityCardinality-06
rfs formula type AG
rfs formula formula --invariant=/tmp/845/inv_6_
rfs formula name BusinessProcesses-PT-06-ReachabilityCardinality-07
rfs formula type AG
rfs formula formula --invariant=/tmp/845/inv_7_
rfs formula name BusinessProcesses-PT-06-ReachabilityCardinality-08
rfs formula type AG
rfs formula formula --invariant=/tmp/845/inv_8_
rfs formula name BusinessProcesses-PT-06-ReachabilityCardinality-09
rfs formula type AG
rfs formula formula --invariant=/tmp/845/inv_9_
rfs formula name BusinessProcesses-PT-06-ReachabilityCardinality-10
rfs formula type EF
rfs formula formula --invariant=/tmp/845/inv_10_
rfs formula name BusinessProcesses-PT-06-ReachabilityCardinality-11
rfs formula type EF
rfs formula formula --invariant=/tmp/845/inv_11_
rfs formula name BusinessProcesses-PT-06-ReachabilityCardinality-12
rfs formula type EF
rfs formula formula --invariant=/tmp/845/inv_12_
rfs formula name BusinessProcesses-PT-06-ReachabilityCardinality-13
rfs formula type EF
rfs formula formula --invariant=/tmp/845/inv_13_
rfs formula name BusinessProcesses-PT-06-ReachabilityCardinality-14
rfs formula type AG
rfs formula formula --invariant=/tmp/845/inv_14_
rfs formula name BusinessProcesses-PT-06-ReachabilityCardinality-15
rfs formula type AG
rfs formula formula --invariant=/tmp/845/inv_15_
pnml2lts-sym: Exploration order is bfs-prev
pnml2lts-sym: Saturation strategy is sat
pnml2lts-sym: Guided search strategy is unguided
pnml2lts-sym: Attractor strategy is default
pnml2lts-sym: opening model.pnml
pnml2lts-sym: Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-sym: Petri net has 376 places, 297 transitions and 830 arcs
pnml2lts-sym: Petri net BusinessProcesses-PT-06 analyzed
pnml2lts-sym: There are safe places
pnml2lts-sym: Loading Petri net took 0.000 real 0.000 user 0.010 sys
pnml2lts-sym: Initializing regrouping layer
pnml2lts-sym: Regroup specification: bs,w2W,ru,hf
pnml2lts-sym: Regroup Boost's Sloan
pnml2lts-sym: Regroup over-approximate must-write to may-write
pnml2lts-sym: Regroup Row sUbsume
pnml2lts-sym: Reqroup Horizontal Flip
pnml2lts-sym: Regrouping: 297->297 groups
pnml2lts-sym: Regrouping took 0.060 real 0.060 user 0.000 sys
pnml2lts-sym: state vector length is 376; there are 297 groups
pnml2lts-sym: Creating a multi-core ListDD domain.
pnml2lts-sym: Sylvan allocates 15.000 GB virtual memory for nodes table and operation cache.
pnml2lts-sym: Initial nodes table and operation cache requires 60.00 MB.
pnml2lts-sym: Using GBgetTransitionsShortR2W as next-state function
pnml2lts-sym: got initial state
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/845/inv_4_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/845/inv_5_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/845/inv_3_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/845/inv_12_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/845/inv_15_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/845/inv_14_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/845/inv_9_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/845/inv_7_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/845/inv_6_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/845/inv_0_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/845/inv_1_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym: Exploration took 2332579 group checks and 0 next state calls
pnml2lts-sym: reachability took 38.730 real 139.130 user 15.230 sys
pnml2lts-sym: counting visited states...
pnml2lts-sym: counting took 0.160 real 0.630 user 0.000 sys
pnml2lts-sym: state space has 2.91564954111943e+18 states, 813308 nodes
pnml2lts-sym: group_next: 1521 nodes total
pnml2lts-sym: group_explored: 797 nodes, 1591 short vectors total
pnml2lts-sym: max token count: 1

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="ltsminxred"
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 ltsminxred"
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 r041-tajo-167813694800494"
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 ;