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-165286037700058.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 ShieldIIPs-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-165286037700058
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 376K
-rw-r--r-- 1 mcc users 6.4K Apr 29 15:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Apr 29 15:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K Apr 29 15:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 38K Apr 29 15:01 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.9K May 9 08:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 9 08:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 08:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 08:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:48 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 164K 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 1653032331937

Running Version 0
[2022-05-20 07:38:53] [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 07:38:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 07:38:53] [INFO ] Load time of PNML (sax parser for PT used): 80 ms
[2022-05-20 07:38:53] [INFO ] Transformed 603 places.
[2022-05-20 07:38:53] [INFO ] Transformed 593 transitions.
[2022-05-20 07:38:53] [INFO ] Found NUPN structural information;
[2022-05-20 07:38:53] [INFO ] Parsed PT model containing 603 places and 593 transitions in 127 ms.
Structural test allowed to assert that 272 places are NOT stable. Took 11 ms.
Incomplete random walk after 10000 steps, including 7 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 331) seen :328
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 593 rows 603 cols
[2022-05-20 07:38:53] [INFO ] Computed 91 place invariants in 25 ms
[2022-05-20 07:38:54] [INFO ] [Real]Absence check using 91 positive place invariants in 33 ms returned sat
[2022-05-20 07:38:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 07:38:54] [INFO ] [Real]Absence check using state equation in 173 ms returned sat
[2022-05-20 07:38:54] [INFO ] Deduced a trap composed of 23 places in 275 ms of which 8 ms to minimize.
[2022-05-20 07:38:54] [INFO ] Deduced a trap composed of 18 places in 215 ms of which 2 ms to minimize.
[2022-05-20 07:38:55] [INFO ] Deduced a trap composed of 23 places in 140 ms of which 1 ms to minimize.
[2022-05-20 07:38:55] [INFO ] Deduced a trap composed of 21 places in 162 ms of which 2 ms to minimize.
[2022-05-20 07:38:55] [INFO ] Deduced a trap composed of 27 places in 115 ms of which 1 ms to minimize.
[2022-05-20 07:38:55] [INFO ] Deduced a trap composed of 27 places in 152 ms of which 1 ms to minimize.
[2022-05-20 07:38:55] [INFO ] Deduced a trap composed of 21 places in 119 ms of which 1 ms to minimize.
[2022-05-20 07:38:55] [INFO ] Deduced a trap composed of 17 places in 98 ms of which 1 ms to minimize.
[2022-05-20 07:38:56] [INFO ] Deduced a trap composed of 20 places in 103 ms of which 1 ms to minimize.
[2022-05-20 07:38:56] [INFO ] Deduced a trap composed of 26 places in 91 ms of which 1 ms to minimize.
[2022-05-20 07:38:56] [INFO ] Deduced a trap composed of 21 places in 94 ms of which 0 ms to minimize.
[2022-05-20 07:38:56] [INFO ] Deduced a trap composed of 39 places in 92 ms of which 0 ms to minimize.
[2022-05-20 07:38:56] [INFO ] Deduced a trap composed of 32 places in 84 ms of which 0 ms to minimize.
[2022-05-20 07:38:56] [INFO ] Deduced a trap composed of 28 places in 84 ms of which 0 ms to minimize.
[2022-05-20 07:38:56] [INFO ] Deduced a trap composed of 20 places in 78 ms of which 1 ms to minimize.
[2022-05-20 07:38:56] [INFO ] Deduced a trap composed of 27 places in 75 ms of which 1 ms to minimize.
[2022-05-20 07:38:56] [INFO ] Deduced a trap composed of 28 places in 76 ms of which 0 ms to minimize.
[2022-05-20 07:38:57] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 0 ms to minimize.
[2022-05-20 07:38:57] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 0 ms to minimize.
[2022-05-20 07:38:57] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 1 ms to minimize.
[2022-05-20 07:38:57] [INFO ] Deduced a trap composed of 25 places in 60 ms of which 1 ms to minimize.
[2022-05-20 07:38:57] [INFO ] Deduced a trap composed of 26 places in 72 ms of which 1 ms to minimize.
[2022-05-20 07:38:57] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 3057 ms
[2022-05-20 07:38:57] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 07:38:57] [INFO ] [Nat]Absence check using 91 positive place invariants in 32 ms returned sat
[2022-05-20 07:38:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 07:38:57] [INFO ] [Nat]Absence check using state equation in 181 ms returned sat
[2022-05-20 07:38:57] [INFO ] Deduced a trap composed of 24 places in 109 ms of which 0 ms to minimize.
[2022-05-20 07:38:58] [INFO ] Deduced a trap composed of 11 places in 97 ms of which 0 ms to minimize.
[2022-05-20 07:38:58] [INFO ] Deduced a trap composed of 31 places in 130 ms of which 0 ms to minimize.
[2022-05-20 07:38:58] [INFO ] Deduced a trap composed of 29 places in 110 ms of which 0 ms to minimize.
[2022-05-20 07:38:58] [INFO ] Deduced a trap composed of 18 places in 103 ms of which 0 ms to minimize.
[2022-05-20 07:38:58] [INFO ] Deduced a trap composed of 29 places in 93 ms of which 0 ms to minimize.
[2022-05-20 07:38:58] [INFO ] Deduced a trap composed of 10 places in 91 ms of which 0 ms to minimize.
[2022-05-20 07:38:58] [INFO ] Deduced a trap composed of 25 places in 86 ms of which 0 ms to minimize.
[2022-05-20 07:38:58] [INFO ] Deduced a trap composed of 19 places in 91 ms of which 1 ms to minimize.
[2022-05-20 07:38:59] [INFO ] Deduced a trap composed of 25 places in 93 ms of which 0 ms to minimize.
[2022-05-20 07:38:59] [INFO ] Deduced a trap composed of 21 places in 89 ms of which 1 ms to minimize.
[2022-05-20 07:38:59] [INFO ] Deduced a trap composed of 17 places in 98 ms of which 0 ms to minimize.
[2022-05-20 07:38:59] [INFO ] Deduced a trap composed of 16 places in 98 ms of which 2 ms to minimize.
[2022-05-20 07:38:59] [INFO ] Deduced a trap composed of 27 places in 95 ms of which 0 ms to minimize.
[2022-05-20 07:38:59] [INFO ] Deduced a trap composed of 17 places in 92 ms of which 0 ms to minimize.
[2022-05-20 07:38:59] [INFO ] Deduced a trap composed of 23 places in 88 ms of which 1 ms to minimize.
[2022-05-20 07:38:59] [INFO ] Deduced a trap composed of 26 places in 83 ms of which 0 ms to minimize.
[2022-05-20 07:38:59] [INFO ] Deduced a trap composed of 29 places in 89 ms of which 1 ms to minimize.
[2022-05-20 07:39:00] [INFO ] Deduced a trap composed of 30 places in 102 ms of which 0 ms to minimize.
[2022-05-20 07:39:00] [INFO ] Deduced a trap composed of 23 places in 80 ms of which 1 ms to minimize.
[2022-05-20 07:39:00] [INFO ] Deduced a trap composed of 19 places in 72 ms of which 1 ms to minimize.
[2022-05-20 07:39:00] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 1 ms to minimize.
[2022-05-20 07:39:00] [INFO ] Deduced a trap composed of 23 places in 81 ms of which 1 ms to minimize.
[2022-05-20 07:39:00] [INFO ] Deduced a trap composed of 16 places in 81 ms of which 0 ms to minimize.
[2022-05-20 07:39:00] [INFO ] Deduced a trap composed of 23 places in 87 ms of which 2 ms to minimize.
[2022-05-20 07:39:00] [INFO ] Deduced a trap composed of 31 places in 77 ms of which 1 ms to minimize.
[2022-05-20 07:39:00] [INFO ] Deduced a trap composed of 19 places in 81 ms of which 0 ms to minimize.
[2022-05-20 07:39:01] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 0 ms to minimize.
[2022-05-20 07:39:01] [INFO ] Deduced a trap composed of 19 places in 69 ms of which 1 ms to minimize.
[2022-05-20 07:39:01] [INFO ] Deduced a trap composed of 38 places in 68 ms of which 0 ms to minimize.
[2022-05-20 07:39:01] [INFO ] Deduced a trap composed of 26 places in 69 ms of which 1 ms to minimize.
[2022-05-20 07:39:01] [INFO ] Deduced a trap composed of 24 places in 66 ms of which 0 ms to minimize.
[2022-05-20 07:39:01] [INFO ] Deduced a trap composed of 28 places in 65 ms of which 0 ms to minimize.
[2022-05-20 07:39:01] [INFO ] Deduced a trap composed of 26 places in 67 ms of which 1 ms to minimize.
[2022-05-20 07:39:01] [INFO ] Deduced a trap composed of 31 places in 70 ms of which 3 ms to minimize.
[2022-05-20 07:39:01] [INFO ] Deduced a trap composed of 21 places in 68 ms of which 0 ms to minimize.
[2022-05-20 07:39:01] [INFO ] Deduced a trap composed of 38 places in 63 ms of which 0 ms to minimize.
[2022-05-20 07:39:01] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 1 ms to minimize.
[2022-05-20 07:39:02] [INFO ] Deduced a trap composed of 40 places in 59 ms of which 1 ms to minimize.
[2022-05-20 07:39:02] [INFO ] Trap strengthening (SAT) tested/added 40/39 trap constraints in 4299 ms
[2022-05-20 07:39:02] [INFO ] Computed and/alt/rep : 592/1243/592 causal constraints (skipped 0 transitions) in 44 ms.
[2022-05-20 07:39:02] [INFO ] Added : 45 causal constraints over 9 iterations in 406 ms. Result :unknown
[2022-05-20 07:39:02] [INFO ] [Real]Absence check using 91 positive place invariants in 29 ms returned sat
[2022-05-20 07:39:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 07:39:02] [INFO ] [Real]Absence check using state equation in 167 ms returned sat
[2022-05-20 07:39:02] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 07:39:02] [INFO ] [Nat]Absence check using 91 positive place invariants in 26 ms returned sat
[2022-05-20 07:39:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 07:39:03] [INFO ] [Nat]Absence check using state equation in 169 ms returned sat
[2022-05-20 07:39:03] [INFO ] Deduced a trap composed of 24 places in 102 ms of which 1 ms to minimize.
[2022-05-20 07:39:03] [INFO ] Deduced a trap composed of 18 places in 101 ms of which 0 ms to minimize.
[2022-05-20 07:39:03] [INFO ] Deduced a trap composed of 18 places in 99 ms of which 1 ms to minimize.
[2022-05-20 07:39:03] [INFO ] Deduced a trap composed of 29 places in 92 ms of which 0 ms to minimize.
[2022-05-20 07:39:03] [INFO ] Deduced a trap composed of 21 places in 106 ms of which 3 ms to minimize.
[2022-05-20 07:39:03] [INFO ] Deduced a trap composed of 24 places in 80 ms of which 0 ms to minimize.
[2022-05-20 07:39:03] [INFO ] Deduced a trap composed of 19 places in 74 ms of which 1 ms to minimize.
[2022-05-20 07:39:03] [INFO ] Deduced a trap composed of 18 places in 76 ms of which 0 ms to minimize.
[2022-05-20 07:39:04] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 1 ms to minimize.
[2022-05-20 07:39:04] [INFO ] Deduced a trap composed of 20 places in 85 ms of which 0 ms to minimize.
[2022-05-20 07:39:04] [INFO ] Deduced a trap composed of 24 places in 83 ms of which 0 ms to minimize.
[2022-05-20 07:39:04] [INFO ] Deduced a trap composed of 36 places in 84 ms of which 0 ms to minimize.
[2022-05-20 07:39:04] [INFO ] Deduced a trap composed of 28 places in 84 ms of which 0 ms to minimize.
[2022-05-20 07:39:04] [INFO ] Deduced a trap composed of 34 places in 83 ms of which 0 ms to minimize.
[2022-05-20 07:39:04] [INFO ] Deduced a trap composed of 22 places in 82 ms of which 0 ms to minimize.
[2022-05-20 07:39:04] [INFO ] Deduced a trap composed of 26 places in 76 ms of which 1 ms to minimize.
[2022-05-20 07:39:04] [INFO ] Deduced a trap composed of 21 places in 71 ms of which 1 ms to minimize.
[2022-05-20 07:39:05] [INFO ] Deduced a trap composed of 14 places in 81 ms of which 1 ms to minimize.
[2022-05-20 07:39:05] [INFO ] Deduced a trap composed of 18 places in 81 ms of which 0 ms to minimize.
[2022-05-20 07:39:05] [INFO ] Deduced a trap composed of 25 places in 74 ms of which 0 ms to minimize.
[2022-05-20 07:39:05] [INFO ] Deduced a trap composed of 26 places in 68 ms of which 1 ms to minimize.
[2022-05-20 07:39:05] [INFO ] Deduced a trap composed of 31 places in 68 ms of which 1 ms to minimize.
[2022-05-20 07:39:05] [INFO ] Deduced a trap composed of 29 places in 69 ms of which 0 ms to minimize.
[2022-05-20 07:39:05] [INFO ] Deduced a trap composed of 24 places in 66 ms of which 1 ms to minimize.
[2022-05-20 07:39:05] [INFO ] Deduced a trap composed of 22 places in 69 ms of which 0 ms to minimize.
[2022-05-20 07:39:05] [INFO ] Deduced a trap composed of 21 places in 63 ms of which 0 ms to minimize.
[2022-05-20 07:39:05] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 1 ms to minimize.
[2022-05-20 07:39:05] [INFO ] Deduced a trap composed of 27 places in 83 ms of which 1 ms to minimize.
[2022-05-20 07:39:06] [INFO ] Deduced a trap composed of 28 places in 82 ms of which 1 ms to minimize.
[2022-05-20 07:39:06] [INFO ] Deduced a trap composed of 30 places in 71 ms of which 0 ms to minimize.
[2022-05-20 07:39:06] [INFO ] Deduced a trap composed of 30 places in 61 ms of which 1 ms to minimize.
[2022-05-20 07:39:06] [INFO ] Deduced a trap composed of 22 places in 76 ms of which 1 ms to minimize.
[2022-05-20 07:39:06] [INFO ] Deduced a trap composed of 25 places in 89 ms of which 0 ms to minimize.
[2022-05-20 07:39:06] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 0 ms to minimize.
[2022-05-20 07:39:06] [INFO ] Deduced a trap composed of 28 places in 56 ms of which 1 ms to minimize.
[2022-05-20 07:39:06] [INFO ] Deduced a trap composed of 28 places in 59 ms of which 1 ms to minimize.
[2022-05-20 07:39:06] [INFO ] Deduced a trap composed of 30 places in 53 ms of which 1 ms to minimize.
[2022-05-20 07:39:06] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 1 ms to minimize.
[2022-05-20 07:39:06] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2022-05-20 07:39:07] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 0 ms to minimize.
[2022-05-20 07:39:07] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 0 ms to minimize.
[2022-05-20 07:39:07] [INFO ] Trap strengthening (SAT) tested/added 42/41 trap constraints in 4077 ms
[2022-05-20 07:39:07] [INFO ] Computed and/alt/rep : 592/1243/592 causal constraints (skipped 0 transitions) in 34 ms.
[2022-05-20 07:39:07] [INFO ] Deduced a trap composed of 25 places in 171 ms of which 1 ms to minimize.
[2022-05-20 07:39:07] [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 07:39:08] [INFO ] [Real]Absence check using 91 positive place invariants in 23 ms returned sat
[2022-05-20 07:39:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 07:39:08] [INFO ] [Real]Absence check using state equation in 161 ms returned sat
[2022-05-20 07:39:08] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 07:39:08] [INFO ] [Nat]Absence check using 91 positive place invariants in 26 ms returned sat
[2022-05-20 07:39:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 07:39:08] [INFO ] [Nat]Absence check using state equation in 174 ms returned sat
[2022-05-20 07:39:08] [INFO ] Deduced a trap composed of 29 places in 105 ms of which 0 ms to minimize.
[2022-05-20 07:39:08] [INFO ] Deduced a trap composed of 16 places in 101 ms of which 1 ms to minimize.
[2022-05-20 07:39:08] [INFO ] Deduced a trap composed of 15 places in 104 ms of which 1 ms to minimize.
[2022-05-20 07:39:09] [INFO ] Deduced a trap composed of 20 places in 96 ms of which 0 ms to minimize.
[2022-05-20 07:39:09] [INFO ] Deduced a trap composed of 19 places in 96 ms of which 1 ms to minimize.
[2022-05-20 07:39:09] [INFO ] Deduced a trap composed of 20 places in 90 ms of which 1 ms to minimize.
[2022-05-20 07:39:09] [INFO ] Deduced a trap composed of 25 places in 89 ms of which 0 ms to minimize.
[2022-05-20 07:39:09] [INFO ] Deduced a trap composed of 30 places in 84 ms of which 0 ms to minimize.
[2022-05-20 07:39:09] [INFO ] Deduced a trap composed of 42 places in 73 ms of which 0 ms to minimize.
[2022-05-20 07:39:09] [INFO ] Deduced a trap composed of 24 places in 72 ms of which 1 ms to minimize.
[2022-05-20 07:39:09] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 0 ms to minimize.
[2022-05-20 07:39:09] [INFO ] Deduced a trap composed of 30 places in 73 ms of which 0 ms to minimize.
[2022-05-20 07:39:09] [INFO ] Deduced a trap composed of 25 places in 75 ms of which 1 ms to minimize.
[2022-05-20 07:39:10] [INFO ] Deduced a trap composed of 30 places in 65 ms of which 0 ms to minimize.
[2022-05-20 07:39:10] [INFO ] Deduced a trap composed of 26 places in 91 ms of which 1 ms to minimize.
[2022-05-20 07:39:10] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 0 ms to minimize.
[2022-05-20 07:39:10] [INFO ] Deduced a trap composed of 26 places in 75 ms of which 0 ms to minimize.
[2022-05-20 07:39:10] [INFO ] Deduced a trap composed of 33 places in 75 ms of which 1 ms to minimize.
[2022-05-20 07:39:10] [INFO ] Deduced a trap composed of 20 places in 80 ms of which 1 ms to minimize.
[2022-05-20 07:39:10] [INFO ] Deduced a trap composed of 28 places in 74 ms of which 1 ms to minimize.
[2022-05-20 07:39:10] [INFO ] Deduced a trap composed of 32 places in 81 ms of which 0 ms to minimize.
[2022-05-20 07:39:10] [INFO ] Deduced a trap composed of 41 places in 66 ms of which 0 ms to minimize.
[2022-05-20 07:39:10] [INFO ] Deduced a trap composed of 40 places in 66 ms of which 0 ms to minimize.
[2022-05-20 07:39:11] [INFO ] Deduced a trap composed of 30 places in 71 ms of which 0 ms to minimize.
[2022-05-20 07:39:11] [INFO ] Deduced a trap composed of 40 places in 66 ms of which 0 ms to minimize.
[2022-05-20 07:39:11] [INFO ] Deduced a trap composed of 32 places in 66 ms of which 0 ms to minimize.
[2022-05-20 07:39:11] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 0 ms to minimize.
[2022-05-20 07:39:11] [INFO ] Deduced a trap composed of 29 places in 66 ms of which 1 ms to minimize.
[2022-05-20 07:39:11] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 0 ms to minimize.
[2022-05-20 07:39:11] [INFO ] Deduced a trap composed of 32 places in 67 ms of which 1 ms to minimize.
[2022-05-20 07:39:11] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 1 ms to minimize.
[2022-05-20 07:39:11] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 0 ms to minimize.
[2022-05-20 07:39:11] [INFO ] Deduced a trap composed of 34 places in 67 ms of which 0 ms to minimize.
[2022-05-20 07:39:11] [INFO ] Deduced a trap composed of 42 places in 61 ms of which 0 ms to minimize.
[2022-05-20 07:39:11] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 1 ms to minimize.
[2022-05-20 07:39:12] [INFO ] Deduced a trap composed of 31 places in 50 ms of which 1 ms to minimize.
[2022-05-20 07:39:12] [INFO ] Deduced a trap composed of 27 places in 48 ms of which 1 ms to minimize.
[2022-05-20 07:39:12] [INFO ] Trap strengthening (SAT) tested/added 38/37 trap constraints in 3548 ms
[2022-05-20 07:39:12] [INFO ] Computed and/alt/rep : 592/1243/592 causal constraints (skipped 0 transitions) in 28 ms.
[2022-05-20 07:39: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: Broken pipe ... while checking expression at index 2
Fused 3 Parikh solutions to 2 different solutions.
Incomplete Parikh walk after 108100 steps, including 634 resets, run finished after 273 ms. (steps per millisecond=395 ) properties (out of 3) seen :0 could not realise parikh vector
Support contains 3 out of 603 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 603/603 places, 593/593 transitions.
Drop transitions removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 51 place count 603 transition count 542
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 1 with 51 rules applied. Total rules applied 102 place count 552 transition count 542
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 51 Pre rules applied. Total rules applied 102 place count 552 transition count 491
Deduced a syphon composed of 51 places in 5 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 102 rules applied. Total rules applied 204 place count 501 transition count 491
Discarding 67 places :
Symmetric choice reduction at 2 with 67 rule applications. Total rules 271 place count 434 transition count 424
Iterating global reduction 2 with 67 rules applied. Total rules applied 338 place count 434 transition count 424
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 30 Pre rules applied. Total rules applied 338 place count 434 transition count 394
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 398 place count 404 transition count 394
Performed 150 Post agglomeration using F-continuation condition.Transition count delta: 150
Deduced a syphon composed of 150 places in 1 ms
Reduce places removed 150 places and 0 transitions.
Iterating global reduction 2 with 300 rules applied. Total rules applied 698 place count 254 transition count 244
Partial Free-agglomeration rule applied 68 times.
Drop transitions removed 68 transitions
Iterating global reduction 2 with 68 rules applied. Total rules applied 766 place count 254 transition count 244
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 767 place count 253 transition count 243
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 768 place count 252 transition count 243
Applied a total of 768 rules in 157 ms. Remains 252 /603 variables (removed 351) and now considering 243/593 (removed 350) transitions.
Finished structural reductions, in 1 iterations. Remains : 252/603 places, 243/593 transitions.
[2022-05-20 07:39:14] [INFO ] Flatten gal took : 185 ms
[2022-05-20 07:39:14] [INFO ] Flatten gal took : 37 ms
[2022-05-20 07:39:14] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12874440673100448057.gal : 34 ms
[2022-05-20 07:39:14] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16213233075341184697.prop : 0 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/ReachabilityCardinality12874440673100448057.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality16213233075341184697.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/ReachabilityCardinality12874440673100448057.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality16213233075341184697.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality16213233075341184697.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :19 after 31
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :31 after 77
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :77 after 231
Invariant property smplace_65 does not hold.
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :231 after 1888
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :1888 after 2304
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :2304 after 3285
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :3285 after 38421
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :38421 after 233473
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :233473 after 6.21806e+06
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :6.21806e+06 after 1.47502e+08
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :1.47502e+08 after 1.48348e+10
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :1.48348e+10 after 3.40755e+10
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :3.40755e+10 after 1.01653e+12
Detected timeout of ITS tools.
[2022-05-20 07:39:29] [INFO ] Flatten gal took : 19 ms
[2022-05-20 07:39:29] [INFO ] Applying decomposition
[2022-05-20 07:39:29] [INFO ] Flatten gal took : 18 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph2261851560491846367.txt, -o, /tmp/graph2261851560491846367.bin, -w, /tmp/graph2261851560491846367.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/graph2261851560491846367.bin, -l, -1, -v, -w, /tmp/graph2261851560491846367.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-05-20 07:39:29] [INFO ] Decomposing Gal with order
[2022-05-20 07:39:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 07:39:29] [INFO ] Removed a total of 197 redundant transitions.
[2022-05-20 07:39:29] [INFO ] Flatten gal took : 71 ms
[2022-05-20 07:39:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 233 labels/synchronizations in 38 ms.
[2022-05-20 07:39:29] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality229427514611853512.gal : 12 ms
[2022-05-20 07:39:29] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14828519576274957791.prop : 0 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/ReachabilityCardinality229427514611853512.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality14828519576274957791.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/ReachabilityCardinality229427514611853512.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality14828519576274957791.prop --nowitness
Loading property file /tmp/ReachabilityCardinality14828519576274957791.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :252 after 414
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :414 after 87624
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :87624 after 1.27903e+12
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10276158232773803223
[2022-05-20 07:39:44] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10276158232773803223
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin10276158232773803223]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin10276158232773803223] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin10276158232773803223] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Finished random walk after 1960 steps, including 0 resets, run visited all 2 properties in 14 ms. (steps per millisecond=140 )
Able to resolve query StableMarking after proving 332 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK MARKED_SUFFIX_TEST DECISION_DIAGRAMS COLLATERAL_PROCESSING TOPOLOGICAL

BK_STOP 1653032387135

--------------------
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="ShieldIIPs-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 ShieldIIPs-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-165286037700058"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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