About the Execution of 2021-gold for BusinessProcesses-PT-16
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 321.855 | 35993.00 | 52519.00 | 780.50 | TFFFTTTFTTFTTFTT | normal |
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-165251936100167.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-16, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r028-tall-165251936100167
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 584K
-rw-r--r-- 1 mcc users 5.9K Apr 29 23:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K Apr 29 23:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Apr 29 23:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Apr 29 23:51 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:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 9 07:10 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 9 07:10 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 9 07:10 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.2K Apr 29 23:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 93K Apr 29 23:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K Apr 29 23:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 86K Apr 29 23:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K 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 159K 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-16-ReachabilityCardinality-00
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityCardinality-01
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityCardinality-02
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityCardinality-03
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityCardinality-04
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityCardinality-05
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityCardinality-06
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityCardinality-07
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityCardinality-08
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityCardinality-09
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityCardinality-10
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityCardinality-11
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityCardinality-12
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityCardinality-13
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityCardinality-14
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1655083327904
Running Version 0
[2022-06-13 01:22:09] [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:22:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-13 01:22:09] [INFO ] Load time of PNML (sax parser for PT used): 79 ms
[2022-06-13 01:22:09] [INFO ] Transformed 638 places.
[2022-06-13 01:22:09] [INFO ] Transformed 578 transitions.
[2022-06-13 01:22:09] [INFO ] Found NUPN structural information;
[2022-06-13 01:22:09] [INFO ] Parsed PT model containing 638 places and 578 transitions in 128 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 8 places in 11 ms
Reduce places removed 8 places and 8 transitions.
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 66 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 15) seen :5
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 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 11 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 11 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 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 12 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 570 rows 630 cols
[2022-06-13 01:22:10] [INFO ] Computed 100 place invariants in 44 ms
[2022-06-13 01:22:10] [INFO ] [Real]Absence check using 62 positive place invariants in 46 ms returned sat
[2022-06-13 01:22:10] [INFO ] [Real]Absence check using 62 positive and 38 generalized place invariants in 38 ms returned sat
[2022-06-13 01:22:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:22:12] [INFO ] [Real]Absence check using state equation in 1977 ms returned sat
[2022-06-13 01:22:12] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:22:12] [INFO ] [Nat]Absence check using 62 positive place invariants in 44 ms returned sat
[2022-06-13 01:22:12] [INFO ] [Nat]Absence check using 62 positive and 38 generalized place invariants in 30 ms returned sat
[2022-06-13 01:22:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-13 01:22:13] [INFO ] [Nat]Absence check using state equation in 414 ms returned sat
[2022-06-13 01:22:13] [INFO ] Deduced a trap composed of 8 places in 172 ms of which 4 ms to minimize.
[2022-06-13 01:22:13] [INFO ] Deduced a trap composed of 11 places in 141 ms of which 1 ms to minimize.
[2022-06-13 01:22:13] [INFO ] Deduced a trap composed of 15 places in 121 ms of which 1 ms to minimize.
[2022-06-13 01:22:13] [INFO ] Deduced a trap composed of 18 places in 114 ms of which 1 ms to minimize.
[2022-06-13 01:22:14] [INFO ] Deduced a trap composed of 18 places in 108 ms of which 1 ms to minimize.
[2022-06-13 01:22:14] [INFO ] Deduced a trap composed of 15 places in 137 ms of which 1 ms to minimize.
[2022-06-13 01:22:14] [INFO ] Deduced a trap composed of 30 places in 116 ms of which 1 ms to minimize.
[2022-06-13 01:22:14] [INFO ] Deduced a trap composed of 22 places in 100 ms of which 1 ms to minimize.
[2022-06-13 01:22:14] [INFO ] Deduced a trap composed of 24 places in 92 ms of which 0 ms to minimize.
[2022-06-13 01:22:14] [INFO ] Deduced a trap composed of 42 places in 99 ms of which 0 ms to minimize.
[2022-06-13 01:22:14] [INFO ] Deduced a trap composed of 23 places in 85 ms of which 0 ms to minimize.
[2022-06-13 01:22:14] [INFO ] Deduced a trap composed of 38 places in 89 ms of which 0 ms to minimize.
[2022-06-13 01:22:15] [INFO ] Deduced a trap composed of 35 places in 87 ms of which 1 ms to minimize.
[2022-06-13 01:22:15] [INFO ] Deduced a trap composed of 35 places in 84 ms of which 0 ms to minimize.
[2022-06-13 01:22:15] [INFO ] Deduced a trap composed of 37 places in 81 ms of which 1 ms to minimize.
[2022-06-13 01:22:15] [INFO ] Deduced a trap composed of 18 places in 76 ms of which 0 ms to minimize.
[2022-06-13 01:22:15] [INFO ] Deduced a trap composed of 34 places in 76 ms of which 0 ms to minimize.
[2022-06-13 01:22:15] [INFO ] Deduced a trap composed of 37 places in 76 ms of which 0 ms to minimize.
[2022-06-13 01:22:15] [INFO ] Deduced a trap composed of 31 places in 55 ms of which 0 ms to minimize.
[2022-06-13 01:22:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 19 trap constraints in 2411 ms
[2022-06-13 01:22:15] [INFO ] [Real]Absence check using 62 positive place invariants in 33 ms returned sat
[2022-06-13 01:22:15] [INFO ] [Real]Absence check using 62 positive and 38 generalized place invariants in 15 ms returned sat
[2022-06-13 01:22:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:22:15] [INFO ] [Real]Absence check using state equation in 215 ms returned sat
[2022-06-13 01:22:16] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:22:16] [INFO ] [Nat]Absence check using 62 positive place invariants in 26 ms returned sat
[2022-06-13 01:22:16] [INFO ] [Nat]Absence check using 62 positive and 38 generalized place invariants in 14 ms returned sat
[2022-06-13 01:22:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-13 01:22:16] [INFO ] [Nat]Absence check using state equation in 198 ms returned sat
[2022-06-13 01:22:16] [INFO ] Deduced a trap composed of 13 places in 94 ms of which 1 ms to minimize.
[2022-06-13 01:22:16] [INFO ] Deduced a trap composed of 15 places in 84 ms of which 1 ms to minimize.
[2022-06-13 01:22:16] [INFO ] Deduced a trap composed of 11 places in 87 ms of which 1 ms to minimize.
[2022-06-13 01:22:16] [INFO ] Deduced a trap composed of 17 places in 95 ms of which 0 ms to minimize.
[2022-06-13 01:22:16] [INFO ] Deduced a trap composed of 8 places in 80 ms of which 1 ms to minimize.
[2022-06-13 01:22:17] [INFO ] Deduced a trap composed of 18 places in 86 ms of which 0 ms to minimize.
[2022-06-13 01:22:17] [INFO ] Deduced a trap composed of 15 places in 145 ms of which 1 ms to minimize.
[2022-06-13 01:22:17] [INFO ] Deduced a trap composed of 37 places in 111 ms of which 0 ms to minimize.
[2022-06-13 01:22:17] [INFO ] Deduced a trap composed of 37 places in 91 ms of which 0 ms to minimize.
[2022-06-13 01:22:17] [INFO ] Deduced a trap composed of 46 places in 79 ms of which 1 ms to minimize.
[2022-06-13 01:22:17] [INFO ] Deduced a trap composed of 44 places in 78 ms of which 0 ms to minimize.
[2022-06-13 01:22:17] [INFO ] Deduced a trap composed of 43 places in 76 ms of which 0 ms to minimize.
[2022-06-13 01:22:17] [INFO ] Deduced a trap composed of 71 places in 76 ms of which 0 ms to minimize.
[2022-06-13 01:22:17] [INFO ] Deduced a trap composed of 83 places in 76 ms of which 1 ms to minimize.
[2022-06-13 01:22:18] [INFO ] Deduced a trap composed of 37 places in 80 ms of which 1 ms to minimize.
[2022-06-13 01:22:18] [INFO ] Deduced a trap composed of 39 places in 81 ms of which 4 ms to minimize.
[2022-06-13 01:22:18] [INFO ] Deduced a trap composed of 33 places in 74 ms of which 0 ms to minimize.
[2022-06-13 01:22:18] [INFO ] Deduced a trap composed of 47 places in 75 ms of which 0 ms to minimize.
[2022-06-13 01:22:18] [INFO ] Deduced a trap composed of 34 places in 74 ms of which 0 ms to minimize.
[2022-06-13 01:22:18] [INFO ] Deduced a trap composed of 38 places in 73 ms of which 0 ms to minimize.
[2022-06-13 01:22:18] [INFO ] Deduced a trap composed of 52 places in 81 ms of which 1 ms to minimize.
[2022-06-13 01:22:18] [INFO ] Deduced a trap composed of 56 places in 75 ms of which 0 ms to minimize.
[2022-06-13 01:22:18] [INFO ] Deduced a trap composed of 96 places in 70 ms of which 1 ms to minimize.
[2022-06-13 01:22:18] [INFO ] Deduced a trap composed of 36 places in 70 ms of which 1 ms to minimize.
[2022-06-13 01:22:19] [INFO ] Deduced a trap composed of 98 places in 78 ms of which 0 ms to minimize.
[2022-06-13 01:22:19] [INFO ] Deduced a trap composed of 93 places in 72 ms of which 0 ms to minimize.
[2022-06-13 01:22:19] [INFO ] Deduced a trap composed of 77 places in 71 ms of which 0 ms to minimize.
[2022-06-13 01:22:19] [INFO ] Deduced a trap composed of 90 places in 72 ms of which 1 ms to minimize.
[2022-06-13 01:22:19] [INFO ] Deduced a trap composed of 82 places in 66 ms of which 1 ms to minimize.
[2022-06-13 01:22:19] [INFO ] Deduced a trap composed of 104 places in 70 ms of which 1 ms to minimize.
[2022-06-13 01:22:19] [INFO ] Deduced a trap composed of 28 places in 84 ms of which 14 ms to minimize.
[2022-06-13 01:22:19] [INFO ] Deduced a trap composed of 93 places in 68 ms of which 1 ms to minimize.
[2022-06-13 01:22:19] [INFO ] Trap strengthening (SAT) tested/added 33/32 trap constraints in 3499 ms
[2022-06-13 01:22:19] [INFO ] Computed and/alt/rep : 535/875/535 causal constraints (skipped 34 transitions) in 52 ms.
[2022-06-13 01:22:21] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
[2022-06-13 01:22:21] [INFO ] [Real]Absence check using 62 positive place invariants in 24 ms returned sat
[2022-06-13 01:22:21] [INFO ] [Real]Absence check using 62 positive and 38 generalized place invariants in 27 ms returned sat
[2022-06-13 01:22:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:22:21] [INFO ] [Real]Absence check using state equation in 181 ms returned sat
[2022-06-13 01:22:21] [INFO ] Deduced a trap composed of 13 places in 140 ms of which 1 ms to minimize.
[2022-06-13 01:22:21] [INFO ] Deduced a trap composed of 42 places in 134 ms of which 1 ms to minimize.
[2022-06-13 01:22:21] [INFO ] Deduced a trap composed of 11 places in 131 ms of which 0 ms to minimize.
[2022-06-13 01:22:22] [INFO ] Deduced a trap composed of 17 places in 136 ms of which 1 ms to minimize.
[2022-06-13 01:22:22] [INFO ] Deduced a trap composed of 23 places in 126 ms of which 0 ms to minimize.
[2022-06-13 01:22:22] [INFO ] Deduced a trap composed of 8 places in 147 ms of which 8 ms to minimize.
[2022-06-13 01:22:22] [INFO ] Deduced a trap composed of 17 places in 137 ms of which 0 ms to minimize.
[2022-06-13 01:22:22] [INFO ] Deduced a trap composed of 42 places in 136 ms of which 1 ms to minimize.
[2022-06-13 01:22:22] [INFO ] Deduced a trap composed of 155 places in 132 ms of which 0 ms to minimize.
[2022-06-13 01:22:23] [INFO ] Deduced a trap composed of 11 places in 121 ms of which 0 ms to minimize.
[2022-06-13 01:22:23] [INFO ] Deduced a trap composed of 18 places in 121 ms of which 0 ms to minimize.
[2022-06-13 01:22:23] [INFO ] Deduced a trap composed of 159 places in 125 ms of which 1 ms to minimize.
[2022-06-13 01:22:23] [INFO ] Deduced a trap composed of 159 places in 126 ms of which 0 ms to minimize.
[2022-06-13 01:22:23] [INFO ] Deduced a trap composed of 162 places in 126 ms of which 0 ms to minimize.
[2022-06-13 01:22:23] [INFO ] Deduced a trap composed of 149 places in 126 ms of which 1 ms to minimize.
[2022-06-13 01:22:23] [INFO ] Deduced a trap composed of 162 places in 129 ms of which 0 ms to minimize.
[2022-06-13 01:22:24] [INFO ] Deduced a trap composed of 145 places in 131 ms of which 3 ms to minimize.
[2022-06-13 01:22:24] [INFO ] Deduced a trap composed of 149 places in 133 ms of which 0 ms to minimize.
[2022-06-13 01:22:24] [INFO ] Deduced a trap composed of 43 places in 129 ms of which 1 ms to minimize.
[2022-06-13 01:22:24] [INFO ] Deduced a trap composed of 141 places in 125 ms of which 0 ms to minimize.
[2022-06-13 01:22:24] [INFO ] Deduced a trap composed of 158 places in 127 ms of which 0 ms to minimize.
[2022-06-13 01:22:24] [INFO ] Deduced a trap composed of 155 places in 127 ms of which 1 ms to minimize.
[2022-06-13 01:22:25] [INFO ] Deduced a trap composed of 16 places in 122 ms of which 0 ms to minimize.
[2022-06-13 01:22:25] [INFO ] Deduced a trap composed of 154 places in 120 ms of which 0 ms to minimize.
[2022-06-13 01:22:25] [INFO ] Deduced a trap composed of 143 places in 123 ms of which 0 ms to minimize.
[2022-06-13 01:22:25] [INFO ] Deduced a trap composed of 166 places in 121 ms of which 0 ms to minimize.
[2022-06-13 01:22:25] [INFO ] Deduced a trap composed of 153 places in 123 ms of which 1 ms to minimize.
[2022-06-13 01:22:25] [INFO ] Deduced a trap composed of 145 places in 129 ms of which 1 ms to minimize.
[2022-06-13 01:22:25] [INFO ] Deduced a trap composed of 34 places in 129 ms of which 0 ms to minimize.
[2022-06-13 01:22:26] [INFO ] Deduced a trap composed of 56 places in 121 ms of which 1 ms to minimize.
[2022-06-13 01:22:26] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
[2022-06-13 01:22:26] [INFO ] [Real]Absence check using 62 positive place invariants in 23 ms returned sat
[2022-06-13 01:22:26] [INFO ] [Real]Absence check using 62 positive and 38 generalized place invariants in 14 ms returned sat
[2022-06-13 01:22:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:22:26] [INFO ] [Real]Absence check using state equation in 207 ms returned sat
[2022-06-13 01:22:26] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:22:26] [INFO ] [Real]Absence check using 62 positive place invariants in 26 ms returned sat
[2022-06-13 01:22:26] [INFO ] [Real]Absence check using 62 positive and 38 generalized place invariants in 18 ms returned sat
[2022-06-13 01:22:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:22:27] [INFO ] [Real]Absence check using state equation in 289 ms returned sat
[2022-06-13 01:22:27] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:22:27] [INFO ] [Real]Absence check using 62 positive place invariants in 29 ms returned sat
[2022-06-13 01:22:27] [INFO ] [Real]Absence check using 62 positive and 38 generalized place invariants in 23 ms returned sat
[2022-06-13 01:22:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:22:28] [INFO ] [Real]Absence check using state equation in 802 ms returned sat
[2022-06-13 01:22:28] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:22:28] [INFO ] [Nat]Absence check using 62 positive place invariants in 35 ms returned sat
[2022-06-13 01:22:28] [INFO ] [Nat]Absence check using 62 positive and 38 generalized place invariants in 20 ms returned sat
[2022-06-13 01:22:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-13 01:22:28] [INFO ] [Nat]Absence check using state equation in 577 ms returned sat
[2022-06-13 01:22:28] [INFO ] Deduced a trap composed of 11 places in 78 ms of which 0 ms to minimize.
[2022-06-13 01:22:29] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 1 ms to minimize.
[2022-06-13 01:22:29] [INFO ] Deduced a trap composed of 14 places in 74 ms of which 0 ms to minimize.
[2022-06-13 01:22:29] [INFO ] Deduced a trap composed of 8 places in 72 ms of which 0 ms to minimize.
[2022-06-13 01:22:29] [INFO ] Deduced a trap composed of 50 places in 73 ms of which 1 ms to minimize.
[2022-06-13 01:22:29] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 0 ms to minimize.
[2022-06-13 01:22:29] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
[2022-06-13 01:22:29] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
[2022-06-13 01:22:29] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 0 ms to minimize.
[2022-06-13 01:22:29] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 841 ms
[2022-06-13 01:22:29] [INFO ] Computed and/alt/rep : 535/875/535 causal constraints (skipped 34 transitions) in 36 ms.
[2022-06-13 01:22:33] [INFO ] Deduced a trap composed of 8 places in 198 ms of which 1 ms to minimize.
[2022-06-13 01:22:33] [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 5
[2022-06-13 01:22:33] [INFO ] [Real]Absence check using 62 positive place invariants in 24 ms returned sat
[2022-06-13 01:22:33] [INFO ] [Real]Absence check using 62 positive and 38 generalized place invariants in 14 ms returned sat
[2022-06-13 01:22:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:22:33] [INFO ] [Real]Absence check using state equation in 187 ms returned sat
[2022-06-13 01:22:33] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:22:33] [INFO ] [Real]Absence check using 62 positive place invariants in 23 ms returned sat
[2022-06-13 01:22:33] [INFO ] [Real]Absence check using 62 positive and 38 generalized place invariants in 14 ms returned sat
[2022-06-13 01:22:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:22:34] [INFO ] [Real]Absence check using state equation in 337 ms returned sat
[2022-06-13 01:22:34] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:22:34] [INFO ] [Real]Absence check using 62 positive place invariants in 23 ms returned sat
[2022-06-13 01:22:34] [INFO ] [Real]Absence check using 62 positive and 38 generalized place invariants in 15 ms returned sat
[2022-06-13 01:22:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:22:34] [INFO ] [Real]Absence check using state equation in 186 ms returned sat
[2022-06-13 01:22:34] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:22:34] [INFO ] [Nat]Absence check using 62 positive place invariants in 24 ms returned sat
[2022-06-13 01:22:34] [INFO ] [Nat]Absence check using 62 positive and 38 generalized place invariants in 13 ms returned sat
[2022-06-13 01:22:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-13 01:22:35] [INFO ] [Nat]Absence check using state equation in 189 ms returned sat
[2022-06-13 01:22:35] [INFO ] Deduced a trap composed of 8 places in 133 ms of which 0 ms to minimize.
[2022-06-13 01:22:35] [INFO ] Deduced a trap composed of 12 places in 122 ms of which 0 ms to minimize.
[2022-06-13 01:22:35] [INFO ] Deduced a trap composed of 35 places in 127 ms of which 0 ms to minimize.
[2022-06-13 01:22:35] [INFO ] Deduced a trap composed of 15 places in 124 ms of which 0 ms to minimize.
[2022-06-13 01:22:35] [INFO ] Deduced a trap composed of 18 places in 127 ms of which 0 ms to minimize.
[2022-06-13 01:22:35] [INFO ] Deduced a trap composed of 117 places in 126 ms of which 1 ms to minimize.
[2022-06-13 01:22:36] [INFO ] Deduced a trap composed of 129 places in 115 ms of which 1 ms to minimize.
[2022-06-13 01:22:36] [INFO ] Deduced a trap composed of 15 places in 112 ms of which 0 ms to minimize.
[2022-06-13 01:22:36] [INFO ] Deduced a trap composed of 18 places in 70 ms of which 1 ms to minimize.
[2022-06-13 01:22:36] [INFO ] Deduced a trap composed of 32 places in 74 ms of which 1 ms to minimize.
[2022-06-13 01:22:36] [INFO ] Deduced a trap composed of 39 places in 69 ms of which 0 ms to minimize.
[2022-06-13 01:22:36] [INFO ] Deduced a trap composed of 38 places in 73 ms of which 0 ms to minimize.
[2022-06-13 01:22:36] [INFO ] Deduced a trap composed of 35 places in 69 ms of which 1 ms to minimize.
[2022-06-13 01:22:36] [INFO ] Deduced a trap composed of 37 places in 73 ms of which 1 ms to minimize.
[2022-06-13 01:22:36] [INFO ] Deduced a trap composed of 36 places in 67 ms of which 1 ms to minimize.
[2022-06-13 01:22:36] [INFO ] Deduced a trap composed of 40 places in 74 ms of which 0 ms to minimize.
[2022-06-13 01:22:37] [INFO ] Deduced a trap composed of 41 places in 68 ms of which 0 ms to minimize.
[2022-06-13 01:22:37] [INFO ] Deduced a trap composed of 46 places in 71 ms of which 0 ms to minimize.
[2022-06-13 01:22:37] [INFO ] Deduced a trap composed of 28 places in 69 ms of which 0 ms to minimize.
[2022-06-13 01:22:37] [INFO ] Deduced a trap composed of 42 places in 68 ms of which 0 ms to minimize.
[2022-06-13 01:22:37] [INFO ] Deduced a trap composed of 31 places in 44 ms of which 0 ms to minimize.
[2022-06-13 01:22:37] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 2430 ms
[2022-06-13 01:22:37] [INFO ] Computed and/alt/rep : 535/875/535 causal constraints (skipped 34 transitions) in 35 ms.
[2022-06-13 01:22:39] [INFO ] Added : 261 causal constraints over 53 iterations in 2169 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 9 ms.
[2022-06-13 01:22:39] [INFO ] [Real]Absence check using 62 positive place invariants in 31 ms returned sat
[2022-06-13 01:22:39] [INFO ] [Real]Absence check using 62 positive and 38 generalized place invariants in 28 ms returned sat
[2022-06-13 01:22:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:22:40] [INFO ] [Real]Absence check using state equation in 790 ms returned sat
[2022-06-13 01:22:40] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:22:40] [INFO ] [Nat]Absence check using 62 positive place invariants in 28 ms returned unsat
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-11 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-08 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-06 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-05 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-00 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 10 Parikh solutions to 2 different solutions.
Incomplete Parikh walk after 19400 steps, including 103 resets, run finished after 69 ms. (steps per millisecond=281 ) properties (out of 4) seen :1 could not realise parikh vector
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 19 out of 630 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 630/630 places, 570/570 transitions.
Graph (trivial) has 350 edges and 630 vertex of which 7 / 630 are part of one of the 1 SCC in 5 ms
Free SCC test removed 6 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1283 edges and 624 vertex of which 618 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.7 ms
Discarding 6 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 137 transitions
Trivial Post-agglo rules discarded 137 transitions
Performed 137 trivial Post agglomeration. Transition count delta: 137
Iterating post reduction 0 with 137 rules applied. Total rules applied 139 place count 618 transition count 424
Reduce places removed 137 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 140 rules applied. Total rules applied 279 place count 481 transition count 421
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 282 place count 478 transition count 421
Performed 84 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 84 Pre rules applied. Total rules applied 282 place count 478 transition count 337
Deduced a syphon composed of 84 places in 2 ms
Ensure Unique test removed 14 places
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 3 with 182 rules applied. Total rules applied 464 place count 380 transition count 337
Discarding 85 places :
Symmetric choice reduction at 3 with 85 rule applications. Total rules 549 place count 295 transition count 252
Iterating global reduction 3 with 85 rules applied. Total rules applied 634 place count 295 transition count 252
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 634 place count 295 transition count 242
Deduced a syphon composed of 10 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 23 rules applied. Total rules applied 657 place count 282 transition count 242
Performed 87 Post agglomeration using F-continuation condition.Transition count delta: 87
Deduced a syphon composed of 87 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 3 with 176 rules applied. Total rules applied 833 place count 193 transition count 155
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 835 place count 192 transition count 159
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 836 place count 192 transition count 158
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 837 place count 191 transition count 158
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 838 place count 191 transition count 158
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 839 place count 190 transition count 157
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 840 place count 189 transition count 157
Applied a total of 840 rules in 165 ms. Remains 189 /630 variables (removed 441) and now considering 157/570 (removed 413) transitions.
Finished structural reductions, in 1 iterations. Remains : 189/630 places, 157/570 transitions.
[2022-06-13 01:22:41] [INFO ] Flatten gal took : 60 ms
[2022-06-13 01:22:41] [INFO ] Flatten gal took : 22 ms
[2022-06-13 01:22:41] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7812753579405262825.gal : 18 ms
[2022-06-13 01:22:41] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5354972062162305063.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/ReachabilityCardinality7812753579405262825.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality5354972062162305063.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/ReachabilityCardinality7812753579405262825.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality5354972062162305063.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality5354972062162305063.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :2 after 4
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :4 after 5
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :5 after 10
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :10 after 92
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :92 after 402
Invariant property BusinessProcesses-PT-16-ReachabilityCardinality-02 does not hold.
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :402 after 4512
Invariant property BusinessProcesses-PT-16-ReachabilityCardinality-07 does not hold.
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :4512 after 16196
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :16196 after 53780
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :53780 after 123332
Reachability property BusinessProcesses-PT-16-ReachabilityCardinality-04 is true.
FORMULA BusinessProcesses-PT-16-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,791416,0.277247,11400,2,4200,19,21891,6,0,912,18915,0
Total reachable state count : 791416
Verifying 3 reachability properties.
Invariant property BusinessProcesses-PT-16-ReachabilityCardinality-02 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
BusinessProcesses-PT-16-ReachabilityCardinality-02,36,0.278761,11664,2,239,19,21891,7,0,915,18915,0
Reachability property BusinessProcesses-PT-16-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-16-ReachabilityCardinality-04,28512,0.279311,11664,2,970,19,21891,8,0,917,18915,0
Invariant property BusinessProcesses-PT-16-ReachabilityCardinality-07 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-16-ReachabilityCardinality-07,3024,0.445079,11664,2,573,19,21891,9,0,969,18915,0
All properties solved without resorting to model-checking.
BK_STOP 1655083363897
--------------------
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-16"
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-16, 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-165251936100167"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-16.tgz
mv BusinessProcesses-PT-16 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 '
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 ;