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-162089151100128.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-2B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r151-tall-162089151100128
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 896K
-rw-r--r-- 1 mcc users 14K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 124K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.6K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K 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.5K Mar 28 16:22 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 28 16:22 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 16:22 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 16:22 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Mar 27 06:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 27 06:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 25 07:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 25 07:50 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 548K 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-2B-ReachabilityFireability-00
FORMULA_NAME NoC3x3-PT-2B-ReachabilityFireability-01
FORMULA_NAME NoC3x3-PT-2B-ReachabilityFireability-02
FORMULA_NAME NoC3x3-PT-2B-ReachabilityFireability-03
FORMULA_NAME NoC3x3-PT-2B-ReachabilityFireability-04
FORMULA_NAME NoC3x3-PT-2B-ReachabilityFireability-05
FORMULA_NAME NoC3x3-PT-2B-ReachabilityFireability-06
FORMULA_NAME NoC3x3-PT-2B-ReachabilityFireability-07
FORMULA_NAME NoC3x3-PT-2B-ReachabilityFireability-08
FORMULA_NAME NoC3x3-PT-2B-ReachabilityFireability-09
FORMULA_NAME NoC3x3-PT-2B-ReachabilityFireability-10
FORMULA_NAME NoC3x3-PT-2B-ReachabilityFireability-11
FORMULA_NAME NoC3x3-PT-2B-ReachabilityFireability-12
FORMULA_NAME NoC3x3-PT-2B-ReachabilityFireability-13
FORMULA_NAME NoC3x3-PT-2B-ReachabilityFireability-14
FORMULA_NAME NoC3x3-PT-2B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1620993385035

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-14 11:56:26] [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 11:56:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-14 11:56:26] [INFO ] Load time of PNML (sax parser for PT used): 121 ms
[2021-05-14 11:56:26] [INFO ] Transformed 2003 places.
[2021-05-14 11:56:26] [INFO ] Transformed 2292 transitions.
[2021-05-14 11:56:26] [INFO ] Found NUPN structural information;
[2021-05-14 11:56:26] [INFO ] Parsed PT model containing 2003 places and 2292 transitions in 179 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 83 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 16 resets, run finished after 86 ms. (steps per millisecond=116 ) properties seen :[1, 0, 1, 1, 0, 1, 0, 0, 1, 0, 1, 0, 0, 1, 1, 1]
FORMULA NoC3x3-PT-2B-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-2B-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-2B-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-2B-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-2B-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-2B-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-2B-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-2B-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-2B-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 1 resets, run finished after 26 ms. (steps per millisecond=384 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties seen :[1, 0, 0, 0, 0, 0, 0]
FORMULA NoC3x3-PT-2B-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 1 resets, run finished after 23 ms. (steps per millisecond=434 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 1 resets, run finished after 12 ms. (steps per millisecond=833 ) properties seen :[0, 0, 0, 0, 0, 0]
// Phase 1: matrix 2292 rows 2003 cols
[2021-05-14 11:56:27] [INFO ] Computed 66 place invariants in 46 ms
[2021-05-14 11:56:27] [INFO ] [Real]Absence check using 66 positive place invariants in 136 ms returned sat
[2021-05-14 11:56:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 11:56:32] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-14 11:56:32] [INFO ] [Real]Absence check using state equation in 4485 ms returned (error "Failed to check-sat")
[2021-05-14 11:56:32] [INFO ] [Real]Absence check using 66 positive place invariants in 131 ms returned sat
[2021-05-14 11:56:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 11:56:37] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-14 11:56:37] [INFO ] [Real]Absence check using state equation in 4565 ms returned (error "Failed to check-sat")
[2021-05-14 11:56:37] [INFO ] [Real]Absence check using 66 positive place invariants in 127 ms returned sat
[2021-05-14 11:56:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 11:56:42] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-14 11:56:42] [INFO ] [Real]Absence check using state equation in 4587 ms returned (error "Failed to check-sat")
[2021-05-14 11:56:42] [INFO ] [Real]Absence check using 66 positive place invariants in 129 ms returned sat
[2021-05-14 11:56:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 11:56:47] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-14 11:56:47] [INFO ] [Real]Absence check using state equation in 4586 ms returned unknown
[2021-05-14 11:56:47] [INFO ] [Real]Absence check using 66 positive place invariants in 131 ms returned sat
[2021-05-14 11:56:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 11:56:52] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-14 11:56:52] [INFO ] [Real]Absence check using state equation in 4580 ms returned (error "Failed to check-sat")
[2021-05-14 11:56:52] [INFO ] [Real]Absence check using 66 positive place invariants in 118 ms returned sat
[2021-05-14 11:56:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 11:56:57] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-14 11:56:57] [INFO ] [Real]Absence check using state equation in 4635 ms returned (error "Failed to check-sat")
Support contains 47 out of 2003 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2003/2003 places, 2292/2292 transitions.
Graph (trivial) has 1509 edges and 2003 vertex of which 56 / 2003 are part of one of the 7 SCC in 62 ms
Free SCC test removed 49 places
Drop transitions removed 56 transitions
Reduce isomorphic transitions removed 56 transitions.
Discarding 9 places :
Implicit places reduction removed 9 places
Performed 383 Post agglomeration using F-continuation condition.Transition count delta: 383
Iterating post reduction 0 with 448 rules applied. Total rules applied 449 place count 1945 transition count 1853
Reduce places removed 383 places and 0 transitions.
Iterating post reduction 1 with 383 rules applied. Total rules applied 832 place count 1562 transition count 1853
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 28 Pre rules applied. Total rules applied 832 place count 1562 transition count 1825
Deduced a syphon composed of 28 places in 6 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 888 place count 1534 transition count 1825
Symmetric choice reduction at 2 with 357 rule applications. Total rules 1245 place count 1534 transition count 1825
Deduced a syphon composed of 357 places in 11 ms
Reduce places removed 357 places and 357 transitions.
Iterating global reduction 2 with 714 rules applied. Total rules applied 1959 place count 1177 transition count 1468
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 35 Pre rules applied. Total rules applied 1959 place count 1177 transition count 1433
Deduced a syphon composed of 35 places in 10 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 2029 place count 1142 transition count 1433
Symmetric choice reduction at 2 with 106 rule applications. Total rules 2135 place count 1142 transition count 1433
Deduced a syphon composed of 106 places in 3 ms
Reduce places removed 106 places and 106 transitions.
Iterating global reduction 2 with 212 rules applied. Total rules applied 2347 place count 1036 transition count 1327
Symmetric choice reduction at 2 with 117 rule applications. Total rules 2464 place count 1036 transition count 1327
Deduced a syphon composed of 117 places in 3 ms
Reduce places removed 117 places and 131 transitions.
Iterating global reduction 2 with 234 rules applied. Total rules applied 2698 place count 919 transition count 1196
Symmetric choice reduction at 2 with 40 rule applications. Total rules 2738 place count 919 transition count 1196
Deduced a syphon composed of 40 places in 3 ms
Reduce places removed 40 places and 75 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 2818 place count 879 transition count 1121
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 17 rules applied. Total rules applied 2835 place count 877 transition count 1106
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 2837 place count 875 transition count 1106
Symmetric choice reduction at 4 with 27 rule applications. Total rules 2864 place count 875 transition count 1106
Deduced a syphon composed of 27 places in 2 ms
Reduce places removed 27 places and 27 transitions.
Iterating global reduction 4 with 54 rules applied. Total rules applied 2918 place count 848 transition count 1079
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 2920 place count 847 transition count 1078
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 2921 place count 846 transition count 1078
Symmetric choice reduction at 6 with 17 rule applications. Total rules 2938 place count 846 transition count 1078
Deduced a syphon composed of 17 places in 2 ms
Reduce places removed 17 places and 34 transitions.
Iterating global reduction 6 with 34 rules applied. Total rules applied 2972 place count 829 transition count 1044
Symmetric choice reduction at 6 with 17 rule applications. Total rules 2989 place count 829 transition count 1044
Deduced a syphon composed of 17 places in 4 ms
Reduce places removed 17 places and 17 transitions.
Iterating global reduction 6 with 34 rules applied. Total rules applied 3023 place count 812 transition count 1027
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 6 with 21 rules applied. Total rules applied 3044 place count 810 transition count 1008
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 3046 place count 808 transition count 1008
Performed 281 Post agglomeration using F-continuation condition.Transition count delta: 281
Deduced a syphon composed of 281 places in 0 ms
Reduce places removed 281 places and 0 transitions.
Iterating global reduction 8 with 562 rules applied. Total rules applied 3608 place count 527 transition count 727
Symmetric choice reduction at 8 with 12 rule applications. Total rules 3620 place count 527 transition count 727
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 12 transitions.
Iterating global reduction 8 with 24 rules applied. Total rules applied 3644 place count 515 transition count 715
Symmetric choice reduction at 8 with 9 rule applications. Total rules 3653 place count 515 transition count 715
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 18 transitions.
Iterating global reduction 8 with 18 rules applied. Total rules applied 3671 place count 506 transition count 697
Symmetric choice reduction at 8 with 2 rule applications. Total rules 3673 place count 506 transition count 697
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 10 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 3677 place count 504 transition count 687
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: -129
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 8 with 56 rules applied. Total rules applied 3733 place count 476 transition count 816
Free-agglomeration rule applied 19 times.
Iterating global reduction 8 with 19 rules applied. Total rules applied 3752 place count 476 transition count 797
Reduce places removed 19 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 23 rules applied. Total rules applied 3775 place count 457 transition count 793
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 9 with 2 rules applied. Total rules applied 3777 place count 457 transition count 791
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 3779 place count 455 transition count 791
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 10 with 5 rules applied. Total rules applied 3784 place count 455 transition count 791
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 3786 place count 455 transition count 791
Applied a total of 3786 rules in 906 ms. Remains 455 /2003 variables (removed 1548) and now considering 791/2292 (removed 1501) transitions.
Finished structural reductions, in 1 iterations. Remains : 455/2003 places, 791/2292 transitions.
Incomplete random walk after 1000000 steps, including 9430 resets, run finished after 4026 ms. (steps per millisecond=248 ) properties seen :[1, 0, 1, 1, 0, 1]
FORMULA NoC3x3-PT-2B-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-2B-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-2B-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-2B-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 691 resets, run finished after 1470 ms. (steps per millisecond=680 ) properties seen :[1, 0]
FORMULA NoC3x3-PT-2B-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 698 resets, run finished after 1542 ms. (steps per millisecond=648 ) properties seen :[0]
[2021-05-14 11:57:05] [INFO ] Flow matrix only has 745 transitions (discarded 46 similar events)
// Phase 1: matrix 745 rows 455 cols
[2021-05-14 11:57:05] [INFO ] Computed 55 place invariants in 8 ms
[2021-05-14 11:57:05] [INFO ] [Real]Absence check using 55 positive place invariants in 30 ms returned sat
[2021-05-14 11:57:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 11:57:06] [INFO ] [Real]Absence check using state equation in 582 ms returned sat
[2021-05-14 11:57:06] [INFO ] State equation strengthened by 78 read => feed constraints.
[2021-05-14 11:57:06] [INFO ] [Real]Added 78 Read/Feed constraints in 39 ms returned sat
[2021-05-14 11:57:06] [INFO ] Computed and/alt/rep : 789/6394/743 causal constraints in 75 ms.
[2021-05-14 11:57:06] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 11:57:06] [INFO ] [Nat]Absence check using 55 positive place invariants in 100 ms returned sat
[2021-05-14 11:57:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 11:57:07] [INFO ] [Nat]Absence check using state equation in 564 ms returned sat
[2021-05-14 11:57:07] [INFO ] [Nat]Added 78 Read/Feed constraints in 22 ms returned sat
[2021-05-14 11:57:07] [INFO ] Computed and/alt/rep : 789/6394/743 causal constraints in 53 ms.
[2021-05-14 11:57:19] [INFO ] Added : 560 causal constraints over 112 iterations in 11865 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 97 ms.
Incomplete Parikh walk after 89600 steps, including 557 resets, run finished after 420 ms. (steps per millisecond=213 ) properties seen :[0] could not realise parikh vector
Support contains 13 out of 455 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 455/455 places, 791/791 transitions.
Graph (trivial) has 51 edges and 455 vertex of which 2 / 455 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 0 with 8 rules applied. Total rules applied 9 place count 454 transition count 783
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 15 place count 448 transition count 783
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 15 place count 448 transition count 775
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 31 place count 440 transition count 775
Symmetric choice reduction at 2 with 7 rule applications. Total rules 38 place count 440 transition count 775
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 13 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 52 place count 433 transition count 762
Symmetric choice reduction at 2 with 1 rule applications. Total rules 53 place count 433 transition count 762
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 55 place count 432 transition count 760
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 56 place count 432 transition count 759
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 80 place count 420 transition count 747
Symmetric choice reduction at 3 with 6 rule applications. Total rules 86 place count 420 transition count 747
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 7 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 98 place count 414 transition count 740
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 99 place count 414 transition count 739
Symmetric choice reduction at 4 with 4 rule applications. Total rules 103 place count 414 transition count 739
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 8 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 111 place count 410 transition count 731
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 113 place count 410 transition count 729
Symmetric choice reduction at 5 with 1 rule applications. Total rules 114 place count 410 transition count 729
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 116 place count 409 transition count 727
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 120 place count 409 transition count 723
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 128 place count 405 transition count 736
Free-agglomeration rule applied 4 times.
Iterating global reduction 6 with 4 rules applied. Total rules applied 132 place count 405 transition count 732
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 138 place count 401 transition count 730
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 139 place count 401 transition count 738
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 140 place count 400 transition count 738
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 141 place count 400 transition count 738
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 142 place count 400 transition count 738
Symmetric choice reduction at 8 with 1 rule applications. Total rules 143 place count 400 transition count 738
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 145 place count 399 transition count 737
Symmetric choice reduction at 8 with 1 rule applications. Total rules 146 place count 399 transition count 737
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 148 place count 398 transition count 735
Symmetric choice reduction at 8 with 1 rule applications. Total rules 149 place count 398 transition count 735
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 151 place count 397 transition count 733
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 152 place count 397 transition count 732
Applied a total of 152 rules in 165 ms. Remains 397 /455 variables (removed 58) and now considering 732/791 (removed 59) transitions.
Finished structural reductions, in 1 iterations. Remains : 397/455 places, 732/791 transitions.
Incomplete random walk after 1000000 steps, including 11697 resets, run finished after 4289 ms. (steps per millisecond=233 ) properties seen :[0]
Incomplete Best-First random walk after 1000001 steps, including 757 resets, run finished after 1512 ms. (steps per millisecond=661 ) properties seen :[0]
Interrupted probabilistic random walk after 6062697 steps, run timeout after 30001 ms. (steps per millisecond=202 ) properties seen :[0]
Probabilistic random walk after 6062697 steps, saw 1026347 distinct states, run finished after 30001 ms. (steps per millisecond=202 ) properties seen :[0]
[2021-05-14 11:57:55] [INFO ] Flow matrix only has 670 transitions (discarded 62 similar events)
// Phase 1: matrix 670 rows 397 cols
[2021-05-14 11:57:55] [INFO ] Computed 55 place invariants in 4 ms
[2021-05-14 11:57:55] [INFO ] [Real]Absence check using 55 positive place invariants in 45 ms returned sat
[2021-05-14 11:57:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 11:57:56] [INFO ] [Real]Absence check using state equation in 540 ms returned sat
[2021-05-14 11:57:56] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 11:57:56] [INFO ] [Nat]Absence check using 55 positive place invariants in 31 ms returned sat
[2021-05-14 11:57:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 11:57:57] [INFO ] [Nat]Absence check using state equation in 463 ms returned sat
[2021-05-14 11:57:57] [INFO ] State equation strengthened by 85 read => feed constraints.
[2021-05-14 11:57:57] [INFO ] [Nat]Added 85 Read/Feed constraints in 40 ms returned sat
[2021-05-14 11:57:57] [INFO ] Computed and/alt/rep : 716/11804/654 causal constraints in 47 ms.
[2021-05-14 11:58:08] [INFO ] Added : 410 causal constraints over 82 iterations in 11322 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 145 ms.
Incomplete Parikh walk after 79800 steps, including 566 resets, run finished after 373 ms. (steps per millisecond=213 ) properties seen :[0] could not realise parikh vector
Support contains 13 out of 397 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 397/397 places, 732/732 transitions.
Applied a total of 0 rules in 15 ms. Remains 397 /397 variables (removed 0) and now considering 732/732 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 397/397 places, 732/732 transitions.
Starting structural reductions, iteration 0 : 397/397 places, 732/732 transitions.
Applied a total of 0 rules in 14 ms. Remains 397 /397 variables (removed 0) and now considering 732/732 (removed 0) transitions.
[2021-05-14 11:58:09] [INFO ] Flow matrix only has 670 transitions (discarded 62 similar events)
// Phase 1: matrix 670 rows 397 cols
[2021-05-14 11:58:09] [INFO ] Computed 55 place invariants in 4 ms
[2021-05-14 11:58:09] [INFO ] Implicit Places using invariants in 480 ms returned [13, 48, 93, 127, 182, 261, 310, 341, 378]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 483 ms to find 9 implicit places.
[2021-05-14 11:58:09] [INFO ] Redundant transitions in 88 ms returned [702, 704, 713, 715, 717, 719]
Found 6 redundant transitions using SMT.
Drop transitions removed 6 transitions
Redundant transitions reduction (with SMT) removed 6 transitions :[719, 717, 715, 713, 704, 702]
[2021-05-14 11:58:09] [INFO ] Flow matrix only has 670 transitions (discarded 56 similar events)
// Phase 1: matrix 670 rows 388 cols
[2021-05-14 11:58:09] [INFO ] Computed 46 place invariants in 3 ms
[2021-05-14 11:58:10] [INFO ] Dead Transitions using invariants and state equation in 703 ms returned []
Starting structural reductions, iteration 1 : 388/397 places, 726/732 transitions.
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 0 with 42 rules applied. Total rules applied 42 place count 367 transition count 705
Ensure Unique test removed 39 transitions
Reduce isomorphic transitions removed 39 transitions.
Iterating post reduction 0 with 39 rules applied. Total rules applied 81 place count 367 transition count 666
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 84 place count 367 transition count 666
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 86 place count 367 transition count 664
Applied a total of 86 rules in 23 ms. Remains 367 /388 variables (removed 21) and now considering 664/726 (removed 62) transitions.
[2021-05-14 11:58:10] [INFO ] Flow matrix only has 608 transitions (discarded 56 similar events)
// Phase 1: matrix 608 rows 367 cols
[2021-05-14 11:58:10] [INFO ] Computed 46 place invariants in 3 ms
[2021-05-14 11:58:10] [INFO ] Implicit Places using invariants in 409 ms returned []
[2021-05-14 11:58:10] [INFO ] Flow matrix only has 608 transitions (discarded 56 similar events)
// Phase 1: matrix 608 rows 367 cols
[2021-05-14 11:58:10] [INFO ] Computed 46 place invariants in 3 ms
[2021-05-14 11:58:11] [INFO ] State equation strengthened by 67 read => feed constraints.
[2021-05-14 11:58:12] [INFO ] Implicit Places using invariants and state equation in 1877 ms returned [7, 12, 32, 34, 37, 38, 43, 45, 81, 84, 86, 103, 104, 111, 113, 117, 143, 144, 145, 146, 149, 150, 151, 157, 159, 161, 166, 168, 170, 231, 232, 233, 236, 237, 238, 239, 242, 243, 244, 284, 289, 304, 305, 306, 309, 315, 317, 345, 346, 349, 350]
Discarding 51 places :
Implicit Place search using SMT with State Equation took 2289 ms to find 51 implicit places.
Starting structural reductions, iteration 2 : 316/397 places, 664/732 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 316 transition count 662
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 314 transition count 662
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 2 with 74 rules applied. Total rules applied 78 place count 277 transition count 625
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 100 place count 266 transition count 634
Free-agglomeration rule (complex) applied 44 times.
Iterating global reduction 2 with 44 rules applied. Total rules applied 144 place count 266 transition count 598
Reduce places removed 44 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 47 rules applied. Total rules applied 191 place count 222 transition count 595
Partial Free-agglomeration rule applied 12 times.
Drop transitions removed 12 transitions
Iterating global reduction 3 with 12 rules applied. Total rules applied 203 place count 222 transition count 595
Applied a total of 203 rules in 46 ms. Remains 222 /316 variables (removed 94) and now considering 595/664 (removed 69) transitions.
[2021-05-14 11:58:12] [INFO ] Flow matrix only has 534 transitions (discarded 61 similar events)
// Phase 1: matrix 534 rows 222 cols
[2021-05-14 11:58:12] [INFO ] Computed 33 place invariants in 2 ms
[2021-05-14 11:58:12] [INFO ] Implicit Places using invariants in 215 ms returned []
[2021-05-14 11:58:12] [INFO ] Flow matrix only has 534 transitions (discarded 61 similar events)
// Phase 1: matrix 534 rows 222 cols
[2021-05-14 11:58:12] [INFO ] Computed 33 place invariants in 3 ms
[2021-05-14 11:58:13] [INFO ] State equation strengthened by 117 read => feed constraints.
[2021-05-14 11:58:14] [INFO ] Implicit Places using invariants and state equation in 1206 ms returned [171, 209]
Discarding 2 places :
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Implicit Place search using SMT with State Equation took 1423 ms to find 2 implicit places.
Starting structural reductions, iteration 3 : 220/397 places, 591/732 transitions.
Applied a total of 0 rules in 10 ms. Remains 220 /220 variables (removed 0) and now considering 591/591 (removed 0) transitions.
[2021-05-14 11:58:14] [INFO ] Redundant transitions in 136 ms returned []
[2021-05-14 11:58:14] [INFO ] Flow matrix only has 530 transitions (discarded 61 similar events)
// Phase 1: matrix 530 rows 220 cols
[2021-05-14 11:58:14] [INFO ] Computed 31 place invariants in 2 ms
[2021-05-14 11:58:14] [INFO ] Dead Transitions using invariants and state equation in 446 ms returned []
Finished structural reductions, in 4 iterations. Remains : 220/397 places, 591/732 transitions.
Incomplete random walk after 1000000 steps, including 13698 resets, run finished after 4320 ms. (steps per millisecond=231 ) properties seen :[0]
Incomplete Best-First random walk after 1000001 steps, including 710 resets, run finished after 1245 ms. (steps per millisecond=803 ) properties seen :[0]
Interrupted probabilistic random walk after 7484973 steps, run timeout after 30001 ms. (steps per millisecond=249 ) properties seen :[0]
Probabilistic random walk after 7484973 steps, saw 1535147 distinct states, run finished after 30001 ms. (steps per millisecond=249 ) properties seen :[0]
[2021-05-14 11:58:50] [INFO ] Flow matrix only has 530 transitions (discarded 61 similar events)
// Phase 1: matrix 530 rows 220 cols
[2021-05-14 11:58:50] [INFO ] Computed 31 place invariants in 2 ms
[2021-05-14 11:58:50] [INFO ] [Real]Absence check using 31 positive place invariants in 14 ms returned sat
[2021-05-14 11:58:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 11:58:50] [INFO ] [Real]Absence check using state equation in 251 ms returned sat
[2021-05-14 11:58:50] [INFO ] State equation strengthened by 100 read => feed constraints.
[2021-05-14 11:58:50] [INFO ] [Real]Added 100 Read/Feed constraints in 16 ms returned sat
[2021-05-14 11:58:50] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 11:58:50] [INFO ] [Nat]Absence check using 31 positive place invariants in 26 ms returned sat
[2021-05-14 11:58:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 11:58:50] [INFO ] [Nat]Absence check using state equation in 245 ms returned sat
[2021-05-14 11:58:50] [INFO ] [Nat]Added 100 Read/Feed constraints in 23 ms returned sat
[2021-05-14 11:58:51] [INFO ] Computed and/alt/rep : 575/12821/514 causal constraints in 38 ms.
[2021-05-14 11:59:02] [INFO ] Added : 355 causal constraints over 71 iterations in 11217 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 137 ms.
Incomplete Parikh walk after 56500 steps, including 543 resets, run finished after 267 ms. (steps per millisecond=211 ) properties seen :[0] could not realise parikh vector
Support contains 13 out of 220 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 220/220 places, 591/591 transitions.
Applied a total of 0 rules in 8 ms. Remains 220 /220 variables (removed 0) and now considering 591/591 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 220/220 places, 591/591 transitions.
Starting structural reductions, iteration 0 : 220/220 places, 591/591 transitions.
Applied a total of 0 rules in 8 ms. Remains 220 /220 variables (removed 0) and now considering 591/591 (removed 0) transitions.
[2021-05-14 11:59:02] [INFO ] Flow matrix only has 530 transitions (discarded 61 similar events)
// Phase 1: matrix 530 rows 220 cols
[2021-05-14 11:59:02] [INFO ] Computed 31 place invariants in 2 ms
[2021-05-14 11:59:02] [INFO ] Implicit Places using invariants in 184 ms returned []
[2021-05-14 11:59:02] [INFO ] Flow matrix only has 530 transitions (discarded 61 similar events)
// Phase 1: matrix 530 rows 220 cols
[2021-05-14 11:59:02] [INFO ] Computed 31 place invariants in 2 ms
[2021-05-14 11:59:03] [INFO ] State equation strengthened by 100 read => feed constraints.
[2021-05-14 11:59:03] [INFO ] Implicit Places using invariants and state equation in 1131 ms returned []
Implicit Place search using SMT with State Equation took 1317 ms to find 0 implicit places.
[2021-05-14 11:59:04] [INFO ] Redundant transitions in 69 ms returned []
[2021-05-14 11:59:04] [INFO ] Flow matrix only has 530 transitions (discarded 61 similar events)
// Phase 1: matrix 530 rows 220 cols
[2021-05-14 11:59:04] [INFO ] Computed 31 place invariants in 2 ms
[2021-05-14 11:59:04] [INFO ] Dead Transitions using invariants and state equation in 441 ms returned []
Finished structural reductions, in 1 iterations. Remains : 220/220 places, 591/591 transitions.
Incomplete random walk after 100000 steps, including 1383 resets, run finished after 445 ms. (steps per millisecond=224 ) properties seen :[0]
[2021-05-14 11:59:04] [INFO ] Flow matrix only has 530 transitions (discarded 61 similar events)
// Phase 1: matrix 530 rows 220 cols
[2021-05-14 11:59:04] [INFO ] Computed 31 place invariants in 2 ms
[2021-05-14 11:59:04] [INFO ] [Real]Absence check using 31 positive place invariants in 14 ms returned sat
[2021-05-14 11:59:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 11:59:05] [INFO ] [Real]Absence check using state equation in 221 ms returned sat
[2021-05-14 11:59:05] [INFO ] State equation strengthened by 100 read => feed constraints.
[2021-05-14 11:59:05] [INFO ] [Real]Added 100 Read/Feed constraints in 16 ms returned sat
[2021-05-14 11:59:05] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 11:59:05] [INFO ] [Nat]Absence check using 31 positive place invariants in 15 ms returned sat
[2021-05-14 11:59:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 11:59:05] [INFO ] [Nat]Absence check using state equation in 229 ms returned sat
[2021-05-14 11:59:05] [INFO ] [Nat]Added 100 Read/Feed constraints in 21 ms returned sat
[2021-05-14 11:59:05] [INFO ] Computed and/alt/rep : 575/12821/514 causal constraints in 35 ms.
[2021-05-14 11:59:16] [INFO ] Added : 355 causal constraints over 71 iterations in 11198 ms. Result :sat
Graph (trivial) has 110 edges and 220 vertex of which 34 / 220 are part of one of the 17 SCC in 1 ms
Free SCC test removed 17 places
Discarding 11 places :
Also discarding 0 output transitions
Graph (complete) has 757 edges and 203 vertex of which 192 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.5 ms
Drop transitions removed 65 transitions
Ensure Unique test removed 76 transitions
Reduce isomorphic transitions removed 141 transitions.
Iterating post reduction 0 with 141 rules applied. Total rules applied 143 place count 192 transition count 450
Symmetric choice reduction at 1 with 14 rule applications. Total rules 157 place count 192 transition count 450
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 52 transitions.
Iterating global reduction 1 with 28 rules applied. Total rules applied 185 place count 178 transition count 398
Partial Free-agglomeration rule applied 21 times.
Drop transitions removed 21 transitions
Iterating global reduction 1 with 21 rules applied. Total rules applied 206 place count 178 transition count 398
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 207 place count 178 transition count 397
Partial Post-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 210 place count 178 transition count 397
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 212 place count 178 transition count 395
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 3 with 10 rules applied. Total rules applied 222 place count 178 transition count 385
Applied a total of 222 rules in 25 ms. Remains 178 /220 variables (removed 42) and now considering 385/591 (removed 206) transitions.
[2021-05-14 11:59:16] [INFO ] Flow matrix only has 384 transitions (discarded 1 similar events)
// Phase 1: matrix 384 rows 178 cols
[2021-05-14 11:59:16] [INFO ] Computed 26 place invariants in 1 ms
[2021-05-14 11:59:16] [INFO ] [Real]Absence check using 26 positive place invariants in 19 ms returned sat
[2021-05-14 11:59:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 11:59:17] [INFO ] [Real]Absence check using state equation in 244 ms returned sat
[2021-05-14 11:59:17] [INFO ] State equation strengthened by 101 read => feed constraints.
[2021-05-14 11:59:17] [INFO ] [Real]Added 101 Read/Feed constraints in 11 ms returned sat
[2021-05-14 11:59:17] [INFO ] Deduced a trap composed of 7 places in 9 ms
[2021-05-14 11:59:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 26 ms
[2021-05-14 11:59:17] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 11:59:17] [INFO ] [Nat]Absence check using 26 positive place invariants in 22 ms returned sat
[2021-05-14 11:59:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 11:59:17] [INFO ] [Nat]Absence check using state equation in 190 ms returned sat
[2021-05-14 11:59:17] [INFO ] [Nat]Added 101 Read/Feed constraints in 11 ms returned sat
[2021-05-14 11:59:17] [INFO ] Deduced a trap composed of 7 places in 29 ms
[2021-05-14 11:59:17] [INFO ] Deduced a trap composed of 9 places in 25 ms
[2021-05-14 11:59:17] [INFO ] Deduced a trap composed of 9 places in 16 ms
[2021-05-14 11:59:17] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 106 ms
[2021-05-14 11:59:17] [INFO ] Computed and/alt/rep : 381/3831/380 causal constraints in 18 ms.
[2021-05-14 11:59:18] [INFO ] Added : 221 causal constraints over 45 iterations in 1334 ms. Result :sat
[2021-05-14 11:59:18] [INFO ] Deduced a trap composed of 6 places in 15 ms
[2021-05-14 11:59:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 65 ms
Attempting to minimize the solution found.
Minimization took 19 ms.
[2021-05-14 11:59:18] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 2 ms.
[2021-05-14 11:59:18] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 44 ms.
[2021-05-14 11:59:19] [INFO ] Flatten gal took : 169 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityFireability @ NoC3x3-PT-2B @ 3570 seconds

FORMULA NoC3x3-PT-2B-ReachabilityFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS SYMMETRIES TOPOLOGICAL USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3568
rslt: Output for ReachabilityFireability @ NoC3x3-PT-2B

{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2020",
"localtimelimit": 0,
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=ReachabilityFireability.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--safe",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--json=ReachabilityFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Fri May 14 11:59:22 2021
",
"timelimit": 3570
},
"child": null,
"exit":
{
"error": null,
"localtimelimitreached": true,
"memory": 25724,
"runtime": 2.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityFireability.xml",
"net": "model.pnml"
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 7,
"adisj": 3,
"aneg": 0,
"comp": 13,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 13,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 13,
"visible_transitions": 0
},
"processed": "E (F (((1 <= p104) AND (1 <= p164) AND ((p19 <= 0) OR (p54 <= 0)) AND (((1 <= p162)) OR ((1 <= p42)) OR ((1 <= p50) AND (1 <= p61))) AND (((1 <= p120)) OR ((1 <= p80) AND (1 <= p84)) OR ((1 <= p167) AND (1 <= p147))))))",
"processed_size": 224,
"rewrites": 1,
"skeleton": "E(F(**))"
},
"net":
{
"arcs": 2913,
"conflict_clusters": 48,
"places": 220,
"places_significant": 189,
"singleton_clusters": 0,
"transitions": 591
},
"result":
{
"edges": 32,
"markings": 33,
"produced_by": "state space",
"value": true
},
"task":
{
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 108,
"problems": 18
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
,
"type": "reachability",
"workflow": "stateequation||search"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 811/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 220
lola: finding significant places
lola: 220 places, 591 transitions, 189 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from ReachabilityFireability.xml
lola: LP says that atomic proposition is always true: (p104 <= 1)
lola: LP says that atomic proposition is always true: (p164 <= 1)
lola: LP says that atomic proposition is always true: (p19 <= 1)
lola: LP says that atomic proposition is always true: (p54 <= 1)
lola: LP says that atomic proposition is always true: (p162 <= 1)
lola: LP says that atomic proposition is always true: (p42 <= 1)
lola: LP says that atomic proposition is always true: (p50 <= 1)
lola: LP says that atomic proposition is always true: (p61 <= 1)
lola: LP says that atomic proposition is always true: (p120 <= 1)
lola: LP says that atomic proposition is always true: (p80 <= 1)
lola: LP says that atomic proposition is always true: (p84 <= 1)
lola: LP says that atomic proposition is always true: (p167 <= 1)
lola: LP says that atomic proposition is always true: (p147 <= 1)
lola: E (F (((1 <= p104) AND (1 <= p164) AND ((p19 <= 0) OR (p54 <= 0)) AND (((1 <= p162)) OR ((1 <= p42)) OR ((1 <= p50) AND (1 <= p61))) AND (((1 <= p120)) OR ((1 <= p80) AND (1 <= p84)) OR ((1 <= p167) AND (1 <= p147))))))
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((1 <= p104) AND (1 <= p164) AND ((p19 <= 0) OR (p54 <= 0)) AND (((1 <= p162)) OR ((1 <= p42)) OR ((1 <= p50) AND (1 <= p61))) AND (((1 <= p120)) OR ((1 <= p80) AND (1 <= p84)) OR ((1 <= p167) AND (1 <= p147))))))
lola: processed formula length: 224
lola: 1 rewrites
lola: closed formula file ReachabilityFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: subprocess will run for 0 seconds at most (--localtimelimit)
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: local time limit reached - aborting
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p104) AND (1 <= p164) AND ((p19 <= 0) OR (p54 <= 0)) AND (((1 <= p162)) OR ((1 <= p42)) OR ((1 <= p50) AND (1 <= p61))) AND (((1 <= p120)) OR ((1 <= p80) AND (1 <= p84)) OR ((1 <= p167) AND (1 <= p147))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 108 literals and 18 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityFireability-0.sara
lola: state equation: calling and running sara
lola: RESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 33 markings, 32 edges
lola: memory consumption: 25724 KB
lola: lola: memory consumption: 25724 KB
time consumption: 2 secondslola: time consumption: 2 seconds

lola: print data as JSON (--json)
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityFireability.json
lola: writing JSON to ReachabilityFireability.json
lola: closed JSON file ReachabilityFireability.json
lola: closed JSON file ReachabilityFireability.json
rslt: finished

--------------------
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-2B"
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-2B, 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-162089151100128"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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