Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r571-tall-171734910100056.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is CO4-PT-12, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r571-tall-171734910100056
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 640K
-rw-r--r-- 1 mcc users 8.2K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 94K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 12K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 126K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 177K Jun 2 16:33 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 CO4-PT-12-UpperBounds-00
FORMULA_NAME CO4-PT-12-UpperBounds-01
FORMULA_NAME CO4-PT-12-UpperBounds-02
FORMULA_NAME CO4-PT-12-UpperBounds-03
FORMULA_NAME CO4-PT-12-UpperBounds-04
FORMULA_NAME CO4-PT-12-UpperBounds-05
FORMULA_NAME CO4-PT-12-UpperBounds-06
FORMULA_NAME CO4-PT-12-UpperBounds-07
FORMULA_NAME CO4-PT-12-UpperBounds-08
FORMULA_NAME CO4-PT-12-UpperBounds-09
FORMULA_NAME CO4-PT-12-UpperBounds-10
FORMULA_NAME CO4-PT-12-UpperBounds-11
FORMULA_NAME CO4-PT-12-UpperBounds-12
FORMULA_NAME CO4-PT-12-UpperBounds-13
FORMULA_NAME CO4-PT-12-UpperBounds-14
FORMULA_NAME CO4-PT-12-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717368694979

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CO4-PT-12
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202304061127
[2024-06-02 22:51:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-06-02 22:51:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 22:51:36] [INFO ] Load time of PNML (sax parser for PT used): 79 ms
[2024-06-02 22:51:36] [INFO ] Transformed 649 places.
[2024-06-02 22:51:36] [INFO ] Transformed 782 transitions.
[2024-06-02 22:51:36] [INFO ] Found NUPN structural information;
[2024-06-02 22:51:36] [INFO ] Parsed PT model containing 649 places and 782 transitions and 1960 arcs in 149 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
Deduced a syphon composed of 172 places in 10 ms
Reduce places removed 172 places and 219 transitions.
FORMULA CO4-PT-12-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-12-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-12-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 563 rows 477 cols
[2024-06-02 22:51:36] [INFO ] Computed 9 invariants in 30 ms
Incomplete random walk after 10000 steps, including 4 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 13) seen :2
FORMULA CO4-PT-12-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CO4-PT-12-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 64 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 11) seen :1
FORMULA CO4-PT-12-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 21 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 76 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 78 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 77 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 10) seen :1
FORMULA CO4-PT-12-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 9) seen :1
FORMULA CO4-PT-12-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 79 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 7 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 8) seen :0
[2024-06-02 22:51:37] [INFO ] Invariant cache hit.
[2024-06-02 22:51:37] [INFO ] [Real]Absence check using 8 positive place invariants in 10 ms returned sat
[2024-06-02 22:51:37] [INFO ] [Real]Absence check using 8 positive and 1 generalized place invariants in 0 ms returned sat
[2024-06-02 22:51:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 22:51:37] [INFO ] [Real]Absence check using state equation in 135 ms returned sat
[2024-06-02 22:51:37] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:51:37] [INFO ] [Nat]Absence check using 8 positive place invariants in 9 ms returned sat
[2024-06-02 22:51:37] [INFO ] [Nat]Absence check using 8 positive and 1 generalized place invariants in 0 ms returned sat
[2024-06-02 22:51:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 22:51:37] [INFO ] [Nat]Absence check using state equation in 168 ms returned sat
[2024-06-02 22:51:37] [INFO ] Computed and/alt/rep : 498/703/498 causal constraints (skipped 64 transitions) in 51 ms.
[2024-06-02 22:51:38] [INFO ] Added : 101 causal constraints over 21 iterations in 769 ms. Result :sat
Minimization took 72 ms.
[2024-06-02 22:51:38] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2024-06-02 22:51:38] [INFO ] [Real]Absence check using 8 positive and 1 generalized place invariants in 0 ms returned sat
[2024-06-02 22:51:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 22:51:38] [INFO ] [Real]Absence check using state equation in 138 ms returned sat
[2024-06-02 22:51:39] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:51:39] [INFO ] [Nat]Absence check using 8 positive place invariants in 9 ms returned sat
[2024-06-02 22:51:39] [INFO ] [Nat]Absence check using 8 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-02 22:51:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 22:51:39] [INFO ] [Nat]Absence check using state equation in 166 ms returned sat
[2024-06-02 22:51:39] [INFO ] Computed and/alt/rep : 498/703/498 causal constraints (skipped 64 transitions) in 31 ms.
[2024-06-02 22:51:40] [INFO ] Deduced a trap composed of 22 places in 140 ms of which 4 ms to minimize.
[2024-06-02 22:51:40] [INFO ] Deduced a trap composed of 67 places in 135 ms of which 1 ms to minimize.
[2024-06-02 22:51:40] [INFO ] Deduced a trap composed of 159 places in 145 ms of which 0 ms to minimize.
[2024-06-02 22:51:40] [INFO ] Deduced a trap composed of 69 places in 119 ms of which 1 ms to minimize.
[2024-06-02 22:51:40] [INFO ] Deduced a trap composed of 160 places in 117 ms of which 1 ms to minimize.
[2024-06-02 22:51:40] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 849 ms
[2024-06-02 22:51:41] [INFO ] Added : 120 causal constraints over 25 iterations in 1722 ms. Result :sat
Minimization took 89 ms.
[2024-06-02 22:51:41] [INFO ] [Real]Absence check using 8 positive place invariants in 7 ms returned sat
[2024-06-02 22:51:41] [INFO ] [Real]Absence check using 8 positive and 1 generalized place invariants in 0 ms returned sat
[2024-06-02 22:51:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 22:51:41] [INFO ] [Real]Absence check using state equation in 120 ms returned sat
[2024-06-02 22:51:41] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:51:41] [INFO ] [Nat]Absence check using 8 positive place invariants in 8 ms returned sat
[2024-06-02 22:51:41] [INFO ] [Nat]Absence check using 8 positive and 1 generalized place invariants in 0 ms returned sat
[2024-06-02 22:51:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 22:51:41] [INFO ] [Nat]Absence check using state equation in 141 ms returned sat
[2024-06-02 22:51:41] [INFO ] Computed and/alt/rep : 498/703/498 causal constraints (skipped 64 transitions) in 37 ms.
[2024-06-02 22:51:42] [INFO ] Added : 102 causal constraints over 22 iterations in 707 ms. Result :sat
Minimization took 75 ms.
[2024-06-02 22:51:42] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2024-06-02 22:51:42] [INFO ] [Real]Absence check using 8 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-02 22:51:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 22:51:42] [INFO ] [Real]Absence check using state equation in 144 ms returned sat
[2024-06-02 22:51:42] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:51:42] [INFO ] [Nat]Absence check using 8 positive place invariants in 8 ms returned sat
[2024-06-02 22:51:42] [INFO ] [Nat]Absence check using 8 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-02 22:51:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 22:51:42] [INFO ] [Nat]Absence check using state equation in 146 ms returned sat
[2024-06-02 22:51:42] [INFO ] Computed and/alt/rep : 498/703/498 causal constraints (skipped 64 transitions) in 35 ms.
[2024-06-02 22:51:43] [INFO ] Added : 93 causal constraints over 19 iterations in 634 ms. Result :sat
Minimization took 71 ms.
[2024-06-02 22:51:43] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2024-06-02 22:51:43] [INFO ] [Real]Absence check using 8 positive and 1 generalized place invariants in 0 ms returned sat
[2024-06-02 22:51:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 22:51:43] [INFO ] [Real]Absence check using state equation in 130 ms returned sat
[2024-06-02 22:51:43] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:51:43] [INFO ] [Nat]Absence check using 8 positive place invariants in 8 ms returned sat
[2024-06-02 22:51:43] [INFO ] [Nat]Absence check using 8 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-02 22:51:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 22:51:44] [INFO ] [Nat]Absence check using state equation in 145 ms returned sat
[2024-06-02 22:51:44] [INFO ] Deduced a trap composed of 78 places in 128 ms of which 1 ms to minimize.
[2024-06-02 22:51:44] [INFO ] Deduced a trap composed of 22 places in 117 ms of which 0 ms to minimize.
[2024-06-02 22:51:44] [INFO ] Deduced a trap composed of 16 places in 117 ms of which 1 ms to minimize.
[2024-06-02 22:51:44] [INFO ] Deduced a trap composed of 22 places in 129 ms of which 0 ms to minimize.
[2024-06-02 22:51:44] [INFO ] Deduced a trap composed of 21 places in 113 ms of which 1 ms to minimize.
[2024-06-02 22:51:44] [INFO ] Deduced a trap composed of 189 places in 103 ms of which 1 ms to minimize.
[2024-06-02 22:51:44] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 835 ms
[2024-06-02 22:51:44] [INFO ] Computed and/alt/rep : 498/703/498 causal constraints (skipped 64 transitions) in 32 ms.
[2024-06-02 22:51:45] [INFO ] Added : 76 causal constraints over 16 iterations in 524 ms. Result :sat
Minimization took 75 ms.
[2024-06-02 22:51:45] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2024-06-02 22:51:45] [INFO ] [Real]Absence check using 8 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-02 22:51:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 22:51:45] [INFO ] [Real]Absence check using state equation in 139 ms returned sat
[2024-06-02 22:51:45] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:51:45] [INFO ] [Nat]Absence check using 8 positive place invariants in 18 ms returned sat
[2024-06-02 22:51:45] [INFO ] [Nat]Absence check using 8 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-02 22:51:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 22:51:46] [INFO ] [Nat]Absence check using state equation in 143 ms returned sat
[2024-06-02 22:51:46] [INFO ] Deduced a trap composed of 23 places in 127 ms of which 1 ms to minimize.
[2024-06-02 22:51:46] [INFO ] Deduced a trap composed of 154 places in 106 ms of which 0 ms to minimize.
[2024-06-02 22:51:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 293 ms
[2024-06-02 22:51:46] [INFO ] Computed and/alt/rep : 498/703/498 causal constraints (skipped 64 transitions) in 32 ms.
[2024-06-02 22:51:47] [INFO ] Deduced a trap composed of 49 places in 70 ms of which 0 ms to minimize.
[2024-06-02 22:51:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 121 ms
[2024-06-02 22:51:47] [INFO ] Added : 111 causal constraints over 23 iterations in 868 ms. Result :sat
Minimization took 69 ms.
[2024-06-02 22:51:47] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2024-06-02 22:51:47] [INFO ] [Real]Absence check using 8 positive and 1 generalized place invariants in 0 ms returned sat
[2024-06-02 22:51:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 22:51:47] [INFO ] [Real]Absence check using state equation in 133 ms returned sat
[2024-06-02 22:51:47] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:51:47] [INFO ] [Nat]Absence check using 8 positive place invariants in 8 ms returned sat
[2024-06-02 22:51:47] [INFO ] [Nat]Absence check using 8 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-02 22:51:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 22:51:47] [INFO ] [Nat]Absence check using state equation in 146 ms returned sat
[2024-06-02 22:51:47] [INFO ] Deduced a trap composed of 65 places in 116 ms of which 0 ms to minimize.
[2024-06-02 22:51:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 160 ms
[2024-06-02 22:51:47] [INFO ] Computed and/alt/rep : 498/703/498 causal constraints (skipped 64 transitions) in 29 ms.
[2024-06-02 22:51:48] [INFO ] Deduced a trap composed of 210 places in 110 ms of which 1 ms to minimize.
[2024-06-02 22:51:48] [INFO ] Deduced a trap composed of 190 places in 87 ms of which 0 ms to minimize.
[2024-06-02 22:51:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 281 ms
[2024-06-02 22:51:49] [INFO ] Added : 116 causal constraints over 24 iterations in 1048 ms. Result :sat
Minimization took 81 ms.
[2024-06-02 22:51:49] [INFO ] [Real]Absence check using 8 positive place invariants in 7 ms returned sat
[2024-06-02 22:51:49] [INFO ] [Real]Absence check using 8 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-02 22:51:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 22:51:49] [INFO ] [Real]Absence check using state equation in 125 ms returned sat
[2024-06-02 22:51:49] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:51:49] [INFO ] [Nat]Absence check using 8 positive place invariants in 8 ms returned sat
[2024-06-02 22:51:49] [INFO ] [Nat]Absence check using 8 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-02 22:51:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 22:51:49] [INFO ] [Nat]Absence check using state equation in 165 ms returned sat
[2024-06-02 22:51:49] [INFO ] Deduced a trap composed of 189 places in 99 ms of which 1 ms to minimize.
[2024-06-02 22:51:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 139 ms
[2024-06-02 22:51:49] [INFO ] Computed and/alt/rep : 498/703/498 causal constraints (skipped 64 transitions) in 29 ms.
[2024-06-02 22:51:50] [INFO ] Added : 90 causal constraints over 18 iterations in 546 ms. Result :sat
Minimization took 64 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0]
FORMULA CO4-PT-12-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-12-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-12-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-12-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-12-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 3 out of 477 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 477/477 places, 563/563 transitions.
Graph (trivial) has 479 edges and 477 vertex of which 3 / 477 are part of one of the 1 SCC in 3 ms
Free SCC test removed 2 places
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (complete) has 770 edges and 475 vertex of which 434 are kept as prefixes of interest. Removing 41 places using SCC suffix rule.2 ms
Discarding 41 places :
Also discarding 20 output transitions
Drop transitions removed 20 transitions
Drop transitions removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Drop transitions removed 273 transitions
Trivial Post-agglo rules discarded 273 transitions
Performed 273 trivial Post agglomeration. Transition count delta: 273
Iterating post reduction 0 with 298 rules applied. Total rules applied 300 place count 434 transition count 242
Reduce places removed 273 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 291 rules applied. Total rules applied 591 place count 161 transition count 224
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 2 with 20 rules applied. Total rules applied 611 place count 153 transition count 212
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 8 rules applied. Total rules applied 619 place count 149 transition count 208
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 6 rules applied. Total rules applied 625 place count 147 transition count 204
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 629 place count 145 transition count 202
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 629 place count 145 transition count 201
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 631 place count 144 transition count 201
Discarding 27 places :
Symmetric choice reduction at 6 with 27 rule applications. Total rules 658 place count 117 transition count 174
Iterating global reduction 6 with 27 rules applied. Total rules applied 685 place count 117 transition count 174
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 7 Pre rules applied. Total rules applied 685 place count 117 transition count 167
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 699 place count 110 transition count 167
Graph (complete) has 264 edges and 110 vertex of which 108 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Iterating post reduction 6 with 1 rules applied. Total rules applied 700 place count 108 transition count 166
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 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 7 with 3 rules applied. Total rules applied 703 place count 108 transition count 163
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 704 place count 107 transition count 163
Discarding 17 places :
Symmetric choice reduction at 9 with 17 rule applications. Total rules 721 place count 90 transition count 128
Iterating global reduction 9 with 17 rules applied. Total rules applied 738 place count 90 transition count 128
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 740 place count 90 transition count 126
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 742 place count 88 transition count 124
Iterating global reduction 10 with 2 rules applied. Total rules applied 744 place count 88 transition count 124
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 746 place count 88 transition count 122
Performed 33 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 33 places in 1 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 11 with 66 rules applied. Total rules applied 812 place count 55 transition count 88
Drop transitions removed 4 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 11 with 7 rules applied. Total rules applied 819 place count 55 transition count 81
Discarding 3 places :
Symmetric choice reduction at 12 with 3 rule applications. Total rules 822 place count 52 transition count 78
Iterating global reduction 12 with 3 rules applied. Total rules applied 825 place count 52 transition count 78
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 826 place count 52 transition count 77
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 13 with 4 rules applied. Total rules applied 830 place count 50 transition count 75
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 13 with 2 rules applied. Total rules applied 832 place count 50 transition count 73
Discarding 2 places :
Symmetric choice reduction at 14 with 2 rule applications. Total rules 834 place count 48 transition count 71
Iterating global reduction 14 with 2 rules applied. Total rules applied 836 place count 48 transition count 71
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 837 place count 48 transition count 70
Discarding 1 places :
Symmetric choice reduction at 15 with 1 rule applications. Total rules 838 place count 47 transition count 69
Iterating global reduction 15 with 1 rules applied. Total rules applied 839 place count 47 transition count 69
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 15 with 1 rules applied. Total rules applied 840 place count 47 transition count 68
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 16 with 18 rules applied. Total rules applied 858 place count 38 transition count 69
Drop transitions removed 9 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 16 with 17 rules applied. Total rules applied 875 place count 38 transition count 52
Discarding 8 places :
Symmetric choice reduction at 17 with 8 rule applications. Total rules 883 place count 30 transition count 44
Iterating global reduction 17 with 8 rules applied. Total rules applied 891 place count 30 transition count 44
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 17 with 8 rules applied. Total rules applied 899 place count 30 transition count 36
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 18 with 2 rules applied. Total rules applied 901 place count 29 transition count 39
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 18 with 1 rules applied. Total rules applied 902 place count 29 transition count 38
Discarding 1 places :
Symmetric choice reduction at 18 with 1 rule applications. Total rules 903 place count 28 transition count 37
Iterating global reduction 18 with 1 rules applied. Total rules applied 904 place count 28 transition count 37
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 18 with 2 rules applied. Total rules applied 906 place count 28 transition count 35
Free-agglomeration rule applied 7 times.
Iterating global reduction 19 with 7 rules applied. Total rules applied 913 place count 28 transition count 28
Reduce places removed 7 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 19 with 9 rules applied. Total rules applied 922 place count 21 transition count 26
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 20 with 1 rules applied. Total rules applied 923 place count 20 transition count 25
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 20 with 2 rules applied. Total rules applied 925 place count 18 transition count 25
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 21 with 6 rules applied. Total rules applied 931 place count 15 transition count 22
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 21 with 4 rules applied. Total rules applied 935 place count 15 transition count 18
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 22 with 2 rules applied. Total rules applied 937 place count 15 transition count 16
Applied a total of 937 rules in 79 ms. Remains 15 /477 variables (removed 462) and now considering 16/563 (removed 547) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80 ms. Remains : 15/477 places, 16/563 transitions.
Successfully produced net in file /tmp/petri1000_1819095954426863799.dot
Successfully produced net in file /tmp/petri1001_2811729642595772548.dot
Drop transitions removed 2 transitions
Dominated transitions for bounds rules discarded 2 transitions
// Phase 1: matrix 14 rows 15 cols
[2024-06-02 22:51:50] [INFO ] Computed 6 invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 470 ms. (steps per millisecond=2127 ) properties (out of 3) seen :3
FORMULA CO4-PT-12-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CO4-PT-12-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CO4-PT-12-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 14631 ms.

BK_STOP 1717368712616

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="CO4-PT-12"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is CO4-PT-12, 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 r571-tall-171734910100056"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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