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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 648K
-rw-r--r-- 1 mcc users 6.0K Apr 30 00:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Apr 30 00:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Apr 30 00:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K 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.7K May 9 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 07:09 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 07:09 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 07:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Apr 30 00:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 193K Apr 30 00:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 10K Apr 30 00:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 92K 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.7K 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 100K 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-07-ReachabilityFireability-00
FORMULA_NAME BusinessProcesses-PT-07-ReachabilityFireability-01
FORMULA_NAME BusinessProcesses-PT-07-ReachabilityFireability-02
FORMULA_NAME BusinessProcesses-PT-07-ReachabilityFireability-03
FORMULA_NAME BusinessProcesses-PT-07-ReachabilityFireability-04
FORMULA_NAME BusinessProcesses-PT-07-ReachabilityFireability-05
FORMULA_NAME BusinessProcesses-PT-07-ReachabilityFireability-06
FORMULA_NAME BusinessProcesses-PT-07-ReachabilityFireability-07
FORMULA_NAME BusinessProcesses-PT-07-ReachabilityFireability-08
FORMULA_NAME BusinessProcesses-PT-07-ReachabilityFireability-09
FORMULA_NAME BusinessProcesses-PT-07-ReachabilityFireability-10
FORMULA_NAME BusinessProcesses-PT-07-ReachabilityFireability-11
FORMULA_NAME BusinessProcesses-PT-07-ReachabilityFireability-12
FORMULA_NAME BusinessProcesses-PT-07-ReachabilityFireability-13
FORMULA_NAME BusinessProcesses-PT-07-ReachabilityFireability-14
FORMULA_NAME BusinessProcesses-PT-07-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1655083045931

Running Version 0
[2022-06-13 01:17:27] [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:17:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-13 01:17:27] [INFO ] Load time of PNML (sax parser for PT used): 170 ms
[2022-06-13 01:17:27] [INFO ] Transformed 386 places.
[2022-06-13 01:17:27] [INFO ] Transformed 360 transitions.
[2022-06-13 01:17:27] [INFO ] Found NUPN structural information;
[2022-06-13 01:17:27] [INFO ] Parsed PT model containing 386 places and 360 transitions in 221 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 105 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 16) seen :9
FORMULA BusinessProcesses-PT-07-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-07-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-07-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-07-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-07-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-07-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-07-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-07-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-07-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 360 rows 386 cols
[2022-06-13 01:17:28] [INFO ] Computed 62 place invariants in 34 ms
[2022-06-13 01:17:28] [INFO ] [Real]Absence check using 33 positive place invariants in 22 ms returned sat
[2022-06-13 01:17:28] [INFO ] [Real]Absence check using 33 positive and 29 generalized place invariants in 17 ms returned sat
[2022-06-13 01:17:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:17:28] [INFO ] [Real]Absence check using state equation in 293 ms returned sat
[2022-06-13 01:17:28] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:17:28] [INFO ] [Nat]Absence check using 33 positive place invariants in 15 ms returned sat
[2022-06-13 01:17:28] [INFO ] [Nat]Absence check using 33 positive and 29 generalized place invariants in 19 ms returned sat
[2022-06-13 01:17:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-13 01:17:28] [INFO ] [Nat]Absence check using state equation in 132 ms returned sat
[2022-06-13 01:17:29] [INFO ] Deduced a trap composed of 12 places in 75 ms of which 4 ms to minimize.
[2022-06-13 01:17:29] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2022-06-13 01:17:29] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 1 ms to minimize.
[2022-06-13 01:17:29] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 232 ms
[2022-06-13 01:17:29] [INFO ] Computed and/alt/rep : 339/625/339 causal constraints (skipped 20 transitions) in 26 ms.
[2022-06-13 01:17:30] [INFO ] Added : 235 causal constraints over 48 iterations in 1426 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 8 ms.
[2022-06-13 01:17:30] [INFO ] [Real]Absence check using 33 positive place invariants in 20 ms returned sat
[2022-06-13 01:17:30] [INFO ] [Real]Absence check using 33 positive and 29 generalized place invariants in 3 ms returned unsat
[2022-06-13 01:17:30] [INFO ] [Real]Absence check using 33 positive place invariants in 16 ms returned sat
[2022-06-13 01:17:30] [INFO ] [Real]Absence check using 33 positive and 29 generalized place invariants in 18 ms returned sat
[2022-06-13 01:17:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:17:31] [INFO ] [Real]Absence check using state equation in 360 ms returned sat
[2022-06-13 01:17:31] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:17:31] [INFO ] [Nat]Absence check using 33 positive place invariants in 16 ms returned sat
[2022-06-13 01:17:31] [INFO ] [Nat]Absence check using 33 positive and 29 generalized place invariants in 23 ms returned sat
[2022-06-13 01:17:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-13 01:17:31] [INFO ] [Nat]Absence check using state equation in 382 ms returned sat
[2022-06-13 01:17:31] [INFO ] Deduced a trap composed of 35 places in 45 ms of which 1 ms to minimize.
[2022-06-13 01:17:31] [INFO ] Deduced a trap composed of 42 places in 42 ms of which 0 ms to minimize.
[2022-06-13 01:17:31] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 0 ms to minimize.
[2022-06-13 01:17:31] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 0 ms to minimize.
[2022-06-13 01:17:31] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 260 ms
[2022-06-13 01:17:32] [INFO ] Computed and/alt/rep : 339/625/339 causal constraints (skipped 20 transitions) in 21 ms.
[2022-06-13 01:17:33] [INFO ] Added : 192 causal constraints over 39 iterations in 1233 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 9 ms.
[2022-06-13 01:17:33] [INFO ] [Real]Absence check using 33 positive place invariants in 11 ms returned sat
[2022-06-13 01:17:33] [INFO ] [Real]Absence check using 33 positive and 29 generalized place invariants in 9 ms returned sat
[2022-06-13 01:17:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:17:33] [INFO ] [Real]Absence check using state equation in 111 ms returned sat
[2022-06-13 01:17:33] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:17:33] [INFO ] [Nat]Absence check using 33 positive place invariants in 11 ms returned sat
[2022-06-13 01:17:33] [INFO ] [Nat]Absence check using 33 positive and 29 generalized place invariants in 8 ms returned sat
[2022-06-13 01:17:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-13 01:17:33] [INFO ] [Nat]Absence check using state equation in 108 ms returned sat
[2022-06-13 01:17:33] [INFO ] Deduced a trap composed of 8 places in 81 ms of which 0 ms to minimize.
[2022-06-13 01:17:33] [INFO ] Deduced a trap composed of 14 places in 76 ms of which 0 ms to minimize.
[2022-06-13 01:17:33] [INFO ] Deduced a trap composed of 20 places in 70 ms of which 0 ms to minimize.
[2022-06-13 01:17:34] [INFO ] Deduced a trap composed of 110 places in 73 ms of which 0 ms to minimize.
[2022-06-13 01:17:34] [INFO ] Deduced a trap composed of 96 places in 71 ms of which 1 ms to minimize.
[2022-06-13 01:17:34] [INFO ] Deduced a trap composed of 89 places in 72 ms of which 1 ms to minimize.
[2022-06-13 01:17:34] [INFO ] Deduced a trap composed of 99 places in 69 ms of which 1 ms to minimize.
[2022-06-13 01:17:34] [INFO ] Deduced a trap composed of 94 places in 70 ms of which 1 ms to minimize.
[2022-06-13 01:17:34] [INFO ] Deduced a trap composed of 99 places in 74 ms of which 1 ms to minimize.
[2022-06-13 01:17:34] [INFO ] Deduced a trap composed of 99 places in 72 ms of which 0 ms to minimize.
[2022-06-13 01:17:34] [INFO ] Deduced a trap composed of 95 places in 73 ms of which 1 ms to minimize.
[2022-06-13 01:17:34] [INFO ] Deduced a trap composed of 91 places in 65 ms of which 0 ms to minimize.
[2022-06-13 01:17:34] [INFO ] Deduced a trap composed of 92 places in 62 ms of which 0 ms to minimize.
[2022-06-13 01:17:34] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 1 ms to minimize.
[2022-06-13 01:17:34] [INFO ] Deduced a trap composed of 95 places in 59 ms of which 0 ms to minimize.
[2022-06-13 01:17:35] [INFO ] Deduced a trap composed of 90 places in 59 ms of which 1 ms to minimize.
[2022-06-13 01:17:35] [INFO ] Deduced a trap composed of 10 places in 65 ms of which 0 ms to minimize.
[2022-06-13 01:17:35] [INFO ] Deduced a trap composed of 99 places in 64 ms of which 1 ms to minimize.
[2022-06-13 01:17:35] [INFO ] Deduced a trap composed of 88 places in 64 ms of which 1 ms to minimize.
[2022-06-13 01:17:35] [INFO ] Deduced a trap composed of 94 places in 64 ms of which 1 ms to minimize.
[2022-06-13 01:17:35] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 0 ms to minimize.
[2022-06-13 01:17:35] [INFO ] Deduced a trap composed of 72 places in 59 ms of which 0 ms to minimize.
[2022-06-13 01:17:35] [INFO ] Deduced a trap composed of 29 places in 30 ms of which 0 ms to minimize.
[2022-06-13 01:17:35] [INFO ] Deduced a trap composed of 28 places in 30 ms of which 0 ms to minimize.
[2022-06-13 01:17:35] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 2129 ms
[2022-06-13 01:17:35] [INFO ] Computed and/alt/rep : 339/625/339 causal constraints (skipped 20 transitions) in 21 ms.
[2022-06-13 01:17:37] [INFO ] Deduced a trap composed of 103 places in 73 ms of which 1 ms to minimize.
[2022-06-13 01:17:37] [INFO ] Deduced a trap composed of 96 places in 97 ms of which 6 ms to minimize.
[2022-06-13 01:17:37] [INFO ] Deduced a trap composed of 94 places in 71 ms of which 0 ms to minimize.
[2022-06-13 01:17:37] [INFO ] Deduced a trap composed of 94 places in 70 ms of which 0 ms to minimize.
[2022-06-13 01:17:37] [INFO ] Deduced a trap composed of 101 places in 70 ms of which 0 ms to minimize.
[2022-06-13 01:17:37] [INFO ] Deduced a trap composed of 98 places in 72 ms of which 0 ms to minimize.
[2022-06-13 01:17:37] [INFO ] Deduced a trap composed of 98 places in 71 ms of which 1 ms to minimize.
[2022-06-13 01:17:37] [INFO ] Deduced a trap composed of 96 places in 72 ms of which 1 ms to minimize.
[2022-06-13 01:17:38] [INFO ] Deduced a trap composed of 100 places in 76 ms of which 0 ms to minimize.
[2022-06-13 01:17:38] [INFO ] Deduced a trap composed of 104 places in 67 ms of which 1 ms to minimize.
[2022-06-13 01:17:38] [INFO ] Deduced a trap composed of 97 places in 78 ms of which 0 ms to minimize.
[2022-06-13 01:17:38] [INFO ] Deduced a trap composed of 92 places in 70 ms of which 0 ms to minimize.
[2022-06-13 01:17:38] [INFO ] Deduced a trap composed of 107 places in 63 ms of which 0 ms to minimize.
[2022-06-13 01:17:38] [INFO ] Deduced a trap composed of 8 places in 107 ms of which 0 ms to minimize.
[2022-06-13 01:17:38] [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 3
[2022-06-13 01:17:38] [INFO ] [Real]Absence check using 33 positive place invariants in 17 ms returned sat
[2022-06-13 01:17:38] [INFO ] [Real]Absence check using 33 positive and 29 generalized place invariants in 18 ms returned sat
[2022-06-13 01:17:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:17:39] [INFO ] [Real]Absence check using state equation in 501 ms returned sat
[2022-06-13 01:17:39] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:17:39] [INFO ] [Nat]Absence check using 33 positive place invariants in 17 ms returned sat
[2022-06-13 01:17:39] [INFO ] [Nat]Absence check using 33 positive and 29 generalized place invariants in 14 ms returned sat
[2022-06-13 01:17:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-13 01:17:39] [INFO ] [Nat]Absence check using state equation in 180 ms returned sat
[2022-06-13 01:17:39] [INFO ] Deduced a trap composed of 74 places in 77 ms of which 0 ms to minimize.
[2022-06-13 01:17:39] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 0 ms to minimize.
[2022-06-13 01:17:39] [INFO ] Deduced a trap composed of 95 places in 69 ms of which 1 ms to minimize.
[2022-06-13 01:17:39] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 0 ms to minimize.
[2022-06-13 01:17:39] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 0 ms to minimize.
[2022-06-13 01:17:39] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 1 ms to minimize.
[2022-06-13 01:17:39] [INFO ] Deduced a trap composed of 94 places in 73 ms of which 1 ms to minimize.
[2022-06-13 01:17:40] [INFO ] Deduced a trap composed of 85 places in 79 ms of which 0 ms to minimize.
[2022-06-13 01:17:40] [INFO ] Deduced a trap composed of 100 places in 74 ms of which 1 ms to minimize.
[2022-06-13 01:17:40] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 0 ms to minimize.
[2022-06-13 01:17:40] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 728 ms
[2022-06-13 01:17:40] [INFO ] Computed and/alt/rep : 339/625/339 causal constraints (skipped 20 transitions) in 19 ms.
[2022-06-13 01:17:41] [INFO ] Added : 191 causal constraints over 39 iterations in 1127 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 9 ms.
[2022-06-13 01:17:41] [INFO ] [Real]Absence check using 33 positive place invariants in 11 ms returned sat
[2022-06-13 01:17:41] [INFO ] [Real]Absence check using 33 positive and 29 generalized place invariants in 7 ms returned unsat
[2022-06-13 01:17:41] [INFO ] [Real]Absence check using 33 positive place invariants in 14 ms returned sat
[2022-06-13 01:17:41] [INFO ] [Real]Absence check using 33 positive and 29 generalized place invariants in 17 ms returned sat
[2022-06-13 01:17:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:17:41] [INFO ] [Real]Absence check using state equation in 368 ms returned sat
[2022-06-13 01:17:41] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:17:41] [INFO ] [Nat]Absence check using 33 positive place invariants in 15 ms returned sat
[2022-06-13 01:17:41] [INFO ] [Nat]Absence check using 33 positive and 29 generalized place invariants in 11 ms returned sat
[2022-06-13 01:17:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-13 01:17:42] [INFO ] [Nat]Absence check using state equation in 219 ms returned sat
[2022-06-13 01:17:42] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 0 ms to minimize.
[2022-06-13 01:17:42] [INFO ] Deduced a trap composed of 34 places in 38 ms of which 0 ms to minimize.
[2022-06-13 01:17:42] [INFO ] Deduced a trap composed of 34 places in 34 ms of which 1 ms to minimize.
[2022-06-13 01:17:42] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 0 ms to minimize.
[2022-06-13 01:17:42] [INFO ] Deduced a trap composed of 33 places in 36 ms of which 0 ms to minimize.
[2022-06-13 01:17:42] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 0 ms to minimize.
[2022-06-13 01:17:42] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 0 ms to minimize.
[2022-06-13 01:17:42] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2022-06-13 01:17:42] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 0 ms to minimize.
[2022-06-13 01:17:42] [INFO ] Deduced a trap composed of 35 places in 32 ms of which 0 ms to minimize.
[2022-06-13 01:17:42] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2022-06-13 01:17:42] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 603 ms
[2022-06-13 01:17:42] [INFO ] Computed and/alt/rep : 339/625/339 causal constraints (skipped 20 transitions) in 18 ms.
[2022-06-13 01:17:44] [INFO ] Deduced a trap composed of 23 places in 25 ms of which 0 ms to minimize.
[2022-06-13 01:17:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 70 ms
[2022-06-13 01:17:44] [INFO ] Added : 216 causal constraints over 44 iterations in 1556 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 9 ms.
FORMULA BusinessProcesses-PT-07-ReachabilityFireability-11 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-07-ReachabilityFireability-03 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 7 Parikh solutions to 5 different solutions.
Incomplete Parikh walk after 32900 steps, including 408 resets, run finished after 93 ms. (steps per millisecond=353 ) properties (out of 5) seen :0 could not realise parikh vector
Incomplete Parikh walk after 24700 steps, including 317 resets, run finished after 64 ms. (steps per millisecond=385 ) properties (out of 5) seen :0 could not realise parikh vector
Incomplete Parikh walk after 16800 steps, including 193 resets, run finished after 39 ms. (steps per millisecond=430 ) properties (out of 5) seen :1 could not realise parikh vector
FORMULA BusinessProcesses-PT-07-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 39100 steps, including 467 resets, run finished after 101 ms. (steps per millisecond=387 ) properties (out of 4) seen :0 could not realise parikh vector
Support contains 141 out of 386 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 386/386 places, 360/360 transitions.
Graph (complete) has 813 edges and 386 vertex of which 384 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.6 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 384 transition count 344
Reduce places removed 15 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 22 rules applied. Total rules applied 38 place count 369 transition count 337
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 45 place count 362 transition count 337
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 48 Pre rules applied. Total rules applied 45 place count 362 transition count 289
Deduced a syphon composed of 48 places in 3 ms
Ensure Unique test removed 1 places
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 3 with 97 rules applied. Total rules applied 142 place count 313 transition count 289
Discarding 29 places :
Symmetric choice reduction at 3 with 29 rule applications. Total rules 171 place count 284 transition count 260
Iterating global reduction 3 with 29 rules applied. Total rules applied 200 place count 284 transition count 260
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 234 place count 267 transition count 243
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
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 236 place count 266 transition count 245
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 237 place count 266 transition count 244
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 238 place count 265 transition count 244
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 239 place count 264 transition count 243
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 240 place count 263 transition count 243
Applied a total of 240 rules in 112 ms. Remains 263 /386 variables (removed 123) and now considering 243/360 (removed 117) transitions.
Finished structural reductions, in 1 iterations. Remains : 263/386 places, 243/360 transitions.
[2022-06-13 01:17:45] [INFO ] Flatten gal took : 53 ms
[2022-06-13 01:17:45] [INFO ] Flatten gal took : 22 ms
[2022-06-13 01:17:45] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5253945807873934274.gal : 15 ms
[2022-06-13 01:17:45] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5389405492017383748.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/ReachabilityCardinality5253945807873934274.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality5389405492017383748.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/ReachabilityCardinality5253945807873934274.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality5389405492017383748.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality5389405492017383748.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :3 after 6
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :6 after 12
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :12 after 52
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :52 after 72
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :72 after 352
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :352 after 1114
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :1114 after 6374
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :6374 after 142159
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :142159 after 172580
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :172580 after 261074
Reachability property BusinessProcesses-PT-07-ReachabilityFireability-05 is true.
FORMULA BusinessProcesses-PT-07-ReachabilityFireability-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Detected timeout of ITS tools.
[2022-06-13 01:18:00] [INFO ] Flatten gal took : 19 ms
[2022-06-13 01:18:00] [INFO ] Applying decomposition
[2022-06-13 01:18:00] [INFO ] Flatten gal took : 18 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/graph7895593024545052075.txt, -o, /tmp/graph7895593024545052075.bin, -w, /tmp/graph7895593024545052075.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/graph7895593024545052075.bin, -l, -1, -v, -w, /tmp/graph7895593024545052075.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-13 01:18:00] [INFO ] Decomposing Gal with order
[2022-06-13 01:18:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-13 01:18:00] [INFO ] Removed a total of 189 redundant transitions.
[2022-06-13 01:18:00] [INFO ] Flatten gal took : 53 ms
[2022-06-13 01:18:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 15 ms.
[2022-06-13 01:18:00] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5891383110485823195.gal : 8 ms
[2022-06-13 01:18:00] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16520065186564339522.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/ReachabilityCardinality5891383110485823195.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality16520065186564339522.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/ReachabilityCardinality5891383110485823195.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality16520065186564339522.prop --nowitness
Loading property file /tmp/ReachabilityCardinality16520065186564339522.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 18
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :18 after 36
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :36 after 36
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :36 after 36
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :20800 after 1.34722e+07
Invariant property BusinessProcesses-PT-07-ReachabilityFireability-00 does not hold.
FORMULA BusinessProcesses-PT-07-ReachabilityFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :6.73359e+11 after 9.2995e+11
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,1.11732e+13,13.62,259564,3931,169,451495,1536,958,941802,136,5472,0
Total reachable state count : 11173204832734

Verifying 3 reachability properties.
Invariant property BusinessProcesses-PT-07-ReachabilityFireability-00 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-07-ReachabilityFireability-00,3.08163e+11,13.6865,259564,587,94,451495,1536,1087,941802,152,5472,7007
Invariant property BusinessProcesses-PT-07-ReachabilityFireability-06 does not hold.
FORMULA BusinessProcesses-PT-07-ReachabilityFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN

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-07-ReachabilityFireability-06,3.03005e+07,13.6945,259564,202,59,451495,1536,1087,941802,152,5472,7281
Invariant property BusinessProcesses-PT-07-ReachabilityFireability-12 is true.
FORMULA BusinessProcesses-PT-07-ReachabilityFireability-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN

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-07-ReachabilityFireability-12,0,13.7947,259564,1,0,451495,1536,1204,941802,154,5472,26185
All properties solved without resorting to model-checking.

BK_STOP 1655083095214

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

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