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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 540K
-rw-r--r-- 1 mcc users 5.7K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 73K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K 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 16K 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 129K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K 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 98K 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-07-UpperBounds-00
FORMULA_NAME CO4-PT-07-UpperBounds-01
FORMULA_NAME CO4-PT-07-UpperBounds-02
FORMULA_NAME CO4-PT-07-UpperBounds-03
FORMULA_NAME CO4-PT-07-UpperBounds-04
FORMULA_NAME CO4-PT-07-UpperBounds-05
FORMULA_NAME CO4-PT-07-UpperBounds-06
FORMULA_NAME CO4-PT-07-UpperBounds-07
FORMULA_NAME CO4-PT-07-UpperBounds-08
FORMULA_NAME CO4-PT-07-UpperBounds-09
FORMULA_NAME CO4-PT-07-UpperBounds-10
FORMULA_NAME CO4-PT-07-UpperBounds-11
FORMULA_NAME CO4-PT-07-UpperBounds-12
FORMULA_NAME CO4-PT-07-UpperBounds-13
FORMULA_NAME CO4-PT-07-UpperBounds-14
FORMULA_NAME CO4-PT-07-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717368619548

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-07
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202304061127
[2024-06-02 22:50:21] [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:50:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 22:50:21] [INFO ] Load time of PNML (sax parser for PT used): 70 ms
[2024-06-02 22:50:21] [INFO ] Transformed 384 places.
[2024-06-02 22:50:21] [INFO ] Transformed 456 transitions.
[2024-06-02 22:50:21] [INFO ] Found NUPN structural information;
[2024-06-02 22:50:21] [INFO ] Parsed PT model containing 384 places and 456 transitions and 1022 arcs in 137 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
Deduced a syphon composed of 100 places in 4 ms
Reduce places removed 100 places and 120 transitions.
FORMULA CO4-PT-07-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-07-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-07-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-07-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 336 rows 284 cols
[2024-06-02 22:50:21] [INFO ] Computed 6 invariants in 23 ms
Incomplete random walk after 10000 steps, including 8 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 12) seen :1
FORMULA CO4-PT-07-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 11) seen :1
FORMULA CO4-PT-07-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 17 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 10) seen :3
FORMULA CO4-PT-07-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-07-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-07-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 20 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 15 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 27 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 7) seen :0
[2024-06-02 22:50:21] [INFO ] Invariant cache hit.
[2024-06-02 22:50:21] [INFO ] [Real]Absence check using 6 positive place invariants in 7 ms returned sat
[2024-06-02 22:50:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 22:50:22] [INFO ] [Real]Absence check using state equation in 87 ms returned sat
[2024-06-02 22:50:22] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:50:22] [INFO ] [Nat]Absence check using 6 positive place invariants in 5 ms returned sat
[2024-06-02 22:50:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 22:50:22] [INFO ] [Nat]Absence check using state equation in 71 ms returned sat
[2024-06-02 22:50:22] [INFO ] Deduced a trap composed of 225 places in 101 ms of which 2 ms to minimize.
[2024-06-02 22:50:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 154 ms
[2024-06-02 22:50:22] [INFO ] Computed and/alt/rep : 293/381/293 causal constraints (skipped 42 transitions) in 30 ms.
[2024-06-02 22:50:22] [INFO ] Added : 69 causal constraints over 14 iterations in 346 ms. Result :sat
Minimization took 81 ms.
[2024-06-02 22:50:22] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2024-06-02 22:50:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 22:50:22] [INFO ] [Real]Absence check using state equation in 73 ms returned sat
[2024-06-02 22:50:22] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:50:23] [INFO ] [Nat]Absence check using 6 positive place invariants in 5 ms returned sat
[2024-06-02 22:50:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 22:50:23] [INFO ] [Nat]Absence check using state equation in 69 ms returned sat
[2024-06-02 22:50:23] [INFO ] Computed and/alt/rep : 293/381/293 causal constraints (skipped 42 transitions) in 25 ms.
[2024-06-02 22:50:23] [INFO ] Added : 56 causal constraints over 12 iterations in 257 ms. Result :sat
Minimization took 36 ms.
[2024-06-02 22:50:23] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2024-06-02 22:50:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 22:50:23] [INFO ] [Real]Absence check using state equation in 73 ms returned sat
[2024-06-02 22:50:23] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:50:23] [INFO ] [Nat]Absence check using 6 positive place invariants in 5 ms returned sat
[2024-06-02 22:50:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 22:50:23] [INFO ] [Nat]Absence check using state equation in 68 ms returned sat
[2024-06-02 22:50:23] [INFO ] Deduced a trap composed of 225 places in 80 ms of which 0 ms to minimize.
[2024-06-02 22:50:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 123 ms
[2024-06-02 22:50:23] [INFO ] Computed and/alt/rep : 293/381/293 causal constraints (skipped 42 transitions) in 30 ms.
[2024-06-02 22:50:24] [INFO ] Added : 66 causal constraints over 14 iterations in 314 ms. Result :sat
Minimization took 37 ms.
[2024-06-02 22:50:24] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2024-06-02 22:50:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 22:50:24] [INFO ] [Real]Absence check using state equation in 66 ms returned sat
[2024-06-02 22:50:24] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:50:24] [INFO ] [Nat]Absence check using 6 positive place invariants in 5 ms returned sat
[2024-06-02 22:50:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 22:50:24] [INFO ] [Nat]Absence check using state equation in 66 ms returned sat
[2024-06-02 22:50:24] [INFO ] Deduced a trap composed of 225 places in 80 ms of which 1 ms to minimize.
[2024-06-02 22:50:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 117 ms
[2024-06-02 22:50:24] [INFO ] Computed and/alt/rep : 293/381/293 causal constraints (skipped 42 transitions) in 25 ms.
[2024-06-02 22:50:24] [INFO ] Added : 66 causal constraints over 14 iterations in 295 ms. Result :sat
Minimization took 36 ms.
[2024-06-02 22:50:25] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2024-06-02 22:50:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 22:50:25] [INFO ] [Real]Absence check using state equation in 72 ms returned sat
[2024-06-02 22:50:25] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:50:25] [INFO ] [Nat]Absence check using 6 positive place invariants in 6 ms returned sat
[2024-06-02 22:50:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 22:50:25] [INFO ] [Nat]Absence check using state equation in 71 ms returned sat
[2024-06-02 22:50:25] [INFO ] Deduced a trap composed of 225 places in 74 ms of which 2 ms to minimize.
[2024-06-02 22:50:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 108 ms
[2024-06-02 22:50:25] [INFO ] Computed and/alt/rep : 293/381/293 causal constraints (skipped 42 transitions) in 21 ms.
[2024-06-02 22:50:25] [INFO ] Added : 56 causal constraints over 12 iterations in 250 ms. Result :sat
Minimization took 30 ms.
[2024-06-02 22:50:25] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2024-06-02 22:50:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 22:50:25] [INFO ] [Real]Absence check using state equation in 62 ms returned sat
[2024-06-02 22:50:25] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:50:25] [INFO ] [Nat]Absence check using 6 positive place invariants in 5 ms returned sat
[2024-06-02 22:50:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 22:50:25] [INFO ] [Nat]Absence check using state equation in 71 ms returned sat
[2024-06-02 22:50:25] [INFO ] Deduced a trap composed of 225 places in 77 ms of which 1 ms to minimize.
[2024-06-02 22:50:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 105 ms
[2024-06-02 22:50:26] [INFO ] Computed and/alt/rep : 293/381/293 causal constraints (skipped 42 transitions) in 19 ms.
[2024-06-02 22:50:26] [INFO ] Added : 55 causal constraints over 11 iterations in 217 ms. Result :sat
Minimization took 34 ms.
[2024-06-02 22:50:26] [INFO ] [Real]Absence check using 6 positive place invariants in 8 ms returned sat
[2024-06-02 22:50:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 22:50:26] [INFO ] [Real]Absence check using state equation in 72 ms returned sat
[2024-06-02 22:50:26] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:50:26] [INFO ] [Nat]Absence check using 6 positive place invariants in 5 ms returned sat
[2024-06-02 22:50:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 22:50:26] [INFO ] [Nat]Absence check using state equation in 81 ms returned sat
[2024-06-02 22:50:26] [INFO ] Computed and/alt/rep : 293/381/293 causal constraints (skipped 42 transitions) in 17 ms.
[2024-06-02 22:50:26] [INFO ] Added : 54 causal constraints over 11 iterations in 226 ms. Result :sat
Minimization took 39 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0]
FORMULA CO4-PT-07-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-07-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-07-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-07-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 3 out of 284 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 284/284 places, 336/336 transitions.
Graph (trivial) has 284 edges and 284 vertex of which 2 / 284 are part of one of the 1 SCC in 3 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 430 edges and 283 vertex of which 253 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.1 ms
Discarding 30 places :
Also discarding 17 output transitions
Drop transitions removed 17 transitions
Drop transitions removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions removed 123 transitions
Trivial Post-agglo rules discarded 123 transitions
Performed 123 trivial Post agglomeration. Transition count delta: 123
Iterating post reduction 0 with 140 rules applied. Total rules applied 142 place count 253 transition count 177
Reduce places removed 123 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 129 rules applied. Total rules applied 271 place count 130 transition count 171
Reduce places removed 3 places and 0 transitions.
Ensure Unique test 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 2 with 6 rules applied. Total rules applied 277 place count 127 transition count 168
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 280 place count 126 transition count 166
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 283 place count 125 transition count 164
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 5 with 4 rules applied. Total rules applied 287 place count 124 transition count 161
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 289 place count 122 transition count 161
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 289 place count 122 transition count 160
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 291 place count 121 transition count 160
Discarding 17 places :
Symmetric choice reduction at 7 with 17 rule applications. Total rules 308 place count 104 transition count 143
Iterating global reduction 7 with 17 rules applied. Total rules applied 325 place count 104 transition count 143
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 5 Pre rules applied. Total rules applied 325 place count 104 transition count 138
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 7 with 10 rules applied. Total rules applied 335 place count 99 transition count 138
Discarding 11 places :
Symmetric choice reduction at 7 with 11 rule applications. Total rules 346 place count 88 transition count 127
Iterating global reduction 7 with 11 rules applied. Total rules applied 357 place count 88 transition count 127
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 358 place count 88 transition count 126
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 359 place count 87 transition count 125
Iterating global reduction 8 with 1 rules applied. Total rules applied 360 place count 87 transition count 125
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 361 place count 87 transition count 124
Performed 35 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 9 with 70 rules applied. Total rules applied 431 place count 52 transition count 85
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 9 with 24 rules applied. Total rules applied 455 place count 40 transition count 86
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 9 with 8 rules applied. Total rules applied 463 place count 40 transition count 78
Discarding 11 places :
Symmetric choice reduction at 10 with 11 rule applications. Total rules 474 place count 29 transition count 56
Iterating global reduction 10 with 11 rules applied. Total rules applied 485 place count 29 transition count 56
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 10 with 8 rules applied. Total rules applied 493 place count 29 transition count 48
Discarding 3 places :
Symmetric choice reduction at 11 with 3 rule applications. Total rules 496 place count 26 transition count 39
Iterating global reduction 11 with 3 rules applied. Total rules applied 499 place count 26 transition count 39
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 501 place count 26 transition count 37
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 12 with 2 rules applied. Total rules applied 503 place count 26 transition count 35
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 505 place count 25 transition count 50
Free-agglomeration rule applied 4 times.
Iterating global reduction 12 with 4 rules applied. Total rules applied 509 place count 25 transition count 46
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 5 rules applied. Total rules applied 514 place count 21 transition count 45
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 515 place count 21 transition count 45
Graph (complete) has 64 edges and 21 vertex of which 20 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 13 with 1 rules applied. Total rules applied 516 place count 20 transition count 45
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 517 place count 20 transition count 44
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 15 with 1 rules applied. Total rules applied 518 place count 20 transition count 44
Graph (complete) has 61 edges and 20 vertex of which 19 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 15 with 1 rules applied. Total rules applied 519 place count 19 transition count 44
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 16 with 1 rules applied. Total rules applied 520 place count 19 transition count 43
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 17 with 1 rules applied. Total rules applied 521 place count 19 transition count 43
Graph (complete) has 58 edges and 19 vertex of which 18 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 17 with 1 rules applied. Total rules applied 522 place count 18 transition count 43
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 18 with 1 rules applied. Total rules applied 523 place count 18 transition count 42
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 19 with 1 rules applied. Total rules applied 524 place count 17 transition count 41
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t87.t401.t15.t16 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 19 with 2 rules applied. Total rules applied 526 place count 14 transition count 39
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 20 with 9 rules applied. Total rules applied 535 place count 14 transition count 30
Discarding 2 places :
Symmetric choice reduction at 20 with 2 rule applications. Total rules 537 place count 12 transition count 24
Iterating global reduction 20 with 2 rules applied. Total rules applied 539 place count 12 transition count 24
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 20 with 2 rules applied. Total rules applied 541 place count 12 transition count 22
Discarding 1 places :
Symmetric choice reduction at 21 with 1 rule applications. Total rules 542 place count 11 transition count 19
Iterating global reduction 21 with 1 rules applied. Total rules applied 543 place count 11 transition count 19
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 21 with 1 rules applied. Total rules applied 544 place count 11 transition count 18
Free-agglomeration rule applied 1 times.
Iterating global reduction 22 with 1 rules applied. Total rules applied 545 place count 11 transition count 17
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 22 with 1 rules applied. Total rules applied 546 place count 10 transition count 17
Applied a total of 546 rules in 114 ms. Remains 10 /284 variables (removed 274) and now considering 17/336 (removed 319) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 114 ms. Remains : 10/284 places, 17/336 transitions.
// Phase 1: matrix 17 rows 10 cols
[2024-06-02 22:50:27] [INFO ] Computed 2 invariants in 0 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 569 ms. (steps per millisecond=1757 ) properties (out of 3) seen :3
FORMULA CO4-PT-07-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CO4-PT-07-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CO4-PT-07-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 6406 ms.

BK_STOP 1717368628887

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

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