Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r028-tall-165251936100155.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2021
Input is BusinessProcesses-PT-12, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r028-tall-165251936100155
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 568K
-rw-r--r-- 1 mcc users 8.6K Apr 30 00:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 100K Apr 30 00:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Apr 30 00:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Apr 30 00:04 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.1K May 9 07:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 9 07:10 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 07:10 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 07:10 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.1K Apr 30 00:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 54K Apr 30 00:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K Apr 30 00:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K Apr 30 00:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 07:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 3 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 146K May 10 09:33 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-12-ReachabilityCardinality-00
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityCardinality-01
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityCardinality-02
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityCardinality-03
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityCardinality-04
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityCardinality-05
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityCardinality-06
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityCardinality-07
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityCardinality-08
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityCardinality-09
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityCardinality-10
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityCardinality-11
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityCardinality-12
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityCardinality-13
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityCardinality-14
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1655083180975

Running Version 0
[2022-06-13 01:19:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-13 01:19:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-13 01:19:42] [INFO ] Load time of PNML (sax parser for PT used): 97 ms
[2022-06-13 01:19:42] [INFO ] Transformed 586 places.
[2022-06-13 01:19:42] [INFO ] Transformed 525 transitions.
[2022-06-13 01:19:42] [INFO ] Found NUPN structural information;
[2022-06-13 01:19:42] [INFO ] Parsed PT model containing 586 places and 525 transitions in 162 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 4 places in 11 ms
Reduce places removed 4 places and 4 transitions.
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 74 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 15) seen :3
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 12) seen :1
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 521 rows 582 cols
[2022-06-13 01:19:43] [INFO ] Computed 98 place invariants in 27 ms
[2022-06-13 01:19:43] [INFO ] [Real]Absence check using 55 positive place invariants in 31 ms returned sat
[2022-06-13 01:19:43] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 23 ms returned sat
[2022-06-13 01:19:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:19:44] [INFO ] [Real]Absence check using state equation in 754 ms returned sat
[2022-06-13 01:19:44] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:19:44] [INFO ] [Real]Absence check using 55 positive place invariants in 28 ms returned sat
[2022-06-13 01:19:44] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 14 ms returned sat
[2022-06-13 01:19:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:19:44] [INFO ] [Real]Absence check using state equation in 180 ms returned sat
[2022-06-13 01:19:44] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:19:44] [INFO ] [Nat]Absence check using 55 positive place invariants in 21 ms returned sat
[2022-06-13 01:19:44] [INFO ] [Nat]Absence check using 55 positive and 43 generalized place invariants in 11 ms returned sat
[2022-06-13 01:19:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-13 01:19:45] [INFO ] [Nat]Absence check using state equation in 177 ms returned sat
[2022-06-13 01:19:45] [INFO ] Deduced a trap composed of 10 places in 192 ms of which 3 ms to minimize.
[2022-06-13 01:19:45] [INFO ] Deduced a trap composed of 22 places in 147 ms of which 1 ms to minimize.
[2022-06-13 01:19:45] [INFO ] Deduced a trap composed of 23 places in 165 ms of which 1 ms to minimize.
[2022-06-13 01:19:45] [INFO ] Deduced a trap composed of 21 places in 150 ms of which 0 ms to minimize.
[2022-06-13 01:19:46] [INFO ] Deduced a trap composed of 126 places in 140 ms of which 1 ms to minimize.
[2022-06-13 01:19:46] [INFO ] Deduced a trap composed of 130 places in 150 ms of which 1 ms to minimize.
[2022-06-13 01:19:46] [INFO ] Deduced a trap composed of 20 places in 143 ms of which 0 ms to minimize.
[2022-06-13 01:19:46] [INFO ] Deduced a trap composed of 119 places in 138 ms of which 0 ms to minimize.
[2022-06-13 01:19:46] [INFO ] Deduced a trap composed of 106 places in 142 ms of which 1 ms to minimize.
[2022-06-13 01:19:46] [INFO ] Deduced a trap composed of 16 places in 104 ms of which 1 ms to minimize.
[2022-06-13 01:19:47] [INFO ] Deduced a trap composed of 20 places in 100 ms of which 1 ms to minimize.
[2022-06-13 01:19:47] [INFO ] Deduced a trap composed of 25 places in 109 ms of which 1 ms to minimize.
[2022-06-13 01:19:47] [INFO ] Deduced a trap composed of 29 places in 102 ms of which 0 ms to minimize.
[2022-06-13 01:19:47] [INFO ] Deduced a trap composed of 21 places in 99 ms of which 1 ms to minimize.
[2022-06-13 01:19:47] [INFO ] Deduced a trap composed of 30 places in 108 ms of which 1 ms to minimize.
[2022-06-13 01:19:47] [INFO ] Deduced a trap composed of 32 places in 122 ms of which 0 ms to minimize.
[2022-06-13 01:19:47] [INFO ] Deduced a trap composed of 35 places in 119 ms of which 0 ms to minimize.
[2022-06-13 01:19:48] [INFO ] Deduced a trap composed of 22 places in 117 ms of which 0 ms to minimize.
[2022-06-13 01:19:48] [INFO ] Deduced a trap composed of 20 places in 119 ms of which 1 ms to minimize.
[2022-06-13 01:19:48] [INFO ] Deduced a trap composed of 31 places in 113 ms of which 1 ms to minimize.
[2022-06-13 01:19:48] [INFO ] Deduced a trap composed of 36 places in 110 ms of which 1 ms to minimize.
[2022-06-13 01:19:48] [INFO ] Deduced a trap composed of 8 places in 123 ms of which 1 ms to minimize.
[2022-06-13 01:19:48] [INFO ] Deduced a trap composed of 38 places in 115 ms of which 0 ms to minimize.
[2022-06-13 01:19:48] [INFO ] Deduced a trap composed of 40 places in 116 ms of which 0 ms to minimize.
[2022-06-13 01:19:49] [INFO ] Deduced a trap composed of 131 places in 122 ms of which 0 ms to minimize.
[2022-06-13 01:19:49] [INFO ] Deduced a trap composed of 129 places in 122 ms of which 1 ms to minimize.
[2022-06-13 01:19:49] [INFO ] Deduced a trap composed of 136 places in 120 ms of which 1 ms to minimize.
[2022-06-13 01:19:49] [INFO ] Deduced a trap composed of 37 places in 122 ms of which 1 ms to minimize.
[2022-06-13 01:19:49] [INFO ] Deduced a trap composed of 138 places in 117 ms of which 0 ms to minimize.
[2022-06-13 01:19:49] [INFO ] Deduced a trap composed of 147 places in 122 ms of which 1 ms to minimize.
[2022-06-13 01:19:49] [INFO ] Deduced a trap composed of 24 places in 113 ms of which 1 ms to minimize.
[2022-06-13 01:19:49] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
[2022-06-13 01:19:50] [INFO ] [Real]Absence check using 55 positive place invariants in 25 ms returned sat
[2022-06-13 01:19:50] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 15 ms returned sat
[2022-06-13 01:19:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:19:50] [INFO ] [Real]Absence check using state equation in 560 ms returned sat
[2022-06-13 01:19:50] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:19:50] [INFO ] [Nat]Absence check using 55 positive place invariants in 23 ms returned sat
[2022-06-13 01:19:50] [INFO ] [Nat]Absence check using 55 positive and 43 generalized place invariants in 11 ms returned sat
[2022-06-13 01:19:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-13 01:19:51] [INFO ] [Nat]Absence check using state equation in 245 ms returned sat
[2022-06-13 01:19:51] [INFO ] Deduced a trap composed of 15 places in 118 ms of which 0 ms to minimize.
[2022-06-13 01:19:51] [INFO ] Deduced a trap composed of 16 places in 117 ms of which 1 ms to minimize.
[2022-06-13 01:19:51] [INFO ] Deduced a trap composed of 8 places in 125 ms of which 0 ms to minimize.
[2022-06-13 01:19:51] [INFO ] Deduced a trap composed of 19 places in 140 ms of which 5 ms to minimize.
[2022-06-13 01:19:51] [INFO ] Deduced a trap composed of 22 places in 120 ms of which 1 ms to minimize.
[2022-06-13 01:19:51] [INFO ] Deduced a trap composed of 22 places in 113 ms of which 1 ms to minimize.
[2022-06-13 01:19:52] [INFO ] Deduced a trap composed of 24 places in 124 ms of which 0 ms to minimize.
[2022-06-13 01:19:52] [INFO ] Deduced a trap composed of 22 places in 136 ms of which 1 ms to minimize.
[2022-06-13 01:19:52] [INFO ] Deduced a trap composed of 25 places in 131 ms of which 2 ms to minimize.
[2022-06-13 01:19:52] [INFO ] Deduced a trap composed of 24 places in 122 ms of which 1 ms to minimize.
[2022-06-13 01:19:52] [INFO ] Deduced a trap composed of 27 places in 121 ms of which 0 ms to minimize.
[2022-06-13 01:19:52] [INFO ] Deduced a trap composed of 42 places in 117 ms of which 0 ms to minimize.
[2022-06-13 01:19:52] [INFO ] Deduced a trap composed of 26 places in 121 ms of which 1 ms to minimize.
[2022-06-13 01:19:53] [INFO ] Deduced a trap composed of 23 places in 110 ms of which 1 ms to minimize.
[2022-06-13 01:19:53] [INFO ] Deduced a trap composed of 21 places in 110 ms of which 1 ms to minimize.
[2022-06-13 01:19:53] [INFO ] Deduced a trap composed of 24 places in 97 ms of which 1 ms to minimize.
[2022-06-13 01:19:53] [INFO ] Deduced a trap composed of 43 places in 109 ms of which 0 ms to minimize.
[2022-06-13 01:19:53] [INFO ] Deduced a trap composed of 118 places in 101 ms of which 1 ms to minimize.
[2022-06-13 01:19:53] [INFO ] Deduced a trap composed of 30 places in 97 ms of which 1 ms to minimize.
[2022-06-13 01:19:53] [INFO ] Deduced a trap composed of 111 places in 107 ms of which 1 ms to minimize.
[2022-06-13 01:19:54] [INFO ] Deduced a trap composed of 111 places in 107 ms of which 1 ms to minimize.
[2022-06-13 01:19:54] [INFO ] Deduced a trap composed of 120 places in 106 ms of which 0 ms to minimize.
[2022-06-13 01:19:54] [INFO ] Deduced a trap composed of 129 places in 106 ms of which 1 ms to minimize.
[2022-06-13 01:19:54] [INFO ] Deduced a trap composed of 43 places in 106 ms of which 1 ms to minimize.
[2022-06-13 01:19:54] [INFO ] Deduced a trap composed of 121 places in 106 ms of which 0 ms to minimize.
[2022-06-13 01:19:54] [INFO ] Deduced a trap composed of 115 places in 115 ms of which 1 ms to minimize.
[2022-06-13 01:19:54] [INFO ] Deduced a trap composed of 116 places in 102 ms of which 0 ms to minimize.
[2022-06-13 01:19:54] [INFO ] Deduced a trap composed of 28 places in 102 ms of which 1 ms to minimize.
[2022-06-13 01:19:55] [INFO ] Deduced a trap composed of 46 places in 94 ms of which 0 ms to minimize.
[2022-06-13 01:19:55] [INFO ] Deduced a trap composed of 123 places in 99 ms of which 1 ms to minimize.
[2022-06-13 01:19:55] [INFO ] Deduced a trap composed of 111 places in 101 ms of which 0 ms to minimize.
[2022-06-13 01:19:55] [INFO ] Deduced a trap composed of 37 places in 102 ms of which 1 ms to minimize.
[2022-06-13 01:19:55] [INFO ] Deduced a trap composed of 44 places in 96 ms of which 0 ms to minimize.
[2022-06-13 01:19:55] [INFO ] Deduced a trap composed of 113 places in 95 ms of which 1 ms to minimize.
[2022-06-13 01:19:55] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
[2022-06-13 01:19:55] [INFO ] [Real]Absence check using 55 positive place invariants in 24 ms returned sat
[2022-06-13 01:19:55] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 17 ms returned sat
[2022-06-13 01:19:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:19:56] [INFO ] [Real]Absence check using state equation in 876 ms returned sat
[2022-06-13 01:19:56] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:19:56] [INFO ] [Real]Absence check using 55 positive place invariants in 20 ms returned sat
[2022-06-13 01:19:56] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 12 ms returned sat
[2022-06-13 01:19:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:19:57] [INFO ] [Real]Absence check using state equation in 180 ms returned sat
[2022-06-13 01:19:57] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:19:57] [INFO ] [Real]Absence check using 55 positive place invariants in 22 ms returned sat
[2022-06-13 01:19:57] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 11 ms returned sat
[2022-06-13 01:19:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:19:57] [INFO ] [Real]Absence check using state equation in 191 ms returned sat
[2022-06-13 01:19:57] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:19:57] [INFO ] [Real]Absence check using 55 positive place invariants in 25 ms returned sat
[2022-06-13 01:19:57] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 19 ms returned sat
[2022-06-13 01:19:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:19:58] [INFO ] [Real]Absence check using state equation in 590 ms returned sat
[2022-06-13 01:19:58] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:19:58] [INFO ] [Nat]Absence check using 55 positive place invariants in 23 ms returned sat
[2022-06-13 01:19:58] [INFO ] [Nat]Absence check using 55 positive and 43 generalized place invariants in 14 ms returned sat
[2022-06-13 01:19:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-13 01:19:59] [INFO ] [Nat]Absence check using state equation in 470 ms returned sat
[2022-06-13 01:19:59] [INFO ] Deduced a trap composed of 8 places in 105 ms of which 0 ms to minimize.
[2022-06-13 01:19:59] [INFO ] Deduced a trap composed of 110 places in 126 ms of which 0 ms to minimize.
[2022-06-13 01:19:59] [INFO ] Deduced a trap composed of 8 places in 113 ms of which 1 ms to minimize.
[2022-06-13 01:19:59] [INFO ] Deduced a trap composed of 19 places in 111 ms of which 0 ms to minimize.
[2022-06-13 01:19:59] [INFO ] Deduced a trap composed of 23 places in 108 ms of which 1 ms to minimize.
[2022-06-13 01:19:59] [INFO ] Deduced a trap composed of 19 places in 111 ms of which 0 ms to minimize.
[2022-06-13 01:20:00] [INFO ] Deduced a trap composed of 16 places in 126 ms of which 1 ms to minimize.
[2022-06-13 01:20:00] [INFO ] Deduced a trap composed of 118 places in 128 ms of which 0 ms to minimize.
[2022-06-13 01:20:00] [INFO ] Deduced a trap composed of 135 places in 120 ms of which 0 ms to minimize.
[2022-06-13 01:20:00] [INFO ] Deduced a trap composed of 16 places in 131 ms of which 0 ms to minimize.
[2022-06-13 01:20:00] [INFO ] Deduced a trap composed of 40 places in 163 ms of which 0 ms to minimize.
[2022-06-13 01:20:00] [INFO ] Deduced a trap composed of 36 places in 120 ms of which 1 ms to minimize.
[2022-06-13 01:20:01] [INFO ] Deduced a trap composed of 134 places in 119 ms of which 1 ms to minimize.
[2022-06-13 01:20:01] [INFO ] Deduced a trap composed of 24 places in 112 ms of which 0 ms to minimize.
[2022-06-13 01:20:01] [INFO ] Deduced a trap composed of 20 places in 120 ms of which 0 ms to minimize.
[2022-06-13 01:20:01] [INFO ] Deduced a trap composed of 34 places in 112 ms of which 1 ms to minimize.
[2022-06-13 01:20:01] [INFO ] Deduced a trap composed of 26 places in 113 ms of which 1 ms to minimize.
[2022-06-13 01:20:01] [INFO ] Deduced a trap composed of 28 places in 109 ms of which 1 ms to minimize.
[2022-06-13 01:20:01] [INFO ] Deduced a trap composed of 23 places in 119 ms of which 1 ms to minimize.
[2022-06-13 01:20:02] [INFO ] Deduced a trap composed of 27 places in 119 ms of which 0 ms to minimize.
[2022-06-13 01:20:02] [INFO ] Deduced a trap composed of 24 places in 113 ms of which 1 ms to minimize.
[2022-06-13 01:20:02] [INFO ] Deduced a trap composed of 125 places in 114 ms of which 0 ms to minimize.
[2022-06-13 01:20:02] [INFO ] Deduced a trap composed of 23 places in 111 ms of which 1 ms to minimize.
[2022-06-13 01:20:02] [INFO ] Deduced a trap composed of 32 places in 113 ms of which 0 ms to minimize.
[2022-06-13 01:20:02] [INFO ] Deduced a trap composed of 47 places in 111 ms of which 1 ms to minimize.
[2022-06-13 01:20:02] [INFO ] Deduced a trap composed of 40 places in 103 ms of which 0 ms to minimize.
[2022-06-13 01:20:03] [INFO ] Deduced a trap composed of 125 places in 119 ms of which 0 ms to minimize.
[2022-06-13 01:20:03] [INFO ] Deduced a trap composed of 21 places in 121 ms of which 0 ms to minimize.
[2022-06-13 01:20:03] [INFO ] Deduced a trap composed of 124 places in 115 ms of which 1 ms to minimize.
[2022-06-13 01:20:03] [INFO ] Deduced a trap composed of 23 places in 109 ms of which 0 ms to minimize.
[2022-06-13 01:20:03] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 6
[2022-06-13 01:20:03] [INFO ] [Real]Absence check using 55 positive place invariants in 22 ms returned sat
[2022-06-13 01:20:03] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 12 ms returned sat
[2022-06-13 01:20:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:20:03] [INFO ] [Real]Absence check using state equation in 209 ms returned sat
[2022-06-13 01:20:04] [INFO ] Deduced a trap composed of 8 places in 156 ms of which 0 ms to minimize.
[2022-06-13 01:20:04] [INFO ] Deduced a trap composed of 20 places in 141 ms of which 1 ms to minimize.
[2022-06-13 01:20:04] [INFO ] Deduced a trap composed of 14 places in 139 ms of which 1 ms to minimize.
[2022-06-13 01:20:04] [INFO ] Deduced a trap composed of 12 places in 137 ms of which 1 ms to minimize.
[2022-06-13 01:20:04] [INFO ] Deduced a trap composed of 21 places in 150 ms of which 1 ms to minimize.
[2022-06-13 01:20:04] [INFO ] Deduced a trap composed of 25 places in 138 ms of which 1 ms to minimize.
[2022-06-13 01:20:05] [INFO ] Deduced a trap composed of 26 places in 138 ms of which 1 ms to minimize.
[2022-06-13 01:20:05] [INFO ] Deduced a trap composed of 23 places in 138 ms of which 1 ms to minimize.
[2022-06-13 01:20:05] [INFO ] Deduced a trap composed of 123 places in 132 ms of which 1 ms to minimize.
[2022-06-13 01:20:05] [INFO ] Deduced a trap composed of 26 places in 129 ms of which 0 ms to minimize.
[2022-06-13 01:20:05] [INFO ] Deduced a trap composed of 22 places in 129 ms of which 1 ms to minimize.
[2022-06-13 01:20:05] [INFO ] Deduced a trap composed of 25 places in 124 ms of which 0 ms to minimize.
[2022-06-13 01:20:05] [INFO ] Deduced a trap composed of 31 places in 129 ms of which 1 ms to minimize.
[2022-06-13 01:20:06] [INFO ] Deduced a trap composed of 17 places in 124 ms of which 1 ms to minimize.
[2022-06-13 01:20:06] [INFO ] Deduced a trap composed of 118 places in 121 ms of which 0 ms to minimize.
[2022-06-13 01:20:06] [INFO ] Deduced a trap composed of 25 places in 120 ms of which 1 ms to minimize.
[2022-06-13 01:20:06] [INFO ] Deduced a trap composed of 23 places in 104 ms of which 0 ms to minimize.
[2022-06-13 01:20:06] [INFO ] Deduced a trap composed of 114 places in 107 ms of which 0 ms to minimize.
[2022-06-13 01:20:06] [INFO ] Deduced a trap composed of 42 places in 31 ms of which 0 ms to minimize.
[2022-06-13 01:20:06] [INFO ] Deduced a trap composed of 45 places in 25 ms of which 0 ms to minimize.
[2022-06-13 01:20:07] [INFO ] Deduced a trap composed of 30 places in 150 ms of which 1 ms to minimize.
[2022-06-13 01:20:07] [INFO ] Deduced a trap composed of 32 places in 122 ms of which 0 ms to minimize.
[2022-06-13 01:20:07] [INFO ] Deduced a trap composed of 32 places in 127 ms of which 1 ms to minimize.
[2022-06-13 01:20:07] [INFO ] Deduced a trap composed of 49 places in 112 ms of which 1 ms to minimize.
[2022-06-13 01:20:07] [INFO ] Deduced a trap composed of 26 places in 115 ms of which 0 ms to minimize.
[2022-06-13 01:20:07] [INFO ] Deduced a trap composed of 151 places in 113 ms of which 0 ms to minimize.
[2022-06-13 01:20:07] [INFO ] Deduced a trap composed of 134 places in 109 ms of which 0 ms to minimize.
[2022-06-13 01:20:08] [INFO ] Deduced a trap composed of 120 places in 132 ms of which 0 ms to minimize.
[2022-06-13 01:20:08] [INFO ] Deduced a trap composed of 133 places in 109 ms of which 1 ms to minimize.
[2022-06-13 01:20:08] [INFO ] Deduced a trap composed of 134 places in 95 ms of which 0 ms to minimize.
[2022-06-13 01:20:08] [INFO ] Trap strengthening (SAT) tested/added 31/30 trap constraints in 4558 ms
[2022-06-13 01:20:08] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:20:08] [INFO ] [Nat]Absence check using 55 positive place invariants in 30 ms returned sat
[2022-06-13 01:20:08] [INFO ] [Nat]Absence check using 55 positive and 43 generalized place invariants in 11 ms returned sat
[2022-06-13 01:20:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-13 01:20:08] [INFO ] [Nat]Absence check using state equation in 179 ms returned sat
[2022-06-13 01:20:08] [INFO ] Deduced a trap composed of 8 places in 143 ms of which 1 ms to minimize.
[2022-06-13 01:20:09] [INFO ] Deduced a trap composed of 20 places in 142 ms of which 1 ms to minimize.
[2022-06-13 01:20:09] [INFO ] Deduced a trap composed of 14 places in 136 ms of which 1 ms to minimize.
[2022-06-13 01:20:09] [INFO ] Deduced a trap composed of 12 places in 128 ms of which 1 ms to minimize.
[2022-06-13 01:20:09] [INFO ] Deduced a trap composed of 21 places in 145 ms of which 1 ms to minimize.
[2022-06-13 01:20:09] [INFO ] Deduced a trap composed of 25 places in 136 ms of which 0 ms to minimize.
[2022-06-13 01:20:09] [INFO ] Deduced a trap composed of 26 places in 130 ms of which 0 ms to minimize.
[2022-06-13 01:20:10] [INFO ] Deduced a trap composed of 23 places in 141 ms of which 1 ms to minimize.
[2022-06-13 01:20:10] [INFO ] Deduced a trap composed of 123 places in 138 ms of which 1 ms to minimize.
[2022-06-13 01:20:10] [INFO ] Deduced a trap composed of 26 places in 130 ms of which 1 ms to minimize.
[2022-06-13 01:20:10] [INFO ] Deduced a trap composed of 30 places in 125 ms of which 1 ms to minimize.
[2022-06-13 01:20:10] [INFO ] Deduced a trap composed of 25 places in 133 ms of which 0 ms to minimize.
[2022-06-13 01:20:10] [INFO ] Deduced a trap composed of 115 places in 131 ms of which 0 ms to minimize.
[2022-06-13 01:20:10] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 1 ms to minimize.
[2022-06-13 01:20:11] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 1 ms to minimize.
[2022-06-13 01:20:11] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 0 ms to minimize.
[2022-06-13 01:20:11] [INFO ] Deduced a trap composed of 31 places in 56 ms of which 0 ms to minimize.
[2022-06-13 01:20:11] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 0 ms to minimize.
[2022-06-13 01:20:11] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 1 ms to minimize.
[2022-06-13 01:20:11] [INFO ] Deduced a trap composed of 34 places in 54 ms of which 1 ms to minimize.
[2022-06-13 01:20:11] [INFO ] Deduced a trap composed of 35 places in 50 ms of which 0 ms to minimize.
[2022-06-13 01:20:11] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 2780 ms
[2022-06-13 01:20:11] [INFO ] Computed and/alt/rep : 489/815/489 causal constraints (skipped 31 transitions) in 31 ms.
[2022-06-13 01:20:13] [INFO ] Deduced a trap composed of 6 places in 185 ms of which 1 ms to minimize.
[2022-06-13 01:20:13] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 7
[2022-06-13 01:20:13] [INFO ] [Real]Absence check using 55 positive place invariants in 23 ms returned sat
[2022-06-13 01:20:13] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 15 ms returned sat
[2022-06-13 01:20:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:20:14] [INFO ] [Real]Absence check using state equation in 331 ms returned sat
[2022-06-13 01:20:14] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:20:14] [INFO ] [Real]Absence check using 55 positive place invariants in 20 ms returned sat
[2022-06-13 01:20:14] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 11 ms returned sat
[2022-06-13 01:20:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:20:14] [INFO ] [Real]Absence check using state equation in 177 ms returned sat
[2022-06-13 01:20:14] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:20:14] [INFO ] [Real]Absence check using 55 positive place invariants in 21 ms returned sat
[2022-06-13 01:20:14] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 13 ms returned sat
[2022-06-13 01:20:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:20:15] [INFO ] [Real]Absence check using state equation in 445 ms returned sat
[2022-06-13 01:20:15] [INFO ] Solution in real domain found non-integer solution.
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-13 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-12 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-11 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-07 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-05 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-04 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-00 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 11 Parikh solutions to 1 different solutions.
Support contains 36 out of 582 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 582/582 places, 521/521 transitions.
Graph (trivial) has 291 edges and 582 vertex of which 4 / 582 are part of one of the 1 SCC in 5 ms
Free SCC test removed 3 places
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 1182 edges and 579 vertex of which 575 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.5 ms
Discarding 4 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 109 transitions
Trivial Post-agglo rules discarded 109 transitions
Performed 109 trivial Post agglomeration. Transition count delta: 109
Iterating post reduction 0 with 109 rules applied. Total rules applied 111 place count 575 transition count 407
Reduce places removed 109 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 117 rules applied. Total rules applied 228 place count 466 transition count 399
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 236 place count 458 transition count 399
Performed 79 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 79 Pre rules applied. Total rules applied 236 place count 458 transition count 320
Deduced a syphon composed of 79 places in 1 ms
Ensure Unique test removed 13 places
Reduce places removed 92 places and 0 transitions.
Iterating global reduction 3 with 171 rules applied. Total rules applied 407 place count 366 transition count 320
Discarding 62 places :
Symmetric choice reduction at 3 with 62 rule applications. Total rules 469 place count 304 transition count 258
Iterating global reduction 3 with 62 rules applied. Total rules applied 531 place count 304 transition count 258
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 531 place count 304 transition count 253
Deduced a syphon composed of 5 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 11 rules applied. Total rules applied 542 place count 298 transition count 253
Performed 81 Post agglomeration using F-continuation condition.Transition count delta: 81
Deduced a syphon composed of 81 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 3 with 165 rules applied. Total rules applied 707 place count 214 transition count 172
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 709 place count 213 transition count 176
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 712 place count 213 transition count 173
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 715 place count 210 transition count 173
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 716 place count 210 transition count 173
Applied a total of 716 rules in 142 ms. Remains 210 /582 variables (removed 372) and now considering 173/521 (removed 348) transitions.
Finished structural reductions, in 1 iterations. Remains : 210/582 places, 173/521 transitions.
[2022-06-13 01:20:15] [INFO ] Flatten gal took : 70 ms
[2022-06-13 01:20:15] [INFO ] Flatten gal took : 25 ms
[2022-06-13 01:20:15] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3148100389762873189.gal : 18 ms
[2022-06-13 01:20:15] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4853296723064709735.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality3148100389762873189.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality4853296723064709735.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality3148100389762873189.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality4853296723064709735.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality4853296723064709735.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :4 after 6
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :6 after 15
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :15 after 20
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :20 after 34
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :34 after 406
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :406 after 1161
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :1161 after 36830
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :726140 after 795068
Reachability property BusinessProcesses-PT-12-ReachabilityCardinality-09 is true.
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Invariant property BusinessProcesses-PT-12-ReachabilityCardinality-08 does not hold.
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Detected timeout of ITS tools.
[2022-06-13 01:20:30] [INFO ] Flatten gal took : 18 ms
[2022-06-13 01:20:30] [INFO ] Applying decomposition
[2022-06-13 01:20:30] [INFO ] Flatten gal took : 15 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph9243978839471186316.txt, -o, /tmp/graph9243978839471186316.bin, -w, /tmp/graph9243978839471186316.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph9243978839471186316.bin, -l, -1, -v, -w, /tmp/graph9243978839471186316.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-13 01:20:30] [INFO ] Decomposing Gal with order
[2022-06-13 01:20:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-13 01:20:31] [INFO ] Removed a total of 112 redundant transitions.
[2022-06-13 01:20:31] [INFO ] Flatten gal took : 48 ms
[2022-06-13 01:20:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 26 labels/synchronizations in 10 ms.
[2022-06-13 01:20:31] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4686130058369000220.gal : 9 ms
[2022-06-13 01:20:31] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality219253344017666560.prop : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality4686130058369000220.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality219253344017666560.prop, --nowitness], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality4686130058369000220.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality219253344017666560.prop --nowitness
Loading property file /tmp/ReachabilityCardinality219253344017666560.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 6
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :6 after 57
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :57 after 235
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :235 after 313
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :313 after 431
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :24412 after 1.06375e+06
Invariant property BusinessProcesses-PT-12-ReachabilityCardinality-02 does not hold.
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Invariant property BusinessProcesses-PT-12-ReachabilityCardinality-01 does not hold.
FORMULA BusinessProcesses-PT-12-ReachabilityCardinality-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 129 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,5.57145e+06,0.170074,9916,907,382,10767,3156,630,15907,194,7724,0
Total reachable state count : 5571452

Verifying 2 reachability properties.
Invariant property BusinessProcesses-PT-12-ReachabilityCardinality-01 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
BusinessProcesses-PT-12-ReachabilityCardinality-01,36864,0.172383,10180,88,80,10767,3156,638,15907,199,7724,0
Invariant property BusinessProcesses-PT-12-ReachabilityCardinality-02 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
BusinessProcesses-PT-12-ReachabilityCardinality-02,18432,0.178833,10180,88,72,10767,3156,717,15907,224,7724,0
All properties solved without resorting to model-checking.

BK_STOP 1655083234361

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination ReachabilityCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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-12"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="gold2021"
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-4028"
echo " Executing tool gold2021"
echo " Input is BusinessProcesses-PT-12, 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 r028-tall-165251936100155"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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