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

About the Execution of 2021-gold for ShieldPPPs-PT-100A

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1166.932 106304.00 138881.00 603.00 TTTTFTFFTTFTTTTT normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r233-tall-165286037300195.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 ShieldPPPs-PT-100A, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r233-tall-165286037300195
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 6.5K Apr 30 03:39 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Apr 30 03:39 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Apr 30 03:32 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K Apr 30 03:32 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 9 08:53 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 9 08:53 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 08:53 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 9 08:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 30 04:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 158K Apr 30 04:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Apr 30 03:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 45K Apr 30 03:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 08:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:53 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 907K 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 ShieldPPPs-PT-100A-ReachabilityFireability-00
FORMULA_NAME ShieldPPPs-PT-100A-ReachabilityFireability-01
FORMULA_NAME ShieldPPPs-PT-100A-ReachabilityFireability-02
FORMULA_NAME ShieldPPPs-PT-100A-ReachabilityFireability-03
FORMULA_NAME ShieldPPPs-PT-100A-ReachabilityFireability-04
FORMULA_NAME ShieldPPPs-PT-100A-ReachabilityFireability-05
FORMULA_NAME ShieldPPPs-PT-100A-ReachabilityFireability-06
FORMULA_NAME ShieldPPPs-PT-100A-ReachabilityFireability-07
FORMULA_NAME ShieldPPPs-PT-100A-ReachabilityFireability-08
FORMULA_NAME ShieldPPPs-PT-100A-ReachabilityFireability-09
FORMULA_NAME ShieldPPPs-PT-100A-ReachabilityFireability-10
FORMULA_NAME ShieldPPPs-PT-100A-ReachabilityFireability-11
FORMULA_NAME ShieldPPPs-PT-100A-ReachabilityFireability-12
FORMULA_NAME ShieldPPPs-PT-100A-ReachabilityFireability-13
FORMULA_NAME ShieldPPPs-PT-100A-ReachabilityFireability-14
FORMULA_NAME ShieldPPPs-PT-100A-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1655073138870

Running Version 0
[2022-06-12 22:32:20] [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-12 22:32:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-12 22:32:20] [INFO ] Load time of PNML (sax parser for PT used): 180 ms
[2022-06-12 22:32:20] [INFO ] Transformed 3103 places.
[2022-06-12 22:32:20] [INFO ] Transformed 2603 transitions.
[2022-06-12 22:32:20] [INFO ] Found NUPN structural information;
[2022-06-12 22:32:20] [INFO ] Parsed PT model containing 3103 places and 2603 transitions in 358 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 261 ms. (steps per millisecond=38 ) properties (out of 16) seen :9
FORMULA ShieldPPPs-PT-100A-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-100A-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-100A-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-100A-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-100A-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-100A-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-100A-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-100A-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-100A-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 148 ms. (steps per millisecond=67 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 2603 rows 3103 cols
[2022-06-12 22:32:22] [INFO ] Computed 1101 place invariants in 32 ms
[2022-06-12 22:32:23] [INFO ] [Real]Absence check using 1101 positive place invariants in 267 ms returned sat
[2022-06-12 22:32:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:32:24] [INFO ] [Real]Absence check using state equation in 1197 ms returned sat
[2022-06-12 22:32:24] [INFO ] Deduced a trap composed of 18 places in 225 ms of which 5 ms to minimize.
[2022-06-12 22:32:24] [INFO ] Deduced a trap composed of 18 places in 180 ms of which 1 ms to minimize.
[2022-06-12 22:32:25] [INFO ] Deduced a trap composed of 18 places in 121 ms of which 1 ms to minimize.
[2022-06-12 22:32:25] [INFO ] Deduced a trap composed of 24 places in 103 ms of which 1 ms to minimize.
[2022-06-12 22:32:25] [INFO ] Deduced a trap composed of 18 places in 66 ms of which 1 ms to minimize.
[2022-06-12 22:32:25] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 0 ms to minimize.
[2022-06-12 22:32:25] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 1 ms to minimize.
[2022-06-12 22:32:26] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2022-06-12 22:32:26] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1807 ms
[2022-06-12 22:32:26] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:32:26] [INFO ] [Nat]Absence check using 1101 positive place invariants in 254 ms returned sat
[2022-06-12 22:32:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:32:28] [INFO ] [Nat]Absence check using state equation in 1277 ms returned sat
[2022-06-12 22:32:28] [INFO ] Deduced a trap composed of 18 places in 128 ms of which 1 ms to minimize.
[2022-06-12 22:32:28] [INFO ] Deduced a trap composed of 18 places in 137 ms of which 0 ms to minimize.
[2022-06-12 22:32:28] [INFO ] Deduced a trap composed of 18 places in 102 ms of which 1 ms to minimize.
[2022-06-12 22:32:29] [INFO ] Deduced a trap composed of 24 places in 123 ms of which 1 ms to minimize.
[2022-06-12 22:32:29] [INFO ] Deduced a trap composed of 24 places in 75 ms of which 1 ms to minimize.
[2022-06-12 22:32:29] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 0 ms to minimize.
[2022-06-12 22:32:29] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 1 ms to minimize.
[2022-06-12 22:32:29] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 0 ms to minimize.
[2022-06-12 22:32:29] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1615 ms
[2022-06-12 22:32:29] [INFO ] Computed and/alt/rep : 2602/7203/2602 causal constraints (skipped 0 transitions) in 129 ms.
[2022-06-12 22:32:31] [INFO ] Added : 50 causal constraints over 10 iterations in 1460 ms. Result :unknown
[2022-06-12 22:32:31] [INFO ] [Real]Absence check using 1101 positive place invariants in 331 ms returned sat
[2022-06-12 22:32:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:32:34] [INFO ] [Real]Absence check using state equation in 2370 ms returned sat
[2022-06-12 22:32:34] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:32:35] [INFO ] [Nat]Absence check using 1101 positive place invariants in 347 ms returned sat
[2022-06-12 22:32:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:32:38] [INFO ] [Nat]Absence check using state equation in 3469 ms returned sat
[2022-06-12 22:32:38] [INFO ] Deduced a trap composed of 18 places in 86 ms of which 0 ms to minimize.
[2022-06-12 22:32:39] [INFO ] Deduced a trap composed of 18 places in 69 ms of which 0 ms to minimize.
[2022-06-12 22:32:39] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 0 ms to minimize.
[2022-06-12 22:32:39] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 1 ms to minimize.
[2022-06-12 22:32:39] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2022-06-12 22:32:39] [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-06-12 22:32:40] [INFO ] [Real]Absence check using 1101 positive place invariants in 257 ms returned sat
[2022-06-12 22:32:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:32:41] [INFO ] [Real]Absence check using state equation in 1241 ms returned sat
[2022-06-12 22:32:41] [INFO ] Deduced a trap composed of 11 places in 91 ms of which 0 ms to minimize.
[2022-06-12 22:32:41] [INFO ] Deduced a trap composed of 20 places in 97 ms of which 0 ms to minimize.
[2022-06-12 22:32:42] [INFO ] Deduced a trap composed of 24 places in 93 ms of which 0 ms to minimize.
[2022-06-12 22:32:42] [INFO ] Deduced a trap composed of 11 places in 72 ms of which 0 ms to minimize.
[2022-06-12 22:32:42] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 0 ms to minimize.
[2022-06-12 22:32:42] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 0 ms to minimize.
[2022-06-12 22:32:42] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 1 ms to minimize.
[2022-06-12 22:32:42] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 0 ms to minimize.
[2022-06-12 22:32:42] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 1 ms to minimize.
[2022-06-12 22:32:43] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 0 ms to minimize.
[2022-06-12 22:32:43] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1702 ms
[2022-06-12 22:32:43] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:32:43] [INFO ] [Nat]Absence check using 1101 positive place invariants in 259 ms returned sat
[2022-06-12 22:32:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:32:45] [INFO ] [Nat]Absence check using state equation in 1273 ms returned sat
[2022-06-12 22:32:45] [INFO ] Deduced a trap composed of 18 places in 206 ms of which 1 ms to minimize.
[2022-06-12 22:32:45] [INFO ] Deduced a trap composed of 11 places in 191 ms of which 1 ms to minimize.
[2022-06-12 22:32:46] [INFO ] Deduced a trap composed of 51 places in 209 ms of which 4 ms to minimize.
[2022-06-12 22:32:46] [INFO ] Deduced a trap composed of 18 places in 219 ms of which 1 ms to minimize.
[2022-06-12 22:32:46] [INFO ] Deduced a trap composed of 18 places in 204 ms of which 1 ms to minimize.
[2022-06-12 22:32:46] [INFO ] Deduced a trap composed of 18 places in 188 ms of which 1 ms to minimize.
[2022-06-12 22:32:47] [INFO ] Deduced a trap composed of 35 places in 175 ms of which 1 ms to minimize.
[2022-06-12 22:32:47] [INFO ] Deduced a trap composed of 24 places in 155 ms of which 0 ms to minimize.
[2022-06-12 22:32:47] [INFO ] Deduced a trap composed of 35 places in 149 ms of which 1 ms to minimize.
[2022-06-12 22:32:47] [INFO ] Deduced a trap composed of 13 places in 147 ms of which 1 ms to minimize.
[2022-06-12 22:32:48] [INFO ] Deduced a trap composed of 18 places in 132 ms of which 1 ms to minimize.
[2022-06-12 22:32:48] [INFO ] Deduced a trap composed of 20 places in 117 ms of which 1 ms to minimize.
[2022-06-12 22:32:48] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
[2022-06-12 22:32:49] [INFO ] [Real]Absence check using 1101 positive place invariants in 262 ms returned sat
[2022-06-12 22:32:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:32:50] [INFO ] [Real]Absence check using state equation in 1358 ms returned sat
[2022-06-12 22:32:50] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:32:51] [INFO ] [Nat]Absence check using 1101 positive place invariants in 263 ms returned sat
[2022-06-12 22:32:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:32:52] [INFO ] [Nat]Absence check using state equation in 1381 ms returned sat
[2022-06-12 22:32:52] [INFO ] Deduced a trap composed of 24 places in 106 ms of which 1 ms to minimize.
[2022-06-12 22:32:52] [INFO ] Deduced a trap composed of 32 places in 112 ms of which 0 ms to minimize.
[2022-06-12 22:32:53] [INFO ] Deduced a trap composed of 18 places in 88 ms of which 0 ms to minimize.
[2022-06-12 22:32:53] [INFO ] Deduced a trap composed of 18 places in 89 ms of which 0 ms to minimize.
[2022-06-12 22:32:53] [INFO ] Deduced a trap composed of 18 places in 81 ms of which 1 ms to minimize.
[2022-06-12 22:32:53] [INFO ] Deduced a trap composed of 29 places in 69 ms of which 0 ms to minimize.
[2022-06-12 22:32:53] [INFO ] Deduced a trap composed of 18 places in 65 ms of which 1 ms to minimize.
[2022-06-12 22:32:53] [INFO ] Deduced a trap composed of 29 places in 68 ms of which 1 ms to minimize.
[2022-06-12 22:32:54] [INFO ] Deduced a trap composed of 42 places in 56 ms of which 0 ms to minimize.
[2022-06-12 22:32:54] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 1 ms to minimize.
[2022-06-12 22:32:54] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1804 ms
[2022-06-12 22:32:54] [INFO ] Computed and/alt/rep : 2602/7203/2602 causal constraints (skipped 0 transitions) in 135 ms.
[2022-06-12 22:32:55] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 3
[2022-06-12 22:32:56] [INFO ] [Real]Absence check using 1101 positive place invariants in 267 ms returned sat
[2022-06-12 22:32:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:32:57] [INFO ] [Real]Absence check using state equation in 1287 ms returned sat
[2022-06-12 22:32:57] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:32:58] [INFO ] [Nat]Absence check using 1101 positive place invariants in 266 ms returned sat
[2022-06-12 22:32:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:32:59] [INFO ] [Nat]Absence check using state equation in 1363 ms returned sat
[2022-06-12 22:32:59] [INFO ] Deduced a trap composed of 11 places in 196 ms of which 1 ms to minimize.
[2022-06-12 22:33:00] [INFO ] Deduced a trap composed of 18 places in 200 ms of which 1 ms to minimize.
[2022-06-12 22:33:00] [INFO ] Deduced a trap composed of 18 places in 210 ms of which 9 ms to minimize.
[2022-06-12 22:33:00] [INFO ] Deduced a trap composed of 20 places in 183 ms of which 0 ms to minimize.
[2022-06-12 22:33:01] [INFO ] Deduced a trap composed of 23 places in 167 ms of which 1 ms to minimize.
[2022-06-12 22:33:01] [INFO ] Deduced a trap composed of 20 places in 161 ms of which 1 ms to minimize.
[2022-06-12 22:33:01] [INFO ] Deduced a trap composed of 18 places in 155 ms of which 0 ms to minimize.
[2022-06-12 22:33:01] [INFO ] Deduced a trap composed of 18 places in 149 ms of which 1 ms to minimize.
[2022-06-12 22:33:02] [INFO ] Deduced a trap composed of 18 places in 156 ms of which 1 ms to minimize.
[2022-06-12 22:33:02] [INFO ] Deduced a trap composed of 20 places in 145 ms of which 0 ms to minimize.
[2022-06-12 22:33:02] [INFO ] Deduced a trap composed of 18 places in 96 ms of which 0 ms to minimize.
[2022-06-12 22:33:02] [INFO ] Deduced a trap composed of 18 places in 98 ms of which 0 ms to minimize.
[2022-06-12 22:33:02] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 4
[2022-06-12 22:33:03] [INFO ] [Real]Absence check using 1101 positive place invariants in 267 ms returned sat
[2022-06-12 22:33:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:33:04] [INFO ] [Real]Absence check using state equation in 1326 ms returned sat
[2022-06-12 22:33:05] [INFO ] Deduced a trap composed of 18 places in 118 ms of which 0 ms to minimize.
[2022-06-12 22:33:05] [INFO ] Deduced a trap composed of 24 places in 146 ms of which 2 ms to minimize.
[2022-06-12 22:33:05] [INFO ] Deduced a trap composed of 20 places in 96 ms of which 3 ms to minimize.
[2022-06-12 22:33:05] [INFO ] Deduced a trap composed of 18 places in 101 ms of which 10 ms to minimize.
[2022-06-12 22:33:05] [INFO ] Deduced a trap composed of 18 places in 119 ms of which 2 ms to minimize.
[2022-06-12 22:33:06] [INFO ] Deduced a trap composed of 11 places in 94 ms of which 0 ms to minimize.
[2022-06-12 22:33:06] [INFO ] Deduced a trap composed of 18 places in 90 ms of which 0 ms to minimize.
[2022-06-12 22:33:06] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 0 ms to minimize.
[2022-06-12 22:33:06] [INFO ] Deduced a trap composed of 30 places in 50 ms of which 1 ms to minimize.
[2022-06-12 22:33:06] [INFO ] Deduced a trap composed of 30 places in 50 ms of which 0 ms to minimize.
[2022-06-12 22:33:06] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2012 ms
[2022-06-12 22:33:06] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:33:07] [INFO ] [Nat]Absence check using 1101 positive place invariants in 272 ms returned sat
[2022-06-12 22:33:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:33:09] [INFO ] [Nat]Absence check using state equation in 1342 ms returned sat
[2022-06-12 22:33:09] [INFO ] Deduced a trap composed of 18 places in 116 ms of which 1 ms to minimize.
[2022-06-12 22:33:09] [INFO ] Deduced a trap composed of 24 places in 103 ms of which 0 ms to minimize.
[2022-06-12 22:33:09] [INFO ] Deduced a trap composed of 20 places in 81 ms of which 0 ms to minimize.
[2022-06-12 22:33:09] [INFO ] Deduced a trap composed of 18 places in 72 ms of which 0 ms to minimize.
[2022-06-12 22:33:09] [INFO ] Deduced a trap composed of 18 places in 66 ms of which 0 ms to minimize.
[2022-06-12 22:33:10] [INFO ] Deduced a trap composed of 11 places in 56 ms of which 1 ms to minimize.
[2022-06-12 22:33:10] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 1 ms to minimize.
[2022-06-12 22:33:10] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 1 ms to minimize.
[2022-06-12 22:33:10] [INFO ] Deduced a trap composed of 30 places in 56 ms of which 0 ms to minimize.
[2022-06-12 22:33:10] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 0 ms to minimize.
[2022-06-12 22:33:10] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1757 ms
[2022-06-12 22:33:10] [INFO ] Computed and/alt/rep : 2602/7203/2602 causal constraints (skipped 0 transitions) in 157 ms.
[2022-06-12 22:33:12] [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 5
[2022-06-12 22:33:12] [INFO ] [Real]Absence check using 1101 positive place invariants in 321 ms returned sat
[2022-06-12 22:33:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:33:15] [INFO ] [Real]Absence check using state equation in 2671 ms returned sat
[2022-06-12 22:33:15] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:33:16] [INFO ] [Nat]Absence check using 1101 positive place invariants in 351 ms returned sat
[2022-06-12 22:33:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:33:19] [INFO ] [Nat]Absence check using state equation in 3071 ms returned sat
[2022-06-12 22:33:19] [INFO ] Deduced a trap composed of 20 places in 116 ms of which 0 ms to minimize.
[2022-06-12 22:33:19] [INFO ] Deduced a trap composed of 24 places in 113 ms of which 1 ms to minimize.
[2022-06-12 22:33:19] [INFO ] Deduced a trap composed of 18 places in 85 ms of which 0 ms to minimize.
[2022-06-12 22:33:20] [INFO ] Deduced a trap composed of 18 places in 91 ms of which 0 ms to minimize.
[2022-06-12 22:33:20] [INFO ] Deduced a trap composed of 20 places in 73 ms of which 1 ms to minimize.
[2022-06-12 22:33:20] [INFO ] Deduced a trap composed of 18 places in 70 ms of which 1 ms to minimize.
[2022-06-12 22:33:20] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 0 ms to minimize.
[2022-06-12 22:33:20] [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 2 different solutions.
Incomplete Parikh walk after 136800 steps, including 866 resets, run finished after 2155 ms. (steps per millisecond=63 ) properties (out of 7) seen :3 could not realise parikh vector
FORMULA ShieldPPPs-PT-100A-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldPPPs-PT-100A-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldPPPs-PT-100A-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 62 out of 3103 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3103/3103 places, 2603/2603 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 13 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 3101 transition count 2601
Partial Free-agglomeration rule applied 866 times.
Drop transitions removed 866 transitions
Iterating global reduction 0 with 866 rules applied. Total rules applied 870 place count 3101 transition count 2601
Applied a total of 870 rules in 1206 ms. Remains 3101 /3103 variables (removed 2) and now considering 2601/2603 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 3101/3103 places, 2601/2603 transitions.
[2022-06-12 22:33:24] [INFO ] Flatten gal took : 367 ms
[2022-06-12 22:33:24] [INFO ] Flatten gal took : 290 ms
[2022-06-12 22:33:24] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12878739981454249219.gal : 61 ms
[2022-06-12 22:33:24] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17168488208950349126.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/ReachabilityCardinality12878739981454249219.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality17168488208950349126.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/ReachabilityCardinality12878739981454249219.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality17168488208950349126.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality17168488208950349126.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :2 after 5
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :36 after 69
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :69 after 134
Invariant property ShieldPPPs-PT-100A-ReachabilityFireability-06 does not hold.
FORMULA ShieldPPPs-PT-100A-ReachabilityFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :134 after 302
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :302 after 836
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :836 after 68294
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :68294 after 280882
SDD proceeding with computation,3 properties remain. new max is 2048
SDD size :280882 after 1.58705e+06
SDD proceeding with computation,3 properties remain. new max is 4096
SDD size :1.58705e+06 after 6.74858e+08
SDD proceeding with computation,3 properties remain. new max is 8192
SDD size :6.74858e+08 after 2.53693e+09
Detected timeout of ITS tools.
[2022-06-12 22:33:40] [INFO ] Flatten gal took : 181 ms
[2022-06-12 22:33:40] [INFO ] Applying decomposition
[2022-06-12 22:33:40] [INFO ] Flatten gal took : 151 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/graph9293519188664715450.txt, -o, /tmp/graph9293519188664715450.bin, -w, /tmp/graph9293519188664715450.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/graph9293519188664715450.bin, -l, -1, -v, -w, /tmp/graph9293519188664715450.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-12 22:33:40] [INFO ] Decomposing Gal with order
[2022-06-12 22:33:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-12 22:33:41] [INFO ] Removed a total of 1456 redundant transitions.
[2022-06-12 22:33:41] [INFO ] Flatten gal took : 320 ms
[2022-06-12 22:33:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 2266 labels/synchronizations in 450 ms.
[2022-06-12 22:33:42] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4664928524561868681.gal : 36 ms
[2022-06-12 22:33:42] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11461597909526457671.prop : 74 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/ReachabilityCardinality4664928524561868681.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality11461597909526457671.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/ReachabilityCardinality4664928524561868681.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality11461597909526457671.prop --nowitness
Loading property file /tmp/ReachabilityCardinality11461597909526457671.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :4 after 4
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :4 after 4
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :4 after 4
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :4 after 4
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :4 after 4
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin919681362766726636
[2022-06-12 22:33:57] [INFO ] Built C files in 57ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin919681362766726636
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/ltsmin919681362766726636]
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/ltsmin919681362766726636] 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/ltsmin919681362766726636] 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 299800 steps, including 21 resets, run visited all 3 properties in 5822 ms. (steps per millisecond=51 )
FORMULA ShieldPPPs-PT-100A-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-100A-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-100A-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.

BK_STOP 1655073245174

--------------------
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="ShieldPPPs-PT-100A"
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 ShieldPPPs-PT-100A, 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-165286037300195"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPs-PT-100A.tgz
mv ShieldPPPs-PT-100A 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 ;