Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r113-smll-162075355600048.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2021-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 gold2020
Input is FlexibleBarrier-PT-14b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r113-smll-162075355600048
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 106K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.8K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 88K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Mar 28 16:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 28 16:11 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 16:11 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Mar 23 11:12 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 23 11:12 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 22 19:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 22 19:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 4 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 726K May 5 16:51 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 FlexibleBarrier-PT-14b-ReachabilityFireability-00
FORMULA_NAME FlexibleBarrier-PT-14b-ReachabilityFireability-01
FORMULA_NAME FlexibleBarrier-PT-14b-ReachabilityFireability-02
FORMULA_NAME FlexibleBarrier-PT-14b-ReachabilityFireability-03
FORMULA_NAME FlexibleBarrier-PT-14b-ReachabilityFireability-04
FORMULA_NAME FlexibleBarrier-PT-14b-ReachabilityFireability-05
FORMULA_NAME FlexibleBarrier-PT-14b-ReachabilityFireability-06
FORMULA_NAME FlexibleBarrier-PT-14b-ReachabilityFireability-07
FORMULA_NAME FlexibleBarrier-PT-14b-ReachabilityFireability-08
FORMULA_NAME FlexibleBarrier-PT-14b-ReachabilityFireability-09
FORMULA_NAME FlexibleBarrier-PT-14b-ReachabilityFireability-10
FORMULA_NAME FlexibleBarrier-PT-14b-ReachabilityFireability-11
FORMULA_NAME FlexibleBarrier-PT-14b-ReachabilityFireability-12
FORMULA_NAME FlexibleBarrier-PT-14b-ReachabilityFireability-13
FORMULA_NAME FlexibleBarrier-PT-14b-ReachabilityFireability-14
FORMULA_NAME FlexibleBarrier-PT-14b-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1620920233398

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-13 15:37:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2021-05-13 15:37:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 15:37:16] [INFO ] Load time of PNML (sax parser for PT used): 322 ms
[2021-05-13 15:37:16] [INFO ] Transformed 2678 places.
[2021-05-13 15:37:16] [INFO ] Transformed 3085 transitions.
[2021-05-13 15:37:16] [INFO ] Found NUPN structural information;
[2021-05-13 15:37:16] [INFO ] Parsed PT model containing 2678 places and 3085 transitions in 406 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 85 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 102 resets, run finished after 150 ms. (steps per millisecond=66 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0]
FORMULA FlexibleBarrier-PT-14b-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-14b-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 30 ms. (steps per millisecond=333 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 31 ms. (steps per millisecond=322 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0]
FORMULA FlexibleBarrier-PT-14b-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 20 ms. (steps per millisecond=500 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 16 ms. (steps per millisecond=625 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 21 ms. (steps per millisecond=476 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 20 ms. (steps per millisecond=500 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 13 ms. (steps per millisecond=769 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 22 ms. (steps per millisecond=454 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 15 ms. (steps per millisecond=666 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 14 ms. (steps per millisecond=714 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 9 resets, run finished after 18 ms. (steps per millisecond=555 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 52 ms. (steps per millisecond=192 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 3085 rows 2678 cols
[2021-05-13 15:37:17] [INFO ] Computed 16 place invariants in 205 ms
[2021-05-13 15:37:18] [INFO ] [Real]Absence check using 16 positive place invariants in 318 ms returned sat
[2021-05-13 15:37:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 15:37:22] [INFO ] [Real]Absence check using state equation in 3809 ms returned (error "Solver has unexpectedly terminated")
[2021-05-13 15:37:23] [INFO ] [Real]Absence check using 16 positive place invariants in 171 ms returned sat
[2021-05-13 15:37:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 15:37:27] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 15:37:27] [INFO ] [Real]Absence check using state equation in 4191 ms returned (error "Failed to check-sat")
[2021-05-13 15:37:28] [INFO ] [Real]Absence check using 16 positive place invariants in 167 ms returned sat
[2021-05-13 15:37:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 15:37:32] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 15:37:32] [INFO ] [Real]Absence check using state equation in 4386 ms returned (error "Failed to check-sat")
[2021-05-13 15:37:33] [INFO ] [Real]Absence check using 16 positive place invariants in 166 ms returned sat
[2021-05-13 15:37:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 15:37:37] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 15:37:37] [INFO ] [Real]Absence check using state equation in 4388 ms returned (error "Failed to check-sat")
[2021-05-13 15:37:38] [INFO ] [Real]Absence check using 16 positive place invariants in 142 ms returned unsat
[2021-05-13 15:37:38] [INFO ] [Real]Absence check using 16 positive place invariants in 178 ms returned sat
[2021-05-13 15:37:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 15:37:43] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 15:37:43] [INFO ] [Real]Absence check using state equation in 4244 ms returned (error "Failed to check-sat")
[2021-05-13 15:37:43] [INFO ] [Real]Absence check using 16 positive place invariants in 170 ms returned sat
[2021-05-13 15:37:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 15:37:48] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 15:37:48] [INFO ] [Real]Absence check using state equation in 4239 ms returned unknown
[2021-05-13 15:37:49] [INFO ] [Real]Absence check using 16 positive place invariants in 228 ms returned sat
[2021-05-13 15:37:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 15:37:53] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 15:37:53] [INFO ] [Real]Absence check using state equation in 4201 ms returned (error "Failed to check-sat")
[2021-05-13 15:37:53] [INFO ] [Real]Absence check using 16 positive place invariants in 165 ms returned sat
[2021-05-13 15:37:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 15:37:58] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 15:37:58] [INFO ] [Real]Absence check using state equation in 4384 ms returned (error "Failed to check-sat")
[2021-05-13 15:37:59] [INFO ] [Real]Absence check using 16 positive place invariants in 172 ms returned sat
[2021-05-13 15:37:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 15:38:03] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 15:38:03] [INFO ] [Real]Absence check using state equation in 4206 ms returned (error "Failed to check-sat")
[2021-05-13 15:38:03] [INFO ] [Real]Absence check using 16 positive place invariants in 165 ms returned sat
[2021-05-13 15:38:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 15:38:08] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 15:38:08] [INFO ] [Real]Absence check using state equation in 4406 ms returned (error "Failed to check-sat")
[2021-05-13 15:38:09] [INFO ] [Real]Absence check using 16 positive place invariants in 167 ms returned sat
[2021-05-13 15:38:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 15:38:13] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 15:38:13] [INFO ] [Real]Absence check using state equation in 4215 ms returned (error "Failed to check-sat")
[2021-05-13 15:38:13] [INFO ] [Real]Absence check using 16 positive place invariants in 169 ms returned sat
[2021-05-13 15:38:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 15:38:18] [INFO ] [Real]Absence check using state equation in 4393 ms returned (error "Failed to check-sat")
FORMULA FlexibleBarrier-PT-14b-ReachabilityFireability-04 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Support contains 56 out of 2678 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2678/2678 places, 3085/3085 transitions.
Graph (trivial) has 2226 edges and 2678 vertex of which 86 / 2678 are part of one of the 14 SCC in 39 ms
Free SCC test removed 72 places
Drop transitions removed 87 transitions
Reduce isomorphic transitions removed 87 transitions.
Performed 485 Post agglomeration using F-continuation condition.Transition count delta: 485
Iterating post reduction 0 with 572 rules applied. Total rules applied 573 place count 2606 transition count 2513
Reduce places removed 485 places and 0 transitions.
Iterating post reduction 1 with 485 rules applied. Total rules applied 1058 place count 2121 transition count 2513
Performed 328 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 328 Pre rules applied. Total rules applied 1058 place count 2121 transition count 2185
Deduced a syphon composed of 328 places in 5 ms
Reduce places removed 328 places and 0 transitions.
Iterating global reduction 2 with 656 rules applied. Total rules applied 1714 place count 1793 transition count 2185
Symmetric choice reduction at 2 with 1021 rule applications. Total rules 2735 place count 1793 transition count 2185
Deduced a syphon composed of 1021 places in 4 ms
Reduce places removed 1021 places and 1021 transitions.
Iterating global reduction 2 with 2042 rules applied. Total rules applied 4777 place count 772 transition count 1164
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 4777 place count 772 transition count 1157
Deduced a syphon composed of 7 places in 3 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 4791 place count 765 transition count 1157
Symmetric choice reduction at 2 with 153 rule applications. Total rules 4944 place count 765 transition count 1157
Deduced a syphon composed of 153 places in 3 ms
Reduce places removed 153 places and 153 transitions.
Iterating global reduction 2 with 306 rules applied. Total rules applied 5250 place count 612 transition count 1004
Ensure Unique test removed 140 transitions
Reduce isomorphic transitions removed 140 transitions.
Iterating post reduction 2 with 140 rules applied. Total rules applied 5390 place count 612 transition count 864
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: 75
Deduced a syphon composed of 75 places in 1 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 3 with 150 rules applied. Total rules applied 5540 place count 537 transition count 789
Drop transitions removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 3 with 13 rules applied. Total rules applied 5553 place count 537 transition count 776
Symmetric choice reduction at 4 with 13 rule applications. Total rules 5566 place count 537 transition count 776
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 13 transitions.
Iterating global reduction 4 with 26 rules applied. Total rules applied 5592 place count 524 transition count 763
Free-agglomeration rule applied 214 times.
Iterating global reduction 4 with 214 rules applied. Total rules applied 5806 place count 524 transition count 549
Reduce places removed 214 places and 0 transitions.
Iterating post reduction 4 with 214 rules applied. Total rules applied 6020 place count 310 transition count 549
Symmetric choice reduction at 5 with 17 rule applications. Total rules 6037 place count 310 transition count 549
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 17 transitions.
Iterating global reduction 5 with 34 rules applied. Total rules applied 6071 place count 293 transition count 532
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 5 with 17 rules applied. Total rules applied 6088 place count 293 transition count 515
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 6090 place count 293 transition count 515
Drop transitions removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 6 with 17 rules applied. Total rules applied 6107 place count 293 transition count 498
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 6108 place count 292 transition count 497
Applied a total of 6108 rules in 1015 ms. Remains 292 /2678 variables (removed 2386) and now considering 497/3085 (removed 2588) transitions.
Finished structural reductions, in 1 iterations. Remains : 292/2678 places, 497/3085 transitions.
Incomplete random walk after 1000000 steps, including 20793 resets, run finished after 3308 ms. (steps per millisecond=302 ) properties seen :[1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1]
FORMULA FlexibleBarrier-PT-14b-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-14b-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-14b-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-14b-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-14b-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-14b-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-14b-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-14b-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-14b-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-14b-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-14b-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 175 resets, run finished after 842 ms. (steps per millisecond=1187 ) properties seen :[0]
[2021-05-13 15:38:23] [INFO ] Flow matrix only has 484 transitions (discarded 13 similar events)
// Phase 1: matrix 484 rows 292 cols
[2021-05-13 15:38:23] [INFO ] Computed 16 place invariants in 11 ms
[2021-05-13 15:38:23] [INFO ] [Real]Absence check using 16 positive place invariants in 30 ms returned sat
[2021-05-13 15:38:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 15:38:24] [INFO ] [Real]Absence check using state equation in 581 ms returned sat
[2021-05-13 15:38:24] [INFO ] State equation strengthened by 99 read => feed constraints.
[2021-05-13 15:38:24] [INFO ] [Real]Added 99 Read/Feed constraints in 33 ms returned sat
[2021-05-13 15:38:24] [INFO ] Computed and/alt/rep : 487/2308/474 causal constraints in 81 ms.
[2021-05-13 15:38:24] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 15:38:24] [INFO ] [Nat]Absence check using 16 positive place invariants in 75 ms returned sat
[2021-05-13 15:38:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 15:38:25] [INFO ] [Nat]Absence check using state equation in 556 ms returned sat
[2021-05-13 15:38:25] [INFO ] [Nat]Added 99 Read/Feed constraints in 21 ms returned sat
[2021-05-13 15:38:25] [INFO ] Computed and/alt/rep : 487/2308/474 causal constraints in 74 ms.
[2021-05-13 15:38:29] [INFO ] Added : 369 causal constraints over 74 iterations in 4103 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 44 ms.
Incomplete Parikh walk after 58200 steps, including 1234 resets, run finished after 390 ms. (steps per millisecond=149 ) properties seen :[0] could not realise parikh vector
Support contains 10 out of 292 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 292/292 places, 497/497 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 292 transition count 486
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 22 place count 281 transition count 486
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 22 place count 281 transition count 484
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 26 place count 279 transition count 484
Symmetric choice reduction at 2 with 13 rule applications. Total rules 39 place count 279 transition count 484
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 13 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 65 place count 266 transition count 471
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 97 place count 250 transition count 455
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 102 place count 250 transition count 450
Symmetric choice reduction at 3 with 10 rule applications. Total rules 112 place count 250 transition count 450
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 10 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 132 place count 240 transition count 440
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 142 place count 240 transition count 430
Free-agglomeration rule applied 11 times with reduction of 1 identical transitions.
Iterating global reduction 4 with 11 rules applied. Total rules applied 153 place count 240 transition count 418
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (trivial) has 70 edges and 228 vertex of which 26 / 228 are part of one of the 13 SCC in 0 ms
Free SCC test removed 13 places
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 4 with 19 rules applied. Total rules applied 172 place count 215 transition count 412
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 5 with 28 rules applied. Total rules applied 200 place count 213 transition count 386
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 14 Pre rules applied. Total rules applied 200 place count 213 transition count 372
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 6 with 28 rules applied. Total rules applied 228 place count 199 transition count 372
Symmetric choice reduction at 6 with 37 rule applications. Total rules 265 place count 199 transition count 372
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 37 transitions.
Iterating global reduction 6 with 74 rules applied. Total rules applied 339 place count 162 transition count 335
Ensure Unique test removed 37 transitions
Reduce isomorphic transitions removed 37 transitions.
Iterating post reduction 6 with 37 rules applied. Total rules applied 376 place count 162 transition count 298
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 7 with 28 rules applied. Total rules applied 404 place count 148 transition count 284
Free-agglomeration rule applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 405 place count 148 transition count 283
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 406 place count 147 transition count 283
Drop transitions removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 8 with 13 rules applied. Total rules applied 419 place count 147 transition count 270
Free-agglomeration rule applied 13 times.
Iterating global reduction 8 with 13 rules applied. Total rules applied 432 place count 147 transition count 257
Reduce places removed 19 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Iterating post reduction 8 with 53 rules applied. Total rules applied 485 place count 128 transition count 223
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 9 with 31 rules applied. Total rules applied 516 place count 112 transition count 208
Symmetric choice reduction at 10 with 43 rule applications. Total rules 559 place count 112 transition count 208
Deduced a syphon composed of 43 places in 0 ms
Reduce places removed 43 places and 43 transitions.
Iterating global reduction 10 with 86 rules applied. Total rules applied 645 place count 69 transition count 165
Ensure Unique test removed 43 transitions
Reduce isomorphic transitions removed 43 transitions.
Iterating post reduction 10 with 43 rules applied. Total rules applied 688 place count 69 transition count 122
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 11 with 9 rules applied. Total rules applied 697 place count 69 transition count 113
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 698 place count 68 transition count 112
Reduce places removed 4 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 11 with 14 rules applied. Total rules applied 712 place count 64 transition count 102
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 12 with 20 rules applied. Total rules applied 732 place count 54 transition count 92
Symmetric choice reduction at 13 with 20 rule applications. Total rules 752 place count 54 transition count 92
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 20 transitions.
Iterating global reduction 13 with 40 rules applied. Total rules applied 792 place count 34 transition count 72
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 13 with 20 rules applied. Total rules applied 812 place count 34 transition count 52
Applied a total of 812 rules in 166 ms. Remains 34 /292 variables (removed 258) and now considering 52/497 (removed 445) transitions.
Finished structural reductions, in 1 iterations. Remains : 34/292 places, 52/497 transitions.
Finished random walk after 41276 steps, including 2816 resets, run visited all 1 properties in 74 ms. (steps per millisecond=557 )
FORMULA FlexibleBarrier-PT-14b-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.

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

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="FlexibleBarrier-PT-14b"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="gold2020"
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 gold2020"
echo " Input is FlexibleBarrier-PT-14b, 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 r113-smll-162075355600048"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FlexibleBarrier-PT-14b.tgz
mv FlexibleBarrier-PT-14b 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 ;