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-171734910100066.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-14, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r571-tall-171734910100066
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 600K
-rw-r--r-- 1 mcc users 5.9K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K 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 18K 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 120K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K 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 174K 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-14-UpperBounds-00
FORMULA_NAME CO4-PT-14-UpperBounds-01
FORMULA_NAME CO4-PT-14-UpperBounds-02
FORMULA_NAME CO4-PT-14-UpperBounds-03
FORMULA_NAME CO4-PT-14-UpperBounds-04
FORMULA_NAME CO4-PT-14-UpperBounds-05
FORMULA_NAME CO4-PT-14-UpperBounds-06
FORMULA_NAME CO4-PT-14-UpperBounds-07
FORMULA_NAME CO4-PT-14-UpperBounds-08
FORMULA_NAME CO4-PT-14-UpperBounds-09
FORMULA_NAME CO4-PT-14-UpperBounds-10
FORMULA_NAME CO4-PT-14-UpperBounds-11
FORMULA_NAME CO4-PT-14-UpperBounds-12
FORMULA_NAME CO4-PT-14-UpperBounds-13
FORMULA_NAME CO4-PT-14-UpperBounds-14
FORMULA_NAME CO4-PT-14-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717368724542

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-14
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202304061127
[2024-06-02 22:52:06] [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:52:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 22:52:06] [INFO ] Load time of PNML (sax parser for PT used): 75 ms
[2024-06-02 22:52:06] [INFO ] Transformed 680 places.
[2024-06-02 22:52:06] [INFO ] Transformed 812 transitions.
[2024-06-02 22:52:06] [INFO ] Found NUPN structural information;
[2024-06-02 22:52:06] [INFO ] Parsed PT model containing 680 places and 812 transitions and 1822 arcs in 144 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
Deduced a syphon composed of 100 places in 8 ms
Reduce places removed 100 places and 120 transitions.
FORMULA CO4-PT-14-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-14-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-14-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-14-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 692 rows 580 cols
[2024-06-02 22:52:06] [INFO ] Computed 8 invariants in 33 ms
Incomplete random walk after 10000 steps, including 39 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 12) seen :2
FORMULA CO4-PT-14-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CO4-PT-14-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 19 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 10) seen :1
FORMULA CO4-PT-14-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 34 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 7 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 9 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 28 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 11 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 9) seen :0
[2024-06-02 22:52:06] [INFO ] Invariant cache hit.
[2024-06-02 22:52:06] [INFO ] [Real]Absence check using 8 positive place invariants in 12 ms returned sat
[2024-06-02 22:52:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 22:52:07] [INFO ] [Real]Absence check using state equation in 181 ms returned sat
[2024-06-02 22:52:07] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:52:07] [INFO ] [Nat]Absence check using 8 positive place invariants in 11 ms returned sat
[2024-06-02 22:52:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 22:52:07] [INFO ] [Nat]Absence check using state equation in 170 ms returned sat
[2024-06-02 22:52:07] [INFO ] Deduced a trap composed of 18 places in 118 ms of which 4 ms to minimize.
[2024-06-02 22:52:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 200 ms
[2024-06-02 22:52:07] [INFO ] Computed and/alt/rep : 606/769/606 causal constraints (skipped 85 transitions) in 77 ms.
[2024-06-02 22:52:08] [INFO ] Added : 157 causal constraints over 32 iterations in 1348 ms. Result :sat
Minimization took 73 ms.
[2024-06-02 22:52:09] [INFO ] [Real]Absence check using 8 positive place invariants in 9 ms returned sat
[2024-06-02 22:52:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 22:52:09] [INFO ] [Real]Absence check using state equation in 173 ms returned sat
[2024-06-02 22:52:09] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:52:09] [INFO ] [Nat]Absence check using 8 positive place invariants in 10 ms returned sat
[2024-06-02 22:52:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 22:52:09] [INFO ] [Nat]Absence check using state equation in 167 ms returned sat
[2024-06-02 22:52:09] [INFO ] Computed and/alt/rep : 606/769/606 causal constraints (skipped 85 transitions) in 44 ms.
[2024-06-02 22:52:10] [INFO ] Added : 101 causal constraints over 21 iterations in 821 ms. Result :sat
Minimization took 71 ms.
[2024-06-02 22:52:10] [INFO ] [Real]Absence check using 8 positive place invariants in 9 ms returned sat
[2024-06-02 22:52:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 22:52:10] [INFO ] [Real]Absence check using state equation in 156 ms returned sat
[2024-06-02 22:52:10] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:52:11] [INFO ] [Nat]Absence check using 8 positive place invariants in 10 ms returned sat
[2024-06-02 22:52:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 22:52:11] [INFO ] [Nat]Absence check using state equation in 174 ms returned sat
[2024-06-02 22:52:11] [INFO ] Computed and/alt/rep : 606/769/606 causal constraints (skipped 85 transitions) in 48 ms.
[2024-06-02 22:52:11] [INFO ] Added : 84 causal constraints over 17 iterations in 657 ms. Result :sat
Minimization took 63 ms.
[2024-06-02 22:52:12] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2024-06-02 22:52:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 22:52:12] [INFO ] [Real]Absence check using state equation in 160 ms returned sat
[2024-06-02 22:52:12] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:52:12] [INFO ] [Nat]Absence check using 8 positive place invariants in 9 ms returned sat
[2024-06-02 22:52:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 22:52:12] [INFO ] [Nat]Absence check using state equation in 177 ms returned sat
[2024-06-02 22:52:12] [INFO ] Deduced a trap composed of 18 places in 85 ms of which 1 ms to minimize.
[2024-06-02 22:52:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 133 ms
[2024-06-02 22:52:12] [INFO ] Computed and/alt/rep : 606/769/606 causal constraints (skipped 85 transitions) in 36 ms.
[2024-06-02 22:52:13] [INFO ] Added : 157 causal constraints over 32 iterations in 1193 ms. Result :sat
Minimization took 84 ms.
[2024-06-02 22:52:14] [INFO ] [Real]Absence check using 8 positive place invariants in 9 ms returned sat
[2024-06-02 22:52:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 22:52:14] [INFO ] [Real]Absence check using state equation in 154 ms returned sat
[2024-06-02 22:52:14] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:52:14] [INFO ] [Nat]Absence check using 8 positive place invariants in 10 ms returned sat
[2024-06-02 22:52:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 22:52:14] [INFO ] [Nat]Absence check using state equation in 163 ms returned sat
[2024-06-02 22:52:14] [INFO ] Computed and/alt/rep : 606/769/606 causal constraints (skipped 85 transitions) in 37 ms.
[2024-06-02 22:52:15] [INFO ] Added : 79 causal constraints over 16 iterations in 626 ms. Result :sat
Minimization took 60 ms.
[2024-06-02 22:52:15] [INFO ] [Real]Absence check using 8 positive place invariants in 9 ms returned sat
[2024-06-02 22:52:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 22:52:15] [INFO ] [Real]Absence check using state equation in 181 ms returned sat
[2024-06-02 22:52:15] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:52:15] [INFO ] [Nat]Absence check using 8 positive place invariants in 10 ms returned sat
[2024-06-02 22:52:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 22:52:15] [INFO ] [Nat]Absence check using state equation in 153 ms returned sat
[2024-06-02 22:52:15] [INFO ] Computed and/alt/rep : 606/769/606 causal constraints (skipped 85 transitions) in 49 ms.
[2024-06-02 22:52:16] [INFO ] Deduced a trap composed of 274 places in 162 ms of which 2 ms to minimize.
[2024-06-02 22:52:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 255 ms
[2024-06-02 22:52:16] [INFO ] Added : 61 causal constraints over 13 iterations in 887 ms. Result :sat
Minimization took 73 ms.
[2024-06-02 22:52:17] [INFO ] [Real]Absence check using 8 positive place invariants in 10 ms returned sat
[2024-06-02 22:52:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 22:52:17] [INFO ] [Real]Absence check using state equation in 176 ms returned sat
[2024-06-02 22:52:17] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:52:17] [INFO ] [Nat]Absence check using 8 positive place invariants in 11 ms returned sat
[2024-06-02 22:52:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 22:52:17] [INFO ] [Nat]Absence check using state equation in 189 ms returned sat
[2024-06-02 22:52:17] [INFO ] Deduced a trap composed of 18 places in 70 ms of which 1 ms to minimize.
[2024-06-02 22:52:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 120 ms
[2024-06-02 22:52:17] [INFO ] Computed and/alt/rep : 606/769/606 causal constraints (skipped 85 transitions) in 40 ms.
[2024-06-02 22:52:18] [INFO ] Added : 134 causal constraints over 27 iterations in 1012 ms. Result :sat
Minimization took 68 ms.
[2024-06-02 22:52:18] [INFO ] [Real]Absence check using 8 positive place invariants in 9 ms returned sat
[2024-06-02 22:52:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 22:52:19] [INFO ] [Real]Absence check using state equation in 169 ms returned sat
[2024-06-02 22:52:19] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:52:19] [INFO ] [Nat]Absence check using 8 positive place invariants in 10 ms returned sat
[2024-06-02 22:52:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 22:52:19] [INFO ] [Nat]Absence check using state equation in 175 ms returned sat
[2024-06-02 22:52:19] [INFO ] Computed and/alt/rep : 606/769/606 causal constraints (skipped 85 transitions) in 44 ms.
[2024-06-02 22:52:20] [INFO ] Deduced a trap composed of 68 places in 110 ms of which 1 ms to minimize.
[2024-06-02 22:52:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 208 ms
[2024-06-02 22:52:20] [INFO ] Added : 84 causal constraints over 17 iterations in 895 ms. Result :sat
Minimization took 72 ms.
[2024-06-02 22:52:20] [INFO ] [Real]Absence check using 8 positive place invariants in 9 ms returned sat
[2024-06-02 22:52:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 22:52:20] [INFO ] [Real]Absence check using state equation in 169 ms returned sat
[2024-06-02 22:52:20] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:52:20] [INFO ] [Nat]Absence check using 8 positive place invariants in 9 ms returned sat
[2024-06-02 22:52:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 22:52:21] [INFO ] [Nat]Absence check using state equation in 162 ms returned sat
[2024-06-02 22:52:21] [INFO ] Deduced a trap composed of 320 places in 154 ms of which 1 ms to minimize.
[2024-06-02 22:52:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 214 ms
[2024-06-02 22:52:21] [INFO ] Computed and/alt/rep : 606/769/606 causal constraints (skipped 85 transitions) in 46 ms.
[2024-06-02 22:52:21] [INFO ] Added : 44 causal constraints over 9 iterations in 390 ms. Result :sat
Minimization took 66 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
FORMULA CO4-PT-14-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-14-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-14-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-14-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-14-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-14-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-14-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-14-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 1 out of 580 places. Attempting structural reductions.
Drop transitions removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 580/580 places, 691/691 transitions.
Graph (trivial) has 600 edges and 580 vertex of which 2 / 580 are part of one of the 1 SCC in 4 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 876 edges and 579 vertex of which 544 are kept as prefixes of interest. Removing 35 places using SCC suffix rule.2 ms
Discarding 35 places :
Also discarding 19 output transitions
Drop transitions removed 19 transitions
Drop transitions removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Drop transitions removed 283 transitions
Trivial Post-agglo rules discarded 283 transitions
Performed 283 trivial Post agglomeration. Transition count delta: 283
Iterating post reduction 0 with 303 rules applied. Total rules applied 305 place count 544 transition count 367
Reduce places removed 283 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 294 rules applied. Total rules applied 599 place count 261 transition count 356
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 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 2 with 11 rules applied. Total rules applied 610 place count 256 transition count 350
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 3 rules applied. Total rules applied 613 place count 255 transition count 348
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 4 with 3 rules applied. Total rules applied 616 place count 254 transition count 346
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 618 place count 253 transition count 345
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 618 place count 253 transition count 344
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 620 place count 252 transition count 344
Discarding 36 places :
Symmetric choice reduction at 6 with 36 rule applications. Total rules 656 place count 216 transition count 308
Iterating global reduction 6 with 36 rules applied. Total rules applied 692 place count 216 transition count 308
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 13 Pre rules applied. Total rules applied 692 place count 216 transition count 295
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 6 with 26 rules applied. Total rules applied 718 place count 203 transition count 295
Discarding 23 places :
Symmetric choice reduction at 6 with 23 rule applications. Total rules 741 place count 180 transition count 272
Iterating global reduction 6 with 23 rules applied. Total rules applied 764 place count 180 transition count 272
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 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 6 with 5 rules applied. Total rules applied 769 place count 180 transition count 267
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 770 place count 179 transition count 267
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 772 place count 177 transition count 264
Iterating global reduction 8 with 2 rules applied. Total rules applied 774 place count 177 transition count 264
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 776 place count 177 transition count 262
Performed 78 Post agglomeration using F-continuation condition with reduction of 10 identical transitions.
Deduced a syphon composed of 78 places in 0 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 9 with 156 rules applied. Total rules applied 932 place count 99 transition count 174
Drop transitions removed 4 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 9 with 7 rules applied. Total rules applied 939 place count 99 transition count 167
Discarding 4 places :
Symmetric choice reduction at 10 with 4 rule applications. Total rules 943 place count 95 transition count 163
Iterating global reduction 10 with 4 rules applied. Total rules applied 947 place count 95 transition count 163
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 948 place count 95 transition count 162
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 11 with 6 rules applied. Total rules applied 954 place count 92 transition count 159
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 11 with 3 rules applied. Total rules applied 957 place count 92 transition count 156
Discarding 2 places :
Symmetric choice reduction at 12 with 2 rule applications. Total rules 959 place count 90 transition count 154
Iterating global reduction 12 with 2 rules applied. Total rules applied 961 place count 90 transition count 154
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 962 place count 90 transition count 153
Discarding 1 places :
Symmetric choice reduction at 13 with 1 rule applications. Total rules 963 place count 89 transition count 152
Iterating global reduction 13 with 1 rules applied. Total rules applied 964 place count 89 transition count 152
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 965 place count 89 transition count 151
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 14 with 56 rules applied. Total rules applied 1021 place count 61 transition count 153
Drop transitions removed 16 transitions
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 14 with 36 rules applied. Total rules applied 1057 place count 61 transition count 117
Discarding 25 places :
Symmetric choice reduction at 15 with 25 rule applications. Total rules 1082 place count 36 transition count 81
Iterating global reduction 15 with 25 rules applied. Total rules applied 1107 place count 36 transition count 81
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 15 with 20 rules applied. Total rules applied 1127 place count 36 transition count 61
Discarding 4 places :
Symmetric choice reduction at 16 with 4 rule applications. Total rules 1131 place count 32 transition count 50
Iterating global reduction 16 with 4 rules applied. Total rules applied 1135 place count 32 transition count 50
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 16 with 3 rules applied. Total rules applied 1138 place count 32 transition count 47
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 17 with 2 rules applied. Total rules applied 1140 place count 31 transition count 54
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 17 with 3 rules applied. Total rules applied 1143 place count 31 transition count 51
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 18 with 5 rules applied. Total rules applied 1148 place count 31 transition count 46
Discarding 1 places :
Symmetric choice reduction at 18 with 1 rule applications. Total rules 1149 place count 30 transition count 45
Iterating global reduction 18 with 1 rules applied. Total rules applied 1150 place count 30 transition count 45
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 18 with 1 rules applied. Total rules applied 1151 place count 30 transition count 44
Free-agglomeration rule applied 5 times.
Iterating global reduction 19 with 5 rules applied. Total rules applied 1156 place count 30 transition count 39
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 19 with 7 rules applied. Total rules applied 1163 place count 25 transition count 37
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 20 with 1 rules applied. Total rules applied 1164 place count 25 transition count 37
Graph (complete) has 69 edges and 25 vertex of which 24 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 20 with 1 rules applied. Total rules applied 1165 place count 24 transition count 37
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 21 with 1 rules applied. Total rules applied 1166 place count 24 transition count 36
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 22 with 1 rules applied. Total rules applied 1167 place count 24 transition count 36
Graph (complete) has 66 edges and 24 vertex of which 23 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 22 with 1 rules applied. Total rules applied 1168 place count 23 transition count 36
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 23 with 1 rules applied. Total rules applied 1169 place count 23 transition count 35
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 24 with 1 rules applied. Total rules applied 1170 place count 23 transition count 35
Graph (complete) has 63 edges and 23 vertex of which 22 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 24 with 1 rules applied. Total rules applied 1171 place count 22 transition count 35
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 25 with 1 rules applied. Total rules applied 1172 place count 22 transition count 34
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 26 with 1 rules applied. Total rules applied 1173 place count 21 transition count 33
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t87.t679 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 15 edges and 17 vertex of which 3 / 17 are part of one of the 1 SCC in 1 ms
Free SCC test removed 2 places
Iterating post reduction 26 with 3 rules applied. Total rules applied 1176 place count 15 transition count 31
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t15.t16.t661.t188.t185.t773.t198.t199 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 5 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (trivial) has 12 edges and 13 vertex of which 3 / 13 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 27 with 9 rules applied. Total rules applied 1185 place count 11 transition count 23
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (complete) has 17 edges and 10 vertex of which 3 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.0 ms
Discarding 7 places :
Also discarding 6 output transitions
Drop transitions removed 6 transitions
Iterating post reduction 28 with 12 rules applied. Total rules applied 1197 place count 3 transition count 7
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 29 with 5 rules applied. Total rules applied 1202 place count 3 transition count 2
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 30 with 1 Pre rules applied. Total rules applied 1202 place count 3 transition count 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 30 with 2 rules applied. Total rules applied 1204 place count 2 transition count 1
Applied a total of 1204 rules in 141 ms. Remains 2 /580 variables (removed 578) and now considering 1/691 (removed 690) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 142 ms. Remains : 2/580 places, 1/691 transitions.
// Phase 1: matrix 1 rows 2 cols
[2024-06-02 22:52:21] [INFO ] Computed 1 invariants in 0 ms
Incomplete random walk after 1000000 steps, including 500000 resets, run finished after 224 ms. (steps per millisecond=4464 ) properties (out of 1) seen :1
FORMULA CO4-PT-14-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 15951 ms.

BK_STOP 1717368743164

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

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