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-165286037300239.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 ShieldPPPt-PT-020B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r233-tall-165286037300239
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 792K
-rw-r--r-- 1 mcc users 5.6K Apr 29 13:37 CTLCardinality.txt
-rw-r--r-- 1 mcc users 57K Apr 29 13:37 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Apr 29 13:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Apr 29 13:36 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K May 9 08:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 9 08:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 9 08:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 13K May 9 08:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 29 13:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 126K Apr 29 13:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Apr 29 13:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 47K Apr 29 13:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:55 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 376K 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 ShieldPPPt-PT-020B-ReachabilityCardinality-00
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityCardinality-01
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityCardinality-02
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityCardinality-03
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityCardinality-04
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityCardinality-05
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityCardinality-06
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityCardinality-07
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityCardinality-08
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityCardinality-09
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityCardinality-10
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityCardinality-11
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityCardinality-12
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityCardinality-13
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityCardinality-14
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1655073833773

Running Version 0
[2022-06-12 22:43:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -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:43:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-12 22:43:55] [INFO ] Load time of PNML (sax parser for PT used): 195 ms
[2022-06-12 22:43:55] [INFO ] Transformed 1563 places.
[2022-06-12 22:43:55] [INFO ] Transformed 1423 transitions.
[2022-06-12 22:43:55] [INFO ] Found NUPN structural information;
[2022-06-12 22:43:55] [INFO ] Parsed PT model containing 1563 places and 1423 transitions in 284 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 16 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldPPPt-PT-020B-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-020B-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-020B-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 13) seen :5
FORMULA ShieldPPPt-PT-020B-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-020B-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-020B-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-020B-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-020B-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 1423 rows 1563 cols
[2022-06-12 22:43:56] [INFO ] Computed 221 place invariants in 36 ms
[2022-06-12 22:43:56] [INFO ] [Real]Absence check using 221 positive place invariants in 116 ms returned sat
[2022-06-12 22:43:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:43:57] [INFO ] [Real]Absence check using state equation in 843 ms returned sat
[2022-06-12 22:43:57] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:43:57] [INFO ] [Nat]Absence check using 221 positive place invariants in 93 ms returned sat
[2022-06-12 22:43:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:43:59] [INFO ] [Nat]Absence check using state equation in 1616 ms returned sat
[2022-06-12 22:44:00] [INFO ] Deduced a trap composed of 13 places in 526 ms of which 8 ms to minimize.
[2022-06-12 22:44:00] [INFO ] Deduced a trap composed of 24 places in 448 ms of which 3 ms to minimize.
[2022-06-12 22:44:01] [INFO ] Deduced a trap composed of 27 places in 426 ms of which 4 ms to minimize.
[2022-06-12 22:44:01] [INFO ] Deduced a trap composed of 18 places in 532 ms of which 3 ms to minimize.
[2022-06-12 22:44:02] [INFO ] Deduced a trap composed of 27 places in 460 ms of which 2 ms to minimize.
[2022-06-12 22:44:02] [INFO ] Deduced a trap composed of 23 places in 399 ms of which 1 ms to minimize.
[2022-06-12 22:44: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 0
[2022-06-12 22:44:03] [INFO ] [Real]Absence check using 221 positive place invariants in 89 ms returned sat
[2022-06-12 22:44:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:44:04] [INFO ] [Real]Absence check using state equation in 1057 ms returned sat
[2022-06-12 22:44:04] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:44:04] [INFO ] [Nat]Absence check using 221 positive place invariants in 90 ms returned sat
[2022-06-12 22:44:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:44:05] [INFO ] [Nat]Absence check using state equation in 1029 ms returned sat
[2022-06-12 22:44:05] [INFO ] Deduced a trap composed of 28 places in 276 ms of which 1 ms to minimize.
[2022-06-12 22:44:06] [INFO ] Deduced a trap composed of 21 places in 298 ms of which 1 ms to minimize.
[2022-06-12 22:44:06] [INFO ] Deduced a trap composed of 18 places in 259 ms of which 1 ms to minimize.
[2022-06-12 22:44:06] [INFO ] Deduced a trap composed of 18 places in 245 ms of which 1 ms to minimize.
[2022-06-12 22:44:07] [INFO ] Deduced a trap composed of 21 places in 248 ms of which 1 ms to minimize.
[2022-06-12 22:44:07] [INFO ] Deduced a trap composed of 20 places in 239 ms of which 1 ms to minimize.
[2022-06-12 22:44:07] [INFO ] Deduced a trap composed of 26 places in 228 ms of which 0 ms to minimize.
[2022-06-12 22:44:08] [INFO ] Deduced a trap composed of 25 places in 164 ms of which 1 ms to minimize.
[2022-06-12 22:44:08] [INFO ] Deduced a trap composed of 21 places in 156 ms of which 2 ms to minimize.
[2022-06-12 22:44:08] [INFO ] Deduced a trap composed of 24 places in 159 ms of which 1 ms to minimize.
[2022-06-12 22:44:08] [INFO ] Deduced a trap composed of 18 places in 150 ms of which 1 ms to minimize.
[2022-06-12 22:44:09] [INFO ] Deduced a trap composed of 25 places in 139 ms of which 0 ms to minimize.
[2022-06-12 22:44:09] [INFO ] Deduced a trap composed of 25 places in 136 ms of which 0 ms to minimize.
[2022-06-12 22:44:09] [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:44:09] [INFO ] [Real]Absence check using 221 positive place invariants in 74 ms returned sat
[2022-06-12 22:44:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:44:10] [INFO ] [Real]Absence check using state equation in 521 ms returned sat
[2022-06-12 22:44:10] [INFO ] Deduced a trap composed of 22 places in 255 ms of which 1 ms to minimize.
[2022-06-12 22:44:10] [INFO ] Deduced a trap composed of 20 places in 261 ms of which 1 ms to minimize.
[2022-06-12 22:44:11] [INFO ] Deduced a trap composed of 19 places in 265 ms of which 1 ms to minimize.
[2022-06-12 22:44:11] [INFO ] Deduced a trap composed of 18 places in 253 ms of which 1 ms to minimize.
[2022-06-12 22:44:11] [INFO ] Deduced a trap composed of 32 places in 247 ms of which 1 ms to minimize.
[2022-06-12 22:44:11] [INFO ] Deduced a trap composed of 34 places in 255 ms of which 1 ms to minimize.
[2022-06-12 22:44:12] [INFO ] Deduced a trap composed of 18 places in 268 ms of which 1 ms to minimize.
[2022-06-12 22:44:12] [INFO ] Deduced a trap composed of 20 places in 239 ms of which 1 ms to minimize.
[2022-06-12 22:44:12] [INFO ] Deduced a trap composed of 31 places in 226 ms of which 0 ms to minimize.
[2022-06-12 22:44:13] [INFO ] Deduced a trap composed of 30 places in 214 ms of which 1 ms to minimize.
[2022-06-12 22:44:13] [INFO ] Deduced a trap composed of 26 places in 215 ms of which 1 ms to minimize.
[2022-06-12 22:44:13] [INFO ] Deduced a trap composed of 42 places in 210 ms of which 1 ms to minimize.
[2022-06-12 22:44:13] [INFO ] Deduced a trap composed of 24 places in 211 ms of which 1 ms to minimize.
[2022-06-12 22:44:14] [INFO ] Deduced a trap composed of 29 places in 201 ms of which 0 ms to minimize.
[2022-06-12 22:44:14] [INFO ] Deduced a trap composed of 22 places in 195 ms of which 1 ms to minimize.
[2022-06-12 22:44:14] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
[2022-06-12 22:44:14] [INFO ] [Real]Absence check using 221 positive place invariants in 90 ms returned sat
[2022-06-12 22:44:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:44:15] [INFO ] [Real]Absence check using state equation in 627 ms returned sat
[2022-06-12 22:44:15] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:44:15] [INFO ] [Real]Absence check using 221 positive place invariants in 84 ms returned sat
[2022-06-12 22:44:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:44:16] [INFO ] [Real]Absence check using state equation in 754 ms returned sat
[2022-06-12 22:44:16] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:44:17] [INFO ] [Nat]Absence check using 221 positive place invariants in 82 ms returned sat
[2022-06-12 22:44:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:44:17] [INFO ] [Nat]Absence check using state equation in 714 ms returned sat
[2022-06-12 22:44:18] [INFO ] Deduced a trap composed of 32 places in 266 ms of which 1 ms to minimize.
[2022-06-12 22:44:18] [INFO ] Deduced a trap composed of 22 places in 268 ms of which 1 ms to minimize.
[2022-06-12 22:44:18] [INFO ] Deduced a trap composed of 22 places in 250 ms of which 0 ms to minimize.
[2022-06-12 22:44:19] [INFO ] Deduced a trap composed of 30 places in 259 ms of which 1 ms to minimize.
[2022-06-12 22:44:19] [INFO ] Deduced a trap composed of 20 places in 249 ms of which 1 ms to minimize.
[2022-06-12 22:44:19] [INFO ] Deduced a trap composed of 20 places in 252 ms of which 2 ms to minimize.
[2022-06-12 22:44:19] [INFO ] Deduced a trap composed of 27 places in 241 ms of which 1 ms to minimize.
[2022-06-12 22:44:20] [INFO ] Deduced a trap composed of 17 places in 236 ms of which 1 ms to minimize.
[2022-06-12 22:44:20] [INFO ] Deduced a trap composed of 25 places in 234 ms of which 1 ms to minimize.
[2022-06-12 22:44:20] [INFO ] Deduced a trap composed of 19 places in 230 ms of which 1 ms to minimize.
[2022-06-12 22:44:21] [INFO ] Deduced a trap composed of 18 places in 274 ms of which 1 ms to minimize.
[2022-06-12 22:44:21] [INFO ] Deduced a trap composed of 30 places in 214 ms of which 1 ms to minimize.
[2022-06-12 22:44:21] [INFO ] Deduced a trap composed of 27 places in 217 ms of which 1 ms to minimize.
[2022-06-12 22:44:21] [INFO ] Deduced a trap composed of 32 places in 213 ms of which 1 ms to minimize.
[2022-06-12 22:44:21] [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:44:22] [INFO ] [Real]Absence check using 221 positive place invariants in 79 ms returned sat
[2022-06-12 22:44:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:44:22] [INFO ] [Real]Absence check using state equation in 625 ms returned sat
[2022-06-12 22:44:22] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:44:23] [INFO ] [Real]Absence check using 221 positive place invariants in 74 ms returned sat
[2022-06-12 22:44:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:44:23] [INFO ] [Real]Absence check using state equation in 526 ms returned sat
[2022-06-12 22:44:23] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:44:24] [INFO ] [Real]Absence check using 221 positive place invariants in 78 ms returned sat
[2022-06-12 22:44:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:44:24] [INFO ] [Real]Absence check using state equation in 541 ms returned sat
[2022-06-12 22:44:25] [INFO ] Solution in real domain found non-integer solution.
FORMULA ShieldPPPt-PT-020B-ReachabilityCardinality-13 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ShieldPPPt-PT-020B-ReachabilityCardinality-12 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ShieldPPPt-PT-020B-ReachabilityCardinality-09 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ShieldPPPt-PT-020B-ReachabilityCardinality-06 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 8 Parikh solutions to 1 different solutions.
Support contains 74 out of 1563 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1563/1563 places, 1423/1423 transitions.
Drop transitions removed 322 transitions
Trivial Post-agglo rules discarded 322 transitions
Performed 322 trivial Post agglomeration. Transition count delta: 322
Iterating post reduction 0 with 322 rules applied. Total rules applied 322 place count 1563 transition count 1101
Reduce places removed 322 places and 0 transitions.
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Iterating post reduction 1 with 340 rules applied. Total rules applied 662 place count 1241 transition count 1083
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 2 with 18 rules applied. Total rules applied 680 place count 1223 transition count 1083
Performed 82 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 82 Pre rules applied. Total rules applied 680 place count 1223 transition count 1001
Deduced a syphon composed of 82 places in 2 ms
Reduce places removed 82 places and 0 transitions.
Iterating global reduction 3 with 164 rules applied. Total rules applied 844 place count 1141 transition count 1001
Discarding 129 places :
Symmetric choice reduction at 3 with 129 rule applications. Total rules 973 place count 1012 transition count 872
Iterating global reduction 3 with 129 rules applied. Total rules applied 1102 place count 1012 transition count 872
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 47 Pre rules applied. Total rules applied 1102 place count 1012 transition count 825
Deduced a syphon composed of 47 places in 4 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 94 rules applied. Total rules applied 1196 place count 965 transition count 825
Performed 319 Post agglomeration using F-continuation condition.Transition count delta: 319
Deduced a syphon composed of 319 places in 1 ms
Reduce places removed 319 places and 0 transitions.
Iterating global reduction 3 with 638 rules applied. Total rules applied 1834 place count 646 transition count 506
Renaming transitions due to excessive name length > 1024 char.
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 49 places in 1 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 3 with 98 rules applied. Total rules applied 1932 place count 597 transition count 506
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 1933 place count 597 transition count 505
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1934 place count 597 transition count 504
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1935 place count 596 transition count 504
Partial Free-agglomeration rule applied 49 times.
Drop transitions removed 49 transitions
Iterating global reduction 4 with 49 rules applied. Total rules applied 1984 place count 596 transition count 504
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1985 place count 595 transition count 503
Applied a total of 1985 rules in 524 ms. Remains 595 /1563 variables (removed 968) and now considering 503/1423 (removed 920) transitions.
Finished structural reductions, in 1 iterations. Remains : 595/1563 places, 503/1423 transitions.
[2022-06-12 22:44:26] [INFO ] Flatten gal took : 128 ms
[2022-06-12 22:44:26] [INFO ] Flatten gal took : 49 ms
[2022-06-12 22:44:26] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11700185096791126148.gal : 62 ms
[2022-06-12 22:44:26] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13098965300889339388.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/ReachabilityCardinality11700185096791126148.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality13098965300889339388.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/ReachabilityCardinality11700185096791126148.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality13098965300889339388.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality13098965300889339388.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :3 after 6
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :6 after 18
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :18 after 72
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :72 after 648
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :648 after 69984
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :69984 after 7.93619e+08
Detected timeout of ITS tools.
[2022-06-12 22:44:41] [INFO ] Flatten gal took : 52 ms
[2022-06-12 22:44:41] [INFO ] Applying decomposition
[2022-06-12 22:44:41] [INFO ] Flatten gal took : 33 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/graph15370923226264368600.txt, -o, /tmp/graph15370923226264368600.bin, -w, /tmp/graph15370923226264368600.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/graph15370923226264368600.bin, -l, -1, -v, -w, /tmp/graph15370923226264368600.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-12 22:44:41] [INFO ] Decomposing Gal with order
[2022-06-12 22:44:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-12 22:44:41] [INFO ] Removed a total of 242 redundant transitions.
[2022-06-12 22:44:41] [INFO ] Flatten gal took : 128 ms
[2022-06-12 22:44:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 110 labels/synchronizations in 41 ms.
[2022-06-12 22:44:41] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15998744518880405223.gal : 13 ms
[2022-06-12 22:44:41] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10936971660630815083.prop : 2 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality15998744518880405223.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality10936971660630815083.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/ReachabilityCardinality15998744518880405223.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality10936971660630815083.prop --nowitness
Loading property file /tmp/ReachabilityCardinality10936971660630815083.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 6
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :6 after 18
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :18 after 648
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :648 after 15552
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :15552 after 2.6454e+07
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5920730690041726802
[2022-06-12 22:44:56] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5920730690041726802
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/ltsmin5920730690041726802]
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/ltsmin5920730690041726802] 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/ltsmin5920730690041726802] 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)
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 4280 ms. (steps per millisecond=233 ) properties (out of 4) seen :2
FORMULA ShieldPPPt-PT-020B-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-020B-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2990 ms. (steps per millisecond=334 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 2489 ms. (steps per millisecond=401 ) properties (out of 2) seen :1
FORMULA ShieldPPPt-PT-020B-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 1 properties.
// Phase 1: matrix 503 rows 595 cols
[2022-06-12 22:45:07] [INFO ] Computed 221 place invariants in 7 ms
[2022-06-12 22:45:07] [INFO ] [Real]Absence check using 221 positive place invariants in 35 ms returned sat
[2022-06-12 22:45:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:45:08] [INFO ] [Real]Absence check using state equation in 224 ms returned sat
[2022-06-12 22:45:08] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:45:08] [INFO ] [Nat]Absence check using 221 positive place invariants in 37 ms returned sat
[2022-06-12 22:45:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:45:08] [INFO ] [Nat]Absence check using state equation in 194 ms returned sat
[2022-06-12 22:45:08] [INFO ] State equation strengthened by 37 read => feed constraints.
[2022-06-12 22:45:08] [INFO ] [Nat]Added 37 Read/Feed constraints in 14 ms returned sat
[2022-06-12 22:45:08] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 1 ms to minimize.
[2022-06-12 22:45:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 74 ms
[2022-06-12 22:45:08] [INFO ] Computed and/alt/rep : 478/1226/478 causal constraints (skipped 0 transitions) in 23 ms.
[2022-06-12 22:45:12] [INFO ] Added : 417 causal constraints over 84 iterations in 3955 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 18 ms.
Finished Parikh walk after 12781 steps, including 49 resets, run visited all 1 properties in 64 ms. (steps per millisecond=199 )
FORMULA ShieldPPPt-PT-020B-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.

BK_STOP 1655073913606

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -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 ReachabilityCardinality -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="ShieldPPPt-PT-020B"
export BK_EXAMINATION="ReachabilityCardinality"
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 ShieldPPPt-PT-020B, examination is ReachabilityCardinality"
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-165286037300239"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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