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-165251936200179.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-20, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r028-tall-165251936200179
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 692K
-rw-r--r-- 1 mcc users 6.8K Apr 29 23:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Apr 29 23:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Apr 29 23:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Apr 29 23:52 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 3.8K May 9 07:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 07:11 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 07:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 07:11 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 29 23:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 148K Apr 29 23:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K Apr 29 23:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 83K Apr 29 23:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 07:11 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 192K 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-20-ReachabilityCardinality-00
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityCardinality-01
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityCardinality-02
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityCardinality-03
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityCardinality-04
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityCardinality-05
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityCardinality-06
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityCardinality-07
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityCardinality-08
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityCardinality-09
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityCardinality-10
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityCardinality-11
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityCardinality-12
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityCardinality-13
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityCardinality-14
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1655083472116

Running Version 0
[2022-06-13 01:24:33] [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:24:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-13 01:24:33] [INFO ] Load time of PNML (sax parser for PT used): 86 ms
[2022-06-13 01:24:33] [INFO ] Transformed 782 places.
[2022-06-13 01:24:33] [INFO ] Transformed 697 transitions.
[2022-06-13 01:24:33] [INFO ] Found NUPN structural information;
[2022-06-13 01:24:33] [INFO ] Parsed PT model containing 782 places and 697 transitions in 140 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 92 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 63 places in 18 ms
Reduce places removed 63 places and 59 transitions.
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 49 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 13) seen :3
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 9 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 9 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 9 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 10) seen :3
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 9 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 638 rows 719 cols
[2022-06-13 01:24:34] [INFO ] Computed 121 place invariants in 40 ms
[2022-06-13 01:24:34] [INFO ] [Real]Absence check using 78 positive place invariants in 42 ms returned sat
[2022-06-13 01:24:34] [INFO ] [Real]Absence check using 78 positive and 43 generalized place invariants in 18 ms returned sat
[2022-06-13 01:24:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:24:35] [INFO ] [Real]Absence check using state equation in 554 ms returned sat
[2022-06-13 01:24:35] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:24:35] [INFO ] [Real]Absence check using 78 positive place invariants in 40 ms returned sat
[2022-06-13 01:24:35] [INFO ] [Real]Absence check using 78 positive and 43 generalized place invariants in 18 ms returned sat
[2022-06-13 01:24:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:24:36] [INFO ] [Real]Absence check using state equation in 521 ms returned sat
[2022-06-13 01:24:36] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:24:36] [INFO ] [Nat]Absence check using 78 positive place invariants in 37 ms returned sat
[2022-06-13 01:24:36] [INFO ] [Nat]Absence check using 78 positive and 43 generalized place invariants in 15 ms returned sat
[2022-06-13 01:24:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-13 01:24:36] [INFO ] [Nat]Absence check using state equation in 211 ms returned sat
[2022-06-13 01:24:37] [INFO ] Deduced a trap composed of 11 places in 267 ms of which 4 ms to minimize.
[2022-06-13 01:24:37] [INFO ] Deduced a trap composed of 18 places in 220 ms of which 2 ms to minimize.
[2022-06-13 01:24:37] [INFO ] Deduced a trap composed of 28 places in 192 ms of which 1 ms to minimize.
[2022-06-13 01:24:37] [INFO ] Deduced a trap composed of 19 places in 185 ms of which 2 ms to minimize.
[2022-06-13 01:24:37] [INFO ] Deduced a trap composed of 46 places in 183 ms of which 1 ms to minimize.
[2022-06-13 01:24:38] [INFO ] Deduced a trap composed of 39 places in 197 ms of which 1 ms to minimize.
[2022-06-13 01:24:38] [INFO ] Deduced a trap composed of 137 places in 163 ms of which 1 ms to minimize.
[2022-06-13 01:24:38] [INFO ] Deduced a trap composed of 26 places in 162 ms of which 1 ms to minimize.
[2022-06-13 01:24:38] [INFO ] Deduced a trap composed of 25 places in 163 ms of which 0 ms to minimize.
[2022-06-13 01:24:38] [INFO ] Deduced a trap composed of 11 places in 164 ms of which 1 ms to minimize.
[2022-06-13 01:24:39] [INFO ] Deduced a trap composed of 46 places in 159 ms of which 0 ms to minimize.
[2022-06-13 01:24:39] [INFO ] Deduced a trap composed of 161 places in 154 ms of which 0 ms to minimize.
[2022-06-13 01:24:39] [INFO ] Deduced a trap composed of 41 places in 149 ms of which 1 ms to minimize.
[2022-06-13 01:24:39] [INFO ] Deduced a trap composed of 158 places in 150 ms of which 0 ms to minimize.
[2022-06-13 01:24:39] [INFO ] Deduced a trap composed of 39 places in 146 ms of which 0 ms to minimize.
[2022-06-13 01:24:40] [INFO ] Deduced a trap composed of 43 places in 143 ms of which 1 ms to minimize.
[2022-06-13 01:24:40] [INFO ] Deduced a trap composed of 142 places in 156 ms of which 1 ms to minimize.
[2022-06-13 01:24:40] [INFO ] Deduced a trap composed of 137 places in 147 ms of which 1 ms to minimize.
[2022-06-13 01:24:40] [INFO ] Deduced a trap composed of 142 places in 148 ms of which 0 ms to minimize.
[2022-06-13 01:24:40] [INFO ] Deduced a trap composed of 28 places in 153 ms of which 1 ms to minimize.
[2022-06-13 01:24:40] [INFO ] Deduced a trap composed of 47 places in 147 ms of which 1 ms to minimize.
[2022-06-13 01:24:41] [INFO ] Deduced a trap composed of 165 places in 165 ms of which 1 ms to minimize.
[2022-06-13 01:24:41] [INFO ] Deduced a trap composed of 160 places in 158 ms of which 1 ms to minimize.
[2022-06-13 01:24:41] [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:24:41] [INFO ] [Real]Absence check using 78 positive place invariants in 45 ms returned sat
[2022-06-13 01:24:41] [INFO ] [Real]Absence check using 78 positive and 43 generalized place invariants in 14 ms returned sat
[2022-06-13 01:24:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:24:41] [INFO ] [Real]Absence check using state equation in 246 ms returned sat
[2022-06-13 01:24:42] [INFO ] Deduced a trap composed of 141 places in 168 ms of which 1 ms to minimize.
[2022-06-13 01:24:42] [INFO ] Deduced a trap composed of 11 places in 158 ms of which 0 ms to minimize.
[2022-06-13 01:24:42] [INFO ] Deduced a trap composed of 151 places in 171 ms of which 0 ms to minimize.
[2022-06-13 01:24:42] [INFO ] Deduced a trap composed of 19 places in 158 ms of which 0 ms to minimize.
[2022-06-13 01:24:42] [INFO ] Deduced a trap composed of 18 places in 161 ms of which 1 ms to minimize.
[2022-06-13 01:24:43] [INFO ] Deduced a trap composed of 56 places in 185 ms of which 0 ms to minimize.
[2022-06-13 01:24:43] [INFO ] Deduced a trap composed of 26 places in 150 ms of which 0 ms to minimize.
[2022-06-13 01:24:43] [INFO ] Deduced a trap composed of 84 places in 153 ms of which 0 ms to minimize.
[2022-06-13 01:24:43] [INFO ] Deduced a trap composed of 141 places in 162 ms of which 0 ms to minimize.
[2022-06-13 01:24:43] [INFO ] Deduced a trap composed of 57 places in 147 ms of which 1 ms to minimize.
[2022-06-13 01:24:43] [INFO ] Deduced a trap composed of 68 places in 148 ms of which 1 ms to minimize.
[2022-06-13 01:24:44] [INFO ] Deduced a trap composed of 150 places in 150 ms of which 5 ms to minimize.
[2022-06-13 01:24:44] [INFO ] Deduced a trap composed of 153 places in 146 ms of which 1 ms to minimize.
[2022-06-13 01:24:44] [INFO ] Deduced a trap composed of 152 places in 147 ms of which 0 ms to minimize.
[2022-06-13 01:24:44] [INFO ] Deduced a trap composed of 158 places in 149 ms of which 0 ms to minimize.
[2022-06-13 01:24:44] [INFO ] Deduced a trap composed of 61 places in 160 ms of which 1 ms to minimize.
[2022-06-13 01:24:45] [INFO ] Deduced a trap composed of 153 places in 149 ms of which 0 ms to minimize.
[2022-06-13 01:24:45] [INFO ] Deduced a trap composed of 159 places in 156 ms of which 0 ms to minimize.
[2022-06-13 01:24:45] [INFO ] Deduced a trap composed of 152 places in 149 ms of which 1 ms to minimize.
[2022-06-13 01:24:45] [INFO ] Deduced a trap composed of 70 places in 145 ms of which 0 ms to minimize.
[2022-06-13 01:24:45] [INFO ] Deduced a trap composed of 160 places in 154 ms of which 0 ms to minimize.
[2022-06-13 01:24:46] [INFO ] Deduced a trap composed of 71 places in 147 ms of which 1 ms to minimize.
[2022-06-13 01:24:46] [INFO ] Deduced a trap composed of 166 places in 152 ms of which 1 ms to minimize.
[2022-06-13 01:24:46] [INFO ] Deduced a trap composed of 164 places in 154 ms of which 1 ms to minimize.
[2022-06-13 01:24:46] [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:24:46] [INFO ] [Real]Absence check using 78 positive place invariants in 43 ms returned sat
[2022-06-13 01:24:46] [INFO ] [Real]Absence check using 78 positive and 43 generalized place invariants in 34 ms returned sat
[2022-06-13 01:24:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:24:49] [INFO ] [Real]Absence check using state equation in 2406 ms returned sat
[2022-06-13 01:24:49] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:24:49] [INFO ] [Nat]Absence check using 78 positive place invariants in 39 ms returned sat
[2022-06-13 01:24:49] [INFO ] [Nat]Absence check using 78 positive and 43 generalized place invariants in 15 ms returned unsat
[2022-06-13 01:24:49] [INFO ] [Real]Absence check using 78 positive place invariants in 34 ms returned sat
[2022-06-13 01:24:49] [INFO ] [Real]Absence check using 78 positive and 43 generalized place invariants in 17 ms returned sat
[2022-06-13 01:24:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:24:49] [INFO ] [Real]Absence check using state equation in 340 ms returned sat
[2022-06-13 01:24:49] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:24:49] [INFO ] [Real]Absence check using 78 positive place invariants in 41 ms returned sat
[2022-06-13 01:24:50] [INFO ] [Real]Absence check using 78 positive and 43 generalized place invariants in 39 ms returned sat
[2022-06-13 01:24:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:24:51] [INFO ] [Real]Absence check using state equation in 1717 ms returned sat
[2022-06-13 01:24:51] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:24:52] [INFO ] [Real]Absence check using 78 positive place invariants in 32 ms returned sat
[2022-06-13 01:24:52] [INFO ] [Real]Absence check using 78 positive and 43 generalized place invariants in 13 ms returned sat
[2022-06-13 01:24:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:24:52] [INFO ] [Real]Absence check using state equation in 236 ms returned sat
[2022-06-13 01:24:52] [INFO ] Deduced a trap composed of 8 places in 171 ms of which 0 ms to minimize.
[2022-06-13 01:24:52] [INFO ] Deduced a trap composed of 16 places in 195 ms of which 0 ms to minimize.
[2022-06-13 01:24:52] [INFO ] Deduced a trap composed of 19 places in 164 ms of which 0 ms to minimize.
[2022-06-13 01:24:53] [INFO ] Deduced a trap composed of 19 places in 163 ms of which 2 ms to minimize.
[2022-06-13 01:24:53] [INFO ] Deduced a trap composed of 21 places in 151 ms of which 0 ms to minimize.
[2022-06-13 01:24:53] [INFO ] Deduced a trap composed of 22 places in 152 ms of which 1 ms to minimize.
[2022-06-13 01:24:53] [INFO ] Deduced a trap composed of 29 places in 154 ms of which 1 ms to minimize.
[2022-06-13 01:24:53] [INFO ] Deduced a trap composed of 19 places in 80 ms of which 0 ms to minimize.
[2022-06-13 01:24:53] [INFO ] Deduced a trap composed of 27 places in 75 ms of which 1 ms to minimize.
[2022-06-13 01:24:54] [INFO ] Deduced a trap composed of 22 places in 76 ms of which 8 ms to minimize.
[2022-06-13 01:24:54] [INFO ] Deduced a trap composed of 28 places in 62 ms of which 0 ms to minimize.
[2022-06-13 01:24:54] [INFO ] Deduced a trap composed of 39 places in 63 ms of which 0 ms to minimize.
[2022-06-13 01:24:54] [INFO ] Deduced a trap composed of 37 places in 57 ms of which 0 ms to minimize.
[2022-06-13 01:24:54] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 2000 ms
[2022-06-13 01:24:54] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:24:54] [INFO ] [Nat]Absence check using 78 positive place invariants in 29 ms returned sat
[2022-06-13 01:24:54] [INFO ] [Nat]Absence check using 78 positive and 43 generalized place invariants in 11 ms returned sat
[2022-06-13 01:24:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-13 01:24:54] [INFO ] [Nat]Absence check using state equation in 211 ms returned sat
[2022-06-13 01:24:54] [INFO ] Deduced a trap composed of 8 places in 173 ms of which 0 ms to minimize.
[2022-06-13 01:24:55] [INFO ] Deduced a trap composed of 16 places in 173 ms of which 1 ms to minimize.
[2022-06-13 01:24:55] [INFO ] Deduced a trap composed of 19 places in 157 ms of which 0 ms to minimize.
[2022-06-13 01:24:55] [INFO ] Deduced a trap composed of 19 places in 170 ms of which 1 ms to minimize.
[2022-06-13 01:24:55] [INFO ] Deduced a trap composed of 23 places in 172 ms of which 1 ms to minimize.
[2022-06-13 01:24:55] [INFO ] Deduced a trap composed of 21 places in 167 ms of which 1 ms to minimize.
[2022-06-13 01:24:56] [INFO ] Deduced a trap composed of 27 places in 167 ms of which 1 ms to minimize.
[2022-06-13 01:24:56] [INFO ] Deduced a trap composed of 22 places in 168 ms of which 0 ms to minimize.
[2022-06-13 01:24:56] [INFO ] Deduced a trap composed of 135 places in 166 ms of which 0 ms to minimize.
[2022-06-13 01:24:56] [INFO ] Deduced a trap composed of 138 places in 165 ms of which 0 ms to minimize.
[2022-06-13 01:24:56] [INFO ] Deduced a trap composed of 139 places in 184 ms of which 1 ms to minimize.
[2022-06-13 01:24:57] [INFO ] Deduced a trap composed of 20 places in 163 ms of which 0 ms to minimize.
[2022-06-13 01:24:57] [INFO ] Deduced a trap composed of 140 places in 160 ms of which 0 ms to minimize.
[2022-06-13 01:24:57] [INFO ] Deduced a trap composed of 26 places in 162 ms of which 0 ms to minimize.
[2022-06-13 01:24:57] [INFO ] Deduced a trap composed of 22 places in 161 ms of which 1 ms to minimize.
[2022-06-13 01:24:57] [INFO ] Deduced a trap composed of 32 places in 176 ms of which 0 ms to minimize.
[2022-06-13 01:24:57] [INFO ] Deduced a trap composed of 29 places in 75 ms of which 1 ms to minimize.
[2022-06-13 01:24:58] [INFO ] Deduced a trap composed of 38 places in 70 ms of which 0 ms to minimize.
[2022-06-13 01:24:58] [INFO ] Deduced a trap composed of 39 places in 66 ms of which 1 ms to minimize.
[2022-06-13 01:24:58] [INFO ] Deduced a trap composed of 37 places in 58 ms of which 1 ms to minimize.
[2022-06-13 01:24:58] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 3574 ms
[2022-06-13 01:24:58] [INFO ] Computed and/alt/rep : 600/951/600 causal constraints (skipped 37 transitions) in 42 ms.
[2022-06-13 01:24:59] [INFO ] Deduced a trap composed of 11 places in 238 ms of which 1 ms to minimize.
[2022-06-13 01:24:59] [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
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-14 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-08 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-07 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-01 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 7 Parikh solutions to 1 different solutions.
Support contains 13 out of 719 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 719/719 places, 638/638 transitions.
Graph (trivial) has 399 edges and 719 vertex of which 7 / 719 are part of one of the 1 SCC in 8 ms
Free SCC test removed 6 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1410 edges and 713 vertex of which 686 are kept as prefixes of interest. Removing 27 places using SCC suffix rule.5 ms
Discarding 27 places :
Also discarding 13 output transitions
Drop transitions removed 13 transitions
Drop transitions removed 159 transitions
Trivial Post-agglo rules discarded 159 transitions
Performed 159 trivial Post agglomeration. Transition count delta: 159
Iterating post reduction 0 with 159 rules applied. Total rules applied 161 place count 686 transition count 458
Reduce places removed 159 places and 0 transitions.
Iterating post reduction 1 with 159 rules applied. Total rules applied 320 place count 527 transition count 458
Performed 108 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 108 Pre rules applied. Total rules applied 320 place count 527 transition count 350
Deduced a syphon composed of 108 places in 2 ms
Ensure Unique test removed 19 places
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 2 with 235 rules applied. Total rules applied 555 place count 400 transition count 350
Discarding 90 places :
Symmetric choice reduction at 2 with 90 rule applications. Total rules 645 place count 310 transition count 260
Iterating global reduction 2 with 90 rules applied. Total rules applied 735 place count 310 transition count 260
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 735 place count 310 transition count 253
Deduced a syphon composed of 7 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 15 rules applied. Total rules applied 750 place count 302 transition count 253
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: 96
Deduced a syphon composed of 96 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 2 with 194 rules applied. Total rules applied 944 place count 204 transition count 157
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 948 place count 202 transition count 164
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 950 place count 202 transition count 162
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 952 place count 200 transition count 162
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 953 place count 200 transition count 162
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 954 place count 199 transition count 161
Applied a total of 954 rules in 165 ms. Remains 199 /719 variables (removed 520) and now considering 161/638 (removed 477) transitions.
Finished structural reductions, in 1 iterations. Remains : 199/719 places, 161/638 transitions.
[2022-06-13 01:25:00] [INFO ] Flatten gal took : 76 ms
[2022-06-13 01:25:00] [INFO ] Flatten gal took : 24 ms
[2022-06-13 01:25:00] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11397047336062120101.gal : 11 ms
[2022-06-13 01:25:00] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17774350029933540951.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/ReachabilityCardinality11397047336062120101.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality17774350029933540951.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/ReachabilityCardinality11397047336062120101.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality17774350029933540951.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality17774350029933540951.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :2 after 11
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :11 after 47
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :47 after 91
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :91 after 267
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :267 after 871
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :871 after 4871
Reachability property BusinessProcesses-PT-20-ReachabilityCardinality-06 is true.
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Invariant property BusinessProcesses-PT-20-ReachabilityCardinality-05 does not hold.
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :4871 after 48903
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :48903 after 185863
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :185863 after 1.2923e+06
Reachability property BusinessProcesses-PT-20-ReachabilityCardinality-15 is true.
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 1025 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,3.23514e+07,0.560699,17096,2,4793,18,53637,6,0,957,30488,0
Total reachable state count : 32351381

Verifying 3 reachability properties.
Invariant property BusinessProcesses-PT-20-ReachabilityCardinality-05 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-20-ReachabilityCardinality-05,65024,2.94902,17096,2,321,18,53637,7,0,982,30488,0
Reachability property BusinessProcesses-PT-20-ReachabilityCardinality-06 is true.

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-20-ReachabilityCardinality-06,1,2.94999,17360,2,200,18,53637,8,0,989,30488,0
Reachability property BusinessProcesses-PT-20-ReachabilityCardinality-15 is true.

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-20-ReachabilityCardinality-15,2048,2.95071,17360,2,252,18,53637,9,0,994,30488,0
All properties solved without resorting to model-checking.

BK_STOP 1655083504151

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

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