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.r234-tall-165286038500498.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 ShieldRVs-PT-010B, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r234-tall-165286038500498
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 336K
-rw-r--r-- 1 mcc users 6.6K Apr 30 06:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Apr 30 06:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Apr 30 06:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Apr 30 06:50 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.5K May 9 08:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 9 08:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 9 08:58 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 9 08:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:58 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:58 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 122K May 10 09:34 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME StableMarking

=== Now, execution of the tool begins

BK_START 1653037147087

Running Version 0
[2022-05-20 08:59:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -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, 1800]
[2022-05-20 08:59:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 08:59:08] [INFO ] Load time of PNML (sax parser for PT used): 144 ms
[2022-05-20 08:59:08] [INFO ] Transformed 403 places.
[2022-05-20 08:59:08] [INFO ] Transformed 453 transitions.
[2022-05-20 08:59:08] [INFO ] Found NUPN structural information;
[2022-05-20 08:59:08] [INFO ] Parsed PT model containing 403 places and 453 transitions in 188 ms.
Structural test allowed to assert that 191 places are NOT stable. Took 10 ms.
Incomplete random walk after 10000 steps, including 22 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 212) seen :204
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 453 rows 403 cols
[2022-05-20 08:59:09] [INFO ] Computed 41 place invariants in 17 ms
[2022-05-20 08:59:09] [INFO ] [Real]Absence check using 41 positive place invariants in 14 ms returned sat
[2022-05-20 08:59:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 08:59:09] [INFO ] [Real]Absence check using state equation in 123 ms returned sat
[2022-05-20 08:59:09] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 08:59:09] [INFO ] [Nat]Absence check using 41 positive place invariants in 17 ms returned sat
[2022-05-20 08:59:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 08:59:09] [INFO ] [Nat]Absence check using state equation in 126 ms returned sat
[2022-05-20 08:59:09] [INFO ] Deduced a trap composed of 78 places in 123 ms of which 2 ms to minimize.
[2022-05-20 08:59:10] [INFO ] Deduced a trap composed of 20 places in 103 ms of which 2 ms to minimize.
[2022-05-20 08:59:10] [INFO ] Deduced a trap composed of 31 places in 86 ms of which 1 ms to minimize.
[2022-05-20 08:59:10] [INFO ] Deduced a trap composed of 26 places in 82 ms of which 1 ms to minimize.
[2022-05-20 08:59:10] [INFO ] Deduced a trap composed of 26 places in 83 ms of which 1 ms to minimize.
[2022-05-20 08:59:10] [INFO ] Deduced a trap composed of 20 places in 77 ms of which 0 ms to minimize.
[2022-05-20 08:59:10] [INFO ] Deduced a trap composed of 25 places in 75 ms of which 1 ms to minimize.
[2022-05-20 08:59:10] [INFO ] Deduced a trap composed of 30 places in 78 ms of which 1 ms to minimize.
[2022-05-20 08:59:10] [INFO ] Deduced a trap composed of 25 places in 68 ms of which 0 ms to minimize.
[2022-05-20 08:59:10] [INFO ] Deduced a trap composed of 37 places in 66 ms of which 0 ms to minimize.
[2022-05-20 08:59:10] [INFO ] Deduced a trap composed of 19 places in 76 ms of which 0 ms to minimize.
[2022-05-20 08:59:10] [INFO ] Deduced a trap composed of 40 places in 90 ms of which 0 ms to minimize.
[2022-05-20 08:59:11] [INFO ] Deduced a trap composed of 41 places in 64 ms of which 1 ms to minimize.
[2022-05-20 08:59:11] [INFO ] Deduced a trap composed of 26 places in 71 ms of which 1 ms to minimize.
[2022-05-20 08:59:11] [INFO ] Deduced a trap composed of 49 places in 46 ms of which 1 ms to minimize.
[2022-05-20 08:59:11] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 0 ms to minimize.
[2022-05-20 08:59:11] [INFO ] Deduced a trap composed of 42 places in 41 ms of which 0 ms to minimize.
[2022-05-20 08:59:11] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 1595 ms
[2022-05-20 08:59:11] [INFO ] Computed and/alt/rep : 452/1319/452 causal constraints (skipped 0 transitions) in 35 ms.
[2022-05-20 08:59:14] [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-05-20 08:59:14] [INFO ] [Real]Absence check using 41 positive place invariants in 21 ms returned sat
[2022-05-20 08:59:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 08:59:14] [INFO ] [Real]Absence check using state equation in 116 ms returned sat
[2022-05-20 08:59:14] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 08:59:14] [INFO ] [Nat]Absence check using 41 positive place invariants in 13 ms returned sat
[2022-05-20 08:59:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 08:59:14] [INFO ] [Nat]Absence check using state equation in 114 ms returned sat
[2022-05-20 08:59:15] [INFO ] Deduced a trap composed of 23 places in 96 ms of which 1 ms to minimize.
[2022-05-20 08:59:15] [INFO ] Deduced a trap composed of 20 places in 88 ms of which 0 ms to minimize.
[2022-05-20 08:59:15] [INFO ] Deduced a trap composed of 20 places in 73 ms of which 1 ms to minimize.
[2022-05-20 08:59:15] [INFO ] Deduced a trap composed of 25 places in 77 ms of which 0 ms to minimize.
[2022-05-20 08:59:15] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 0 ms to minimize.
[2022-05-20 08:59:15] [INFO ] Deduced a trap composed of 25 places in 73 ms of which 0 ms to minimize.
[2022-05-20 08:59:15] [INFO ] Deduced a trap composed of 30 places in 70 ms of which 0 ms to minimize.
[2022-05-20 08:59:15] [INFO ] Deduced a trap composed of 27 places in 61 ms of which 1 ms to minimize.
[2022-05-20 08:59:15] [INFO ] Deduced a trap composed of 48 places in 70 ms of which 1 ms to minimize.
[2022-05-20 08:59:15] [INFO ] Deduced a trap composed of 29 places in 67 ms of which 1 ms to minimize.
[2022-05-20 08:59:15] [INFO ] Deduced a trap composed of 29 places in 71 ms of which 1 ms to minimize.
[2022-05-20 08:59:16] [INFO ] Deduced a trap composed of 41 places in 74 ms of which 0 ms to minimize.
[2022-05-20 08:59:16] [INFO ] Deduced a trap composed of 20 places in 97 ms of which 0 ms to minimize.
[2022-05-20 08:59:16] [INFO ] Deduced a trap composed of 22 places in 75 ms of which 0 ms to minimize.
[2022-05-20 08:59:16] [INFO ] Deduced a trap composed of 28 places in 90 ms of which 1 ms to minimize.
[2022-05-20 08:59:16] [INFO ] Deduced a trap composed of 19 places in 79 ms of which 0 ms to minimize.
[2022-05-20 08:59:16] [INFO ] Deduced a trap composed of 26 places in 76 ms of which 1 ms to minimize.
[2022-05-20 08:59:16] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 0 ms to minimize.
[2022-05-20 08:59:16] [INFO ] Deduced a trap composed of 43 places in 76 ms of which 0 ms to minimize.
[2022-05-20 08:59:16] [INFO ] Deduced a trap composed of 32 places in 68 ms of which 0 ms to minimize.
[2022-05-20 08:59:16] [INFO ] Deduced a trap composed of 31 places in 69 ms of which 0 ms to minimize.
[2022-05-20 08:59:17] [INFO ] Deduced a trap composed of 37 places in 69 ms of which 1 ms to minimize.
[2022-05-20 08:59:17] [INFO ] Deduced a trap composed of 40 places in 69 ms of which 0 ms to minimize.
[2022-05-20 08:59:17] [INFO ] Deduced a trap composed of 28 places in 74 ms of which 1 ms to minimize.
[2022-05-20 08:59:17] [INFO ] Deduced a trap composed of 26 places in 88 ms of which 0 ms to minimize.
[2022-05-20 08:59:17] [INFO ] Deduced a trap composed of 17 places in 88 ms of which 0 ms to minimize.
[2022-05-20 08:59:17] [INFO ] Deduced a trap composed of 31 places in 83 ms of which 0 ms to minimize.
[2022-05-20 08:59:17] [INFO ] Deduced a trap composed of 29 places in 123 ms of which 0 ms to minimize.
[2022-05-20 08:59:17] [INFO ] Deduced a trap composed of 21 places in 86 ms of which 0 ms to minimize.
[2022-05-20 08:59:17] [INFO ] Deduced a trap composed of 26 places in 80 ms of which 1 ms to minimize.
[2022-05-20 08:59:18] [INFO ] Deduced a trap composed of 39 places in 80 ms of which 1 ms to minimize.
[2022-05-20 08:59:18] [INFO ] Deduced a trap composed of 16 places in 79 ms of which 0 ms to minimize.
[2022-05-20 08:59:18] [INFO ] Deduced a trap composed of 30 places in 77 ms of which 0 ms to minimize.
[2022-05-20 08:59:18] [INFO ] Deduced a trap composed of 29 places in 75 ms of which 0 ms to minimize.
[2022-05-20 08:59:18] [INFO ] Deduced a trap composed of 42 places in 74 ms of which 1 ms to minimize.
[2022-05-20 08:59:18] [INFO ] Deduced a trap composed of 40 places in 78 ms of which 0 ms to minimize.
[2022-05-20 08:59:18] [INFO ] Deduced a trap composed of 25 places in 70 ms of which 1 ms to minimize.
[2022-05-20 08:59:18] [INFO ] Deduced a trap composed of 29 places in 66 ms of which 0 ms to minimize.
[2022-05-20 08:59:18] [INFO ] Deduced a trap composed of 32 places in 73 ms of which 0 ms to minimize.
[2022-05-20 08:59:18] [INFO ] Deduced a trap composed of 33 places in 80 ms of which 8 ms to minimize.
[2022-05-20 08:59:18] [INFO ] Deduced a trap composed of 35 places in 71 ms of which 0 ms to minimize.
[2022-05-20 08:59:19] [INFO ] Deduced a trap composed of 32 places in 68 ms of which 1 ms to minimize.
[2022-05-20 08:59:19] [INFO ] Deduced a trap composed of 37 places in 72 ms of which 0 ms to minimize.
[2022-05-20 08:59:19] [INFO ] Deduced a trap composed of 25 places in 71 ms of which 1 ms to minimize.
[2022-05-20 08:59:19] [INFO ] Deduced a trap composed of 47 places in 66 ms of which 0 ms to minimize.
[2022-05-20 08:59:19] [INFO ] Deduced a trap composed of 33 places in 65 ms of which 0 ms to minimize.
[2022-05-20 08:59:19] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 1 ms to minimize.
[2022-05-20 08:59:19] [INFO ] Deduced a trap composed of 28 places in 60 ms of which 0 ms to minimize.
[2022-05-20 08:59:19] [INFO ] Deduced a trap composed of 41 places in 82 ms of which 2 ms to minimize.
[2022-05-20 08:59:19] [INFO ] Deduced a trap composed of 25 places in 77 ms of which 0 ms to minimize.
[2022-05-20 08:59:19] [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-05-20 08:59:19] [INFO ] [Real]Absence check using 41 positive place invariants in 12 ms returned sat
[2022-05-20 08:59:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 08:59:19] [INFO ] [Real]Absence check using state equation in 112 ms returned sat
[2022-05-20 08:59:20] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 08:59:20] [INFO ] [Nat]Absence check using 41 positive place invariants in 15 ms returned sat
[2022-05-20 08:59:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 08:59:20] [INFO ] [Nat]Absence check using state equation in 124 ms returned sat
[2022-05-20 08:59:20] [INFO ] Deduced a trap composed of 23 places in 79 ms of which 1 ms to minimize.
[2022-05-20 08:59:20] [INFO ] Deduced a trap composed of 32 places in 85 ms of which 10 ms to minimize.
[2022-05-20 08:59:20] [INFO ] Deduced a trap composed of 22 places in 74 ms of which 1 ms to minimize.
[2022-05-20 08:59:20] [INFO ] Deduced a trap composed of 21 places in 75 ms of which 1 ms to minimize.
[2022-05-20 08:59:20] [INFO ] Deduced a trap composed of 19 places in 76 ms of which 1 ms to minimize.
[2022-05-20 08:59:20] [INFO ] Deduced a trap composed of 20 places in 78 ms of which 0 ms to minimize.
[2022-05-20 08:59:20] [INFO ] Deduced a trap composed of 31 places in 71 ms of which 0 ms to minimize.
[2022-05-20 08:59:20] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 1 ms to minimize.
[2022-05-20 08:59:21] [INFO ] Deduced a trap composed of 27 places in 58 ms of which 1 ms to minimize.
[2022-05-20 08:59:21] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2022-05-20 08:59:21] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 879 ms
[2022-05-20 08:59:21] [INFO ] Computed and/alt/rep : 452/1319/452 causal constraints (skipped 0 transitions) in 25 ms.
[2022-05-20 08:59:25] [INFO ] Added : 420 causal constraints over 84 iterations in 3927 ms. Result :unknown
[2022-05-20 08:59:25] [INFO ] [Real]Absence check using 41 positive place invariants in 12 ms returned sat
[2022-05-20 08:59:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 08:59:25] [INFO ] [Real]Absence check using state equation in 117 ms returned sat
[2022-05-20 08:59:25] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 08:59:25] [INFO ] [Nat]Absence check using 41 positive place invariants in 14 ms returned sat
[2022-05-20 08:59:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 08:59:25] [INFO ] [Nat]Absence check using state equation in 108 ms returned sat
[2022-05-20 08:59:25] [INFO ] Deduced a trap composed of 20 places in 93 ms of which 0 ms to minimize.
[2022-05-20 08:59:25] [INFO ] Deduced a trap composed of 25 places in 112 ms of which 0 ms to minimize.
[2022-05-20 08:59:25] [INFO ] Deduced a trap composed of 26 places in 88 ms of which 0 ms to minimize.
[2022-05-20 08:59:25] [INFO ] Deduced a trap composed of 34 places in 83 ms of which 0 ms to minimize.
[2022-05-20 08:59:25] [INFO ] Deduced a trap composed of 30 places in 79 ms of which 1 ms to minimize.
[2022-05-20 08:59:26] [INFO ] Deduced a trap composed of 33 places in 79 ms of which 0 ms to minimize.
[2022-05-20 08:59:26] [INFO ] Deduced a trap composed of 20 places in 75 ms of which 1 ms to minimize.
[2022-05-20 08:59:26] [INFO ] Deduced a trap composed of 24 places in 72 ms of which 1 ms to minimize.
[2022-05-20 08:59:26] [INFO ] Deduced a trap composed of 30 places in 64 ms of which 0 ms to minimize.
[2022-05-20 08:59:26] [INFO ] Deduced a trap composed of 29 places in 75 ms of which 0 ms to minimize.
[2022-05-20 08:59:26] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 1 ms to minimize.
[2022-05-20 08:59:26] [INFO ] Deduced a trap composed of 29 places in 90 ms of which 1 ms to minimize.
[2022-05-20 08:59:26] [INFO ] Deduced a trap composed of 20 places in 92 ms of which 1 ms to minimize.
[2022-05-20 08:59:26] [INFO ] Deduced a trap composed of 45 places in 85 ms of which 1 ms to minimize.
[2022-05-20 08:59:26] [INFO ] Deduced a trap composed of 21 places in 81 ms of which 1 ms to minimize.
[2022-05-20 08:59:27] [INFO ] Deduced a trap composed of 25 places in 64 ms of which 0 ms to minimize.
[2022-05-20 08:59:27] [INFO ] Deduced a trap composed of 31 places in 74 ms of which 0 ms to minimize.
[2022-05-20 08:59:27] [INFO ] Deduced a trap composed of 29 places in 73 ms of which 0 ms to minimize.
[2022-05-20 08:59:27] [INFO ] Deduced a trap composed of 41 places in 63 ms of which 1 ms to minimize.
[2022-05-20 08:59:27] [INFO ] Deduced a trap composed of 36 places in 59 ms of which 0 ms to minimize.
[2022-05-20 08:59:27] [INFO ] Deduced a trap composed of 38 places in 61 ms of which 0 ms to minimize.
[2022-05-20 08:59:27] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 1 ms to minimize.
[2022-05-20 08:59:27] [INFO ] Deduced a trap composed of 30 places in 63 ms of which 0 ms to minimize.
[2022-05-20 08:59:27] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 2204 ms
[2022-05-20 08:59:27] [INFO ] Computed and/alt/rep : 452/1319/452 causal constraints (skipped 0 transitions) in 25 ms.
[2022-05-20 08:59:30] [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-05-20 08:59:30] [INFO ] [Real]Absence check using 41 positive place invariants in 12 ms returned sat
[2022-05-20 08:59:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 08:59:30] [INFO ] [Real]Absence check using state equation in 120 ms returned sat
[2022-05-20 08:59:30] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 08:59:30] [INFO ] [Nat]Absence check using 41 positive place invariants in 14 ms returned sat
[2022-05-20 08:59:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 08:59:30] [INFO ] [Nat]Absence check using state equation in 132 ms returned sat
[2022-05-20 08:59:30] [INFO ] Deduced a trap composed of 31 places in 82 ms of which 0 ms to minimize.
[2022-05-20 08:59:30] [INFO ] Deduced a trap composed of 28 places in 77 ms of which 0 ms to minimize.
[2022-05-20 08:59:30] [INFO ] Deduced a trap composed of 25 places in 78 ms of which 0 ms to minimize.
[2022-05-20 08:59:31] [INFO ] Deduced a trap composed of 31 places in 71 ms of which 1 ms to minimize.
[2022-05-20 08:59:31] [INFO ] Deduced a trap composed of 32 places in 72 ms of which 0 ms to minimize.
[2022-05-20 08:59:31] [INFO ] Deduced a trap composed of 27 places in 62 ms of which 1 ms to minimize.
[2022-05-20 08:59:31] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 1 ms to minimize.
[2022-05-20 08:59:31] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 0 ms to minimize.
[2022-05-20 08:59:31] [INFO ] Deduced a trap composed of 25 places in 61 ms of which 0 ms to minimize.
[2022-05-20 08:59:31] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 1 ms to minimize.
[2022-05-20 08:59:31] [INFO ] Deduced a trap composed of 25 places in 59 ms of which 1 ms to minimize.
[2022-05-20 08:59:31] [INFO ] Deduced a trap composed of 46 places in 55 ms of which 0 ms to minimize.
[2022-05-20 08:59:31] [INFO ] Deduced a trap composed of 33 places in 54 ms of which 1 ms to minimize.
[2022-05-20 08:59:31] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 0 ms to minimize.
[2022-05-20 08:59:31] [INFO ] Deduced a trap composed of 30 places in 53 ms of which 0 ms to minimize.
[2022-05-20 08:59:31] [INFO ] Deduced a trap composed of 28 places in 49 ms of which 0 ms to minimize.
[2022-05-20 08:59:32] [INFO ] Deduced a trap composed of 31 places in 50 ms of which 0 ms to minimize.
[2022-05-20 08:59:32] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 1360 ms
[2022-05-20 08:59:32] [INFO ] Computed and/alt/rep : 452/1319/452 causal constraints (skipped 0 transitions) in 26 ms.
[2022-05-20 08:59:35] [INFO ] Added : 415 causal constraints over 83 iterations in 3445 ms. Result :unknown
[2022-05-20 08:59:35] [INFO ] [Real]Absence check using 41 positive place invariants in 12 ms returned sat
[2022-05-20 08:59:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 08:59:35] [INFO ] [Real]Absence check using state equation in 123 ms returned sat
[2022-05-20 08:59:35] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 08:59:35] [INFO ] [Nat]Absence check using 41 positive place invariants in 13 ms returned sat
[2022-05-20 08:59:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 08:59:35] [INFO ] [Nat]Absence check using state equation in 118 ms returned sat
[2022-05-20 08:59:35] [INFO ] Deduced a trap composed of 36 places in 85 ms of which 0 ms to minimize.
[2022-05-20 08:59:36] [INFO ] Deduced a trap composed of 41 places in 82 ms of which 0 ms to minimize.
[2022-05-20 08:59:36] [INFO ] Deduced a trap composed of 30 places in 80 ms of which 0 ms to minimize.
[2022-05-20 08:59:36] [INFO ] Deduced a trap composed of 20 places in 75 ms of which 0 ms to minimize.
[2022-05-20 08:59:36] [INFO ] Deduced a trap composed of 36 places in 78 ms of which 0 ms to minimize.
[2022-05-20 08:59:36] [INFO ] Deduced a trap composed of 28 places in 76 ms of which 1 ms to minimize.
[2022-05-20 08:59:36] [INFO ] Deduced a trap composed of 31 places in 78 ms of which 1 ms to minimize.
[2022-05-20 08:59:36] [INFO ] Deduced a trap composed of 27 places in 70 ms of which 0 ms to minimize.
[2022-05-20 08:59:36] [INFO ] Deduced a trap composed of 19 places in 69 ms of which 0 ms to minimize.
[2022-05-20 08:59:36] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 1 ms to minimize.
[2022-05-20 08:59:36] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 0 ms to minimize.
[2022-05-20 08:59:36] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 0 ms to minimize.
[2022-05-20 08:59:37] [INFO ] Deduced a trap composed of 24 places in 90 ms of which 0 ms to minimize.
[2022-05-20 08:59:37] [INFO ] Deduced a trap composed of 62 places in 91 ms of which 0 ms to minimize.
[2022-05-20 08:59:37] [INFO ] Deduced a trap composed of 18 places in 98 ms of which 0 ms to minimize.
[2022-05-20 08:59:37] [INFO ] Deduced a trap composed of 24 places in 94 ms of which 0 ms to minimize.
[2022-05-20 08:59:37] [INFO ] Deduced a trap composed of 22 places in 92 ms of which 0 ms to minimize.
[2022-05-20 08:59:37] [INFO ] Deduced a trap composed of 25 places in 74 ms of which 1 ms to minimize.
[2022-05-20 08:59:37] [INFO ] Deduced a trap composed of 26 places in 89 ms of which 0 ms to minimize.
[2022-05-20 08:59:37] [INFO ] Deduced a trap composed of 29 places in 87 ms of which 1 ms to minimize.
[2022-05-20 08:59:37] [INFO ] Deduced a trap composed of 27 places in 84 ms of which 0 ms to minimize.
[2022-05-20 08:59:38] [INFO ] Deduced a trap composed of 31 places in 93 ms of which 0 ms to minimize.
[2022-05-20 08:59:38] [INFO ] Deduced a trap composed of 42 places in 86 ms of which 1 ms to minimize.
[2022-05-20 08:59:38] [INFO ] Deduced a trap composed of 19 places in 73 ms of which 1 ms to minimize.
[2022-05-20 08:59:38] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 1 ms to minimize.
[2022-05-20 08:59:38] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 2465 ms
[2022-05-20 08:59:38] [INFO ] Computed and/alt/rep : 452/1319/452 causal constraints (skipped 0 transitions) in 23 ms.
[2022-05-20 08:59:40] [INFO ] Added : 350 causal constraints over 70 iterations in 2347 ms. Result :unknown
[2022-05-20 08:59:40] [INFO ] [Real]Absence check using 41 positive place invariants in 12 ms returned sat
[2022-05-20 08:59:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 08:59:40] [INFO ] [Real]Absence check using state equation in 122 ms returned sat
[2022-05-20 08:59:40] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 08:59:41] [INFO ] [Nat]Absence check using 41 positive place invariants in 17 ms returned sat
[2022-05-20 08:59:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 08:59:41] [INFO ] [Nat]Absence check using state equation in 118 ms returned sat
[2022-05-20 08:59:41] [INFO ] Deduced a trap composed of 28 places in 85 ms of which 0 ms to minimize.
[2022-05-20 08:59:41] [INFO ] Deduced a trap composed of 38 places in 75 ms of which 1 ms to minimize.
[2022-05-20 08:59:41] [INFO ] Deduced a trap composed of 31 places in 70 ms of which 1 ms to minimize.
[2022-05-20 08:59:41] [INFO ] Deduced a trap composed of 27 places in 72 ms of which 1 ms to minimize.
[2022-05-20 08:59:41] [INFO ] Deduced a trap composed of 34 places in 72 ms of which 1 ms to minimize.
[2022-05-20 08:59:41] [INFO ] Deduced a trap composed of 24 places in 68 ms of which 0 ms to minimize.
[2022-05-20 08:59:41] [INFO ] Deduced a trap composed of 26 places in 62 ms of which 0 ms to minimize.
[2022-05-20 08:59:41] [INFO ] Deduced a trap composed of 39 places in 61 ms of which 0 ms to minimize.
[2022-05-20 08:59:41] [INFO ] Deduced a trap composed of 25 places in 62 ms of which 0 ms to minimize.
[2022-05-20 08:59:42] [INFO ] Deduced a trap composed of 31 places in 73 ms of which 1 ms to minimize.
[2022-05-20 08:59:42] [INFO ] Deduced a trap composed of 27 places in 68 ms of which 0 ms to minimize.
[2022-05-20 08:59:42] [INFO ] Deduced a trap composed of 20 places in 74 ms of which 1 ms to minimize.
[2022-05-20 08:59:42] [INFO ] Deduced a trap composed of 27 places in 70 ms of which 1 ms to minimize.
[2022-05-20 08:59:42] [INFO ] Deduced a trap composed of 22 places in 68 ms of which 0 ms to minimize.
[2022-05-20 08:59:42] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 0 ms to minimize.
[2022-05-20 08:59:42] [INFO ] Deduced a trap composed of 18 places in 70 ms of which 0 ms to minimize.
[2022-05-20 08:59:42] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 0 ms to minimize.
[2022-05-20 08:59:42] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 1451 ms
[2022-05-20 08:59:42] [INFO ] Computed and/alt/rep : 452/1319/452 causal constraints (skipped 0 transitions) in 27 ms.
[2022-05-20 08:59:45] [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 6
Fused 7 Parikh solutions to 4 different solutions.
Incomplete Parikh walk after 39200 steps, including 174 resets, run finished after 112 ms. (steps per millisecond=350 ) properties (out of 7) seen :0 could not realise parikh vector
Incomplete Parikh walk after 49400 steps, including 304 resets, run finished after 118 ms. (steps per millisecond=418 ) properties (out of 7) seen :0 could not realise parikh vector
Incomplete Parikh walk after 67400 steps, including 445 resets, run finished after 150 ms. (steps per millisecond=449 ) properties (out of 7) seen :0 could not realise parikh vector
Support contains 7 out of 403 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 403/403 places, 453/453 transitions.
Drop transitions removed 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 0 with 41 rules applied. Total rules applied 41 place count 403 transition count 412
Reduce places removed 41 places and 0 transitions.
Iterating post reduction 1 with 41 rules applied. Total rules applied 82 place count 362 transition count 412
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 82 place count 362 transition count 362
Deduced a syphon composed of 50 places in 11 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 182 place count 312 transition count 362
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 245 place count 249 transition count 299
Iterating global reduction 2 with 63 rules applied. Total rules applied 308 place count 249 transition count 299
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 30 Pre rules applied. Total rules applied 308 place count 249 transition count 269
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 368 place count 219 transition count 269
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 70
Deduced a syphon composed of 70 places in 0 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 2 with 140 rules applied. Total rules applied 508 place count 149 transition count 199
Partial Free-agglomeration rule applied 22 times.
Drop transitions removed 22 transitions
Iterating global reduction 2 with 22 rules applied. Total rules applied 530 place count 149 transition count 199
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 531 place count 148 transition count 198
Applied a total of 531 rules in 137 ms. Remains 148 /403 variables (removed 255) and now considering 198/453 (removed 255) transitions.
Finished structural reductions, in 1 iterations. Remains : 148/403 places, 198/453 transitions.
[2022-05-20 08:59:46] [INFO ] Flatten gal took : 70 ms
[2022-05-20 08:59:46] [INFO ] Flatten gal took : 19 ms
[2022-05-20 08:59:46] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5011057742874608973.gal : 26 ms
[2022-05-20 08:59:46] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1356749327236589479.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/ReachabilityCardinality5011057742874608973.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality1356749327236589479.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/ReachabilityCardinality5011057742874608973.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality1356749327236589479.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality1356749327236589479.prop.
SDD proceeding with computation,7 properties remain. new max is 4
SDD size :2 after 5
SDD proceeding with computation,7 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,7 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,7 properties remain. new max is 32
SDD size :19 after 31
SDD proceeding with computation,7 properties remain. new max is 64
SDD size :31 after 213
SDD proceeding with computation,7 properties remain. new max is 128
SDD size :213 after 285
SDD proceeding with computation,7 properties remain. new max is 256
SDD size :285 after 776
SDD proceeding with computation,7 properties remain. new max is 512
SDD size :776 after 13315
Invariant property smplace_100 does not hold.
SDD proceeding with computation,6 properties remain. new max is 512
SDD size :13315 after 52131
Invariant property smplace_164 does not hold.
SDD proceeding with computation,5 properties remain. new max is 512
SDD size :52131 after 1.64012e+06
SDD proceeding with computation,5 properties remain. new max is 1024
SDD size :1.64012e+06 after 2.54002e+06
SDD proceeding with computation,5 properties remain. new max is 2048
SDD size :2.54002e+06 after 6.05631e+06
Invariant property smplace_203 does not hold.
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :6.05631e+06 after 2.5093e+08
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :2.5093e+08 after 5.69901e+08
Invariant property smplace_178 does not hold.
SDD proceeding with computation,3 properties remain. new max is 4096
SDD size :5.69901e+08 after 2.23952e+10
Invariant property smplace_217 does not hold.
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :2.23952e+10 after 7.80883e+10
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :7.80883e+10 after 8.84681e+10
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :8.84681e+10 after 3.65537e+12
Invariant property smplace_254 does not hold.
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :3.65537e+12 after 2.0044e+14
Invariant property smplace_295 does not hold.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 16385 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,1.13512e+15,5.46702,144956,2,36561,32,403469,6,0,793,1.0448e+06,0
Total reachable state count : 1135123214225527

Verifying 7 reachability properties.
Invariant property smplace_100 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
smplace\_100,10518,5.46962,144956,2,503,32,403469,7,0,796,1.0448e+06,0
Invariant property smplace_164 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
smplace\_164,1.76992e+07,5.4716,144956,2,1206,32,403469,8,0,798,1.0448e+06,0
Invariant property smplace_178 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
smplace\_178,1.23548e+08,5.47301,144956,2,2165,32,403469,9,0,800,1.0448e+06,0
Invariant property smplace_203 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
smplace\_203,2.54359e+09,5.47437,144956,2,2484,32,403469,10,0,802,1.0448e+06,0
Invariant property smplace_217 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
smplace\_217,1.73013e+10,5.47608,144956,2,3635,32,403469,11,0,804,1.0448e+06,0
Invariant property smplace_254 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
smplace\_254,2.37202e+12,5.4836,144956,2,18148,32,403469,12,0,806,1.0448e+06,0
Invariant property smplace_295 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
smplace\_295,6.05036e+13,5.49464,144956,2,26305,32,403469,13,0,808,1.0448e+06,0
Able to resolve query StableMarking after proving 213 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK MARKED_SUFFIX_TEST DECISION_DIAGRAMS COLLATERAL_PROCESSING BESTFIRST_WALK TOPOLOGICAL

BK_STOP 1653037193336

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ StableMarking = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution StableMarking -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
+ 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 StableMarking -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 1800 -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="ShieldRVs-PT-010B"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="gold2021"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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 ShieldRVs-PT-010B, examination is StableMarking"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r234-tall-165286038500498"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVs-PT-010B.tgz
mv ShieldRVs-PT-010B execution
cd execution
if [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "UpperBounds" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] || [ "StableMarking" = "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 [ "StableMarking" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "StableMarking" != "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 "StableMarking.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property StableMarking.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "StableMarking.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 '' StableMarking.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] ; then
echo "FORMULA_NAME StableMarking"
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 ;