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.r233-tall-165286037600366.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 ShieldRVt-PT-010B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r233-tall-165286037600366
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 632K
-rw-r--r-- 1 mcc users 5.7K Apr 30 00:17 CTLCardinality.txt
-rw-r--r-- 1 mcc users 57K Apr 30 00:17 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Apr 30 00:17 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Apr 30 00:17 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K May 9 09:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 09:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 9 09:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 09:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Apr 30 00:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 192K Apr 30 00:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Apr 30 00:17 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Apr 30 00:17 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 09:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 09:01 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 119K 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

here is the order used to build the result vector(from text file)
FORMULA_NAME ShieldRVt-PT-010B-ReachabilityFireability-00
FORMULA_NAME ShieldRVt-PT-010B-ReachabilityFireability-01
FORMULA_NAME ShieldRVt-PT-010B-ReachabilityFireability-02
FORMULA_NAME ShieldRVt-PT-010B-ReachabilityFireability-03
FORMULA_NAME ShieldRVt-PT-010B-ReachabilityFireability-04
FORMULA_NAME ShieldRVt-PT-010B-ReachabilityFireability-05
FORMULA_NAME ShieldRVt-PT-010B-ReachabilityFireability-06
FORMULA_NAME ShieldRVt-PT-010B-ReachabilityFireability-07
FORMULA_NAME ShieldRVt-PT-010B-ReachabilityFireability-08
FORMULA_NAME ShieldRVt-PT-010B-ReachabilityFireability-09
FORMULA_NAME ShieldRVt-PT-010B-ReachabilityFireability-10
FORMULA_NAME ShieldRVt-PT-010B-ReachabilityFireability-11
FORMULA_NAME ShieldRVt-PT-010B-ReachabilityFireability-12
FORMULA_NAME ShieldRVt-PT-010B-ReachabilityFireability-13
FORMULA_NAME ShieldRVt-PT-010B-ReachabilityFireability-14
FORMULA_NAME ShieldRVt-PT-010B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1655081259018

Running Version 0
[2022-06-13 00:47:40] [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 00:47:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-13 00:47:40] [INFO ] Load time of PNML (sax parser for PT used): 69 ms
[2022-06-13 00:47:40] [INFO ] Transformed 503 places.
[2022-06-13 00:47:40] [INFO ] Transformed 503 transitions.
[2022-06-13 00:47:40] [INFO ] Found NUPN structural information;
[2022-06-13 00:47:40] [INFO ] Parsed PT model containing 503 places and 503 transitions in 119 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 16) seen :9
FORMULA ShieldRVt-PT-010B-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-010B-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-010B-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-010B-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-010B-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-010B-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-010B-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-010B-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-010B-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) 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 17 ms. (steps per millisecond=588 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 503 rows 503 cols
[2022-06-13 00:47:41] [INFO ] Computed 41 place invariants in 19 ms
[2022-06-13 00:47:41] [INFO ] [Real]Absence check using 41 positive place invariants in 30 ms returned sat
[2022-06-13 00:47:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 00:47:41] [INFO ] [Real]Absence check using state equation in 297 ms returned sat
[2022-06-13 00:47:41] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 00:47:41] [INFO ] [Nat]Absence check using 41 positive place invariants in 19 ms returned sat
[2022-06-13 00:47:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-13 00:47:42] [INFO ] [Nat]Absence check using state equation in 381 ms returned sat
[2022-06-13 00:47:42] [INFO ] Deduced a trap composed of 28 places in 168 ms of which 4 ms to minimize.
[2022-06-13 00:47:42] [INFO ] Deduced a trap composed of 21 places in 117 ms of which 2 ms to minimize.
[2022-06-13 00:47:42] [INFO ] Deduced a trap composed of 37 places in 86 ms of which 1 ms to minimize.
[2022-06-13 00:47:42] [INFO ] Deduced a trap composed of 36 places in 78 ms of which 1 ms to minimize.
[2022-06-13 00:47:43] [INFO ] Deduced a trap composed of 21 places in 74 ms of which 1 ms to minimize.
[2022-06-13 00:47:43] [INFO ] Deduced a trap composed of 41 places in 66 ms of which 0 ms to minimize.
[2022-06-13 00:47:43] [INFO ] Deduced a trap composed of 36 places in 64 ms of which 0 ms to minimize.
[2022-06-13 00:47:43] [INFO ] Deduced a trap composed of 28 places in 63 ms of which 1 ms to minimize.
[2022-06-13 00:47:43] [INFO ] Deduced a trap composed of 30 places in 111 ms of which 1 ms to minimize.
[2022-06-13 00:47:43] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 0 ms to minimize.
[2022-06-13 00:47:43] [INFO ] Deduced a trap composed of 28 places in 69 ms of which 0 ms to minimize.
[2022-06-13 00:47:43] [INFO ] Deduced a trap composed of 23 places in 79 ms of which 1 ms to minimize.
[2022-06-13 00:47:43] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 0 ms to minimize.
[2022-06-13 00:47:43] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 0 ms to minimize.
[2022-06-13 00:47:43] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 1496 ms
[2022-06-13 00:47:43] [INFO ] Computed and/alt/rep : 502/743/502 causal constraints (skipped 0 transitions) in 35 ms.
[2022-06-13 00:47:46] [INFO ] Added : 410 causal constraints over 82 iterations in 2994 ms. Result :unknown
[2022-06-13 00:47:46] [INFO ] [Real]Absence check using 41 positive place invariants in 20 ms returned sat
[2022-06-13 00:47:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 00:47:47] [INFO ] [Real]Absence check using state equation in 189 ms returned sat
[2022-06-13 00:47:47] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 00:47:47] [INFO ] [Nat]Absence check using 41 positive place invariants in 16 ms returned sat
[2022-06-13 00:47:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-13 00:47:47] [INFO ] [Nat]Absence check using state equation in 178 ms returned sat
[2022-06-13 00:47:47] [INFO ] Deduced a trap composed of 25 places in 83 ms of which 1 ms to minimize.
[2022-06-13 00:47:47] [INFO ] Deduced a trap composed of 29 places in 88 ms of which 1 ms to minimize.
[2022-06-13 00:47:47] [INFO ] Deduced a trap composed of 23 places in 86 ms of which 1 ms to minimize.
[2022-06-13 00:47:47] [INFO ] Deduced a trap composed of 27 places in 79 ms of which 0 ms to minimize.
[2022-06-13 00:47:47] [INFO ] Deduced a trap composed of 40 places in 74 ms of which 1 ms to minimize.
[2022-06-13 00:47:48] [INFO ] Deduced a trap composed of 28 places in 78 ms of which 0 ms to minimize.
[2022-06-13 00:47:48] [INFO ] Deduced a trap composed of 38 places in 65 ms of which 0 ms to minimize.
[2022-06-13 00:47:48] [INFO ] Deduced a trap composed of 51 places in 76 ms of which 1 ms to minimize.
[2022-06-13 00:47:48] [INFO ] Deduced a trap composed of 27 places in 76 ms of which 1 ms to minimize.
[2022-06-13 00:47:48] [INFO ] Deduced a trap composed of 27 places in 67 ms of which 0 ms to minimize.
[2022-06-13 00:47:48] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 0 ms to minimize.
[2022-06-13 00:47:48] [INFO ] Deduced a trap composed of 28 places in 62 ms of which 1 ms to minimize.
[2022-06-13 00:47:48] [INFO ] Deduced a trap composed of 35 places in 62 ms of which 1 ms to minimize.
[2022-06-13 00:47:48] [INFO ] Deduced a trap composed of 25 places in 63 ms of which 1 ms to minimize.
[2022-06-13 00:47:48] [INFO ] Deduced a trap composed of 37 places in 62 ms of which 0 ms to minimize.
[2022-06-13 00:47:48] [INFO ] Deduced a trap composed of 32 places in 58 ms of which 0 ms to minimize.
[2022-06-13 00:47:48] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 0 ms to minimize.
[2022-06-13 00:47:49] [INFO ] Deduced a trap composed of 39 places in 53 ms of which 1 ms to minimize.
[2022-06-13 00:47:49] [INFO ] Deduced a trap composed of 41 places in 60 ms of which 1 ms to minimize.
[2022-06-13 00:47:49] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 1 ms to minimize.
[2022-06-13 00:47:49] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 1808 ms
[2022-06-13 00:47:49] [INFO ] Computed and/alt/rep : 502/743/502 causal constraints (skipped 0 transitions) in 27 ms.
[2022-06-13 00:47:52] [INFO ] Added : 430 causal constraints over 86 iterations in 2923 ms. Result :unknown
[2022-06-13 00:47:52] [INFO ] [Real]Absence check using 41 positive place invariants in 18 ms returned sat
[2022-06-13 00:47:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 00:47:52] [INFO ] [Real]Absence check using state equation in 246 ms returned sat
[2022-06-13 00:47:52] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 00:47:52] [INFO ] [Nat]Absence check using 41 positive place invariants in 18 ms returned sat
[2022-06-13 00:47:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-13 00:47:52] [INFO ] [Nat]Absence check using state equation in 247 ms returned sat
[2022-06-13 00:47:52] [INFO ] Deduced a trap composed of 40 places in 78 ms of which 0 ms to minimize.
[2022-06-13 00:47:53] [INFO ] Deduced a trap composed of 27 places in 83 ms of which 1 ms to minimize.
[2022-06-13 00:47:53] [INFO ] Deduced a trap composed of 64 places in 76 ms of which 0 ms to minimize.
[2022-06-13 00:47:53] [INFO ] Deduced a trap composed of 18 places in 79 ms of which 0 ms to minimize.
[2022-06-13 00:47:53] [INFO ] Deduced a trap composed of 26 places in 71 ms of which 0 ms to minimize.
[2022-06-13 00:47:53] [INFO ] Deduced a trap composed of 38 places in 83 ms of which 0 ms to minimize.
[2022-06-13 00:47:53] [INFO ] Deduced a trap composed of 20 places in 78 ms of which 0 ms to minimize.
[2022-06-13 00:47:53] [INFO ] Deduced a trap composed of 29 places in 65 ms of which 0 ms to minimize.
[2022-06-13 00:47:53] [INFO ] Deduced a trap composed of 37 places in 71 ms of which 1 ms to minimize.
[2022-06-13 00:47:53] [INFO ] Deduced a trap composed of 31 places in 63 ms of which 1 ms to minimize.
[2022-06-13 00:47:53] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 0 ms to minimize.
[2022-06-13 00:47:53] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 0 ms to minimize.
[2022-06-13 00:47:54] [INFO ] Deduced a trap composed of 27 places in 60 ms of which 1 ms to minimize.
[2022-06-13 00:47:54] [INFO ] Deduced a trap composed of 25 places in 56 ms of which 1 ms to minimize.
[2022-06-13 00:47:54] [INFO ] Deduced a trap composed of 28 places in 53 ms of which 1 ms to minimize.
[2022-06-13 00:47:54] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 1 ms to minimize.
[2022-06-13 00:47:54] [INFO ] Deduced a trap composed of 35 places in 53 ms of which 1 ms to minimize.
[2022-06-13 00:47:54] [INFO ] Deduced a trap composed of 31 places in 42 ms of which 1 ms to minimize.
[2022-06-13 00:47:54] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 0 ms to minimize.
[2022-06-13 00:47:54] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 0 ms to minimize.
[2022-06-13 00:47:54] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 1646 ms
[2022-06-13 00:47:54] [INFO ] Computed and/alt/rep : 502/743/502 causal constraints (skipped 0 transitions) in 25 ms.
[2022-06-13 00:47:57] [INFO ] Added : 440 causal constraints over 88 iterations in 3024 ms. Result :unknown
[2022-06-13 00:47:57] [INFO ] [Real]Absence check using 41 positive place invariants in 15 ms returned sat
[2022-06-13 00:47:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 00:47:57] [INFO ] [Real]Absence check using state equation in 198 ms returned sat
[2022-06-13 00:47:57] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 00:47:57] [INFO ] [Nat]Absence check using 41 positive place invariants in 17 ms returned sat
[2022-06-13 00:47:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-13 00:47:58] [INFO ] [Nat]Absence check using state equation in 187 ms returned sat
[2022-06-13 00:47:58] [INFO ] Deduced a trap composed of 34 places in 73 ms of which 0 ms to minimize.
[2022-06-13 00:47:58] [INFO ] Deduced a trap composed of 21 places in 75 ms of which 0 ms to minimize.
[2022-06-13 00:47:58] [INFO ] Deduced a trap composed of 31 places in 78 ms of which 8 ms to minimize.
[2022-06-13 00:47:58] [INFO ] Deduced a trap composed of 42 places in 70 ms of which 1 ms to minimize.
[2022-06-13 00:47:58] [INFO ] Deduced a trap composed of 33 places in 65 ms of which 0 ms to minimize.
[2022-06-13 00:47:58] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 0 ms to minimize.
[2022-06-13 00:47:58] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 1 ms to minimize.
[2022-06-13 00:47:58] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 0 ms to minimize.
[2022-06-13 00:47:58] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 1 ms to minimize.
[2022-06-13 00:47:58] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 761 ms
[2022-06-13 00:47:58] [INFO ] Computed and/alt/rep : 502/743/502 causal constraints (skipped 0 transitions) in 25 ms.
[2022-06-13 00:48:03] [INFO ] Deduced a trap composed of 15 places in 135 ms of which 1 ms to minimize.
[2022-06-13 00:48:03] [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 00:48:03] [INFO ] [Real]Absence check using 41 positive place invariants in 14 ms returned sat
[2022-06-13 00:48:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 00:48:03] [INFO ] [Real]Absence check using state equation in 131 ms returned sat
[2022-06-13 00:48:03] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 00:48:03] [INFO ] [Nat]Absence check using 41 positive place invariants in 16 ms returned sat
[2022-06-13 00:48:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-13 00:48:03] [INFO ] [Nat]Absence check using state equation in 140 ms returned sat
[2022-06-13 00:48:03] [INFO ] Deduced a trap composed of 29 places in 69 ms of which 0 ms to minimize.
[2022-06-13 00:48:03] [INFO ] Deduced a trap composed of 33 places in 69 ms of which 1 ms to minimize.
[2022-06-13 00:48:03] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 2 ms to minimize.
[2022-06-13 00:48:03] [INFO ] Deduced a trap composed of 30 places in 64 ms of which 2 ms to minimize.
[2022-06-13 00:48:03] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 4 ms to minimize.
[2022-06-13 00:48:03] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 1 ms to minimize.
[2022-06-13 00:48:04] [INFO ] Deduced a trap composed of 31 places in 59 ms of which 0 ms to minimize.
[2022-06-13 00:48:04] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 0 ms to minimize.
[2022-06-13 00:48:04] [INFO ] Deduced a trap composed of 37 places in 44 ms of which 0 ms to minimize.
[2022-06-13 00:48:04] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 1 ms to minimize.
[2022-06-13 00:48:04] [INFO ] Deduced a trap composed of 48 places in 42 ms of which 0 ms to minimize.
[2022-06-13 00:48:04] [INFO ] Deduced a trap composed of 31 places in 45 ms of which 0 ms to minimize.
[2022-06-13 00:48:04] [INFO ] Deduced a trap composed of 32 places in 49 ms of which 0 ms to minimize.
[2022-06-13 00:48:04] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 0 ms to minimize.
[2022-06-13 00:48:04] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 1009 ms
[2022-06-13 00:48:04] [INFO ] Computed and/alt/rep : 502/743/502 causal constraints (skipped 0 transitions) in 33 ms.
[2022-06-13 00:48:08] [INFO ] Added : 484 causal constraints over 98 iterations in 3774 ms. Result :unknown
[2022-06-13 00:48:08] [INFO ] [Real]Absence check using 41 positive place invariants in 16 ms returned unsat
[2022-06-13 00:48:08] [INFO ] [Real]Absence check using 41 positive place invariants in 18 ms returned sat
[2022-06-13 00:48:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 00:48:08] [INFO ] [Real]Absence check using state equation in 238 ms returned sat
[2022-06-13 00:48:08] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 00:48:08] [INFO ] [Nat]Absence check using 41 positive place invariants in 20 ms returned sat
[2022-06-13 00:48:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-13 00:48:09] [INFO ] [Nat]Absence check using state equation in 214 ms returned sat
[2022-06-13 00:48:09] [INFO ] Deduced a trap composed of 38 places in 70 ms of which 1 ms to minimize.
[2022-06-13 00:48:09] [INFO ] Deduced a trap composed of 27 places in 71 ms of which 0 ms to minimize.
[2022-06-13 00:48:09] [INFO ] Deduced a trap composed of 27 places in 65 ms of which 2 ms to minimize.
[2022-06-13 00:48:09] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 0 ms to minimize.
[2022-06-13 00:48:09] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 1 ms to minimize.
[2022-06-13 00:48:09] [INFO ] Deduced a trap composed of 31 places in 55 ms of which 0 ms to minimize.
[2022-06-13 00:48:09] [INFO ] Deduced a trap composed of 27 places in 49 ms of which 0 ms to minimize.
[2022-06-13 00:48:09] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 0 ms to minimize.
[2022-06-13 00:48:09] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 666 ms
[2022-06-13 00:48:09] [INFO ] Computed and/alt/rep : 502/743/502 causal constraints (skipped 0 transitions) in 24 ms.
[2022-06-13 00:48:13] [INFO ] Deduced a trap composed of 16 places in 105 ms of which 0 ms to minimize.
[2022-06-13 00:48:13] [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
FORMULA ShieldRVt-PT-010B-ReachabilityFireability-13 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 7 Parikh solutions to 5 different solutions.
Incomplete Parikh walk after 51100 steps, including 332 resets, run finished after 152 ms. (steps per millisecond=336 ) properties (out of 6) seen :0 could not realise parikh vector
Incomplete Parikh walk after 29200 steps, including 180 resets, run finished after 74 ms. (steps per millisecond=394 ) properties (out of 6) seen :0 could not realise parikh vector
Incomplete Parikh walk after 41700 steps, including 287 resets, run finished after 120 ms. (steps per millisecond=347 ) properties (out of 6) seen :0 could not realise parikh vector
Incomplete Parikh walk after 55400 steps, including 277 resets, run finished after 123 ms. (steps per millisecond=450 ) properties (out of 6) seen :0 could not realise parikh vector
Support contains 146 out of 503 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 503/503 places, 503/503 transitions.
Drop transitions removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 0 with 37 rules applied. Total rules applied 37 place count 503 transition count 466
Reduce places removed 37 places and 0 transitions.
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Iterating post reduction 1 with 64 rules applied. Total rules applied 101 place count 466 transition count 439
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 2 with 27 rules applied. Total rules applied 128 place count 439 transition count 439
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 44 Pre rules applied. Total rules applied 128 place count 439 transition count 395
Deduced a syphon composed of 44 places in 3 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 88 rules applied. Total rules applied 216 place count 395 transition count 395
Discarding 57 places :
Symmetric choice reduction at 3 with 57 rule applications. Total rules 273 place count 338 transition count 338
Iterating global reduction 3 with 57 rules applied. Total rules applied 330 place count 338 transition count 338
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 330 place count 338 transition count 334
Deduced a syphon composed of 4 places in 3 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 338 place count 334 transition count 334
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 1 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 3 with 78 rules applied. Total rules applied 416 place count 295 transition count 295
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 426 place count 290 transition count 295
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 427 place count 290 transition count 294
Free-agglomeration rule applied 4 times.
Iterating global reduction 3 with 4 rules applied. Total rules applied 431 place count 290 transition count 290
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 435 place count 286 transition count 290
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 442 place count 286 transition count 290
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 443 place count 285 transition count 289
Applied a total of 443 rules in 156 ms. Remains 285 /503 variables (removed 218) and now considering 289/503 (removed 214) transitions.
Finished structural reductions, in 1 iterations. Remains : 285/503 places, 289/503 transitions.
[2022-06-13 00:48:14] [INFO ] Flatten gal took : 48 ms
[2022-06-13 00:48:14] [INFO ] Flatten gal took : 19 ms
[2022-06-13 00:48:14] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4280493071862103818.gal : 12 ms
[2022-06-13 00:48:14] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5877641753848107586.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/ReachabilityCardinality4280493071862103818.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality5877641753848107586.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/ReachabilityCardinality4280493071862103818.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality5877641753848107586.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality5877641753848107586.prop.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :5 after 7
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :7 after 14
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :14 after 65
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :65 after 4806
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :4806 after 1.72297e+07
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :1.72297e+07 after 2.59308e+13
Detected timeout of ITS tools.
[2022-06-13 00:48:29] [INFO ] Flatten gal took : 17 ms
[2022-06-13 00:48:29] [INFO ] Applying decomposition
[2022-06-13 00:48:29] [INFO ] Flatten gal took : 16 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/graph8924663389139316859.txt, -o, /tmp/graph8924663389139316859.bin, -w, /tmp/graph8924663389139316859.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/graph8924663389139316859.bin, -l, -1, -v, -w, /tmp/graph8924663389139316859.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-13 00:48:29] [INFO ] Decomposing Gal with order
[2022-06-13 00:48:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-13 00:48:30] [INFO ] Removed a total of 71 redundant transitions.
[2022-06-13 00:48:30] [INFO ] Flatten gal took : 59 ms
[2022-06-13 00:48:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 24 labels/synchronizations in 13 ms.
[2022-06-13 00:48:30] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9500262778965562413.gal : 9 ms
[2022-06-13 00:48:30] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13032079765702194456.prop : 2 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/ReachabilityCardinality9500262778965562413.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality13032079765702194456.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/ReachabilityCardinality9500262778965562413.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality13032079765702194456.prop --nowitness
Loading property file /tmp/ReachabilityCardinality13032079765702194456.prop.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :1 after 2
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :2 after 1168
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :1168 after 3.15878e+07
Invariant property ShieldRVt-PT-010B-ReachabilityFireability-14 does not hold.
FORMULA ShieldRVt-PT-010B-ReachabilityFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :1.35165e+16 after 2.29598e+16
Invariant property ShieldRVt-PT-010B-ReachabilityFireability-03 does not hold.
FORMULA ShieldRVt-PT-010B-ReachabilityFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Reachability property ShieldRVt-PT-010B-ReachabilityFireability-02 is true.
FORMULA ShieldRVt-PT-010B-ReachabilityFireability-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :2.29598e+16 after 5.2789e+16
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :5.2789e+16 after 1.51597e+19
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\_mod\_flat,3.04954e+30,1.42359,38576,1035,63,59407,572,914,202932,111,2554,0
Total reachable state count : 3049537445627984579038061527040

Verifying 6 reachability properties.
Reachability property ShieldRVt-PT-010B-ReachabilityFireability-02 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
ShieldRVt-PT-010B-ReachabilityFireability-02,4.91602e+15,1.43828,38576,255,53,59407,572,1126,202932,119,2554,1700
Invariant property ShieldRVt-PT-010B-ReachabilityFireability-03 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
ShieldRVt-PT-010B-ReachabilityFireability-03,1.93868e+28,1.45277,38576,781,58,59407,572,1219,202932,125,2554,3869
Reachability property ShieldRVt-PT-010B-ReachabilityFireability-07 is true.
FORMULA ShieldRVt-PT-010B-ReachabilityFireability-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
ShieldRVt-PT-010B-ReachabilityFireability-07,8.91943e+20,1.4562,38576,430,52,59407,572,1246,202932,125,2554,4774
Invariant property ShieldRVt-PT-010B-ReachabilityFireability-09 does not hold.
FORMULA ShieldRVt-PT-010B-ReachabilityFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
ShieldRVt-PT-010B-ReachabilityFireability-09,2.75544e+27,1.47279,38576,994,59,59407,572,1273,202932,125,2554,6634
Invariant property ShieldRVt-PT-010B-ReachabilityFireability-11 does not hold.
FORMULA ShieldRVt-PT-010B-ReachabilityFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
ShieldRVt-PT-010B-ReachabilityFireability-11,7.78267e+26,1.47475,38576,571,58,59407,572,1275,202932,125,2554,6759
Invariant property ShieldRVt-PT-010B-ReachabilityFireability-14 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
ShieldRVt-PT-010B-ReachabilityFireability-14,7.51869e+28,1.49736,38576,1087,64,59407,572,1417,202932,125,2554,9662
All properties solved without resorting to model-checking.

BK_STOP 1655081312687

--------------------
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="ShieldRVt-PT-010B"
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 ShieldRVt-PT-010B, 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 r233-tall-165286037600366"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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