Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r511-tall-167912735700154.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool gold2022
Input is Vasy2003-PT-none, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r511-tall-167912735700154
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 684K
-rw-r--r-- 1 mcc users 6.5K Feb 25 14:33 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Feb 25 14:33 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 25 14:25 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Feb 25 14:25 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.3K Feb 25 17:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 17:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 17:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 14:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 131K Feb 25 14:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 10K Feb 25 14:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 90K Feb 25 14:35 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:26 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 17:26 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 207K Mar 5 18:23 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME Vasy2003-PT-none-UpperBounds-00
FORMULA_NAME Vasy2003-PT-none-UpperBounds-01
FORMULA_NAME Vasy2003-PT-none-UpperBounds-02
FORMULA_NAME Vasy2003-PT-none-UpperBounds-03
FORMULA_NAME Vasy2003-PT-none-UpperBounds-04
FORMULA_NAME Vasy2003-PT-none-UpperBounds-05
FORMULA_NAME Vasy2003-PT-none-UpperBounds-06
FORMULA_NAME Vasy2003-PT-none-UpperBounds-07
FORMULA_NAME Vasy2003-PT-none-UpperBounds-08
FORMULA_NAME Vasy2003-PT-none-UpperBounds-09
FORMULA_NAME Vasy2003-PT-none-UpperBounds-10
FORMULA_NAME Vasy2003-PT-none-UpperBounds-11
FORMULA_NAME Vasy2003-PT-none-UpperBounds-12
FORMULA_NAME Vasy2003-PT-none-UpperBounds-13
FORMULA_NAME Vasy2003-PT-none-UpperBounds-14
FORMULA_NAME Vasy2003-PT-none-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1679323634584

Running Version 202205111006
[2023-03-20 14:47:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-20 14:47:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 14:47:15] [INFO ] Load time of PNML (sax parser for PT used): 111 ms
[2023-03-20 14:47:15] [INFO ] Transformed 485 places.
[2023-03-20 14:47:15] [INFO ] Transformed 776 transitions.
[2023-03-20 14:47:15] [INFO ] Found NUPN structural information;
[2023-03-20 14:47:15] [INFO ] Parsed PT model containing 485 places and 776 transitions in 212 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Ensure Unique test removed 24 transitions
Reduce redundant transitions removed 24 transitions.
Normalized transition count is 696 out of 752 initially.
// Phase 1: matrix 696 rows 485 cols
[2023-03-20 14:47:16] [INFO ] Computed 66 place invariants in 32 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 16) seen :11
FORMULA Vasy2003-PT-none-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Vasy2003-PT-none-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Vasy2003-PT-none-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Vasy2003-PT-none-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Vasy2003-PT-none-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Vasy2003-PT-none-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Vasy2003-PT-none-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Vasy2003-PT-none-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Vasy2003-PT-none-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Vasy2003-PT-none-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Vasy2003-PT-none-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 5) seen :0
[2023-03-20 14:47:16] [INFO ] Flow matrix only has 696 transitions (discarded 56 similar events)
// Phase 1: matrix 696 rows 485 cols
[2023-03-20 14:47:16] [INFO ] Computed 66 place invariants in 11 ms
[2023-03-20 14:47:16] [INFO ] [Real]Absence check using 59 positive place invariants in 20 ms returned sat
[2023-03-20 14:47:16] [INFO ] [Real]Absence check using 59 positive and 7 generalized place invariants in 4 ms returned sat
[2023-03-20 14:47:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 14:47:16] [INFO ] [Real]Absence check using state equation in 160 ms returned sat
[2023-03-20 14:47:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 14:47:16] [INFO ] [Nat]Absence check using 59 positive place invariants in 20 ms returned sat
[2023-03-20 14:47:16] [INFO ] [Nat]Absence check using 59 positive and 7 generalized place invariants in 4 ms returned sat
[2023-03-20 14:47:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 14:47:16] [INFO ] [Nat]Absence check using state equation in 150 ms returned sat
[2023-03-20 14:47:16] [INFO ] State equation strengthened by 73 read => feed constraints.
[2023-03-20 14:47:16] [INFO ] [Nat]Added 73 Read/Feed constraints in 21 ms returned sat
[2023-03-20 14:47:17] [INFO ] Computed and/alt/rep : 458/1617/458 causal constraints (skipped 237 transitions) in 60 ms.
[2023-03-20 14:47:17] [INFO ] Added : 47 causal constraints over 10 iterations in 640 ms. Result :sat
Minimization took 101 ms.
[2023-03-20 14:47:17] [INFO ] [Real]Absence check using 59 positive place invariants in 14 ms returned sat
[2023-03-20 14:47:17] [INFO ] [Real]Absence check using 59 positive and 7 generalized place invariants in 5 ms returned sat
[2023-03-20 14:47:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 14:47:18] [INFO ] [Real]Absence check using state equation in 140 ms returned sat
[2023-03-20 14:47:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 14:47:18] [INFO ] [Nat]Absence check using 59 positive place invariants in 14 ms returned sat
[2023-03-20 14:47:18] [INFO ] [Nat]Absence check using 59 positive and 7 generalized place invariants in 3 ms returned sat
[2023-03-20 14:47:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 14:47:18] [INFO ] [Nat]Absence check using state equation in 148 ms returned sat
[2023-03-20 14:47:18] [INFO ] [Nat]Added 73 Read/Feed constraints in 15 ms returned sat
[2023-03-20 14:47:18] [INFO ] Computed and/alt/rep : 458/1617/458 causal constraints (skipped 237 transitions) in 48 ms.
[2023-03-20 14:47:18] [INFO ] Added : 30 causal constraints over 6 iterations in 384 ms. Result :sat
Minimization took 86 ms.
[2023-03-20 14:47:18] [INFO ] [Real]Absence check using 59 positive place invariants in 14 ms returned sat
[2023-03-20 14:47:18] [INFO ] [Real]Absence check using 59 positive and 7 generalized place invariants in 4 ms returned sat
[2023-03-20 14:47:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 14:47:19] [INFO ] [Real]Absence check using state equation in 138 ms returned sat
[2023-03-20 14:47:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 14:47:19] [INFO ] [Nat]Absence check using 59 positive place invariants in 15 ms returned sat
[2023-03-20 14:47:19] [INFO ] [Nat]Absence check using 59 positive and 7 generalized place invariants in 4 ms returned sat
[2023-03-20 14:47:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 14:47:19] [INFO ] [Nat]Absence check using state equation in 150 ms returned sat
[2023-03-20 14:47:19] [INFO ] [Nat]Added 73 Read/Feed constraints in 18 ms returned sat
[2023-03-20 14:47:19] [INFO ] Computed and/alt/rep : 458/1617/458 causal constraints (skipped 237 transitions) in 34 ms.
[2023-03-20 14:47:19] [INFO ] Added : 36 causal constraints over 8 iterations in 435 ms. Result :sat
Minimization took 100 ms.
[2023-03-20 14:47:20] [INFO ] [Real]Absence check using 59 positive place invariants in 14 ms returned sat
[2023-03-20 14:47:20] [INFO ] [Real]Absence check using 59 positive and 7 generalized place invariants in 9 ms returned sat
[2023-03-20 14:47:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 14:47:20] [INFO ] [Real]Absence check using state equation in 154 ms returned sat
[2023-03-20 14:47:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 14:47:20] [INFO ] [Nat]Absence check using 59 positive place invariants in 15 ms returned sat
[2023-03-20 14:47:20] [INFO ] [Nat]Absence check using 59 positive and 7 generalized place invariants in 6 ms returned sat
[2023-03-20 14:47:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 14:47:20] [INFO ] [Nat]Absence check using state equation in 148 ms returned sat
[2023-03-20 14:47:20] [INFO ] [Nat]Added 73 Read/Feed constraints in 19 ms returned sat
[2023-03-20 14:47:20] [INFO ] Computed and/alt/rep : 458/1617/458 causal constraints (skipped 237 transitions) in 45 ms.
[2023-03-20 14:47:21] [INFO ] Deduced a trap composed of 222 places in 118 ms of which 3 ms to minimize.
[2023-03-20 14:47:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 189 ms
[2023-03-20 14:47:21] [INFO ] Added : 105 causal constraints over 21 iterations in 1165 ms. Result :sat
Minimization took 112 ms.
[2023-03-20 14:47:21] [INFO ] [Real]Absence check using 59 positive place invariants in 13 ms returned sat
[2023-03-20 14:47:21] [INFO ] [Real]Absence check using 59 positive and 7 generalized place invariants in 4 ms returned sat
[2023-03-20 14:47:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 14:47:22] [INFO ] [Real]Absence check using state equation in 134 ms returned sat
[2023-03-20 14:47:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 14:47:22] [INFO ] [Nat]Absence check using 59 positive place invariants in 14 ms returned sat
[2023-03-20 14:47:22] [INFO ] [Nat]Absence check using 59 positive and 7 generalized place invariants in 4 ms returned sat
[2023-03-20 14:47:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 14:47:22] [INFO ] [Nat]Absence check using state equation in 145 ms returned sat
[2023-03-20 14:47:22] [INFO ] [Nat]Added 73 Read/Feed constraints in 18 ms returned sat
[2023-03-20 14:47:22] [INFO ] Computed and/alt/rep : 458/1617/458 causal constraints (skipped 237 transitions) in 36 ms.
[2023-03-20 14:47:23] [INFO ] Added : 69 causal constraints over 14 iterations in 657 ms. Result :sat
Minimization took 115 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0]
FORMULA Vasy2003-PT-none-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Vasy2003-PT-none-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Vasy2003-PT-none-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Vasy2003-PT-none-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 1 out of 485 places. Attempting structural reductions.
Drop transitions removed 1 transitions
Starting structural reductions in SAFETY mode, iteration 0 : 485/485 places, 751/751 transitions.
Graph (trivial) has 166 edges and 485 vertex of which 4 / 485 are part of one of the 2 SCC in 3 ms
Free SCC test removed 2 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1554 edges and 483 vertex of which 413 are kept as prefixes of interest. Removing 70 places using SCC suffix rule.3 ms
Discarding 70 places :
Also discarding 55 output transitions
Drop transitions removed 55 transitions
Drop transitions removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 20 rules applied. Total rules applied 22 place count 413 transition count 668
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 23 place count 412 transition count 668
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 23 place count 412 transition count 650
Deduced a syphon composed of 18 places in 2 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 59 place count 394 transition count 650
Discarding 134 places :
Symmetric choice reduction at 2 with 134 rule applications. Total rules 193 place count 260 transition count 516
Ensure Unique test removed 1 places
Iterating global reduction 2 with 135 rules applied. Total rules applied 328 place count 259 transition count 516
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 2 with 30 rules applied. Total rules applied 358 place count 259 transition count 486
Discarding 100 places :
Symmetric choice reduction at 3 with 100 rule applications. Total rules 458 place count 159 transition count 360
Iterating global reduction 3 with 100 rules applied. Total rules applied 558 place count 159 transition count 360
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 73 rules applied. Total rules applied 631 place count 159 transition count 287
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 632 place count 158 transition count 287
Discarding 42 places :
Symmetric choice reduction at 5 with 42 rule applications. Total rules 674 place count 116 transition count 212
Iterating global reduction 5 with 42 rules applied. Total rules applied 716 place count 116 transition count 212
Ensure Unique test removed 39 transitions
Reduce isomorphic transitions removed 39 transitions.
Iterating post reduction 5 with 39 rules applied. Total rules applied 755 place count 116 transition count 173
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 757 place count 114 transition count 161
Iterating global reduction 6 with 2 rules applied. Total rules applied 759 place count 114 transition count 161
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 760 place count 113 transition count 159
Iterating global reduction 6 with 1 rules applied. Total rules applied 761 place count 113 transition count 159
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 762 place count 112 transition count 157
Iterating global reduction 6 with 1 rules applied. Total rules applied 763 place count 112 transition count 157
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 764 place count 111 transition count 154
Iterating global reduction 6 with 1 rules applied. Total rules applied 765 place count 111 transition count 154
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 766 place count 110 transition count 151
Iterating global reduction 6 with 1 rules applied. Total rules applied 767 place count 110 transition count 151
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 768 place count 109 transition count 149
Iterating global reduction 6 with 1 rules applied. Total rules applied 769 place count 109 transition count 149
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 6 with 14 rules applied. Total rules applied 783 place count 102 transition count 142
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 6 with 8 rules applied. Total rules applied 791 place count 102 transition count 134
Free-agglomeration rule applied 2 times.
Iterating global reduction 6 with 2 rules applied. Total rules applied 793 place count 102 transition count 132
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 795 place count 100 transition count 132
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 796 place count 99 transition count 131
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (trivial) has 17 edges and 91 vertex of which 4 / 91 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 7 with 13 rules applied. Total rules applied 809 place count 89 transition count 127
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 813 place count 89 transition count 123
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 5 Pre rules applied. Total rules applied 813 place count 89 transition count 118
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 9 with 15 rules applied. Total rules applied 828 place count 79 transition count 118
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 9 with 3 rules applied. Total rules applied 831 place count 79 transition count 115
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 2 Pre rules applied. Total rules applied 831 place count 79 transition count 113
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 10 with 5 rules applied. Total rules applied 836 place count 76 transition count 113
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 1 Pre rules applied. Total rules applied 836 place count 76 transition count 112
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 10 with 3 rules applied. Total rules applied 839 place count 74 transition count 112
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 840 place count 74 transition count 111
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 11 with 6 rules applied. Total rules applied 846 place count 70 transition count 109
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 847 place count 69 transition count 108
Iterating global reduction 11 with 1 rules applied. Total rules applied 848 place count 69 transition count 108
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 11 with 4 rules applied. Total rules applied 852 place count 67 transition count 106
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 11 with 6 rules applied. Total rules applied 858 place count 67 transition count 100
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 859 place count 66 transition count 98
Iterating global reduction 12 with 1 rules applied. Total rules applied 860 place count 66 transition count 98
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 12 with 3 rules applied. Total rules applied 863 place count 66 transition count 95
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 864 place count 66 transition count 94
Free-agglomeration rule applied 6 times.
Iterating global reduction 13 with 6 rules applied. Total rules applied 870 place count 66 transition count 88
Reduce places removed 8 places and 0 transitions.
Drop transitions removed 3 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 13 with 12 rules applied. Total rules applied 882 place count 58 transition count 84
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 1 Pre rules applied. Total rules applied 882 place count 58 transition count 83
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 14 with 3 rules applied. Total rules applied 885 place count 56 transition count 83
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 1 Pre rules applied. Total rules applied 885 place count 56 transition count 82
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 14 with 3 rules applied. Total rules applied 888 place count 54 transition count 82
Graph (trivial) has 9 edges and 54 vertex of which 2 / 54 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 14 with 2 rules applied. Total rules applied 890 place count 52 transition count 82
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 14 with 3 rules applied. Total rules applied 893 place count 52 transition count 79
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 15 with 2 rules applied. Total rules applied 895 place count 52 transition count 77
Free-agglomeration rule applied 1 times.
Iterating global reduction 15 with 1 rules applied. Total rules applied 896 place count 52 transition count 76
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 15 with 4 rules applied. Total rules applied 900 place count 50 transition count 74
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 16 with 2 rules applied. Total rules applied 902 place count 49 transition count 73
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 16 with 2 rules applied. Total rules applied 904 place count 49 transition count 74
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 16 with 6 rules applied. Total rules applied 910 place count 47 transition count 70
Applied a total of 910 rules in 152 ms. Remains 47 /485 variables (removed 438) and now considering 70/751 (removed 681) transitions.
Finished structural reductions, in 1 iterations. Remains : 47/485 places, 70/751 transitions.
Normalized transition count is 60 out of 70 initially.
// Phase 1: matrix 60 rows 47 cols
[2023-03-20 14:47:23] [INFO ] Computed 13 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 601 ms. (steps per millisecond=1663 ) properties (out of 1) seen :1
FORMULA Vasy2003-PT-none-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 8804 ms.

BK_STOP 1679323644577

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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="Vasy2003-PT-none"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2022"
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-5348"
echo " Executing tool gold2022"
echo " Input is Vasy2003-PT-none, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r511-tall-167912735700154"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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