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.r151-tall-162089151200168.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2020
Input is NoC3x3-PT-7B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r151-tall-162089151200168
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.3M
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 102K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 92K 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.1K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.0K Mar 28 16:23 LTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 28 16:23 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:23 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 28 16:23 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Mar 27 06:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 27 06:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 25 07:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K Mar 25 07:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K 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 3 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 2.0M 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 NoC3x3-PT-7B-ReachabilityFireability-00
FORMULA_NAME NoC3x3-PT-7B-ReachabilityFireability-01
FORMULA_NAME NoC3x3-PT-7B-ReachabilityFireability-02
FORMULA_NAME NoC3x3-PT-7B-ReachabilityFireability-03
FORMULA_NAME NoC3x3-PT-7B-ReachabilityFireability-04
FORMULA_NAME NoC3x3-PT-7B-ReachabilityFireability-05
FORMULA_NAME NoC3x3-PT-7B-ReachabilityFireability-06
FORMULA_NAME NoC3x3-PT-7B-ReachabilityFireability-07
FORMULA_NAME NoC3x3-PT-7B-ReachabilityFireability-08
FORMULA_NAME NoC3x3-PT-7B-ReachabilityFireability-09
FORMULA_NAME NoC3x3-PT-7B-ReachabilityFireability-10
FORMULA_NAME NoC3x3-PT-7B-ReachabilityFireability-11
FORMULA_NAME NoC3x3-PT-7B-ReachabilityFireability-12
FORMULA_NAME NoC3x3-PT-7B-ReachabilityFireability-13
FORMULA_NAME NoC3x3-PT-7B-ReachabilityFireability-14
FORMULA_NAME NoC3x3-PT-7B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1621001481152

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-14 14:11:23] [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-14 14:11:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-14 14:11:23] [INFO ] Load time of PNML (sax parser for PT used): 277 ms
[2021-05-14 14:11:23] [INFO ] Transformed 7014 places.
[2021-05-14 14:11:23] [INFO ] Transformed 8833 transitions.
[2021-05-14 14:11:23] [INFO ] Found NUPN structural information;
[2021-05-14 14:11:23] [INFO ] Parsed PT model containing 7014 places and 8833 transitions in 396 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 191 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 4 resets, run finished after 200 ms. (steps per millisecond=50 ) properties seen :[1, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0]
FORMULA NoC3x3-PT-7B-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-7B-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-7B-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-7B-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-7B-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 28 ms. (steps per millisecond=357 ) properties seen :[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 38 ms. (steps per millisecond=263 ) properties seen :[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 21 ms. (steps per millisecond=476 ) properties seen :[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 17 ms. (steps per millisecond=588 ) properties seen :[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 22 ms. (steps per millisecond=454 ) properties seen :[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 29 ms. (steps per millisecond=344 ) properties seen :[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 23 ms. (steps per millisecond=434 ) properties seen :[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 15 ms. (steps per millisecond=666 ) properties seen :[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 15 ms. (steps per millisecond=666 ) properties seen :[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 26 ms. (steps per millisecond=384 ) properties seen :[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 17 ms. (steps per millisecond=588 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 8833 rows 7014 cols
[2021-05-14 14:11:24] [INFO ] Computed 66 place invariants in 152 ms
[2021-05-14 14:11:26] [INFO ] [Real]Absence check using 66 positive place invariants in 506 ms returned sat
[2021-05-14 14:11:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 14:11:29] [INFO ] [Real]Absence check using state equation in 3392 ms returned (error "Solver has unexpectedly terminated")
[2021-05-14 14:11:30] [INFO ] [Real]Absence check using 66 positive place invariants in 519 ms returned sat
[2021-05-14 14:11:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 14:11:34] [INFO ] [Real]Absence check using state equation in 3633 ms returned (error "Solver has unexpectedly terminated")
[2021-05-14 14:11:35] [INFO ] [Real]Absence check using 66 positive place invariants in 491 ms returned sat
[2021-05-14 14:11:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 14:11:39] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-14 14:11:39] [INFO ] [Real]Absence check using state equation in 3661 ms returned (error "Failed to check-sat")
[2021-05-14 14:11:40] [INFO ] [Real]Absence check using 66 positive place invariants in 477 ms returned sat
[2021-05-14 14:11:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 14:11:44] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-14 14:11:44] [INFO ] [Real]Absence check using state equation in 3712 ms returned (error "Failed to check-sat")
[2021-05-14 14:11:45] [INFO ] [Real]Absence check using 66 positive place invariants in 483 ms returned sat
[2021-05-14 14:11:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 14:11:49] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-14 14:11:49] [INFO ] [Real]Absence check using state equation in 3709 ms returned (error "Failed to check-sat")
[2021-05-14 14:11:50] [INFO ] [Real]Absence check using 66 positive place invariants in 488 ms returned sat
[2021-05-14 14:11:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 14:11:54] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-14 14:11:54] [INFO ] [Real]Absence check using state equation in 3713 ms returned (error "Failed to check-sat")
[2021-05-14 14:11:55] [INFO ] [Real]Absence check using 66 positive place invariants in 491 ms returned sat
[2021-05-14 14:11:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 14:11:59] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-14 14:11:59] [INFO ] [Real]Absence check using state equation in 3642 ms returned (error "Failed to check-sat")
[2021-05-14 14:12:00] [INFO ] [Real]Absence check using 66 positive place invariants in 483 ms returned sat
[2021-05-14 14:12:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 14:12:04] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-14 14:12:04] [INFO ] [Real]Absence check using state equation in 3716 ms returned (error "Failed to check-sat")
[2021-05-14 14:12:05] [INFO ] [Real]Absence check using 66 positive place invariants in 478 ms returned sat
[2021-05-14 14:12:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 14:12:09] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-14 14:12:09] [INFO ] [Real]Absence check using state equation in 3713 ms returned (error "Failed to check-sat")
[2021-05-14 14:12:10] [INFO ] [Real]Absence check using 66 positive place invariants in 488 ms returned sat
[2021-05-14 14:12:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 14:12:14] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-14 14:12:14] [INFO ] [Real]Absence check using state equation in 3712 ms returned (error "Failed to check-sat")
[2021-05-14 14:12:15] [INFO ] [Real]Absence check using 66 positive place invariants in 478 ms returned sat
[2021-05-14 14:12:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 14:12:19] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-14 14:12:19] [INFO ] [Real]Absence check using state equation in 3691 ms returned (error "Failed to check-sat")
Support contains 40 out of 7014 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 7014/7014 places, 8833/8833 transitions.
Graph (trivial) has 7718 edges and 7014 vertex of which 4099 / 7014 are part of one of the 31 SCC in 26 ms
Free SCC test removed 4068 places
Drop transitions removed 4964 transitions
Reduce isomorphic transitions removed 4964 transitions.
Performed 825 Post agglomeration using F-continuation condition.Transition count delta: 825
Iterating post reduction 0 with 5789 rules applied. Total rules applied 5790 place count 2946 transition count 3044
Reduce places removed 825 places and 0 transitions.
Ensure Unique test removed 47 transitions
Reduce isomorphic transitions removed 47 transitions.
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Iterating post reduction 1 with 912 rules applied. Total rules applied 6702 place count 2121 transition count 2957
Reduce places removed 40 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 41 rules applied. Total rules applied 6743 place count 2081 transition count 2956
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 6743 place count 2081 transition count 2954
Deduced a syphon composed of 2 places in 6 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 6747 place count 2079 transition count 2954
Symmetric choice reduction at 3 with 736 rule applications. Total rules 7483 place count 2079 transition count 2954
Deduced a syphon composed of 736 places in 7 ms
Reduce places removed 736 places and 744 transitions.
Iterating global reduction 3 with 1472 rules applied. Total rules applied 8955 place count 1343 transition count 2210
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 3 with 17 rules applied. Total rules applied 8972 place count 1343 transition count 2193
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 8979 place count 1336 transition count 2193
Performed 53 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 53 Pre rules applied. Total rules applied 8979 place count 1336 transition count 2140
Deduced a syphon composed of 53 places in 13 ms
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 5 with 106 rules applied. Total rules applied 9085 place count 1283 transition count 2140
Symmetric choice reduction at 5 with 420 rule applications. Total rules 9505 place count 1283 transition count 2140
Deduced a syphon composed of 420 places in 12 ms
Reduce places removed 420 places and 577 transitions.
Iterating global reduction 5 with 840 rules applied. Total rules applied 10345 place count 863 transition count 1563
Ensure Unique test removed 352 transitions
Reduce isomorphic transitions removed 352 transitions.
Iterating post reduction 5 with 352 rules applied. Total rules applied 10697 place count 863 transition count 1211
Symmetric choice reduction at 6 with 5 rule applications. Total rules 10702 place count 863 transition count 1211
Deduced a syphon composed of 5 places in 32 ms
Reduce places removed 5 places and 10 transitions.
Iterating global reduction 6 with 10 rules applied. Total rules applied 10712 place count 858 transition count 1201
Symmetric choice reduction at 6 with 5 rule applications. Total rules 10717 place count 858 transition count 1201
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 5 transitions.
Iterating global reduction 6 with 10 rules applied. Total rules applied 10727 place count 853 transition count 1196
Symmetric choice reduction at 6 with 4 rule applications. Total rules 10731 place count 853 transition count 1196
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 12 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 10739 place count 849 transition count 1184
Symmetric choice reduction at 6 with 4 rule applications. Total rules 10743 place count 849 transition count 1184
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 8 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 10751 place count 845 transition count 1176
Performed 245 Post agglomeration using F-continuation condition with reduction of 24 identical transitions.
Deduced a syphon composed of 245 places in 1 ms
Reduce places removed 245 places and 0 transitions.
Iterating global reduction 6 with 490 rules applied. Total rules applied 11241 place count 600 transition count 907
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 6 with 16 rules applied. Total rules applied 11257 place count 600 transition count 891
Symmetric choice reduction at 7 with 1 rule applications. Total rules 11258 place count 600 transition count 891
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 11260 place count 599 transition count 890
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 7 with 20 rules applied. Total rules applied 11280 place count 589 transition count 880
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 11281 place count 589 transition count 879
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 11283 place count 588 transition count 878
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 11284 place count 588 transition count 877
Performed 72 Post agglomeration using F-continuation condition with reduction of 154 identical transitions.
Deduced a syphon composed of 72 places in 0 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 9 with 144 rules applied. Total rules applied 11428 place count 516 transition count 1016
Ensure Unique test removed 75 transitions
Reduce isomorphic transitions removed 75 transitions.
Iterating post reduction 9 with 75 rules applied. Total rules applied 11503 place count 516 transition count 941
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -69
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 10 with 10 rules applied. Total rules applied 11513 place count 511 transition count 1010
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 10 with 23 rules applied. Total rules applied 11536 place count 511 transition count 987
Free-agglomeration rule applied 194 times.
Iterating global reduction 11 with 194 rules applied. Total rules applied 11730 place count 511 transition count 793
Reduce places removed 194 places and 0 transitions.
Drop transitions removed 65 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 66 transitions.
Discarding 38 places :
Also discarding 0 output transitions
Graph (complete) has 1124 edges and 317 vertex of which 279 are kept as prefixes of interest. Removing 38 places using SCC suffix rule.12 ms
Iterating post reduction 11 with 261 rules applied. Total rules applied 11991 place count 279 transition count 727
Drop transitions removed 41 transitions
Reduce isomorphic transitions removed 41 transitions.
Iterating post reduction 12 with 41 rules applied. Total rules applied 12032 place count 279 transition count 686
Symmetric choice reduction at 13 with 12 rule applications. Total rules 12044 place count 279 transition count 686
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 12 transitions.
Iterating global reduction 13 with 24 rules applied. Total rules applied 12068 place count 267 transition count 674
Free-agglomeration rule applied 1 times.
Iterating global reduction 13 with 1 rules applied. Total rules applied 12069 place count 267 transition count 673
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 12070 place count 266 transition count 673
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 14 with 2 rules applied. Total rules applied 12072 place count 266 transition count 671
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 14 with 2 rules applied. Total rules applied 12074 place count 264 transition count 671
Partial Free-agglomeration rule applied 25 times.
Drop transitions removed 25 transitions
Iterating global reduction 15 with 25 rules applied. Total rules applied 12099 place count 264 transition count 671
Drop transitions removed 79 transitions
Redundant transition composition rules discarded 79 transitions
Iterating global reduction 15 with 79 rules applied. Total rules applied 12178 place count 264 transition count 592
Free-agglomeration rule applied 2 times.
Iterating global reduction 15 with 2 rules applied. Total rules applied 12180 place count 264 transition count 590
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 6 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Graph (complete) has 987 edges and 262 vertex of which 256 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Iterating post reduction 15 with 5 rules applied. Total rules applied 12185 place count 256 transition count 586
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 16 with 5 rules applied. Total rules applied 12190 place count 256 transition count 581
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 17 with 1 rules applied. Total rules applied 12191 place count 256 transition count 581
Applied a total of 12191 rules in 1229 ms. Remains 256 /7014 variables (removed 6758) and now considering 581/8833 (removed 8252) transitions.
Finished structural reductions, in 1 iterations. Remains : 256/7014 places, 581/8833 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 3393 ms. (steps per millisecond=294 ) properties seen :[1, 1, 1, 0, 0, 1, 0, 1, 1, 1, 0]
FORMULA NoC3x3-PT-7B-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-7B-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-7B-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-7B-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-7B-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-7B-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-7B-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 1036 ms. (steps per millisecond=965 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 1052 ms. (steps per millisecond=950 ) properties seen :[1, 0, 0, 0]
FORMULA NoC3x3-PT-7B-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 1093 ms. (steps per millisecond=914 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 1056 ms. (steps per millisecond=946 ) properties seen :[0, 0, 0]
[2021-05-14 14:12:28] [INFO ] Flow matrix only has 525 transitions (discarded 56 similar events)
// Phase 1: matrix 525 rows 256 cols
[2021-05-14 14:12:28] [INFO ] Computed 52 place invariants in 2 ms
[2021-05-14 14:12:28] [INFO ] [Real]Absence check using 52 positive place invariants in 28 ms returned sat
[2021-05-14 14:12:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 14:12:28] [INFO ] [Real]Absence check using state equation in 238 ms returned sat
[2021-05-14 14:12:28] [INFO ] State equation strengthened by 149 read => feed constraints.
[2021-05-14 14:12:28] [INFO ] [Real]Added 149 Read/Feed constraints in 31 ms returned sat
[2021-05-14 14:12:28] [INFO ] Computed and/alt/rep : 579/3280/523 causal constraints in 44 ms.
[2021-05-14 14:12:29] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 14:12:29] [INFO ] [Nat]Absence check using 52 positive place invariants in 58 ms returned sat
[2021-05-14 14:12:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 14:12:29] [INFO ] [Nat]Absence check using state equation in 231 ms returned sat
[2021-05-14 14:12:29] [INFO ] [Nat]Added 149 Read/Feed constraints in 13 ms returned sat
[2021-05-14 14:12:29] [INFO ] Computed and/alt/rep : 579/3280/523 causal constraints in 36 ms.
[2021-05-14 14:12:34] [INFO ] Added : 516 causal constraints over 104 iterations in 4801 ms. Result :sat
[2021-05-14 14:12:34] [INFO ] Deduced a trap composed of 13 places in 21 ms
[2021-05-14 14:12:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 99 ms
Attempting to minimize the solution found.
Minimization took 47 ms.
[2021-05-14 14:12:34] [INFO ] [Real]Absence check using 52 positive place invariants in 19 ms returned sat
[2021-05-14 14:12:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 14:12:34] [INFO ] [Real]Absence check using state equation in 265 ms returned sat
[2021-05-14 14:12:34] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 14:12:34] [INFO ] [Nat]Absence check using 52 positive place invariants in 38 ms returned sat
[2021-05-14 14:12:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 14:12:35] [INFO ] [Nat]Absence check using state equation in 237 ms returned sat
[2021-05-14 14:12:35] [INFO ] [Nat]Added 149 Read/Feed constraints in 14 ms returned sat
[2021-05-14 14:12:35] [INFO ] Computed and/alt/rep : 579/3280/523 causal constraints in 32 ms.
[2021-05-14 14:12:39] [INFO ] Added : 518 causal constraints over 104 iterations in 4462 ms. Result :sat
[2021-05-14 14:12:39] [INFO ] Deduced a trap composed of 8 places in 8 ms
[2021-05-14 14:12:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 79 ms
Attempting to minimize the solution found.
Minimization took 37 ms.
[2021-05-14 14:12:39] [INFO ] [Real]Absence check using 52 positive place invariants in 19 ms returned sat
[2021-05-14 14:12:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 14:12:39] [INFO ] [Real]Absence check using state equation in 226 ms returned sat
[2021-05-14 14:12:39] [INFO ] [Real]Added 149 Read/Feed constraints in 20 ms returned sat
[2021-05-14 14:12:39] [INFO ] Computed and/alt/rep : 579/3280/523 causal constraints in 29 ms.
[2021-05-14 14:12:40] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 14:12:40] [INFO ] [Nat]Absence check using 52 positive place invariants in 52 ms returned sat
[2021-05-14 14:12:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 14:12:40] [INFO ] [Nat]Absence check using state equation in 224 ms returned sat
[2021-05-14 14:12:40] [INFO ] [Nat]Added 149 Read/Feed constraints in 14 ms returned sat
[2021-05-14 14:12:40] [INFO ] Computed and/alt/rep : 579/3280/523 causal constraints in 27 ms.
[2021-05-14 14:12:44] [INFO ] Added : 476 causal constraints over 96 iterations in 3742 ms. Result :sat
[2021-05-14 14:12:44] [INFO ] Deduced a trap composed of 16 places in 14 ms
[2021-05-14 14:12:44] [INFO ] Deduced a trap composed of 8 places in 8 ms
[2021-05-14 14:12:44] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 149 ms
Attempting to minimize the solution found.
Minimization took 35 ms.
Finished Parikh walk after 4608 steps, including 39 resets, run visited all 3 properties in 27 ms. (steps per millisecond=170 )
FORMULA NoC3x3-PT-7B-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA NoC3x3-PT-7B-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA NoC3x3-PT-7B-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL PARIKH_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="NoC3x3-PT-7B"
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 NoC3x3-PT-7B, 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 r151-tall-162089151200168"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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