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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 640K
-rw-r--r-- 1 mcc users 9.0K Apr 30 00:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 105K Apr 30 00:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Apr 30 00:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Apr 30 00:01 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:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 9 07:08 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 07:09 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 07:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Apr 30 00:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 176K Apr 30 00:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 30 00:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 106K Apr 30 00:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 07:09 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 59K 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-02-ReachabilityFireability-00
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityFireability-01
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityFireability-02
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityFireability-03
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityFireability-04
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityFireability-05
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityFireability-06
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityFireability-07
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityFireability-08
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityFireability-09
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityFireability-10
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityFireability-11
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityFireability-12
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityFireability-13
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityFireability-14
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1655082926938

Running Version 0
[2022-06-13 01:15:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -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:15:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-13 01:15:28] [INFO ] Load time of PNML (sax parser for PT used): 56 ms
[2022-06-13 01:15:28] [INFO ] Transformed 262 places.
[2022-06-13 01:15:28] [INFO ] Transformed 219 transitions.
[2022-06-13 01:15:28] [INFO ] Found NUPN structural information;
[2022-06-13 01:15:28] [INFO ] Parsed PT model containing 262 places and 219 transitions in 102 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 17 places in 4 ms
Reduce places removed 17 places and 15 transitions.
FORMULA BusinessProcesses-PT-02-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 137 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 15) seen :7
FORMULA BusinessProcesses-PT-02-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-02-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-02-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-02-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-02-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-02-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-02-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 23 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 26 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 204 rows 245 cols
[2022-06-13 01:15:29] [INFO ] Computed 43 place invariants in 24 ms
[2022-06-13 01:15:29] [INFO ] [Real]Absence check using 30 positive place invariants in 19 ms returned sat
[2022-06-13 01:15:29] [INFO ] [Real]Absence check using 30 positive and 13 generalized place invariants in 5 ms returned sat
[2022-06-13 01:15:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:15:29] [INFO ] [Real]Absence check using state equation in 81 ms returned sat
[2022-06-13 01:15:29] [INFO ] Deduced a trap composed of 12 places in 117 ms of which 4 ms to minimize.
[2022-06-13 01:15:29] [INFO ] Deduced a trap composed of 55 places in 83 ms of which 3 ms to minimize.
[2022-06-13 01:15:29] [INFO ] Deduced a trap composed of 8 places in 47 ms of which 1 ms to minimize.
[2022-06-13 01:15:29] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2022-06-13 01:15:29] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
[2022-06-13 01:15:30] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 0 ms to minimize.
[2022-06-13 01:15:30] [INFO ] Deduced a trap composed of 39 places in 34 ms of which 1 ms to minimize.
[2022-06-13 01:15:30] [INFO ] Deduced a trap composed of 22 places in 25 ms of which 1 ms to minimize.
[2022-06-13 01:15:30] [INFO ] Deduced a trap composed of 32 places in 26 ms of which 1 ms to minimize.
[2022-06-13 01:15:30] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 586 ms
[2022-06-13 01:15:30] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:15:30] [INFO ] [Nat]Absence check using 30 positive place invariants in 12 ms returned sat
[2022-06-13 01:15:30] [INFO ] [Nat]Absence check using 30 positive and 13 generalized place invariants in 5 ms returned sat
[2022-06-13 01:15:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-13 01:15:30] [INFO ] [Nat]Absence check using state equation in 66 ms returned sat
[2022-06-13 01:15:30] [INFO ] Deduced a trap composed of 12 places in 61 ms of which 1 ms to minimize.
[2022-06-13 01:15:30] [INFO ] Deduced a trap composed of 55 places in 54 ms of which 1 ms to minimize.
[2022-06-13 01:15:30] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 1 ms to minimize.
[2022-06-13 01:15:30] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 1 ms to minimize.
[2022-06-13 01:15:30] [INFO ] Deduced a trap composed of 37 places in 29 ms of which 1 ms to minimize.
[2022-06-13 01:15:30] [INFO ] Deduced a trap composed of 19 places in 22 ms of which 1 ms to minimize.
[2022-06-13 01:15:30] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 331 ms
[2022-06-13 01:15:30] [INFO ] Computed and/alt/rep : 188/229/188 causal constraints (skipped 15 transitions) in 12 ms.
[2022-06-13 01:15:31] [INFO ] Added : 141 causal constraints over 29 iterations in 514 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 2 ms.
[2022-06-13 01:15:31] [INFO ] [Real]Absence check using 30 positive place invariants in 14 ms returned sat
[2022-06-13 01:15:31] [INFO ] [Real]Absence check using 30 positive and 13 generalized place invariants in 3 ms returned sat
[2022-06-13 01:15:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:15:31] [INFO ] [Real]Absence check using state equation in 114 ms returned sat
[2022-06-13 01:15:31] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:15:31] [INFO ] [Nat]Absence check using 30 positive place invariants in 5 ms returned unsat
[2022-06-13 01:15:31] [INFO ] [Real]Absence check using 30 positive place invariants in 9 ms returned sat
[2022-06-13 01:15:31] [INFO ] [Real]Absence check using 30 positive and 13 generalized place invariants in 3 ms returned sat
[2022-06-13 01:15:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:15:31] [INFO ] [Real]Absence check using state equation in 63 ms returned sat
[2022-06-13 01:15:31] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 0 ms to minimize.
[2022-06-13 01:15:31] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 0 ms to minimize.
[2022-06-13 01:15:31] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 0 ms to minimize.
[2022-06-13 01:15:31] [INFO ] Deduced a trap composed of 56 places in 44 ms of which 0 ms to minimize.
[2022-06-13 01:15:31] [INFO ] Deduced a trap composed of 55 places in 43 ms of which 0 ms to minimize.
[2022-06-13 01:15:31] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 1 ms to minimize.
[2022-06-13 01:15:31] [INFO ] Deduced a trap composed of 55 places in 44 ms of which 0 ms to minimize.
[2022-06-13 01:15:32] [INFO ] Deduced a trap composed of 60 places in 50 ms of which 0 ms to minimize.
[2022-06-13 01:15:32] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 0 ms to minimize.
[2022-06-13 01:15:32] [INFO ] Deduced a trap composed of 59 places in 40 ms of which 0 ms to minimize.
[2022-06-13 01:15:32] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2022-06-13 01:15:32] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2022-06-13 01:15:32] [INFO ] Deduced a trap composed of 60 places in 40 ms of which 1 ms to minimize.
[2022-06-13 01:15:32] [INFO ] Deduced a trap composed of 64 places in 52 ms of which 0 ms to minimize.
[2022-06-13 01:15:32] [INFO ] Deduced a trap composed of 59 places in 47 ms of which 0 ms to minimize.
[2022-06-13 01:15:32] [INFO ] Deduced a trap composed of 59 places in 41 ms of which 0 ms to minimize.
[2022-06-13 01:15:32] [INFO ] Deduced a trap composed of 59 places in 41 ms of which 1 ms to minimize.
[2022-06-13 01:15:32] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2022-06-13 01:15:32] [INFO ] Deduced a trap composed of 61 places in 50 ms of which 5 ms to minimize.
[2022-06-13 01:15:32] [INFO ] Deduced a trap composed of 67 places in 39 ms of which 0 ms to minimize.
[2022-06-13 01:15:32] [INFO ] Deduced a trap composed of 56 places in 32 ms of which 1 ms to minimize.
[2022-06-13 01:15:32] [INFO ] Deduced a trap composed of 57 places in 37 ms of which 1 ms to minimize.
[2022-06-13 01:15:32] [INFO ] Deduced a trap composed of 64 places in 38 ms of which 0 ms to minimize.
[2022-06-13 01:15:32] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 1288 ms
[2022-06-13 01:15:32] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:15:32] [INFO ] [Nat]Absence check using 30 positive place invariants in 9 ms returned sat
[2022-06-13 01:15:32] [INFO ] [Nat]Absence check using 30 positive and 13 generalized place invariants in 3 ms returned sat
[2022-06-13 01:15:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-13 01:15:32] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2022-06-13 01:15:33] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 0 ms to minimize.
[2022-06-13 01:15:33] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 0 ms to minimize.
[2022-06-13 01:15:33] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 1 ms to minimize.
[2022-06-13 01:15:33] [INFO ] Deduced a trap composed of 56 places in 44 ms of which 0 ms to minimize.
[2022-06-13 01:15:33] [INFO ] Deduced a trap composed of 55 places in 52 ms of which 0 ms to minimize.
[2022-06-13 01:15:33] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 1 ms to minimize.
[2022-06-13 01:15:33] [INFO ] Deduced a trap composed of 55 places in 41 ms of which 1 ms to minimize.
[2022-06-13 01:15:33] [INFO ] Deduced a trap composed of 60 places in 47 ms of which 1 ms to minimize.
[2022-06-13 01:15:33] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2022-06-13 01:15:33] [INFO ] Deduced a trap composed of 59 places in 40 ms of which 0 ms to minimize.
[2022-06-13 01:15:33] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2022-06-13 01:15:33] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2022-06-13 01:15:33] [INFO ] Deduced a trap composed of 60 places in 42 ms of which 0 ms to minimize.
[2022-06-13 01:15:33] [INFO ] Deduced a trap composed of 64 places in 42 ms of which 1 ms to minimize.
[2022-06-13 01:15:33] [INFO ] Deduced a trap composed of 59 places in 41 ms of which 1 ms to minimize.
[2022-06-13 01:15:33] [INFO ] Deduced a trap composed of 57 places in 44 ms of which 0 ms to minimize.
[2022-06-13 01:15:33] [INFO ] Deduced a trap composed of 56 places in 43 ms of which 1 ms to minimize.
[2022-06-13 01:15:33] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 8 ms to minimize.
[2022-06-13 01:15:34] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 0 ms to minimize.
[2022-06-13 01:15:34] [INFO ] Deduced a trap composed of 25 places in 64 ms of which 1 ms to minimize.
[2022-06-13 01:15:34] [INFO ] Deduced a trap composed of 53 places in 51 ms of which 1 ms to minimize.
[2022-06-13 01:15:34] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2022-06-13 01:15:34] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 1 ms to minimize.
[2022-06-13 01:15:34] [INFO ] Deduced a trap composed of 61 places in 53 ms of which 1 ms to minimize.
[2022-06-13 01:15:34] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 0 ms to minimize.
[2022-06-13 01:15:34] [INFO ] Deduced a trap composed of 29 places in 55 ms of which 0 ms to minimize.
[2022-06-13 01:15:34] [INFO ] Deduced a trap composed of 56 places in 55 ms of which 0 ms to minimize.
[2022-06-13 01:15:34] [INFO ] Deduced a trap composed of 26 places in 60 ms of which 1 ms to minimize.
[2022-06-13 01:15:34] [INFO ] Deduced a trap composed of 33 places in 49 ms of which 0 ms to minimize.
[2022-06-13 01:15:34] [INFO ] Deduced a trap composed of 50 places in 52 ms of which 0 ms to minimize.
[2022-06-13 01:15:34] [INFO ] Deduced a trap composed of 29 places in 61 ms of which 0 ms to minimize.
[2022-06-13 01:15:34] [INFO ] Deduced a trap composed of 64 places in 71 ms of which 1 ms to minimize.
[2022-06-13 01:15:34] [INFO ] Deduced a trap composed of 58 places in 75 ms of which 11 ms to minimize.
[2022-06-13 01:15:35] [INFO ] Deduced a trap composed of 61 places in 75 ms of which 9 ms to minimize.
[2022-06-13 01:15:35] [INFO ] Deduced a trap composed of 63 places in 69 ms of which 0 ms to minimize.
[2022-06-13 01:15:35] [INFO ] Deduced a trap composed of 64 places in 75 ms of which 0 ms to minimize.
[2022-06-13 01:15:35] [INFO ] Deduced a trap composed of 65 places in 66 ms of which 1 ms to minimize.
[2022-06-13 01:15:35] [INFO ] Deduced a trap composed of 62 places in 101 ms of which 0 ms to minimize.
[2022-06-13 01:15:35] [INFO ] Deduced a trap composed of 57 places in 67 ms of which 0 ms to minimize.
[2022-06-13 01:15:35] [INFO ] Deduced a trap composed of 62 places in 42 ms of which 1 ms to minimize.
[2022-06-13 01:15:35] [INFO ] Deduced a trap composed of 61 places in 39 ms of which 2 ms to minimize.
[2022-06-13 01:15:35] [INFO ] Deduced a trap composed of 57 places in 39 ms of which 2 ms to minimize.
[2022-06-13 01:15:35] [INFO ] Trap strengthening (SAT) tested/added 43/42 trap constraints in 2720 ms
[2022-06-13 01:15:35] [INFO ] Computed and/alt/rep : 188/229/188 causal constraints (skipped 15 transitions) in 14 ms.
[2022-06-13 01:15:36] [INFO ] Added : 130 causal constraints over 26 iterations in 561 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 5 ms.
[2022-06-13 01:15:36] [INFO ] [Real]Absence check using 30 positive place invariants in 11 ms returned sat
[2022-06-13 01:15:36] [INFO ] [Real]Absence check using 30 positive and 13 generalized place invariants in 6 ms returned unsat
[2022-06-13 01:15:36] [INFO ] [Real]Absence check using 30 positive place invariants in 9 ms returned sat
[2022-06-13 01:15:36] [INFO ] [Real]Absence check using 30 positive and 13 generalized place invariants in 9 ms returned sat
[2022-06-13 01:15:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:15:36] [INFO ] [Real]Absence check using state equation in 68 ms returned sat
[2022-06-13 01:15:36] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:15:36] [INFO ] [Nat]Absence check using 30 positive place invariants in 5 ms returned unsat
[2022-06-13 01:15:36] [INFO ] [Real]Absence check using 30 positive place invariants in 5 ms returned unsat
[2022-06-13 01:15:36] [INFO ] [Real]Absence check using 30 positive place invariants in 9 ms returned sat
[2022-06-13 01:15:36] [INFO ] [Real]Absence check using 30 positive and 13 generalized place invariants in 5 ms returned sat
[2022-06-13 01:15:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:15:36] [INFO ] [Real]Absence check using state equation in 121 ms returned sat
[2022-06-13 01:15:36] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:15:36] [INFO ] [Nat]Absence check using 30 positive place invariants in 10 ms returned sat
[2022-06-13 01:15:36] [INFO ] [Nat]Absence check using 30 positive and 13 generalized place invariants in 3 ms returned sat
[2022-06-13 01:15:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-13 01:15:36] [INFO ] [Nat]Absence check using state equation in 71 ms returned sat
[2022-06-13 01:15:36] [INFO ] Deduced a trap composed of 8 places in 60 ms of which 1 ms to minimize.
[2022-06-13 01:15:37] [INFO ] Deduced a trap composed of 28 places in 54 ms of which 1 ms to minimize.
[2022-06-13 01:15:37] [INFO ] Deduced a trap composed of 58 places in 41 ms of which 1 ms to minimize.
[2022-06-13 01:15:37] [INFO ] Deduced a trap composed of 62 places in 44 ms of which 1 ms to minimize.
[2022-06-13 01:15:37] [INFO ] Deduced a trap composed of 61 places in 44 ms of which 1 ms to minimize.
[2022-06-13 01:15:37] [INFO ] Deduced a trap composed of 61 places in 42 ms of which 1 ms to minimize.
[2022-06-13 01:15:37] [INFO ] Deduced a trap composed of 58 places in 42 ms of which 0 ms to minimize.
[2022-06-13 01:15:37] [INFO ] Deduced a trap composed of 58 places in 40 ms of which 0 ms to minimize.
[2022-06-13 01:15:37] [INFO ] Deduced a trap composed of 58 places in 49 ms of which 0 ms to minimize.
[2022-06-13 01:15:37] [INFO ] Deduced a trap composed of 59 places in 50 ms of which 1 ms to minimize.
[2022-06-13 01:15:37] [INFO ] Deduced a trap composed of 61 places in 43 ms of which 0 ms to minimize.
[2022-06-13 01:15:37] [INFO ] Deduced a trap composed of 59 places in 47 ms of which 1 ms to minimize.
[2022-06-13 01:15:37] [INFO ] Deduced a trap composed of 60 places in 47 ms of which 1 ms to minimize.
[2022-06-13 01:15:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 13 trap constraints in 797 ms
[2022-06-13 01:15:37] [INFO ] [Real]Absence check using 30 positive place invariants in 11 ms returned sat
[2022-06-13 01:15:37] [INFO ] [Real]Absence check using 30 positive and 13 generalized place invariants in 4 ms returned sat
[2022-06-13 01:15:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:15:37] [INFO ] [Real]Absence check using state equation in 162 ms returned sat
[2022-06-13 01:15:37] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:15:37] [INFO ] [Nat]Absence check using 30 positive place invariants in 11 ms returned sat
[2022-06-13 01:15:37] [INFO ] [Nat]Absence check using 30 positive and 13 generalized place invariants in 4 ms returned sat
[2022-06-13 01:15:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-13 01:15:38] [INFO ] [Nat]Absence check using state equation in 128 ms returned sat
[2022-06-13 01:15:38] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 1 ms to minimize.
[2022-06-13 01:15:38] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 0 ms to minimize.
[2022-06-13 01:15:38] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 101 ms
[2022-06-13 01:15:38] [INFO ] Computed and/alt/rep : 188/229/188 causal constraints (skipped 15 transitions) in 13 ms.
[2022-06-13 01:15:38] [INFO ] Added : 119 causal constraints over 24 iterations in 455 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 10 ms.
FORMULA BusinessProcesses-PT-02-ReachabilityFireability-10 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-02-ReachabilityFireability-08 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-02-ReachabilityFireability-05 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-02-ReachabilityFireability-04 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-02-ReachabilityFireability-01 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 8 Parikh solutions to 3 different solutions.
Incomplete Parikh walk after 15500 steps, including 234 resets, run finished after 52 ms. (steps per millisecond=298 ) properties (out of 3) seen :0 could not realise parikh vector
Incomplete Parikh walk after 12400 steps, including 189 resets, run finished after 25 ms. (steps per millisecond=496 ) properties (out of 3) seen :0 could not realise parikh vector
Incomplete Parikh walk after 12900 steps, including 208 resets, run finished after 45 ms. (steps per millisecond=286 ) properties (out of 3) seen :0 could not realise parikh vector
Support contains 17 out of 245 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 245/245 places, 204/204 transitions.
Graph (complete) has 446 edges and 245 vertex of which 235 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.3 ms
Discarding 10 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 32 rules applied. Total rules applied 33 place count 235 transition count 168
Reduce places removed 31 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 35 rules applied. Total rules applied 68 place count 204 transition count 164
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 72 place count 200 transition count 164
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 51 Pre rules applied. Total rules applied 72 place count 200 transition count 113
Deduced a syphon composed of 51 places in 1 ms
Ensure Unique test removed 6 places
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 3 with 108 rules applied. Total rules applied 180 place count 143 transition count 113
Discarding 29 places :
Symmetric choice reduction at 3 with 29 rule applications. Total rules 209 place count 114 transition count 84
Iterating global reduction 3 with 29 rules applied. Total rules applied 238 place count 114 transition count 84
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 304 place count 80 transition count 52
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 305 place count 80 transition count 51
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 306 place count 80 transition count 51
Applied a total of 306 rules in 72 ms. Remains 80 /245 variables (removed 165) and now considering 51/204 (removed 153) transitions.
Finished structural reductions, in 1 iterations. Remains : 80/245 places, 51/204 transitions.
[2022-06-13 01:15:39] [INFO ] Flatten gal took : 34 ms
[2022-06-13 01:15:39] [INFO ] Flatten gal took : 10 ms
[2022-06-13 01:15:39] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11040798331234730006.gal : 9 ms
[2022-06-13 01:15:39] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11813520552261218760.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/ReachabilityCardinality11040798331234730006.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality11813520552261218760.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/ReachabilityCardinality11040798331234730006.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality11813520552261218760.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality11813520552261218760.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 6
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :6 after 7
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :7 after 57
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :57 after 79
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :79 after 214
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :1054 after 1432
Invariant property BusinessProcesses-PT-02-ReachabilityFireability-11 does not hold.
FORMULA BusinessProcesses-PT-02-ReachabilityFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Reachability property BusinessProcesses-PT-02-ReachabilityFireability-02 is true.
FORMULA BusinessProcesses-PT-02-ReachabilityFireability-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Reachability property BusinessProcesses-PT-02-ReachabilityFireability-00 is true.
FORMULA BusinessProcesses-PT-02-ReachabilityFireability-00 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 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,3178,0.050203,4780,2,1172,15,4174,6,0,372,2282,0
Total reachable state count : 3178

Verifying 3 reachability properties.
Reachability property BusinessProcesses-PT-02-ReachabilityFireability-00 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-02-ReachabilityFireability-00,4,0.050937,5044,2,82,15,4174,7,0,375,2282,0
Reachability property BusinessProcesses-PT-02-ReachabilityFireability-02 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-02-ReachabilityFireability-02,12,0.051376,5044,2,138,15,4174,8,0,377,2282,0
Invariant property BusinessProcesses-PT-02-ReachabilityFireability-11 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-02-ReachabilityFireability-11,18,0.057133,5044,2,144,15,4174,9,0,411,2282,0
All properties solved without resorting to model-checking.

BK_STOP 1655082940485

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -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 ReachabilityFireability -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-02"
export BK_EXAMINATION="ReachabilityFireability"
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-02, examination is ReachabilityFireability"
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-165251936100126"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-02.tgz
mv BusinessProcesses-PT-02 execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;