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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 568K
-rw-r--r-- 1 mcc users 6.1K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K 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 52K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K 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 13K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 135K 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 138K 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-08-UpperBounds-00
FORMULA_NAME CO4-PT-08-UpperBounds-01
FORMULA_NAME CO4-PT-08-UpperBounds-02
FORMULA_NAME CO4-PT-08-UpperBounds-03
FORMULA_NAME CO4-PT-08-UpperBounds-04
FORMULA_NAME CO4-PT-08-UpperBounds-05
FORMULA_NAME CO4-PT-08-UpperBounds-06
FORMULA_NAME CO4-PT-08-UpperBounds-07
FORMULA_NAME CO4-PT-08-UpperBounds-08
FORMULA_NAME CO4-PT-08-UpperBounds-09
FORMULA_NAME CO4-PT-08-UpperBounds-10
FORMULA_NAME CO4-PT-08-UpperBounds-11
FORMULA_NAME CO4-PT-08-UpperBounds-12
FORMULA_NAME CO4-PT-08-UpperBounds-13
FORMULA_NAME CO4-PT-08-UpperBounds-14
FORMULA_NAME CO4-PT-08-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717368632932

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-08
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202304061127
[2024-06-02 22:50:34] [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:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 22:50:34] [INFO ] Load time of PNML (sax parser for PT used): 67 ms
[2024-06-02 22:50:34] [INFO ] Transformed 467 places.
[2024-06-02 22:50:34] [INFO ] Transformed 600 transitions.
[2024-06-02 22:50:34] [INFO ] Found NUPN structural information;
[2024-06-02 22:50:34] [INFO ] Parsed PT model containing 467 places and 600 transitions and 1596 arcs in 133 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
Deduced a syphon composed of 108 places in 6 ms
Reduce places removed 108 places and 155 transitions.
FORMULA CO4-PT-08-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-08-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-08-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-08-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-08-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-08-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 445 rows 359 cols
[2024-06-02 22:50:34] [INFO ] Computed 9 invariants in 17 ms
Incomplete random walk after 10000 steps, including 5 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 10) seen :1
FORMULA CO4-PT-08-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 16 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 9) seen :1
FORMULA CO4-PT-08-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 85 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 83 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 31 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 15 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 28 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 81 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 19 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 8) seen :0
[2024-06-02 22:50:34] [INFO ] Invariant cache hit.
[2024-06-02 22:50:35] [INFO ] [Real]Absence check using 7 positive place invariants in 9 ms returned sat
[2024-06-02 22:50:35] [INFO ] [Real]Absence check using 7 positive and 2 generalized place invariants in 5 ms returned sat
[2024-06-02 22:50:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 22:50:35] [INFO ] [Real]Absence check using state equation in 127 ms returned sat
[2024-06-02 22:50:35] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:50:35] [INFO ] [Nat]Absence check using 7 positive place invariants in 7 ms returned sat
[2024-06-02 22:50:35] [INFO ] [Nat]Absence check using 7 positive and 2 generalized place invariants in 1 ms returned sat
[2024-06-02 22:50:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 22:50:35] [INFO ] [Nat]Absence check using state equation in 102 ms returned sat
[2024-06-02 22:50:35] [INFO ] Deduced a trap composed of 20 places in 252 ms of which 3 ms to minimize.
[2024-06-02 22:50:36] [INFO ] Deduced a trap composed of 20 places in 138 ms of which 1 ms to minimize.
[2024-06-02 22:50:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 464 ms
[2024-06-02 22:50:36] [INFO ] Computed and/alt/rep : 380/581/380 causal constraints (skipped 64 transitions) in 26 ms.
[2024-06-02 22:50:36] [INFO ] Added : 105 causal constraints over 21 iterations in 660 ms. Result :sat
Minimization took 57 ms.
[2024-06-02 22:50:36] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2024-06-02 22:50:36] [INFO ] [Real]Absence check using 7 positive and 2 generalized place invariants in 2 ms returned sat
[2024-06-02 22:50:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 22:50:37] [INFO ] [Real]Absence check using state equation in 134 ms returned sat
[2024-06-02 22:50:37] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:50:37] [INFO ] [Nat]Absence check using 7 positive place invariants in 6 ms returned sat
[2024-06-02 22:50:37] [INFO ] [Nat]Absence check using 7 positive and 2 generalized place invariants in 1 ms returned sat
[2024-06-02 22:50:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 22:50:37] [INFO ] [Nat]Absence check using state equation in 97 ms returned sat
[2024-06-02 22:50:37] [INFO ] Computed and/alt/rep : 380/581/380 causal constraints (skipped 64 transitions) in 28 ms.
[2024-06-02 22:50:37] [INFO ] Added : 61 causal constraints over 13 iterations in 382 ms. Result :sat
Minimization took 53 ms.
[2024-06-02 22:50:37] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2024-06-02 22:50:37] [INFO ] [Real]Absence check using 7 positive and 2 generalized place invariants in 3 ms returned sat
[2024-06-02 22:50:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 22:50:38] [INFO ] [Real]Absence check using state equation in 121 ms returned sat
[2024-06-02 22:50:38] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:50:38] [INFO ] [Nat]Absence check using 7 positive place invariants in 6 ms returned sat
[2024-06-02 22:50:38] [INFO ] [Nat]Absence check using 7 positive and 2 generalized place invariants in 6 ms returned sat
[2024-06-02 22:50:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 22:50:38] [INFO ] [Nat]Absence check using state equation in 92 ms returned sat
[2024-06-02 22:50:38] [INFO ] Computed and/alt/rep : 380/581/380 causal constraints (skipped 64 transitions) in 25 ms.
[2024-06-02 22:50:38] [INFO ] Added : 97 causal constraints over 20 iterations in 537 ms. Result :sat
Minimization took 54 ms.
[2024-06-02 22:50:38] [INFO ] [Real]Absence check using 7 positive place invariants in 6 ms returned sat
[2024-06-02 22:50:38] [INFO ] [Real]Absence check using 7 positive and 2 generalized place invariants in 1 ms returned sat
[2024-06-02 22:50:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 22:50:38] [INFO ] [Real]Absence check using state equation in 98 ms returned sat
[2024-06-02 22:50:38] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:50:39] [INFO ] [Nat]Absence check using 7 positive place invariants in 6 ms returned sat
[2024-06-02 22:50:39] [INFO ] [Nat]Absence check using 7 positive and 2 generalized place invariants in 1 ms returned sat
[2024-06-02 22:50:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 22:50:39] [INFO ] [Nat]Absence check using state equation in 94 ms returned sat
[2024-06-02 22:50:39] [INFO ] Deduced a trap composed of 200 places in 94 ms of which 1 ms to minimize.
[2024-06-02 22:50:39] [INFO ] Deduced a trap composed of 208 places in 78 ms of which 1 ms to minimize.
[2024-06-02 22:50:39] [INFO ] Deduced a trap composed of 258 places in 76 ms of which 1 ms to minimize.
[2024-06-02 22:50:39] [INFO ] Deduced a trap composed of 256 places in 82 ms of which 0 ms to minimize.
[2024-06-02 22:50:39] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 417 ms
[2024-06-02 22:50:39] [INFO ] Computed and/alt/rep : 380/581/380 causal constraints (skipped 64 transitions) in 24 ms.
[2024-06-02 22:50:39] [INFO ] Added : 41 causal constraints over 9 iterations in 268 ms. Result :sat
Minimization took 44 ms.
[2024-06-02 22:50:39] [INFO ] [Real]Absence check using 7 positive place invariants in 6 ms returned sat
[2024-06-02 22:50:39] [INFO ] [Real]Absence check using 7 positive and 2 generalized place invariants in 1 ms returned sat
[2024-06-02 22:50:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 22:50:40] [INFO ] [Real]Absence check using state equation in 94 ms returned sat
[2024-06-02 22:50:40] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:50:40] [INFO ] [Nat]Absence check using 7 positive place invariants in 6 ms returned sat
[2024-06-02 22:50:40] [INFO ] [Nat]Absence check using 7 positive and 2 generalized place invariants in 2 ms returned sat
[2024-06-02 22:50:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 22:50:40] [INFO ] [Nat]Absence check using state equation in 101 ms returned sat
[2024-06-02 22:50:40] [INFO ] Computed and/alt/rep : 380/581/380 causal constraints (skipped 64 transitions) in 29 ms.
[2024-06-02 22:50:40] [INFO ] Added : 75 causal constraints over 15 iterations in 411 ms. Result :sat
Minimization took 56 ms.
[2024-06-02 22:50:40] [INFO ] [Real]Absence check using 7 positive place invariants in 6 ms returned sat
[2024-06-02 22:50:40] [INFO ] [Real]Absence check using 7 positive and 2 generalized place invariants in 3 ms returned sat
[2024-06-02 22:50:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 22:50:40] [INFO ] [Real]Absence check using state equation in 97 ms returned sat
[2024-06-02 22:50:40] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:50:41] [INFO ] [Nat]Absence check using 7 positive place invariants in 11 ms returned sat
[2024-06-02 22:50:41] [INFO ] [Nat]Absence check using 7 positive and 2 generalized place invariants in 1 ms returned sat
[2024-06-02 22:50:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 22:50:41] [INFO ] [Nat]Absence check using state equation in 94 ms returned sat
[2024-06-02 22:50:41] [INFO ] Computed and/alt/rep : 380/581/380 causal constraints (skipped 64 transitions) in 24 ms.
[2024-06-02 22:50:41] [INFO ] Added : 56 causal constraints over 12 iterations in 314 ms. Result :sat
Minimization took 51 ms.
[2024-06-02 22:50:41] [INFO ] [Real]Absence check using 7 positive place invariants in 6 ms returned sat
[2024-06-02 22:50:41] [INFO ] [Real]Absence check using 7 positive and 2 generalized place invariants in 2 ms returned sat
[2024-06-02 22:50:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 22:50:41] [INFO ] [Real]Absence check using state equation in 108 ms returned sat
[2024-06-02 22:50:41] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:50:41] [INFO ] [Nat]Absence check using 7 positive place invariants in 6 ms returned sat
[2024-06-02 22:50:41] [INFO ] [Nat]Absence check using 7 positive and 2 generalized place invariants in 1 ms returned sat
[2024-06-02 22:50:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 22:50:41] [INFO ] [Nat]Absence check using state equation in 97 ms returned sat
[2024-06-02 22:50:41] [INFO ] Computed and/alt/rep : 380/581/380 causal constraints (skipped 64 transitions) in 29 ms.
[2024-06-02 22:50:42] [INFO ] Added : 69 causal constraints over 15 iterations in 379 ms. Result :sat
Minimization took 51 ms.
[2024-06-02 22:50:42] [INFO ] [Real]Absence check using 7 positive place invariants in 6 ms returned sat
[2024-06-02 22:50:42] [INFO ] [Real]Absence check using 7 positive and 2 generalized place invariants in 1 ms returned sat
[2024-06-02 22:50:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 22:50:42] [INFO ] [Real]Absence check using state equation in 97 ms returned sat
[2024-06-02 22:50:42] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:50:42] [INFO ] [Nat]Absence check using 7 positive place invariants in 7 ms returned sat
[2024-06-02 22:50:42] [INFO ] [Nat]Absence check using 7 positive and 2 generalized place invariants in 1 ms returned sat
[2024-06-02 22:50:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 22:50:42] [INFO ] [Nat]Absence check using state equation in 98 ms returned sat
[2024-06-02 22:50:42] [INFO ] Deduced a trap composed of 14 places in 104 ms of which 1 ms to minimize.
[2024-06-02 22:50:42] [INFO ] Deduced a trap composed of 133 places in 109 ms of which 1 ms to minimize.
[2024-06-02 22:50:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 256 ms
[2024-06-02 22:50:42] [INFO ] Computed and/alt/rep : 380/581/380 causal constraints (skipped 64 transitions) in 25 ms.
[2024-06-02 22:50:43] [INFO ] Deduced a trap composed of 18 places in 78 ms of which 1 ms to minimize.
[2024-06-02 22:50:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 109 ms
[2024-06-02 22:50:43] [INFO ] Added : 99 causal constraints over 22 iterations in 685 ms. Result :sat
Minimization took 53 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-08-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-08-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-08-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-08-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 4 out of 359 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 359/359 places, 445/445 transitions.
Graph (trivial) has 356 edges and 359 vertex of which 2 / 359 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 653 edges and 358 vertex of which 326 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.1 ms
Discarding 32 places :
Also discarding 11 output transitions
Drop transitions removed 11 transitions
Drop transitions removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Drop transitions removed 162 transitions
Trivial Post-agglo rules discarded 162 transitions
Performed 162 trivial Post agglomeration. Transition count delta: 162
Iterating post reduction 0 with 186 rules applied. Total rules applied 188 place count 326 transition count 246
Reduce places removed 162 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 180 rules applied. Total rules applied 368 place count 164 transition count 228
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 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 2 with 18 rules applied. Total rules applied 386 place count 156 transition count 218
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 3 with 6 rules applied. Total rules applied 392 place count 154 transition count 214
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 398 place count 152 transition count 210
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 5 with 6 rules applied. Total rules applied 404 place count 150 transition count 206
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 406 place count 148 transition count 206
Discarding 27 places :
Symmetric choice reduction at 7 with 27 rule applications. Total rules 433 place count 121 transition count 179
Iterating global reduction 7 with 27 rules applied. Total rules applied 460 place count 121 transition count 179
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 7 Pre rules applied. Total rules applied 460 place count 121 transition count 172
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 7 with 14 rules applied. Total rules applied 474 place count 114 transition count 172
Discarding 15 places :
Symmetric choice reduction at 7 with 15 rule applications. Total rules 489 place count 99 transition count 139
Iterating global reduction 7 with 15 rules applied. Total rules applied 504 place count 99 transition count 139
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 506 place count 99 transition count 137
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 508 place count 97 transition count 135
Iterating global reduction 8 with 2 rules applied. Total rules applied 510 place count 97 transition count 135
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 512 place count 97 transition count 133
Performed 34 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 9 with 68 rules applied. Total rules applied 580 place count 63 transition count 98
Drop transitions removed 3 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 9 with 6 rules applied. Total rules applied 586 place count 63 transition count 92
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 589 place count 60 transition count 89
Iterating global reduction 10 with 3 rules applied. Total rules applied 592 place count 60 transition count 89
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 10 with 6 rules applied. Total rules applied 598 place count 57 transition count 86
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 10 with 3 rules applied. Total rules applied 601 place count 57 transition count 83
Discarding 3 places :
Symmetric choice reduction at 11 with 3 rule applications. Total rules 604 place count 54 transition count 80
Iterating global reduction 11 with 3 rules applied. Total rules applied 607 place count 54 transition count 80
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 609 place count 54 transition count 78
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 12 with 20 rules applied. Total rules applied 629 place count 44 transition count 79
Drop transitions removed 9 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 12 with 17 rules applied. Total rules applied 646 place count 44 transition count 62
Discarding 8 places :
Symmetric choice reduction at 13 with 8 rule applications. Total rules 654 place count 36 transition count 54
Iterating global reduction 13 with 8 rules applied. Total rules applied 662 place count 36 transition count 54
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 13 with 8 rules applied. Total rules applied 670 place count 36 transition count 46
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 14 with 2 rules applied. Total rules applied 672 place count 35 transition count 51
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 14 with 1 rules applied. Total rules applied 673 place count 35 transition count 50
Discarding 1 places :
Symmetric choice reduction at 14 with 1 rule applications. Total rules 674 place count 34 transition count 49
Iterating global reduction 14 with 1 rules applied. Total rules applied 675 place count 34 transition count 49
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 14 with 2 rules applied. Total rules applied 677 place count 34 transition count 47
Free-agglomeration rule applied 7 times.
Iterating global reduction 15 with 7 rules applied. Total rules applied 684 place count 34 transition count 40
Reduce places removed 7 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 15 with 9 rules applied. Total rules applied 693 place count 27 transition count 38
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 16 with 1 rules applied. Total rules applied 694 place count 26 transition count 37
Reduce places removed 2 places and 0 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 16 with 3 rules applied. Total rules applied 697 place count 24 transition count 36
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 17 with 2 rules applied. Total rules applied 699 place count 23 transition count 35
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 18 with 1 rules applied. Total rules applied 700 place count 22 transition count 35
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 19 with 1 Pre rules applied. Total rules applied 700 place count 22 transition count 34
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 19 with 2 rules applied. Total rules applied 702 place count 21 transition count 34
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 19 with 4 rules applied. Total rules applied 706 place count 19 transition count 32
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 19 with 4 rules applied. Total rules applied 710 place count 19 transition count 28
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 20 with 2 rules applied. Total rules applied 712 place count 18 transition count 28
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 20 with 2 rules applied. Total rules applied 714 place count 18 transition count 26
Applied a total of 714 rules in 82 ms. Remains 18 /359 variables (removed 341) and now considering 26/445 (removed 419) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 82 ms. Remains : 18/359 places, 26/445 transitions.
Successfully produced net in file /tmp/petri1000_12745295226083307568.dot
Successfully produced net in file /tmp/petri1001_9455239342297322600.dot
Drop transitions removed 2 transitions
Dominated transitions for bounds rules discarded 2 transitions
// Phase 1: matrix 24 rows 18 cols
[2024-06-02 22:50:43] [INFO ] Computed 5 invariants in 1 ms
Incomplete random walk after 1000000 steps, including 45536 resets, run finished after 549 ms. (steps per millisecond=1821 ) properties (out of 4) seen :4
FORMULA CO4-PT-08-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CO4-PT-08-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CO4-PT-08-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CO4-PT-08-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 10092 ms.

BK_STOP 1717368645702

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
++ perl -pe 's/.*\.//g'
+ 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-08"
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-08, 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-171734910100036"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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