About the Execution of 2021-gold for BusinessProcesses-PT-20
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 534.684 | 69503.00 | 86768.00 | 352.90 | FFFTTTTTFTFTTTFT | 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-165251936200180.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2021
Input is BusinessProcesses-PT-20, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r028-tall-165251936200180
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 692K
-rw-r--r-- 1 mcc users 6.8K Apr 29 23:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Apr 29 23:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Apr 29 23:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Apr 29 23:52 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K May 9 07:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 07:11 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 07:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 07:11 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 29 23:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 148K Apr 29 23:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K Apr 29 23:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 83K Apr 29 23:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 07:11 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 3 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 192K May 10 09:33 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityFireability-00
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityFireability-01
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityFireability-02
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityFireability-03
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityFireability-04
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityFireability-05
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityFireability-06
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityFireability-07
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityFireability-08
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityFireability-09
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityFireability-10
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityFireability-11
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityFireability-12
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityFireability-13
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityFireability-14
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityFireability-15
=== Now, execution of the tool begins
BK_START 1655083486869
Running Version 0
[2022-06-13 01:24:48] [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:24:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-13 01:24:48] [INFO ] Load time of PNML (sax parser for PT used): 175 ms
[2022-06-13 01:24:48] [INFO ] Transformed 782 places.
[2022-06-13 01:24:48] [INFO ] Transformed 697 transitions.
[2022-06-13 01:24:48] [INFO ] Found NUPN structural information;
[2022-06-13 01:24:48] [INFO ] Parsed PT model containing 782 places and 697 transitions in 234 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 63 places in 16 ms
Reduce places removed 63 places and 59 transitions.
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 48 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 15) seen :7
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 6 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 9 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 638 rows 719 cols
[2022-06-13 01:24:49] [INFO ] Computed 121 place invariants in 44 ms
[2022-06-13 01:24:49] [INFO ] [Real]Absence check using 78 positive place invariants in 36 ms returned sat
[2022-06-13 01:24:49] [INFO ] [Real]Absence check using 78 positive and 43 generalized place invariants in 14 ms returned sat
[2022-06-13 01:24:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:24:49] [INFO ] [Real]Absence check using state equation in 429 ms returned sat
[2022-06-13 01:24:49] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:24:50] [INFO ] [Nat]Absence check using 78 positive place invariants in 36 ms returned sat
[2022-06-13 01:24:50] [INFO ] [Nat]Absence check using 78 positive and 43 generalized place invariants in 15 ms returned sat
[2022-06-13 01:24:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-13 01:24:50] [INFO ] [Nat]Absence check using state equation in 404 ms returned sat
[2022-06-13 01:24:50] [INFO ] Deduced a trap composed of 24 places in 194 ms of which 3 ms to minimize.
[2022-06-13 01:24:50] [INFO ] Deduced a trap composed of 35 places in 147 ms of which 2 ms to minimize.
[2022-06-13 01:24:51] [INFO ] Deduced a trap composed of 8 places in 136 ms of which 2 ms to minimize.
[2022-06-13 01:24:51] [INFO ] Deduced a trap composed of 31 places in 121 ms of which 2 ms to minimize.
[2022-06-13 01:24:51] [INFO ] Deduced a trap composed of 25 places in 84 ms of which 0 ms to minimize.
[2022-06-13 01:24:51] [INFO ] Deduced a trap composed of 33 places in 65 ms of which 1 ms to minimize.
[2022-06-13 01:24:51] [INFO ] Deduced a trap composed of 33 places in 69 ms of which 1 ms to minimize.
[2022-06-13 01:24:51] [INFO ] Deduced a trap composed of 30 places in 82 ms of which 12 ms to minimize.
[2022-06-13 01:24:51] [INFO ] Deduced a trap composed of 40 places in 79 ms of which 0 ms to minimize.
[2022-06-13 01:24:51] [INFO ] Deduced a trap composed of 45 places in 61 ms of which 0 ms to minimize.
[2022-06-13 01:24:51] [INFO ] Deduced a trap composed of 39 places in 41 ms of which 0 ms to minimize.
[2022-06-13 01:24:52] [INFO ] Deduced a trap composed of 38 places in 33 ms of which 1 ms to minimize.
[2022-06-13 01:24:52] [INFO ] Deduced a trap composed of 37 places in 37 ms of which 0 ms to minimize.
[2022-06-13 01:24:52] [INFO ] Deduced a trap composed of 39 places in 34 ms of which 0 ms to minimize.
[2022-06-13 01:24:52] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 1703 ms
[2022-06-13 01:24:52] [INFO ] Computed and/alt/rep : 600/951/600 causal constraints (skipped 37 transitions) in 43 ms.
[2022-06-13 01:24:55] [INFO ] Deduced a trap composed of 11 places in 228 ms of which 0 ms to minimize.
[2022-06-13 01:24:55] [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 0
[2022-06-13 01:24:55] [INFO ] [Real]Absence check using 78 positive place invariants in 13 ms returned unsat
[2022-06-13 01:24:55] [INFO ] [Real]Absence check using 78 positive place invariants in 32 ms returned sat
[2022-06-13 01:24:55] [INFO ] [Real]Absence check using 78 positive and 43 generalized place invariants in 15 ms returned sat
[2022-06-13 01:24:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:24:55] [INFO ] [Real]Absence check using state equation in 275 ms returned sat
[2022-06-13 01:24:55] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:24:55] [INFO ] [Nat]Absence check using 78 positive place invariants in 33 ms returned sat
[2022-06-13 01:24:55] [INFO ] [Nat]Absence check using 78 positive and 43 generalized place invariants in 21 ms returned sat
[2022-06-13 01:24:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-13 01:24:56] [INFO ] [Nat]Absence check using state equation in 284 ms returned sat
[2022-06-13 01:24:56] [INFO ] Deduced a trap composed of 22 places in 147 ms of which 1 ms to minimize.
[2022-06-13 01:24:56] [INFO ] Deduced a trap composed of 8 places in 149 ms of which 1 ms to minimize.
[2022-06-13 01:24:56] [INFO ] Deduced a trap composed of 59 places in 150 ms of which 0 ms to minimize.
[2022-06-13 01:24:56] [INFO ] Deduced a trap composed of 61 places in 142 ms of which 0 ms to minimize.
[2022-06-13 01:24:57] [INFO ] Deduced a trap composed of 156 places in 153 ms of which 1 ms to minimize.
[2022-06-13 01:24:57] [INFO ] Deduced a trap composed of 160 places in 146 ms of which 0 ms to minimize.
[2022-06-13 01:24:57] [INFO ] Deduced a trap composed of 33 places in 148 ms of which 1 ms to minimize.
[2022-06-13 01:24:57] [INFO ] Deduced a trap composed of 153 places in 147 ms of which 0 ms to minimize.
[2022-06-13 01:24:57] [INFO ] Deduced a trap composed of 160 places in 151 ms of which 0 ms to minimize.
[2022-06-13 01:24:57] [INFO ] Deduced a trap composed of 152 places in 148 ms of which 0 ms to minimize.
[2022-06-13 01:24:58] [INFO ] Deduced a trap composed of 67 places in 144 ms of which 1 ms to minimize.
[2022-06-13 01:24:58] [INFO ] Deduced a trap composed of 53 places in 146 ms of which 0 ms to minimize.
[2022-06-13 01:24:58] [INFO ] Deduced a trap composed of 187 places in 149 ms of which 1 ms to minimize.
[2022-06-13 01:24:58] [INFO ] Deduced a trap composed of 31 places in 145 ms of which 0 ms to minimize.
[2022-06-13 01:24:58] [INFO ] Deduced a trap composed of 163 places in 149 ms of which 1 ms to minimize.
[2022-06-13 01:24:59] [INFO ] Deduced a trap composed of 52 places in 153 ms of which 1 ms to minimize.
[2022-06-13 01:24:59] [INFO ] Deduced a trap composed of 66 places in 154 ms of which 0 ms to minimize.
[2022-06-13 01:24:59] [INFO ] Deduced a trap composed of 72 places in 162 ms of which 0 ms to minimize.
[2022-06-13 01:24:59] [INFO ] Deduced a trap composed of 39 places in 147 ms of which 1 ms to minimize.
[2022-06-13 01:24:59] [INFO ] Deduced a trap composed of 32 places in 149 ms of which 1 ms to minimize.
[2022-06-13 01:24:59] [INFO ] Deduced a trap composed of 62 places in 152 ms of which 0 ms to minimize.
[2022-06-13 01:25:00] [INFO ] Deduced a trap composed of 68 places in 146 ms of which 1 ms to minimize.
[2022-06-13 01:25:00] [INFO ] Deduced a trap composed of 48 places in 178 ms of which 1 ms to minimize.
[2022-06-13 01:25:00] [INFO ] Deduced a trap composed of 157 places in 143 ms of which 1 ms to minimize.
[2022-06-13 01:25:00] [INFO ] Deduced a trap composed of 65 places in 144 ms of which 1 ms to minimize.
[2022-06-13 01:25:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 25 trap constraints in 4550 ms
[2022-06-13 01:25:00] [INFO ] [Real]Absence check using 78 positive place invariants in 28 ms returned sat
[2022-06-13 01:25:00] [INFO ] [Real]Absence check using 78 positive and 43 generalized place invariants in 12 ms returned sat
[2022-06-13 01:25:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:25:01] [INFO ] [Real]Absence check using state equation in 192 ms returned sat
[2022-06-13 01:25:01] [INFO ] Deduced a trap composed of 8 places in 196 ms of which 1 ms to minimize.
[2022-06-13 01:25:01] [INFO ] Deduced a trap composed of 8 places in 192 ms of which 0 ms to minimize.
[2022-06-13 01:25:01] [INFO ] Deduced a trap composed of 30 places in 164 ms of which 1 ms to minimize.
[2022-06-13 01:25:01] [INFO ] Deduced a trap composed of 31 places in 160 ms of which 1 ms to minimize.
[2022-06-13 01:25:02] [INFO ] Deduced a trap composed of 11 places in 161 ms of which 0 ms to minimize.
[2022-06-13 01:25:02] [INFO ] Deduced a trap composed of 159 places in 156 ms of which 1 ms to minimize.
[2022-06-13 01:25:02] [INFO ] Deduced a trap composed of 147 places in 155 ms of which 1 ms to minimize.
[2022-06-13 01:25:03] [INFO ] Deduced a trap composed of 154 places in 154 ms of which 1 ms to minimize.
[2022-06-13 01:25:03] [INFO ] Deduced a trap composed of 156 places in 156 ms of which 1 ms to minimize.
[2022-06-13 01:25:03] [INFO ] Deduced a trap composed of 164 places in 156 ms of which 1 ms to minimize.
[2022-06-13 01:25:03] [INFO ] Deduced a trap composed of 145 places in 152 ms of which 1 ms to minimize.
[2022-06-13 01:25:03] [INFO ] Deduced a trap composed of 167 places in 150 ms of which 0 ms to minimize.
[2022-06-13 01:25:03] [INFO ] Deduced a trap composed of 164 places in 166 ms of which 0 ms to minimize.
[2022-06-13 01:25:04] [INFO ] Deduced a trap composed of 166 places in 156 ms of which 1 ms to minimize.
[2022-06-13 01:25:04] [INFO ] Deduced a trap composed of 175 places in 159 ms of which 0 ms to minimize.
[2022-06-13 01:25:04] [INFO ] Deduced a trap composed of 177 places in 135 ms of which 0 ms to minimize.
[2022-06-13 01:25:04] [INFO ] Deduced a trap composed of 162 places in 140 ms of which 1 ms to minimize.
[2022-06-13 01:25:04] [INFO ] Deduced a trap composed of 176 places in 138 ms of which 0 ms to minimize.
[2022-06-13 01:25:05] [INFO ] Deduced a trap composed of 164 places in 166 ms of which 0 ms to minimize.
[2022-06-13 01:25:05] [INFO ] Deduced a trap composed of 168 places in 149 ms of which 1 ms to minimize.
[2022-06-13 01:25:05] [INFO ] Deduced a trap composed of 156 places in 152 ms of which 1 ms to minimize.
[2022-06-13 01:25:05] [INFO ] Deduced a trap composed of 161 places in 146 ms of which 1 ms to minimize.
[2022-06-13 01:25:05] [INFO ] Deduced a trap composed of 156 places in 161 ms of which 1 ms to minimize.
[2022-06-13 01:25:05] [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:25:06] [INFO ] [Real]Absence check using 78 positive place invariants in 34 ms returned sat
[2022-06-13 01:25:06] [INFO ] [Real]Absence check using 78 positive and 43 generalized place invariants in 21 ms returned sat
[2022-06-13 01:25:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:25:06] [INFO ] [Real]Absence check using state equation in 390 ms returned sat
[2022-06-13 01:25:06] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:25:06] [INFO ] [Nat]Absence check using 78 positive place invariants in 35 ms returned sat
[2022-06-13 01:25:06] [INFO ] [Nat]Absence check using 78 positive and 43 generalized place invariants in 20 ms returned sat
[2022-06-13 01:25:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-13 01:25:07] [INFO ] [Nat]Absence check using state equation in 442 ms returned sat
[2022-06-13 01:25:07] [INFO ] Deduced a trap composed of 23 places in 78 ms of which 1 ms to minimize.
[2022-06-13 01:25:07] [INFO ] Deduced a trap composed of 22 places in 78 ms of which 0 ms to minimize.
[2022-06-13 01:25:07] [INFO ] Deduced a trap composed of 19 places in 77 ms of which 3 ms to minimize.
[2022-06-13 01:25:07] [INFO ] Deduced a trap composed of 40 places in 64 ms of which 0 ms to minimize.
[2022-06-13 01:25:07] [INFO ] Deduced a trap composed of 40 places in 61 ms of which 1 ms to minimize.
[2022-06-13 01:25:07] [INFO ] Deduced a trap composed of 42 places in 54 ms of which 0 ms to minimize.
[2022-06-13 01:25:07] [INFO ] Deduced a trap composed of 33 places in 53 ms of which 0 ms to minimize.
[2022-06-13 01:25:07] [INFO ] Deduced a trap composed of 29 places in 58 ms of which 0 ms to minimize.
[2022-06-13 01:25:07] [INFO ] Deduced a trap composed of 40 places in 55 ms of which 0 ms to minimize.
[2022-06-13 01:25:07] [INFO ] Deduced a trap composed of 32 places in 58 ms of which 0 ms to minimize.
[2022-06-13 01:25:08] [INFO ] Deduced a trap composed of 37 places in 53 ms of which 0 ms to minimize.
[2022-06-13 01:25:08] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 1 ms to minimize.
[2022-06-13 01:25:08] [INFO ] Deduced a trap composed of 34 places in 53 ms of which 0 ms to minimize.
[2022-06-13 01:25:08] [INFO ] Deduced a trap composed of 38 places in 37 ms of which 0 ms to minimize.
[2022-06-13 01:25:08] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 1280 ms
[2022-06-13 01:25:08] [INFO ] Computed and/alt/rep : 600/951/600 causal constraints (skipped 37 transitions) in 35 ms.
[2022-06-13 01:25:11] [INFO ] Deduced a trap composed of 11 places in 216 ms of which 0 ms to minimize.
[2022-06-13 01:25:11] [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 4
[2022-06-13 01:25:11] [INFO ] [Real]Absence check using 78 positive place invariants in 32 ms returned sat
[2022-06-13 01:25:11] [INFO ] [Real]Absence check using 78 positive and 43 generalized place invariants in 16 ms returned sat
[2022-06-13 01:25:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:25:12] [INFO ] [Real]Absence check using state equation in 612 ms returned sat
[2022-06-13 01:25:12] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:25:12] [INFO ] [Nat]Absence check using 78 positive place invariants in 32 ms returned sat
[2022-06-13 01:25:12] [INFO ] [Nat]Absence check using 78 positive and 43 generalized place invariants in 18 ms returned sat
[2022-06-13 01:25:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-13 01:25:13] [INFO ] [Nat]Absence check using state equation in 624 ms returned sat
[2022-06-13 01:25:13] [INFO ] Deduced a trap composed of 8 places in 100 ms of which 1 ms to minimize.
[2022-06-13 01:25:13] [INFO ] Deduced a trap composed of 22 places in 90 ms of which 0 ms to minimize.
[2022-06-13 01:25:13] [INFO ] Deduced a trap composed of 11 places in 89 ms of which 0 ms to minimize.
[2022-06-13 01:25:13] [INFO ] Deduced a trap composed of 12 places in 93 ms of which 0 ms to minimize.
[2022-06-13 01:25:13] [INFO ] Deduced a trap composed of 17 places in 85 ms of which 1 ms to minimize.
[2022-06-13 01:25:13] [INFO ] Deduced a trap composed of 30 places in 116 ms of which 0 ms to minimize.
[2022-06-13 01:25:14] [INFO ] Deduced a trap composed of 50 places in 82 ms of which 0 ms to minimize.
[2022-06-13 01:25:14] [INFO ] Deduced a trap composed of 57 places in 79 ms of which 0 ms to minimize.
[2022-06-13 01:25:14] [INFO ] Deduced a trap composed of 38 places in 70 ms of which 1 ms to minimize.
[2022-06-13 01:25:14] [INFO ] Deduced a trap composed of 28 places in 64 ms of which 0 ms to minimize.
[2022-06-13 01:25:14] [INFO ] Deduced a trap composed of 40 places in 70 ms of which 0 ms to minimize.
[2022-06-13 01:25:14] [INFO ] Deduced a trap composed of 46 places in 68 ms of which 0 ms to minimize.
[2022-06-13 01:25:14] [INFO ] Deduced a trap composed of 38 places in 60 ms of which 0 ms to minimize.
[2022-06-13 01:25:14] [INFO ] Deduced a trap composed of 35 places in 57 ms of which 0 ms to minimize.
[2022-06-13 01:25:14] [INFO ] Deduced a trap composed of 37 places in 33 ms of which 0 ms to minimize.
[2022-06-13 01:25:14] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 1617 ms
[2022-06-13 01:25:14] [INFO ] Computed and/alt/rep : 600/951/600 causal constraints (skipped 37 transitions) in 35 ms.
[2022-06-13 01:25:17] [INFO ] Added : 310 causal constraints over 62 iterations in 2628 ms. Result :unknown
[2022-06-13 01:25:17] [INFO ] [Real]Absence check using 78 positive place invariants in 34 ms returned sat
[2022-06-13 01:25:17] [INFO ] [Real]Absence check using 78 positive and 43 generalized place invariants in 18 ms returned sat
[2022-06-13 01:25:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:25:18] [INFO ] [Real]Absence check using state equation in 457 ms returned sat
[2022-06-13 01:25:18] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:25:18] [INFO ] [Nat]Absence check using 78 positive place invariants in 26 ms returned unsat
[2022-06-13 01:25:18] [INFO ] [Real]Absence check using 78 positive place invariants in 32 ms returned sat
[2022-06-13 01:25:18] [INFO ] [Real]Absence check using 78 positive and 43 generalized place invariants in 17 ms returned sat
[2022-06-13 01:25:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:25:18] [INFO ] [Real]Absence check using state equation in 518 ms returned sat
[2022-06-13 01:25:18] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:25:19] [INFO ] [Nat]Absence check using 78 positive place invariants in 32 ms returned sat
[2022-06-13 01:25:19] [INFO ] [Nat]Absence check using 78 positive and 43 generalized place invariants in 16 ms returned sat
[2022-06-13 01:25:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-13 01:25:19] [INFO ] [Nat]Absence check using state equation in 537 ms returned sat
[2022-06-13 01:25:19] [INFO ] Deduced a trap composed of 11 places in 94 ms of which 0 ms to minimize.
[2022-06-13 01:25:19] [INFO ] Deduced a trap composed of 30 places in 91 ms of which 0 ms to minimize.
[2022-06-13 01:25:19] [INFO ] Deduced a trap composed of 8 places in 91 ms of which 0 ms to minimize.
[2022-06-13 01:25:20] [INFO ] Deduced a trap composed of 62 places in 84 ms of which 0 ms to minimize.
[2022-06-13 01:25:20] [INFO ] Deduced a trap composed of 47 places in 90 ms of which 0 ms to minimize.
[2022-06-13 01:25:20] [INFO ] Deduced a trap composed of 47 places in 88 ms of which 0 ms to minimize.
[2022-06-13 01:25:20] [INFO ] Deduced a trap composed of 17 places in 92 ms of which 0 ms to minimize.
[2022-06-13 01:25:20] [INFO ] Deduced a trap composed of 76 places in 91 ms of which 0 ms to minimize.
[2022-06-13 01:25:20] [INFO ] Deduced a trap composed of 54 places in 104 ms of which 0 ms to minimize.
[2022-06-13 01:25:20] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 0 ms to minimize.
[2022-06-13 01:25:20] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 1 ms to minimize.
[2022-06-13 01:25:20] [INFO ] Deduced a trap composed of 31 places in 54 ms of which 0 ms to minimize.
[2022-06-13 01:25:21] [INFO ] Deduced a trap composed of 40 places in 66 ms of which 1 ms to minimize.
[2022-06-13 01:25:21] [INFO ] Deduced a trap composed of 46 places in 47 ms of which 1 ms to minimize.
[2022-06-13 01:25:21] [INFO ] Deduced a trap composed of 43 places in 52 ms of which 0 ms to minimize.
[2022-06-13 01:25:21] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 1697 ms
[2022-06-13 01:25:21] [INFO ] Computed and/alt/rep : 600/951/600 causal constraints (skipped 37 transitions) in 49 ms.
[2022-06-13 01:25:24] [INFO ] Deduced a trap composed of 11 places in 213 ms of which 1 ms to minimize.
[2022-06-13 01:25:24] [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 7
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-11 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-02 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-01 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 8 Parikh solutions to 2 different solutions.
Incomplete Parikh walk after 43100 steps, including 266 resets, run finished after 117 ms. (steps per millisecond=368 ) properties (out of 5) seen :0 could not realise parikh vector
Support contains 48 out of 719 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 719/719 places, 638/638 transitions.
Graph (complete) has 1418 edges and 719 vertex of which 692 are kept as prefixes of interest. Removing 27 places using SCC suffix rule.4 ms
Discarding 27 places :
Also discarding 13 output transitions
Drop transitions removed 13 transitions
Drop transitions removed 99 transitions
Trivial Post-agglo rules discarded 99 transitions
Performed 99 trivial Post agglomeration. Transition count delta: 99
Iterating post reduction 0 with 99 rules applied. Total rules applied 100 place count 692 transition count 526
Reduce places removed 99 places and 0 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Iterating post reduction 1 with 110 rules applied. Total rules applied 210 place count 593 transition count 515
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 221 place count 582 transition count 515
Performed 135 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 135 Pre rules applied. Total rules applied 221 place count 582 transition count 380
Deduced a syphon composed of 135 places in 3 ms
Ensure Unique test removed 18 places
Reduce places removed 153 places and 0 transitions.
Iterating global reduction 3 with 288 rules applied. Total rules applied 509 place count 429 transition count 380
Discarding 81 places :
Symmetric choice reduction at 3 with 81 rule applications. Total rules 590 place count 348 transition count 299
Iterating global reduction 3 with 81 rules applied. Total rules applied 671 place count 348 transition count 299
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 671 place count 348 transition count 293
Deduced a syphon composed of 6 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 685 place count 340 transition count 293
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: 89
Deduced a syphon composed of 89 places in 1 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 3 with 178 rules applied. Total rules applied 863 place count 251 transition count 204
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 867 place count 249 transition count 210
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 871 place count 249 transition count 210
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 872 place count 248 transition count 209
Applied a total of 872 rules in 177 ms. Remains 248 /719 variables (removed 471) and now considering 209/638 (removed 429) transitions.
Finished structural reductions, in 1 iterations. Remains : 248/719 places, 209/638 transitions.
[2022-06-13 01:25:24] [INFO ] Flatten gal took : 102 ms
[2022-06-13 01:25:24] [INFO ] Flatten gal took : 20 ms
[2022-06-13 01:25:24] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1147000273849384967.gal : 19 ms
[2022-06-13 01:25:24] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5060855210192974367.prop : 3 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/ReachabilityCardinality1147000273849384967.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality5060855210192974367.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/ReachabilityCardinality1147000273849384967.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality5060855210192974367.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality5060855210192974367.prop.
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :3 after 6
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :6 after 30
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :30 after 51
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :51 after 83
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :83 after 132
SDD proceeding with computation,5 properties remain. new max is 256
SDD size :132 after 398
SDD proceeding with computation,5 properties remain. new max is 512
SDD size :398 after 5266
SDD proceeding with computation,5 properties remain. new max is 1024
SDD size :5266 after 93312
SDD proceeding with computation,5 properties remain. new max is 2048
SDD size :93312 after 1.00482e+07
Invariant property BusinessProcesses-PT-20-ReachabilityFireability-14 does not hold.
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :1.00482e+07 after 1.53426e+07
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :1.53426e+07 after 1.72326e+07
SDD proceeding with computation,4 properties remain. new max is 8192
SDD size :1.72326e+07 after 1.36624e+08
Detected timeout of ITS tools.
[2022-06-13 01:25:39] [INFO ] Flatten gal took : 25 ms
[2022-06-13 01:25:39] [INFO ] Applying decomposition
[2022-06-13 01:25:39] [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/graph18081496614702799611.txt, -o, /tmp/graph18081496614702799611.bin, -w, /tmp/graph18081496614702799611.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/graph18081496614702799611.bin, -l, -1, -v, -w, /tmp/graph18081496614702799611.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-13 01:25:40] [INFO ] Decomposing Gal with order
[2022-06-13 01:25:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-13 01:25:40] [INFO ] Removed a total of 230 redundant transitions.
[2022-06-13 01:25:40] [INFO ] Flatten gal took : 95 ms
[2022-06-13 01:25:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 45 labels/synchronizations in 36 ms.
[2022-06-13 01:25:40] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12935284072451338892.gal : 18 ms
[2022-06-13 01:25:40] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16442333676390983419.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/ReachabilityCardinality12935284072451338892.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality16442333676390983419.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/ReachabilityCardinality12935284072451338892.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality16442333676390983419.prop --nowitness
Loading property file /tmp/ReachabilityCardinality16442333676390983419.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :2 after 5
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :5 after 6
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :6 after 10020
Invariant property BusinessProcesses-PT-20-ReachabilityFireability-10 does not hold.
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Reachability property BusinessProcesses-PT-20-ReachabilityFireability-04 is true.
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Reachability property BusinessProcesses-PT-20-ReachabilityFireability-03 is true.
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Invariant property BusinessProcesses-PT-20-ReachabilityFireability-00 does not hold.
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 33 fixpoint passes
Detected timeout of ITS tools.
All properties solved without resorting to model-checking.
BK_STOP 1655083556372
--------------------
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-20"
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-20, 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-165251936200180"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-20.tgz
mv BusinessProcesses-PT-20 execution
cd execution
if [ "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 '
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 ;