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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 576K
-rw-r--r-- 1 mcc users 6.3K Apr 29 23:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Apr 29 23:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Apr 29 23:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 29 23:57 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.6K May 9 07:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 9 07:10 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 07:10 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 07:10 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 29 23:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 110K Apr 29 23:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Apr 29 23:59 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K Apr 29 23:59 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 07:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 3 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 148K 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-13-ReachabilityCardinality-00
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityCardinality-01
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityCardinality-02
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityCardinality-03
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityCardinality-04
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityCardinality-05
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityCardinality-06
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityCardinality-07
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityCardinality-08
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityCardinality-09
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityCardinality-10
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityCardinality-11
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityCardinality-12
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityCardinality-13
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityCardinality-14
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1655083240131

Running Version 0
[2022-06-13 01:20:41] [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:20:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-13 01:20:42] [INFO ] Load time of PNML (sax parser for PT used): 471 ms
[2022-06-13 01:20:42] [INFO ] Transformed 593 places.
[2022-06-13 01:20:42] [INFO ] Transformed 536 transitions.
[2022-06-13 01:20:42] [INFO ] Found NUPN structural information;
[2022-06-13 01:20:42] [INFO ] Parsed PT model containing 593 places and 536 transitions in 519 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 8 places in 16 ms
Reduce places removed 8 places and 8 transitions.
FORMULA BusinessProcesses-PT-13-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-13-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-13-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 70 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 13) seen :3
FORMULA BusinessProcesses-PT-13-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-13-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-13-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 14 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 528 rows 585 cols
[2022-06-13 01:20:42] [INFO ] Computed 95 place invariants in 37 ms
[2022-06-13 01:20:42] [INFO ] [Real]Absence check using 57 positive place invariants in 34 ms returned sat
[2022-06-13 01:20:42] [INFO ] [Real]Absence check using 57 positive and 38 generalized place invariants in 20 ms returned sat
[2022-06-13 01:20:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:20:43] [INFO ] [Real]Absence check using state equation in 335 ms returned sat
[2022-06-13 01:20:43] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:20:43] [INFO ] [Nat]Absence check using 57 positive place invariants in 41 ms returned sat
[2022-06-13 01:20:43] [INFO ] [Nat]Absence check using 57 positive and 38 generalized place invariants in 11 ms returned sat
[2022-06-13 01:20:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-13 01:20:43] [INFO ] [Nat]Absence check using state equation in 356 ms returned sat
[2022-06-13 01:20:44] [INFO ] Deduced a trap composed of 8 places in 196 ms of which 4 ms to minimize.
[2022-06-13 01:20:44] [INFO ] Deduced a trap composed of 11 places in 160 ms of which 2 ms to minimize.
[2022-06-13 01:20:44] [INFO ] Deduced a trap composed of 14 places in 154 ms of which 1 ms to minimize.
[2022-06-13 01:20:44] [INFO ] Deduced a trap composed of 15 places in 137 ms of which 1 ms to minimize.
[2022-06-13 01:20:44] [INFO ] Deduced a trap composed of 15 places in 140 ms of which 1 ms to minimize.
[2022-06-13 01:20:44] [INFO ] Deduced a trap composed of 125 places in 143 ms of which 0 ms to minimize.
[2022-06-13 01:20:45] [INFO ] Deduced a trap composed of 18 places in 147 ms of which 1 ms to minimize.
[2022-06-13 01:20:45] [INFO ] Deduced a trap composed of 33 places in 118 ms of which 0 ms to minimize.
[2022-06-13 01:20:45] [INFO ] Deduced a trap composed of 133 places in 133 ms of which 0 ms to minimize.
[2022-06-13 01:20:45] [INFO ] Deduced a trap composed of 56 places in 127 ms of which 1 ms to minimize.
[2022-06-13 01:20:45] [INFO ] Deduced a trap composed of 20 places in 153 ms of which 1 ms to minimize.
[2022-06-13 01:20:45] [INFO ] Deduced a trap composed of 17 places in 126 ms of which 0 ms to minimize.
[2022-06-13 01:20:46] [INFO ] Deduced a trap composed of 146 places in 136 ms of which 1 ms to minimize.
[2022-06-13 01:20:46] [INFO ] Deduced a trap composed of 135 places in 144 ms of which 0 ms to minimize.
[2022-06-13 01:20:46] [INFO ] Deduced a trap composed of 23 places in 118 ms of which 0 ms to minimize.
[2022-06-13 01:20:46] [INFO ] Deduced a trap composed of 127 places in 116 ms of which 1 ms to minimize.
[2022-06-13 01:20:46] [INFO ] Deduced a trap composed of 34 places in 115 ms of which 1 ms to minimize.
[2022-06-13 01:20:46] [INFO ] Deduced a trap composed of 41 places in 118 ms of which 1 ms to minimize.
[2022-06-13 01:20:46] [INFO ] Deduced a trap composed of 31 places in 111 ms of which 1 ms to minimize.
[2022-06-13 01:20:47] [INFO ] Deduced a trap composed of 145 places in 118 ms of which 1 ms to minimize.
[2022-06-13 01:20:47] [INFO ] Deduced a trap composed of 145 places in 109 ms of which 1 ms to minimize.
[2022-06-13 01:20:47] [INFO ] Deduced a trap composed of 33 places in 120 ms of which 1 ms to minimize.
[2022-06-13 01:20:47] [INFO ] Deduced a trap composed of 146 places in 117 ms of which 1 ms to minimize.
[2022-06-13 01:20:47] [INFO ] Deduced a trap composed of 133 places in 122 ms of which 1 ms to minimize.
[2022-06-13 01:20:47] [INFO ] Deduced a trap composed of 137 places in 116 ms of which 0 ms to minimize.
[2022-06-13 01:20:47] [INFO ] Deduced a trap composed of 34 places in 120 ms of which 1 ms to minimize.
[2022-06-13 01:20:48] [INFO ] Deduced a trap composed of 131 places in 123 ms of which 1 ms to minimize.
[2022-06-13 01:20:48] [INFO ] Deduced a trap composed of 44 places in 116 ms of which 0 ms to minimize.
[2022-06-13 01:20:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 28 trap constraints in 4471 ms
[2022-06-13 01:20:48] [INFO ] [Real]Absence check using 57 positive place invariants in 25 ms returned sat
[2022-06-13 01:20:48] [INFO ] [Real]Absence check using 57 positive and 38 generalized place invariants in 14 ms returned sat
[2022-06-13 01:20:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:20:48] [INFO ] [Real]Absence check using state equation in 498 ms returned sat
[2022-06-13 01:20:48] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:20:49] [INFO ] [Real]Absence check using 57 positive place invariants in 23 ms returned sat
[2022-06-13 01:20:49] [INFO ] [Real]Absence check using 57 positive and 38 generalized place invariants in 10 ms returned sat
[2022-06-13 01:20:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:20:49] [INFO ] [Real]Absence check using state equation in 195 ms returned sat
[2022-06-13 01:20:49] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:20:49] [INFO ] [Real]Absence check using 57 positive place invariants in 25 ms returned sat
[2022-06-13 01:20:49] [INFO ] [Real]Absence check using 57 positive and 38 generalized place invariants in 12 ms returned sat
[2022-06-13 01:20:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:20:49] [INFO ] [Real]Absence check using state equation in 223 ms returned sat
[2022-06-13 01:20:49] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:20:49] [INFO ] [Nat]Absence check using 57 positive place invariants in 25 ms returned sat
[2022-06-13 01:20:49] [INFO ] [Nat]Absence check using 57 positive and 38 generalized place invariants in 12 ms returned sat
[2022-06-13 01:20:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-13 01:20:50] [INFO ] [Nat]Absence check using state equation in 281 ms returned sat
[2022-06-13 01:20:50] [INFO ] Deduced a trap composed of 11 places in 84 ms of which 1 ms to minimize.
[2022-06-13 01:20:50] [INFO ] Deduced a trap composed of 8 places in 93 ms of which 1 ms to minimize.
[2022-06-13 01:20:50] [INFO ] Deduced a trap composed of 23 places in 89 ms of which 1 ms to minimize.
[2022-06-13 01:20:50] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 1 ms to minimize.
[2022-06-13 01:20:50] [INFO ] Deduced a trap composed of 37 places in 86 ms of which 0 ms to minimize.
[2022-06-13 01:20:50] [INFO ] Deduced a trap composed of 36 places in 86 ms of which 0 ms to minimize.
[2022-06-13 01:20:51] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 1 ms to minimize.
[2022-06-13 01:20:51] [INFO ] Deduced a trap composed of 49 places in 85 ms of which 1 ms to minimize.
[2022-06-13 01:20:51] [INFO ] Deduced a trap composed of 48 places in 89 ms of which 0 ms to minimize.
[2022-06-13 01:20:51] [INFO ] Deduced a trap composed of 67 places in 84 ms of which 1 ms to minimize.
[2022-06-13 01:20:51] [INFO ] Deduced a trap composed of 48 places in 78 ms of which 0 ms to minimize.
[2022-06-13 01:20:51] [INFO ] Deduced a trap composed of 49 places in 72 ms of which 1 ms to minimize.
[2022-06-13 01:20:51] [INFO ] Deduced a trap composed of 46 places in 74 ms of which 0 ms to minimize.
[2022-06-13 01:20:51] [INFO ] Deduced a trap composed of 27 places in 97 ms of which 1 ms to minimize.
[2022-06-13 01:20:51] [INFO ] Deduced a trap composed of 22 places in 86 ms of which 1 ms to minimize.
[2022-06-13 01:20:52] [INFO ] Deduced a trap composed of 38 places in 88 ms of which 1 ms to minimize.
[2022-06-13 01:20:52] [INFO ] Deduced a trap composed of 33 places in 83 ms of which 0 ms to minimize.
[2022-06-13 01:20:52] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 0 ms to minimize.
[2022-06-13 01:20:52] [INFO ] Deduced a trap composed of 34 places in 52 ms of which 1 ms to minimize.
[2022-06-13 01:20:52] [INFO ] Deduced a trap composed of 34 places in 58 ms of which 1 ms to minimize.
[2022-06-13 01:20:52] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 0 ms to minimize.
[2022-06-13 01:20:52] [INFO ] Deduced a trap composed of 40 places in 53 ms of which 1 ms to minimize.
[2022-06-13 01:20:52] [INFO ] Deduced a trap composed of 48 places in 56 ms of which 1 ms to minimize.
[2022-06-13 01:20:52] [INFO ] Deduced a trap composed of 28 places in 56 ms of which 0 ms to minimize.
[2022-06-13 01:20:52] [INFO ] Deduced a trap composed of 41 places in 58 ms of which 0 ms to minimize.
[2022-06-13 01:20:52] [INFO ] Deduced a trap composed of 35 places in 57 ms of which 0 ms to minimize.
[2022-06-13 01:20:52] [INFO ] Deduced a trap composed of 47 places in 55 ms of which 1 ms to minimize.
[2022-06-13 01:20:53] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 0 ms to minimize.
[2022-06-13 01:20:53] [INFO ] Deduced a trap composed of 49 places in 65 ms of which 8 ms to minimize.
[2022-06-13 01:20:53] [INFO ] Deduced a trap composed of 56 places in 55 ms of which 1 ms to minimize.
[2022-06-13 01:20:53] [INFO ] Trap strengthening (SAT) tested/added 31/30 trap constraints in 3041 ms
[2022-06-13 01:20:53] [INFO ] Computed and/alt/rep : 496/823/496 causal constraints (skipped 31 transitions) in 38 ms.
[2022-06-13 01:20:54] [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:20:54] [INFO ] [Real]Absence check using 57 positive place invariants in 30 ms returned sat
[2022-06-13 01:20:54] [INFO ] [Real]Absence check using 57 positive and 38 generalized place invariants in 18 ms returned sat
[2022-06-13 01:20:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:20:55] [INFO ] [Real]Absence check using state equation in 760 ms returned sat
[2022-06-13 01:20:55] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:20:55] [INFO ] [Real]Absence check using 57 positive place invariants in 27 ms returned sat
[2022-06-13 01:20:55] [INFO ] [Real]Absence check using 57 positive and 38 generalized place invariants in 17 ms returned sat
[2022-06-13 01:20:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:20:56] [INFO ] [Real]Absence check using state equation in 633 ms returned sat
[2022-06-13 01:20:56] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:20:56] [INFO ] [Real]Absence check using 57 positive place invariants in 24 ms returned sat
[2022-06-13 01:20:56] [INFO ] [Real]Absence check using 57 positive and 38 generalized place invariants in 13 ms returned sat
[2022-06-13 01:20:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:20:57] [INFO ] [Real]Absence check using state equation in 463 ms returned sat
[2022-06-13 01:20:57] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:20:57] [INFO ] [Real]Absence check using 57 positive place invariants in 22 ms returned sat
[2022-06-13 01:20:57] [INFO ] [Real]Absence check using 57 positive and 38 generalized place invariants in 10 ms returned sat
[2022-06-13 01:20:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:20:57] [INFO ] [Real]Absence check using state equation in 187 ms returned sat
[2022-06-13 01:20:57] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:20:57] [INFO ] [Real]Absence check using 57 positive place invariants in 24 ms returned sat
[2022-06-13 01:20:57] [INFO ] [Real]Absence check using 57 positive and 38 generalized place invariants in 13 ms returned sat
[2022-06-13 01:20:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:20:58] [INFO ] [Real]Absence check using state equation in 1016 ms returned sat
[2022-06-13 01:20:59] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:20:59] [INFO ] [Real]Absence check using 57 positive place invariants in 22 ms returned sat
[2022-06-13 01:20:59] [INFO ] [Real]Absence check using 57 positive and 38 generalized place invariants in 12 ms returned sat
[2022-06-13 01:20:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:20:59] [INFO ] [Real]Absence check using state equation in 196 ms returned sat
[2022-06-13 01:20:59] [INFO ] Solution in real domain found non-integer solution.
FORMULA BusinessProcesses-PT-13-ReachabilityCardinality-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-13-ReachabilityCardinality-12 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-13-ReachabilityCardinality-09 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-13-ReachabilityCardinality-08 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-13-ReachabilityCardinality-07 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-13-ReachabilityCardinality-05 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-13-ReachabilityCardinality-03 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-13-ReachabilityCardinality-02 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-13-ReachabilityCardinality-00 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 10 Parikh solutions to 1 different solutions.
Support contains 23 out of 585 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 585/585 places, 528/528 transitions.
Graph (trivial) has 302 edges and 585 vertex of which 4 / 585 are part of one of the 1 SCC in 5 ms
Free SCC test removed 3 places
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 1193 edges and 582 vertex of which 576 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.5 ms
Discarding 6 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 111 transitions
Trivial Post-agglo rules discarded 111 transitions
Performed 111 trivial Post agglomeration. Transition count delta: 111
Iterating post reduction 0 with 111 rules applied. Total rules applied 113 place count 576 transition count 412
Reduce places removed 111 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 113 rules applied. Total rules applied 226 place count 465 transition count 410
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 228 place count 463 transition count 410
Performed 88 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 88 Pre rules applied. Total rules applied 228 place count 463 transition count 322
Deduced a syphon composed of 88 places in 1 ms
Ensure Unique test removed 13 places
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 189 rules applied. Total rules applied 417 place count 362 transition count 322
Discarding 70 places :
Symmetric choice reduction at 3 with 70 rule applications. Total rules 487 place count 292 transition count 252
Iterating global reduction 3 with 70 rules applied. Total rules applied 557 place count 292 transition count 252
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 557 place count 292 transition count 245
Deduced a syphon composed of 7 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 573 place count 283 transition count 245
Performed 84 Post agglomeration using F-continuation condition.Transition count delta: 84
Deduced a syphon composed of 84 places in 1 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 3 with 168 rules applied. Total rules applied 741 place count 199 transition count 161
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 743 place count 198 transition count 165
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 746 place count 198 transition count 162
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 749 place count 195 transition count 162
Partial Post-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 755 place count 195 transition count 162
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 756 place count 194 transition count 161
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 757 place count 193 transition count 161
Applied a total of 757 rules in 158 ms. Remains 193 /585 variables (removed 392) and now considering 161/528 (removed 367) transitions.
Finished structural reductions, in 1 iterations. Remains : 193/585 places, 161/528 transitions.
[2022-06-13 01:20:59] [INFO ] Flatten gal took : 90 ms
[2022-06-13 01:20:59] [INFO ] Flatten gal took : 19 ms
[2022-06-13 01:21:00] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17420156811527350607.gal : 25 ms
[2022-06-13 01:21:00] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality286125482274624746.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/ReachabilityCardinality17420156811527350607.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality286125482274624746.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/ReachabilityCardinality17420156811527350607.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality286125482274624746.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality286125482274624746.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 25
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :25 after 49
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :49 after 61
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :61 after 669
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :669 after 9155
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :9155 after 14929
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :14929 after 216053
Reachability property BusinessProcesses-PT-13-ReachabilityCardinality-04 is true.
FORMULA BusinessProcesses-PT-13-ReachabilityCardinality-04 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 513 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,511013,0.802048,13496,2,4530,14,31464,6,0,933,20464,0
Total reachable state count : 511013

Verifying 1 reachability properties.
Reachability property BusinessProcesses-PT-13-ReachabilityCardinality-04 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-13-ReachabilityCardinality-04,144,1.20842,13496,2,300,14,31464,7,0,1004,20464,0
All properties solved without resorting to model-checking.

BK_STOP 1655083263886

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

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