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-165286037000063.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-100A, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r233-tall-165286037000063
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 6.7K Apr 29 15:33 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Apr 29 15:33 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Apr 29 15:25 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Apr 29 15:25 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.6K May 9 08:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 08:49 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 08:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 08:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Apr 29 16:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 178K Apr 29 16:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Apr 29 15:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 33K Apr 29 15:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 08:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:49 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 868K 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 ShieldIIPs-PT-100A-ReachabilityFireability-00
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityFireability-01
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityFireability-02
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityFireability-03
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityFireability-04
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityFireability-05
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityFireability-06
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityFireability-07
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityFireability-08
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityFireability-09
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityFireability-10
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityFireability-11
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityFireability-12
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityFireability-13
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityFireability-14
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1655068860988

Running Version 0
[2022-06-12 21:21:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-12 21:21:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-12 21:21:02] [INFO ] Load time of PNML (sax parser for PT used): 253 ms
[2022-06-12 21:21:02] [INFO ] Transformed 2503 places.
[2022-06-12 21:21:02] [INFO ] Transformed 2403 transitions.
[2022-06-12 21:21:02] [INFO ] Found NUPN structural information;
[2022-06-12 21:21:02] [INFO ] Parsed PT model containing 2503 places and 2403 transitions in 351 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 222 ms. (steps per millisecond=45 ) properties (out of 16) seen :10
FORMULA ShieldIIPs-PT-100A-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100A-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100A-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100A-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100A-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100A-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100A-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100A-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100A-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100A-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 147 ms. (steps per millisecond=68 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 153 ms. (steps per millisecond=65 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 137 ms. (steps per millisecond=73 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 2403 rows 2503 cols
[2022-06-12 21:21:04] [INFO ] Computed 901 place invariants in 44 ms
[2022-06-12 21:21:04] [INFO ] [Real]Absence check using 901 positive place invariants in 210 ms returned sat
[2022-06-12 21:21:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:21:05] [INFO ] [Real]Absence check using state equation in 1067 ms returned sat
[2022-06-12 21:21:06] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:21:06] [INFO ] [Nat]Absence check using 901 positive place invariants in 194 ms returned sat
[2022-06-12 21:21:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:21:07] [INFO ] [Nat]Absence check using state equation in 1250 ms returned sat
[2022-06-12 21:21:08] [INFO ] Deduced a trap composed of 9 places in 154 ms of which 3 ms to minimize.
[2022-06-12 21:21:08] [INFO ] Deduced a trap composed of 9 places in 100 ms of which 1 ms to minimize.
[2022-06-12 21:21:08] [INFO ] Deduced a trap composed of 18 places in 112 ms of which 1 ms to minimize.
[2022-06-12 21:21:08] [INFO ] Deduced a trap composed of 13 places in 96 ms of which 2 ms to minimize.
[2022-06-12 21:21:08] [INFO ] Deduced a trap composed of 11 places in 60 ms of which 1 ms to minimize.
[2022-06-12 21:21:08] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 1 ms to minimize.
[2022-06-12 21:21:09] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 0 ms to minimize.
[2022-06-12 21:21:09] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
[2022-06-12 21:21:09] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 0 ms to minimize.
[2022-06-12 21:21:09] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 0 ms to minimize.
[2022-06-12 21:21:09] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 0 ms to minimize.
[2022-06-12 21:21:09] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1902 ms
[2022-06-12 21:21:09] [INFO ] Computed and/alt/rep : 2204/7623/2204 causal constraints (skipped 198 transitions) in 168 ms.
[2022-06-12 21:21:11] [INFO ] Added : 45 causal constraints over 9 iterations in 1314 ms. Result :unknown
[2022-06-12 21:21:11] [INFO ] [Real]Absence check using 901 positive place invariants in 203 ms returned sat
[2022-06-12 21:21:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:21:12] [INFO ] [Real]Absence check using state equation in 1071 ms returned sat
[2022-06-12 21:21:12] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:21:13] [INFO ] [Nat]Absence check using 901 positive place invariants in 199 ms returned sat
[2022-06-12 21:21:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:21:14] [INFO ] [Nat]Absence check using state equation in 1048 ms returned sat
[2022-06-12 21:21:14] [INFO ] Computed and/alt/rep : 2204/7623/2204 causal constraints (skipped 198 transitions) in 159 ms.
[2022-06-12 21:21:19] [INFO ] Deduced a trap composed of 3 places in 1835 ms of which 4 ms to minimize.
[2022-06-12 21:21:19] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
[2022-06-12 21:21:20] [INFO ] [Real]Absence check using 901 positive place invariants in 220 ms returned sat
[2022-06-12 21:21:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:21:21] [INFO ] [Real]Absence check using state equation in 1681 ms returned sat
[2022-06-12 21:21:22] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:21:22] [INFO ] [Nat]Absence check using 901 positive place invariants in 233 ms returned sat
[2022-06-12 21:21:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:21:24] [INFO ] [Nat]Absence check using state equation in 2049 ms returned sat
[2022-06-12 21:21:24] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
[2022-06-12 21:21:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 215 ms
[2022-06-12 21:21:25] [INFO ] Computed and/alt/rep : 2204/7623/2204 causal constraints (skipped 198 transitions) in 176 ms.
[2022-06-12 21:21:27] [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
[2022-06-12 21:21:27] [INFO ] [Real]Absence check using 901 positive place invariants in 202 ms returned sat
[2022-06-12 21:21:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:21:28] [INFO ] [Real]Absence check using state equation in 1144 ms returned sat
[2022-06-12 21:21:28] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:21:29] [INFO ] [Nat]Absence check using 901 positive place invariants in 236 ms returned sat
[2022-06-12 21:21:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:21:31] [INFO ] [Nat]Absence check using state equation in 2169 ms returned sat
[2022-06-12 21:21:31] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2022-06-12 21:21:31] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
[2022-06-12 21:21:31] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 312 ms
[2022-06-12 21:21:31] [INFO ] Computed and/alt/rep : 2204/7623/2204 causal constraints (skipped 198 transitions) in 129 ms.
[2022-06-12 21:21:33] [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 21:21:34] [INFO ] [Real]Absence check using 901 positive place invariants in 202 ms returned sat
[2022-06-12 21:21:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:21:35] [INFO ] [Real]Absence check using state equation in 1059 ms returned sat
[2022-06-12 21:21:35] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:21:36] [INFO ] [Nat]Absence check using 901 positive place invariants in 206 ms returned sat
[2022-06-12 21:21:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:21:37] [INFO ] [Nat]Absence check using state equation in 1070 ms returned sat
[2022-06-12 21:21:37] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 0 ms to minimize.
[2022-06-12 21:21:37] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 0 ms to minimize.
[2022-06-12 21:21:37] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 0 ms to minimize.
[2022-06-12 21:21:37] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 0 ms to minimize.
[2022-06-12 21:21:37] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 534 ms
[2022-06-12 21:21:37] [INFO ] Computed and/alt/rep : 2204/7623/2204 causal constraints (skipped 198 transitions) in 126 ms.
[2022-06-12 21:21:40] [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 21:21:41] [INFO ] [Real]Absence check using 901 positive place invariants in 204 ms returned sat
[2022-06-12 21:21:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:21:42] [INFO ] [Real]Absence check using state equation in 1080 ms returned sat
[2022-06-12 21:21:42] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:21:42] [INFO ] [Nat]Absence check using 901 positive place invariants in 202 ms returned sat
[2022-06-12 21:21:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:21:44] [INFO ] [Nat]Absence check using state equation in 1578 ms returned sat
[2022-06-12 21:21:44] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 0 ms to minimize.
[2022-06-12 21:21:44] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 0 ms to minimize.
[2022-06-12 21:21:44] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 1 ms to minimize.
[2022-06-12 21:21:45] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 0 ms to minimize.
[2022-06-12 21:21:45] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 1 ms to minimize.
[2022-06-12 21:21:45] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 1 ms to minimize.
[2022-06-12 21:21:45] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 1 ms to minimize.
[2022-06-12 21:21:45] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 0 ms to minimize.
[2022-06-12 21:21:45] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 0 ms to minimize.
[2022-06-12 21:21:45] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 0 ms to minimize.
[2022-06-12 21:21:46] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 0 ms to minimize.
[2022-06-12 21:21:46] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 0 ms to minimize.
[2022-06-12 21:21:46] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
[2022-06-12 21:21:46] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 1 ms to minimize.
[2022-06-12 21:21:46] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 2075 ms
[2022-06-12 21:21:46] [INFO ] Computed and/alt/rep : 2204/7623/2204 causal constraints (skipped 198 transitions) in 143 ms.
[2022-06-12 21:21:47] [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
Fused 6 Parikh solutions to 2 different solutions.
Incomplete Parikh walk after 249900 steps, including 1020 resets, run finished after 4661 ms. (steps per millisecond=53 ) properties (out of 6) seen :5 could not realise parikh vector
FORMULA ShieldIIPs-PT-100A-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldIIPs-PT-100A-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldIIPs-PT-100A-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldIIPs-PT-100A-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldIIPs-PT-100A-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 17 out of 2503 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 2503 transition count 2402
Deduced a syphon composed of 1 places in 17 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 2502 transition count 2402
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 13 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 2501 transition count 2401
Partial Free-agglomeration rule applied 687 times.
Drop transitions removed 687 transitions
Iterating global reduction 0 with 687 rules applied. Total rules applied 691 place count 2501 transition count 2401
Applied a total of 691 rules in 961 ms. Remains 2501 /2503 variables (removed 2) and now considering 2401/2403 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 2501/2503 places, 2401/2403 transitions.
[2022-06-12 21:21:53] [INFO ] Flatten gal took : 398 ms
[2022-06-12 21:21:53] [INFO ] Flatten gal took : 229 ms
[2022-06-12 21:21:53] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1339149580088174599.gal : 51 ms
[2022-06-12 21:21:53] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16409912548013456673.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/ReachabilityCardinality1339149580088174599.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality16409912548013456673.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/ReachabilityCardinality1339149580088174599.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality16409912548013456673.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality16409912548013456673.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :3 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :36 after 69
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :69 after 134
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :134 after 281
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :281 after 8183
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :8183 after 21429
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :21429 after 253033
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :253033 after 2.64166e+07
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :2.64166e+07 after 4.64949e+07
Detected timeout of ITS tools.
[2022-06-12 21:22:09] [INFO ] Flatten gal took : 188 ms
[2022-06-12 21:22:09] [INFO ] Applying decomposition
[2022-06-12 21:22:09] [INFO ] Flatten gal took : 183 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/graph9505326893196512039.txt, -o, /tmp/graph9505326893196512039.bin, -w, /tmp/graph9505326893196512039.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/graph9505326893196512039.bin, -l, -1, -v, -w, /tmp/graph9505326893196512039.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-12 21:22:09] [INFO ] Decomposing Gal with order
[2022-06-12 21:22:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-12 21:22:10] [INFO ] Removed a total of 1885 redundant transitions.
[2022-06-12 21:22:10] [INFO ] Flatten gal took : 505 ms
[2022-06-12 21:22:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 2507 labels/synchronizations in 374 ms.
[2022-06-12 21:22:11] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10499422887318021450.gal : 38 ms
[2022-06-12 21:22:11] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6183171385811553632.prop : 76 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/ReachabilityCardinality10499422887318021450.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality6183171385811553632.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/ReachabilityCardinality10499422887318021450.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality6183171385811553632.prop --nowitness
Loading property file /tmp/ReachabilityCardinality6183171385811553632.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 2
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :2 after 2
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :2 after 2
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :2 after 2
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1422037526065325202
[2022-06-12 21:22:26] [INFO ] Built C files in 49ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1422037526065325202
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/ltsmin1422037526065325202]
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/ltsmin1422037526065325202] 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/ltsmin1422037526065325202] 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 106640 steps, including 10 resets, run visited all 1 properties in 2004 ms. (steps per millisecond=53 )
FORMULA ShieldIIPs-PT-100A-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.

BK_STOP 1655068950272

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

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