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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 608K
-rw-r--r-- 1 mcc users 5.8K 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 4.5K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 6.7K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 64K 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 71K 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 255K 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-15-UpperBounds-00
FORMULA_NAME CO4-PT-15-UpperBounds-01
FORMULA_NAME CO4-PT-15-UpperBounds-02
FORMULA_NAME CO4-PT-15-UpperBounds-03
FORMULA_NAME CO4-PT-15-UpperBounds-04
FORMULA_NAME CO4-PT-15-UpperBounds-05
FORMULA_NAME CO4-PT-15-UpperBounds-06
FORMULA_NAME CO4-PT-15-UpperBounds-07
FORMULA_NAME CO4-PT-15-UpperBounds-08
FORMULA_NAME CO4-PT-15-UpperBounds-09
FORMULA_NAME CO4-PT-15-UpperBounds-10
FORMULA_NAME CO4-PT-15-UpperBounds-11
FORMULA_NAME CO4-PT-15-UpperBounds-12
FORMULA_NAME CO4-PT-15-UpperBounds-13
FORMULA_NAME CO4-PT-15-UpperBounds-14
FORMULA_NAME CO4-PT-15-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717368738919

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-15
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202304061127
[2024-06-02 22:52:20] [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:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 22:52:20] [INFO ] Load time of PNML (sax parser for PT used): 84 ms
[2024-06-02 22:52:20] [INFO ] Transformed 833 places.
[2024-06-02 22:52:20] [INFO ] Transformed 1106 transitions.
[2024-06-02 22:52:20] [INFO ] Found NUPN structural information;
[2024-06-02 22:52:20] [INFO ] Parsed PT model containing 833 places and 1106 transitions and 2980 arcs in 153 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
Deduced a syphon composed of 124 places in 10 ms
Reduce places removed 124 places and 197 transitions.
FORMULA CO4-PT-15-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-15-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-15-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 909 rows 709 cols
[2024-06-02 22:52:20] [INFO ] Computed 12 invariants in 37 ms
Incomplete random walk after 10000 steps, including 229 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 13) seen :3
FORMULA CO4-PT-15-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CO4-PT-15-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CO4-PT-15-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 38 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 41 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 38 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 10) seen :0
[2024-06-02 22:52:21] [INFO ] Invariant cache hit.
[2024-06-02 22:52:21] [INFO ] [Real]Absence check using 11 positive place invariants in 15 ms returned sat
[2024-06-02 22:52:21] [INFO ] [Real]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-02 22:52:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 22:52:21] [INFO ] [Real]Absence check using state equation in 247 ms returned sat
[2024-06-02 22:52:21] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:52:21] [INFO ] [Nat]Absence check using 11 positive place invariants in 14 ms returned sat
[2024-06-02 22:52:21] [INFO ] [Nat]Absence check using 11 positive and 1 generalized place invariants in 2 ms returned sat
[2024-06-02 22:52:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 22:52:22] [INFO ] [Nat]Absence check using state equation in 246 ms returned sat
[2024-06-02 22:52:22] [INFO ] Computed and/alt/rep : 724/1001/724 causal constraints (skipped 184 transitions) in 65 ms.
[2024-06-02 22:52:23] [INFO ] Added : 96 causal constraints over 20 iterations in 1226 ms. Result :sat
Minimization took 99 ms.
[2024-06-02 22:52:23] [INFO ] [Real]Absence check using 11 positive place invariants in 13 ms returned sat
[2024-06-02 22:52:23] [INFO ] [Real]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-02 22:52:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 22:52:23] [INFO ] [Real]Absence check using state equation in 255 ms returned sat
[2024-06-02 22:52:23] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:52:24] [INFO ] [Nat]Absence check using 11 positive place invariants in 15 ms returned sat
[2024-06-02 22:52:24] [INFO ] [Nat]Absence check using 11 positive and 1 generalized place invariants in 2 ms returned sat
[2024-06-02 22:52:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 22:52:24] [INFO ] [Nat]Absence check using state equation in 239 ms returned sat
[2024-06-02 22:52:24] [INFO ] Computed and/alt/rep : 724/1001/724 causal constraints (skipped 184 transitions) in 62 ms.
[2024-06-02 22:52:25] [INFO ] Added : 78 causal constraints over 16 iterations in 800 ms. Result :sat
Minimization took 83 ms.
[2024-06-02 22:52:25] [INFO ] [Real]Absence check using 11 positive place invariants in 12 ms returned sat
[2024-06-02 22:52:25] [INFO ] [Real]Absence check using 11 positive and 1 generalized place invariants in 0 ms returned sat
[2024-06-02 22:52:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 22:52:25] [INFO ] [Real]Absence check using state equation in 227 ms returned sat
[2024-06-02 22:52:25] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:52:25] [INFO ] [Nat]Absence check using 11 positive place invariants in 14 ms returned sat
[2024-06-02 22:52:25] [INFO ] [Nat]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-02 22:52:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 22:52:25] [INFO ] [Nat]Absence check using state equation in 231 ms returned sat
[2024-06-02 22:52:26] [INFO ] Computed and/alt/rep : 724/1001/724 causal constraints (skipped 184 transitions) in 58 ms.
[2024-06-02 22:52:27] [INFO ] Deduced a trap composed of 17 places in 143 ms of which 4 ms to minimize.
[2024-06-02 22:52:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 230 ms
[2024-06-02 22:52:27] [INFO ] Added : 137 causal constraints over 29 iterations in 1583 ms. Result :sat
Minimization took 90 ms.
[2024-06-02 22:52:27] [INFO ] [Real]Absence check using 11 positive place invariants in 12 ms returned sat
[2024-06-02 22:52:27] [INFO ] [Real]Absence check using 11 positive and 1 generalized place invariants in 0 ms returned sat
[2024-06-02 22:52:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 22:52:28] [INFO ] [Real]Absence check using state equation in 220 ms returned sat
[2024-06-02 22:52:28] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:52:28] [INFO ] [Nat]Absence check using 11 positive place invariants in 14 ms returned sat
[2024-06-02 22:52:28] [INFO ] [Nat]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-02 22:52:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 22:52:28] [INFO ] [Nat]Absence check using state equation in 235 ms returned sat
[2024-06-02 22:52:28] [INFO ] Computed and/alt/rep : 724/1001/724 causal constraints (skipped 184 transitions) in 44 ms.
[2024-06-02 22:52:29] [INFO ] Added : 90 causal constraints over 18 iterations in 803 ms. Result :sat
Minimization took 89 ms.
[2024-06-02 22:52:29] [INFO ] [Real]Absence check using 11 positive place invariants in 12 ms returned sat
[2024-06-02 22:52:29] [INFO ] [Real]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-02 22:52:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 22:52:29] [INFO ] [Real]Absence check using state equation in 228 ms returned sat
[2024-06-02 22:52:29] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:52:29] [INFO ] [Nat]Absence check using 11 positive place invariants in 13 ms returned sat
[2024-06-02 22:52:29] [INFO ] [Nat]Absence check using 11 positive and 1 generalized place invariants in 2 ms returned sat
[2024-06-02 22:52:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 22:52:30] [INFO ] [Nat]Absence check using state equation in 218 ms returned sat
[2024-06-02 22:52:30] [INFO ] Deduced a trap composed of 22 places in 150 ms of which 1 ms to minimize.
[2024-06-02 22:52:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 210 ms
[2024-06-02 22:52:30] [INFO ] Computed and/alt/rep : 724/1001/724 causal constraints (skipped 184 transitions) in 45 ms.
[2024-06-02 22:52:31] [INFO ] Added : 131 causal constraints over 27 iterations in 1242 ms. Result :sat
Minimization took 102 ms.
[2024-06-02 22:52:31] [INFO ] [Real]Absence check using 11 positive place invariants in 12 ms returned sat
[2024-06-02 22:52:31] [INFO ] [Real]Absence check using 11 positive and 1 generalized place invariants in 0 ms returned sat
[2024-06-02 22:52:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 22:52:32] [INFO ] [Real]Absence check using state equation in 231 ms returned sat
[2024-06-02 22:52:32] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:52:32] [INFO ] [Nat]Absence check using 11 positive place invariants in 13 ms returned sat
[2024-06-02 22:52:32] [INFO ] [Nat]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-02 22:52:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 22:52:32] [INFO ] [Nat]Absence check using state equation in 241 ms returned sat
[2024-06-02 22:52:32] [INFO ] Computed and/alt/rep : 724/1001/724 causal constraints (skipped 184 transitions) in 44 ms.
[2024-06-02 22:52:33] [INFO ] Added : 122 causal constraints over 25 iterations in 1186 ms. Result :sat
Minimization took 99 ms.
[2024-06-02 22:52:33] [INFO ] [Real]Absence check using 11 positive place invariants in 13 ms returned sat
[2024-06-02 22:52:33] [INFO ] [Real]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-02 22:52:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 22:52:34] [INFO ] [Real]Absence check using state equation in 215 ms returned sat
[2024-06-02 22:52:34] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:52:34] [INFO ] [Nat]Absence check using 11 positive place invariants in 13 ms returned sat
[2024-06-02 22:52:34] [INFO ] [Nat]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-02 22:52:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 22:52:34] [INFO ] [Nat]Absence check using state equation in 210 ms returned sat
[2024-06-02 22:52:34] [INFO ] Computed and/alt/rep : 724/1001/724 causal constraints (skipped 184 transitions) in 44 ms.
[2024-06-02 22:52:35] [INFO ] Added : 100 causal constraints over 20 iterations in 927 ms. Result :sat
Minimization took 102 ms.
[2024-06-02 22:52:35] [INFO ] [Real]Absence check using 11 positive place invariants in 12 ms returned sat
[2024-06-02 22:52:35] [INFO ] [Real]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-02 22:52:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 22:52:35] [INFO ] [Real]Absence check using state equation in 244 ms returned sat
[2024-06-02 22:52:36] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:52:36] [INFO ] [Nat]Absence check using 11 positive place invariants in 14 ms returned sat
[2024-06-02 22:52:36] [INFO ] [Nat]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-02 22:52:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 22:52:36] [INFO ] [Nat]Absence check using state equation in 215 ms returned sat
[2024-06-02 22:52:36] [INFO ] Computed and/alt/rep : 724/1001/724 causal constraints (skipped 184 transitions) in 42 ms.
[2024-06-02 22:52:37] [INFO ] Added : 107 causal constraints over 22 iterations in 1003 ms. Result :sat
Minimization took 95 ms.
[2024-06-02 22:52:37] [INFO ] [Real]Absence check using 11 positive place invariants in 13 ms returned sat
[2024-06-02 22:52:37] [INFO ] [Real]Absence check using 11 positive and 1 generalized place invariants in 2 ms returned sat
[2024-06-02 22:52:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 22:52:37] [INFO ] [Real]Absence check using state equation in 235 ms returned sat
[2024-06-02 22:52:37] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:52:37] [INFO ] [Nat]Absence check using 11 positive place invariants in 13 ms returned sat
[2024-06-02 22:52:37] [INFO ] [Nat]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-02 22:52:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 22:52:38] [INFO ] [Nat]Absence check using state equation in 230 ms returned sat
[2024-06-02 22:52:38] [INFO ] Computed and/alt/rep : 724/1001/724 causal constraints (skipped 184 transitions) in 44 ms.
[2024-06-02 22:52:38] [INFO ] Added : 78 causal constraints over 16 iterations in 745 ms. Result :sat
Minimization took 85 ms.
[2024-06-02 22:52:39] [INFO ] [Real]Absence check using 11 positive place invariants in 12 ms returned sat
[2024-06-02 22:52:39] [INFO ] [Real]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-02 22:52:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 22:52:39] [INFO ] [Real]Absence check using state equation in 222 ms returned sat
[2024-06-02 22:52:39] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:52:39] [INFO ] [Nat]Absence check using 11 positive place invariants in 13 ms returned sat
[2024-06-02 22:52:39] [INFO ] [Nat]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-02 22:52:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 22:52:39] [INFO ] [Nat]Absence check using state equation in 203 ms returned sat
[2024-06-02 22:52:39] [INFO ] Computed and/alt/rep : 724/1001/724 causal constraints (skipped 184 transitions) in 41 ms.
[2024-06-02 22:52:40] [INFO ] Added : 86 causal constraints over 18 iterations in 821 ms. Result :sat
Minimization took 76 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
FORMULA CO4-PT-15-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-15-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-15-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-15-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-15-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-15-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-15-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-15-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-15-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 1 out of 709 places. Attempting structural reductions.
Drop transitions removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 709/709 places, 908/908 transitions.
Graph (trivial) has 739 edges and 709 vertex of which 2 / 709 are part of one of the 1 SCC in 5 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 1303 edges and 708 vertex of which 657 are kept as prefixes of interest. Removing 51 places using SCC suffix rule.2 ms
Discarding 51 places :
Also discarding 23 output transitions
Drop transitions removed 23 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Drop transitions removed 352 transitions
Trivial Post-agglo rules discarded 352 transitions
Performed 352 trivial Post agglomeration. Transition count delta: 352
Iterating post reduction 0 with 383 rules applied. Total rules applied 385 place count 656 transition count 500
Reduce places removed 352 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 379 rules applied. Total rules applied 764 place count 304 transition count 473
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 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 2 with 27 rules applied. Total rules applied 791 place count 292 transition count 458
Reduce places removed 3 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 3 with 9 rules applied. Total rules applied 800 place count 289 transition count 452
Reduce places removed 3 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 4 with 9 rules applied. Total rules applied 809 place count 286 transition count 446
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 815 place count 283 transition count 443
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 815 place count 283 transition count 442
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 817 place count 282 transition count 442
Discarding 45 places :
Symmetric choice reduction at 6 with 45 rule applications. Total rules 862 place count 237 transition count 397
Iterating global reduction 6 with 45 rules applied. Total rules applied 907 place count 237 transition count 397
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 14 Pre rules applied. Total rules applied 907 place count 237 transition count 383
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 6 with 28 rules applied. Total rules applied 935 place count 223 transition count 383
Discarding 28 places :
Symmetric choice reduction at 6 with 28 rule applications. Total rules 963 place count 195 transition count 339
Iterating global reduction 6 with 28 rules applied. Total rules applied 991 place count 195 transition count 339
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 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 7 rules applied. Total rules applied 998 place count 195 transition count 332
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 999 place count 194 transition count 332
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 1003 place count 190 transition count 327
Iterating global reduction 8 with 4 rules applied. Total rules applied 1007 place count 190 transition count 327
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 1011 place count 190 transition count 323
Performed 75 Post agglomeration using F-continuation condition with reduction of 10 identical transitions.
Deduced a syphon composed of 75 places in 1 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 9 with 150 rules applied. Total rules applied 1161 place count 115 transition count 238
Drop transitions removed 1 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 1165 place count 115 transition count 234
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: -41
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 10 with 78 rules applied. Total rules applied 1243 place count 76 transition count 275
Drop transitions removed 39 transitions
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 59 transitions.
Iterating post reduction 10 with 59 rules applied. Total rules applied 1302 place count 76 transition count 216
Discarding 28 places :
Symmetric choice reduction at 11 with 28 rule applications. Total rules 1330 place count 48 transition count 132
Iterating global reduction 11 with 28 rules applied. Total rules applied 1358 place count 48 transition count 132
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 11 with 19 rules applied. Total rules applied 1377 place count 48 transition count 113
Discarding 7 places :
Symmetric choice reduction at 12 with 7 rule applications. Total rules 1384 place count 41 transition count 81
Iterating global reduction 12 with 7 rules applied. Total rules applied 1391 place count 41 transition count 81
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 12 with 5 rules applied. Total rules applied 1396 place count 41 transition count 76
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 13 with 4 rules applied. Total rules applied 1400 place count 39 transition count 99
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 13 with 6 rules applied. Total rules applied 1406 place count 39 transition count 93
Drop transitions removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 14 with 17 rules applied. Total rules applied 1423 place count 39 transition count 76
Free-agglomeration rule applied 8 times.
Iterating global reduction 14 with 8 rules applied. Total rules applied 1431 place count 39 transition count 68
Reduce places removed 8 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 14 with 10 rules applied. Total rules applied 1441 place count 31 transition count 66
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 15 with 1 rules applied. Total rules applied 1442 place count 31 transition count 66
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 15 with 1 rules applied. Total rules applied 1443 place count 30 transition count 65
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t511.t836 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 18 edges and 26 vertex of which 3 / 26 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 15 with 3 rules applied. Total rules applied 1446 place count 24 transition count 63
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 5 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (trivial) has 18 edges and 23 vertex of which 6 / 23 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Iterating post reduction 16 with 8 rules applied. Total rules applied 1454 place count 18 transition count 57
Drop transitions removed 15 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 17 with 23 rules applied. Total rules applied 1477 place count 18 transition count 34
Discarding 1 places :
Symmetric choice reduction at 18 with 1 rule applications. Total rules 1478 place count 17 transition count 31
Iterating global reduction 18 with 1 rules applied. Total rules applied 1479 place count 17 transition count 31
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 18 with 1 rules applied. Total rules applied 1480 place count 17 transition count 30
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 19 with 5 rules applied. Total rules applied 1485 place count 17 transition count 25
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 47 edges and 16 vertex of which 15 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 19 with 3 rules applied. Total rules applied 1488 place count 15 transition count 24
Discarding 1 places :
Symmetric choice reduction at 20 with 1 rule applications. Total rules 1489 place count 14 transition count 22
Iterating global reduction 20 with 1 rules applied. Total rules applied 1490 place count 14 transition count 22
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 20 with 1 rules applied. Total rules applied 1491 place count 14 transition count 21
Free-agglomeration rule applied 2 times.
Iterating global reduction 21 with 2 rules applied. Total rules applied 1493 place count 14 transition count 19
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 21 with 2 rules applied. Total rules applied 1495 place count 12 transition count 19
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 22 with 3 rules applied. Total rules applied 1498 place count 12 transition count 16
Applied a total of 1498 rules in 140 ms. Remains 12 /709 variables (removed 697) and now considering 16/908 (removed 892) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 140 ms. Remains : 12/709 places, 16/908 transitions.
Successfully produced net in file /tmp/petri1000_2920588059358601321.dot
Successfully produced net in file /tmp/petri1001_6918495605776505593.dot
Drop transitions removed 2 transitions
Dominated transitions for bounds rules discarded 2 transitions
Reduce places removed 1 places and 0 transitions.
Normalized transition count is 13 out of 14 initially.
// Phase 1: matrix 13 rows 11 cols
[2024-06-02 22:52:41] [INFO ] Computed 5 invariants in 0 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 599 ms. (steps per millisecond=1669 ) properties (out of 1) seen :1
FORMULA CO4-PT-15-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 21240 ms.

BK_STOP 1717368762718

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

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