fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r028-tall-165251936100150
Last Updated
Jun 22, 2022

About the Execution of 2021-gold for BusinessProcesses-PT-10

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
292.575 26693.00 40752.00 996.80 TFTTTTFFFTFTTTFF 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-165251936100150.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-10, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r028-tall-165251936100150
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 552K
-rw-r--r-- 1 mcc users 5.5K Apr 30 00:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 57K Apr 30 00:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.3K Apr 30 00:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 34K Apr 30 00:02 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 4.0K May 9 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 9 07:09 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 07:09 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 07:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 30 00:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 158K Apr 30 00:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Apr 30 00:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 31K Apr 30 00:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 07:09 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 3 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 131K 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-10-ReachabilityFireability-00
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityFireability-01
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityFireability-02
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityFireability-03
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityFireability-04
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityFireability-05
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityFireability-06
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityFireability-07
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityFireability-08
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityFireability-09
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityFireability-10
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityFireability-11
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityFireability-12
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityFireability-13
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityFireability-14
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1655083139913

Running Version 0
[2022-06-13 01:19:02] [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:19:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-13 01:19:02] [INFO ] Load time of PNML (sax parser for PT used): 79 ms
[2022-06-13 01:19:02] [INFO ] Transformed 518 places.
[2022-06-13 01:19:02] [INFO ] Transformed 471 transitions.
[2022-06-13 01:19:02] [INFO ] Found NUPN structural information;
[2022-06-13 01:19:02] [INFO ] Parsed PT model containing 518 places and 471 transitions in 125 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 20 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 83 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 16) seen :7
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 9) seen :3
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 6) seen :1
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 471 rows 518 cols
[2022-06-13 01:19:02] [INFO ] Computed 85 place invariants in 33 ms
[2022-06-13 01:19:02] [INFO ] [Real]Absence check using 48 positive place invariants in 29 ms returned sat
[2022-06-13 01:19:03] [INFO ] [Real]Absence check using 48 positive and 37 generalized place invariants in 12 ms returned sat
[2022-06-13 01:19:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:19:03] [INFO ] [Real]Absence check using state equation in 156 ms returned sat
[2022-06-13 01:19:03] [INFO ] Deduced a trap composed of 8 places in 212 ms of which 6 ms to minimize.
[2022-06-13 01:19:03] [INFO ] Deduced a trap composed of 13 places in 153 ms of which 1 ms to minimize.
[2022-06-13 01:19:03] [INFO ] Deduced a trap composed of 29 places in 140 ms of which 1 ms to minimize.
[2022-06-13 01:19:03] [INFO ] Deduced a trap composed of 114 places in 130 ms of which 2 ms to minimize.
[2022-06-13 01:19:04] [INFO ] Deduced a trap composed of 40 places in 139 ms of which 1 ms to minimize.
[2022-06-13 01:19:04] [INFO ] Deduced a trap composed of 114 places in 125 ms of which 0 ms to minimize.
[2022-06-13 01:19:04] [INFO ] Deduced a trap composed of 16 places in 131 ms of which 0 ms to minimize.
[2022-06-13 01:19:04] [INFO ] Deduced a trap composed of 24 places in 150 ms of which 1 ms to minimize.
[2022-06-13 01:19:04] [INFO ] Deduced a trap composed of 129 places in 144 ms of which 1 ms to minimize.
[2022-06-13 01:19:04] [INFO ] Deduced a trap composed of 130 places in 119 ms of which 1 ms to minimize.
[2022-06-13 01:19:05] [INFO ] Deduced a trap composed of 128 places in 153 ms of which 5 ms to minimize.
[2022-06-13 01:19:05] [INFO ] Deduced a trap composed of 21 places in 141 ms of which 0 ms to minimize.
[2022-06-13 01:19:05] [INFO ] Deduced a trap composed of 17 places in 113 ms of which 1 ms to minimize.
[2022-06-13 01:19:05] [INFO ] Deduced a trap composed of 38 places in 116 ms of which 0 ms to minimize.
[2022-06-13 01:19:05] [INFO ] Deduced a trap composed of 22 places in 130 ms of which 1 ms to minimize.
[2022-06-13 01:19:05] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
[2022-06-13 01:19:05] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 0 ms to minimize.
[2022-06-13 01:19:05] [INFO ] Deduced a trap composed of 31 places in 35 ms of which 0 ms to minimize.
[2022-06-13 01:19:05] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 1 ms to minimize.
[2022-06-13 01:19:06] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 0 ms to minimize.
[2022-06-13 01:19:06] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 2810 ms
[2022-06-13 01:19:06] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:19:06] [INFO ] [Nat]Absence check using 48 positive place invariants in 20 ms returned sat
[2022-06-13 01:19:06] [INFO ] [Nat]Absence check using 48 positive and 37 generalized place invariants in 9 ms returned sat
[2022-06-13 01:19:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-13 01:19:06] [INFO ] [Nat]Absence check using state equation in 132 ms returned sat
[2022-06-13 01:19:06] [INFO ] Deduced a trap composed of 8 places in 116 ms of which 1 ms to minimize.
[2022-06-13 01:19:06] [INFO ] Deduced a trap composed of 13 places in 115 ms of which 1 ms to minimize.
[2022-06-13 01:19:06] [INFO ] Deduced a trap composed of 29 places in 114 ms of which 0 ms to minimize.
[2022-06-13 01:19:06] [INFO ] Deduced a trap composed of 114 places in 118 ms of which 0 ms to minimize.
[2022-06-13 01:19:06] [INFO ] Deduced a trap composed of 40 places in 120 ms of which 1 ms to minimize.
[2022-06-13 01:19:07] [INFO ] Deduced a trap composed of 108 places in 112 ms of which 0 ms to minimize.
[2022-06-13 01:19:07] [INFO ] Deduced a trap composed of 19 places in 110 ms of which 0 ms to minimize.
[2022-06-13 01:19:07] [INFO ] Deduced a trap composed of 112 places in 108 ms of which 0 ms to minimize.
[2022-06-13 01:19:07] [INFO ] Deduced a trap composed of 24 places in 120 ms of which 0 ms to minimize.
[2022-06-13 01:19:07] [INFO ] Deduced a trap composed of 113 places in 123 ms of which 1 ms to minimize.
[2022-06-13 01:19:07] [INFO ] Deduced a trap composed of 121 places in 120 ms of which 0 ms to minimize.
[2022-06-13 01:19:07] [INFO ] Deduced a trap composed of 18 places in 119 ms of which 0 ms to minimize.
[2022-06-13 01:19:08] [INFO ] Deduced a trap composed of 110 places in 116 ms of which 0 ms to minimize.
[2022-06-13 01:19:08] [INFO ] Deduced a trap composed of 18 places in 106 ms of which 1 ms to minimize.
[2022-06-13 01:19:08] [INFO ] Deduced a trap composed of 108 places in 122 ms of which 4 ms to minimize.
[2022-06-13 01:19:08] [INFO ] Deduced a trap composed of 23 places in 115 ms of which 0 ms to minimize.
[2022-06-13 01:19:08] [INFO ] Deduced a trap composed of 116 places in 110 ms of which 0 ms to minimize.
[2022-06-13 01:19:08] [INFO ] Deduced a trap composed of 124 places in 125 ms of which 0 ms to minimize.
[2022-06-13 01:19:08] [INFO ] Deduced a trap composed of 18 places in 119 ms of which 1 ms to minimize.
[2022-06-13 01:19:09] [INFO ] Deduced a trap composed of 107 places in 119 ms of which 2 ms to minimize.
[2022-06-13 01:19:09] [INFO ] Deduced a trap composed of 113 places in 121 ms of which 0 ms to minimize.
[2022-06-13 01:19:09] [INFO ] Deduced a trap composed of 115 places in 118 ms of which 1 ms to minimize.
[2022-06-13 01:19:09] [INFO ] Deduced a trap composed of 114 places in 121 ms of which 1 ms to minimize.
[2022-06-13 01:19:09] [INFO ] Deduced a trap composed of 129 places in 122 ms of which 1 ms to minimize.
[2022-06-13 01:19:09] [INFO ] Deduced a trap composed of 122 places in 117 ms of which 0 ms to minimize.
[2022-06-13 01:19:09] [INFO ] Deduced a trap composed of 115 places in 121 ms of which 1 ms to minimize.
[2022-06-13 01:19:10] [INFO ] Deduced a trap composed of 113 places in 119 ms of which 1 ms to minimize.
[2022-06-13 01:19:10] [INFO ] Deduced a trap composed of 111 places in 116 ms of which 1 ms to minimize.
[2022-06-13 01:19:10] [INFO ] Deduced a trap composed of 113 places in 115 ms of which 1 ms to minimize.
[2022-06-13 01:19:10] [INFO ] Deduced a trap composed of 111 places in 106 ms of which 0 ms to minimize.
[2022-06-13 01:19:10] [INFO ] Deduced a trap composed of 16 places in 111 ms of which 0 ms to minimize.
[2022-06-13 01:19:10] [INFO ] Deduced a trap composed of 14 places in 106 ms of which 1 ms to minimize.
[2022-06-13 01:19:11] [INFO ] Deduced a trap composed of 41 places in 100 ms of which 0 ms to minimize.
[2022-06-13 01:19:11] [INFO ] Deduced a trap composed of 12 places in 147 ms of which 0 ms to minimize.
[2022-06-13 01:19: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 0
[2022-06-13 01:19:11] [INFO ] [Real]Absence check using 48 positive place invariants in 21 ms returned sat
[2022-06-13 01:19:11] [INFO ] [Real]Absence check using 48 positive and 37 generalized place invariants in 15 ms returned sat
[2022-06-13 01:19:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:19:11] [INFO ] [Real]Absence check using state equation in 671 ms returned sat
[2022-06-13 01:19:12] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:19:12] [INFO ] [Nat]Absence check using 48 positive place invariants in 17 ms returned unsat
[2022-06-13 01:19:12] [INFO ] [Real]Absence check using 48 positive place invariants in 22 ms returned sat
[2022-06-13 01:19:12] [INFO ] [Real]Absence check using 48 positive and 37 generalized place invariants in 18 ms returned sat
[2022-06-13 01:19:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:19:12] [INFO ] [Real]Absence check using state equation in 569 ms returned sat
[2022-06-13 01:19:12] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:19:12] [INFO ] [Nat]Absence check using 48 positive place invariants in 24 ms returned sat
[2022-06-13 01:19:12] [INFO ] [Nat]Absence check using 48 positive and 37 generalized place invariants in 22 ms returned sat
[2022-06-13 01:19:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-13 01:19:13] [INFO ] [Nat]Absence check using state equation in 378 ms returned sat
[2022-06-13 01:19:13] [INFO ] Deduced a trap composed of 112 places in 113 ms of which 1 ms to minimize.
[2022-06-13 01:19:13] [INFO ] Deduced a trap composed of 125 places in 109 ms of which 0 ms to minimize.
[2022-06-13 01:19:13] [INFO ] Deduced a trap composed of 8 places in 110 ms of which 1 ms to minimize.
[2022-06-13 01:19:13] [INFO ] Deduced a trap composed of 125 places in 107 ms of which 1 ms to minimize.
[2022-06-13 01:19:14] [INFO ] Deduced a trap composed of 37 places in 108 ms of which 1 ms to minimize.
[2022-06-13 01:19:14] [INFO ] Deduced a trap composed of 115 places in 111 ms of which 0 ms to minimize.
[2022-06-13 01:19:14] [INFO ] Deduced a trap composed of 128 places in 110 ms of which 1 ms to minimize.
[2022-06-13 01:19:14] [INFO ] Deduced a trap composed of 134 places in 127 ms of which 0 ms to minimize.
[2022-06-13 01:19:14] [INFO ] Deduced a trap composed of 111 places in 103 ms of which 1 ms to minimize.
[2022-06-13 01:19:14] [INFO ] Deduced a trap composed of 13 places in 107 ms of which 0 ms to minimize.
[2022-06-13 01:19:14] [INFO ] Deduced a trap composed of 139 places in 111 ms of which 0 ms to minimize.
[2022-06-13 01:19:15] [INFO ] Deduced a trap composed of 116 places in 103 ms of which 0 ms to minimize.
[2022-06-13 01:19:15] [INFO ] Deduced a trap composed of 128 places in 100 ms of which 0 ms to minimize.
[2022-06-13 01:19:15] [INFO ] Deduced a trap composed of 130 places in 110 ms of which 1 ms to minimize.
[2022-06-13 01:19:15] [INFO ] Deduced a trap composed of 32 places in 112 ms of which 0 ms to minimize.
[2022-06-13 01:19:15] [INFO ] Deduced a trap composed of 115 places in 108 ms of which 1 ms to minimize.
[2022-06-13 01:19:15] [INFO ] Deduced a trap composed of 121 places in 104 ms of which 0 ms to minimize.
[2022-06-13 01:19:15] [INFO ] Deduced a trap composed of 113 places in 103 ms of which 0 ms to minimize.
[2022-06-13 01:19:16] [INFO ] Deduced a trap composed of 47 places in 112 ms of which 0 ms to minimize.
[2022-06-13 01:19:16] [INFO ] Deduced a trap composed of 123 places in 109 ms of which 0 ms to minimize.
[2022-06-13 01:19:16] [INFO ] Deduced a trap composed of 34 places in 100 ms of which 1 ms to minimize.
[2022-06-13 01:19:16] [INFO ] Deduced a trap composed of 124 places in 94 ms of which 1 ms to minimize.
[2022-06-13 01:19:16] [INFO ] Deduced a trap composed of 110 places in 100 ms of which 1 ms to minimize.
[2022-06-13 01:19:16] [INFO ] Deduced a trap composed of 124 places in 100 ms of which 1 ms to minimize.
[2022-06-13 01:19:16] [INFO ] Deduced a trap composed of 109 places in 100 ms of which 0 ms to minimize.
[2022-06-13 01:19:16] [INFO ] Deduced a trap composed of 33 places in 115 ms of which 10 ms to minimize.
[2022-06-13 01:19:17] [INFO ] Deduced a trap composed of 122 places in 106 ms of which 1 ms to minimize.
[2022-06-13 01:19:17] [INFO ] Deduced a trap composed of 113 places in 102 ms of which 0 ms to minimize.
[2022-06-13 01:19:17] [INFO ] Deduced a trap composed of 111 places in 99 ms of which 0 ms to minimize.
[2022-06-13 01:19:17] [INFO ] Deduced a trap composed of 9 places in 99 ms of which 1 ms to minimize.
[2022-06-13 01:19:17] [INFO ] Deduced a trap composed of 118 places in 110 ms of which 0 ms to minimize.
[2022-06-13 01:19:17] [INFO ] Deduced a trap composed of 115 places in 100 ms of which 1 ms to minimize.
[2022-06-13 01:19:17] [INFO ] Deduced a trap composed of 110 places in 99 ms of which 0 ms to minimize.
[2022-06-13 01:19:17] [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:19:18] [INFO ] [Real]Absence check using 48 positive place invariants in 21 ms returned sat
[2022-06-13 01:19:18] [INFO ] [Real]Absence check using 48 positive and 37 generalized place invariants in 12 ms returned sat
[2022-06-13 01:19:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:19:18] [INFO ] [Real]Absence check using state equation in 162 ms returned sat
[2022-06-13 01:19:18] [INFO ] Deduced a trap composed of 8 places in 133 ms of which 0 ms to minimize.
[2022-06-13 01:19:18] [INFO ] Deduced a trap composed of 36 places in 137 ms of which 0 ms to minimize.
[2022-06-13 01:19:18] [INFO ] Deduced a trap composed of 12 places in 125 ms of which 0 ms to minimize.
[2022-06-13 01:19:18] [INFO ] Deduced a trap composed of 35 places in 123 ms of which 1 ms to minimize.
[2022-06-13 01:19:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 4 trap constraints in 603 ms
[2022-06-13 01:19:18] [INFO ] [Real]Absence check using 48 positive place invariants in 24 ms returned sat
[2022-06-13 01:19:18] [INFO ] [Real]Absence check using 48 positive and 37 generalized place invariants in 17 ms returned sat
[2022-06-13 01:19:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:19:19] [INFO ] [Real]Absence check using state equation in 423 ms returned sat
[2022-06-13 01:19:19] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:19:19] [INFO ] [Nat]Absence check using 48 positive place invariants in 21 ms returned sat
[2022-06-13 01:19:19] [INFO ] [Nat]Absence check using 48 positive and 37 generalized place invariants in 15 ms returned sat
[2022-06-13 01:19:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-13 01:19:19] [INFO ] [Nat]Absence check using state equation in 308 ms returned sat
[2022-06-13 01:19:19] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 0 ms to minimize.
[2022-06-13 01:19:19] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 0 ms to minimize.
[2022-06-13 01:19:20] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 0 ms to minimize.
[2022-06-13 01:19:20] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 1 ms to minimize.
[2022-06-13 01:19:20] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 0 ms to minimize.
[2022-06-13 01:19:20] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 0 ms to minimize.
[2022-06-13 01:19:20] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 1 ms to minimize.
[2022-06-13 01:19:20] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 1 ms to minimize.
[2022-06-13 01:19:20] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 643 ms
[2022-06-13 01:19:20] [INFO ] Computed and/alt/rep : 442/759/442 causal constraints (skipped 28 transitions) in 29 ms.
[2022-06-13 01:19:22] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 0 ms to minimize.
[2022-06-13 01:19:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 97 ms
[2022-06-13 01:19:22] [INFO ] Added : 277 causal constraints over 56 iterations in 2173 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 9 ms.
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-10 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-05 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 5 Parikh solutions to 2 different solutions.
Incomplete Parikh walk after 26000 steps, including 240 resets, run finished after 66 ms. (steps per millisecond=393 ) properties (out of 3) seen :0 could not realise parikh vector
Support contains 36 out of 518 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 518/518 places, 471/471 transitions.
Graph (complete) has 1071 edges and 518 vertex of which 516 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 65 transitions
Trivial Post-agglo rules discarded 65 transitions
Performed 65 trivial Post agglomeration. Transition count delta: 65
Iterating post reduction 0 with 65 rules applied. Total rules applied 66 place count 516 transition count 405
Reduce places removed 65 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 70 rules applied. Total rules applied 136 place count 451 transition count 400
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 141 place count 446 transition count 400
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 100 Pre rules applied. Total rules applied 141 place count 446 transition count 300
Deduced a syphon composed of 100 places in 1 ms
Ensure Unique test removed 10 places
Reduce places removed 110 places and 0 transitions.
Iterating global reduction 3 with 210 rules applied. Total rules applied 351 place count 336 transition count 300
Discarding 59 places :
Symmetric choice reduction at 3 with 59 rule applications. Total rules 410 place count 277 transition count 241
Iterating global reduction 3 with 59 rules applied. Total rules applied 469 place count 277 transition count 241
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 469 place count 277 transition count 236
Deduced a syphon composed of 5 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 11 rules applied. Total rules applied 480 place count 271 transition count 236
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 70
Deduced a syphon composed of 70 places in 1 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 3 with 140 rules applied. Total rules applied 620 place count 201 transition count 166
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 621 place count 201 transition count 165
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 623 place count 200 transition count 168
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 628 place count 200 transition count 168
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 629 place count 199 transition count 167
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 630 place count 198 transition count 167
Applied a total of 630 rules in 130 ms. Remains 198 /518 variables (removed 320) and now considering 167/471 (removed 304) transitions.
Finished structural reductions, in 1 iterations. Remains : 198/518 places, 167/471 transitions.
[2022-06-13 01:19:23] [INFO ] Flatten gal took : 59 ms
[2022-06-13 01:19:23] [INFO ] Flatten gal took : 23 ms
[2022-06-13 01:19:23] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2627193484986652937.gal : 12 ms
[2022-06-13 01:19:23] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1007287656928514374.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/ReachabilityCardinality2627193484986652937.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality1007287656928514374.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/ReachabilityCardinality2627193484986652937.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality1007287656928514374.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality1007287656928514374.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :3 after 7
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :7 after 11
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :11 after 13
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :13 after 39
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :39 after 3800
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :3800 after 5348
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :5348 after 23784
Reachability property BusinessProcesses-PT-10-ReachabilityFireability-04 is true.
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :23784 after 29864
Invariant property BusinessProcesses-PT-10-ReachabilityFireability-08 does not hold.
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :29864 after 38118
Invariant property BusinessProcesses-PT-10-ReachabilityFireability-15 does not hold.
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-15 FALSE 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,42120,0.605678,19280,2,13049,18,53235,6,0,959,25954,0
Total reachable state count : 42120

Verifying 3 reachability properties.
Reachability property BusinessProcesses-PT-10-ReachabilityFireability-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-10-ReachabilityFireability-04,2,0.608418,19280,2,201,18,53235,7,0,962,25954,0
Invariant property BusinessProcesses-PT-10-ReachabilityFireability-08 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-10-ReachabilityFireability-08,6,0.644737,19544,2,235,18,53235,8,0,1011,25954,0
Invariant property BusinessProcesses-PT-10-ReachabilityFireability-15 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-10-ReachabilityFireability-15,48,0.863909,19544,2,730,18,53235,9,0,1050,25954,0
All properties solved without resorting to model-checking.

BK_STOP 1655083166606

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

tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-10.tgz
mv BusinessProcesses-PT-10 execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;