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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 696K
-rw-r--r-- 1 mcc users 8.6K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 99K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K 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.0K 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 11K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 121K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 43K 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 260K 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-16-UpperBounds-00
FORMULA_NAME CO4-PT-16-UpperBounds-01
FORMULA_NAME CO4-PT-16-UpperBounds-02
FORMULA_NAME CO4-PT-16-UpperBounds-03
FORMULA_NAME CO4-PT-16-UpperBounds-04
FORMULA_NAME CO4-PT-16-UpperBounds-05
FORMULA_NAME CO4-PT-16-UpperBounds-06
FORMULA_NAME CO4-PT-16-UpperBounds-07
FORMULA_NAME CO4-PT-16-UpperBounds-08
FORMULA_NAME CO4-PT-16-UpperBounds-09
FORMULA_NAME CO4-PT-16-UpperBounds-10
FORMULA_NAME CO4-PT-16-UpperBounds-11
FORMULA_NAME CO4-PT-16-UpperBounds-12
FORMULA_NAME CO4-PT-16-UpperBounds-13
FORMULA_NAME CO4-PT-16-UpperBounds-14
FORMULA_NAME CO4-PT-16-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717368766961

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-16
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202304061127
[2024-06-02 22:52:48] [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:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 22:52:48] [INFO ] Load time of PNML (sax parser for PT used): 78 ms
[2024-06-02 22:52:48] [INFO ] Transformed 837 places.
[2024-06-02 22:52:48] [INFO ] Transformed 1122 transitions.
[2024-06-02 22:52:48] [INFO ] Found NUPN structural information;
[2024-06-02 22:52:48] [INFO ] Parsed PT model containing 837 places and 1122 transitions and 3052 arcs in 143 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
Deduced a syphon composed of 116 places in 10 ms
Reduce places removed 116 places and 180 transitions.
FORMULA CO4-PT-16-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 942 rows 721 cols
[2024-06-02 22:52:48] [INFO ] Computed 12 invariants in 33 ms
Incomplete random walk after 10000 steps, including 228 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 15) seen :5
FORMULA CO4-PT-16-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CO4-PT-16-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CO4-PT-16-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CO4-PT-16-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CO4-PT-16-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
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
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 10) seen :1
FORMULA CO4-PT-16-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 9) seen :1
FORMULA CO4-PT-16-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 40 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 40 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 8) seen :0
[2024-06-02 22:52:49] [INFO ] Invariant cache hit.
[2024-06-02 22:52:49] [INFO ] [Real]Absence check using 11 positive place invariants in 17 ms returned sat
[2024-06-02 22:52:49] [INFO ] [Real]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-02 22:52:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 22:52:49] [INFO ] [Real]Absence check using state equation in 255 ms returned sat
[2024-06-02 22:52:49] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:52:49] [INFO ] [Nat]Absence check using 11 positive place invariants in 13 ms returned sat
[2024-06-02 22:52:49] [INFO ] [Nat]Absence check using 11 positive and 1 generalized place invariants in 2 ms returned sat
[2024-06-02 22:52:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 22:52:50] [INFO ] [Nat]Absence check using state equation in 237 ms returned sat
[2024-06-02 22:52:50] [INFO ] Computed and/alt/rep : 741/1099/741 causal constraints (skipped 200 transitions) in 64 ms.
[2024-06-02 22:52:51] [INFO ] Added : 114 causal constraints over 23 iterations in 1229 ms. Result :sat
Minimization took 88 ms.
[2024-06-02 22:52:51] [INFO ] [Real]Absence check using 11 positive place invariants in 11 ms returned sat
[2024-06-02 22:52:51] [INFO ] [Real]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-02 22:52:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 22:52:51] [INFO ] [Real]Absence check using state equation in 203 ms returned sat
[2024-06-02 22:52:51] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:52:51] [INFO ] [Nat]Absence check using 11 positive place invariants in 12 ms returned sat
[2024-06-02 22:52:51] [INFO ] [Nat]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-02 22:52:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 22:52:52] [INFO ] [Nat]Absence check using state equation in 232 ms returned sat
[2024-06-02 22:52:52] [INFO ] Computed and/alt/rep : 741/1099/741 causal constraints (skipped 200 transitions) in 58 ms.
[2024-06-02 22:52:53] [INFO ] Deduced a trap composed of 27 places in 217 ms of which 3 ms to minimize.
[2024-06-02 22:52:54] [INFO ] Deduced a trap composed of 326 places in 246 ms of which 1 ms to minimize.
[2024-06-02 22:52:54] [INFO ] Deduced a trap composed of 58 places in 199 ms of which 1 ms to minimize.
[2024-06-02 22:52:54] [INFO ] Deduced a trap composed of 130 places in 203 ms of which 1 ms to minimize.
[2024-06-02 22:52:54] [INFO ] Deduced a trap composed of 203 places in 199 ms of which 2 ms to minimize.
[2024-06-02 22:52:55] [INFO ] Deduced a trap composed of 344 places in 144 ms of which 0 ms to minimize.
[2024-06-02 22:52:55] [INFO ] Deduced a trap composed of 63 places in 150 ms of which 1 ms to minimize.
[2024-06-02 22:52:55] [INFO ] Deduced a trap composed of 334 places in 123 ms of which 1 ms to minimize.
[2024-06-02 22:52:55] [INFO ] Deduced a trap composed of 20 places in 140 ms of which 0 ms to minimize.
[2024-06-02 22:52:55] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 2072 ms
[2024-06-02 22:52:55] [INFO ] Added : 143 causal constraints over 30 iterations in 3603 ms. Result :sat
Minimization took 123 ms.
[2024-06-02 22:52:56] [INFO ] [Real]Absence check using 11 positive place invariants in 12 ms returned sat
[2024-06-02 22:52:56] [INFO ] [Real]Absence check using 11 positive and 1 generalized place invariants in 2 ms returned sat
[2024-06-02 22:52:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 22:52:56] [INFO ] [Real]Absence check using state equation in 228 ms returned sat
[2024-06-02 22:52:56] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:52:56] [INFO ] [Nat]Absence check using 11 positive place invariants in 13 ms returned sat
[2024-06-02 22:52:56] [INFO ] [Nat]Absence check using 11 positive and 1 generalized place invariants in 5 ms returned sat
[2024-06-02 22:52:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 22:52:56] [INFO ] [Nat]Absence check using state equation in 227 ms returned sat
[2024-06-02 22:52:56] [INFO ] Computed and/alt/rep : 741/1099/741 causal constraints (skipped 200 transitions) in 51 ms.
[2024-06-02 22:52:57] [INFO ] Deduced a trap composed of 18 places in 180 ms of which 1 ms to minimize.
[2024-06-02 22:52:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 254 ms
[2024-06-02 22:52:58] [INFO ] Added : 115 causal constraints over 23 iterations in 1324 ms. Result :sat
Minimization took 113 ms.
[2024-06-02 22:52:58] [INFO ] [Real]Absence check using 11 positive place invariants in 11 ms returned sat
[2024-06-02 22:52:58] [INFO ] [Real]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-02 22:52:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 22:52:58] [INFO ] [Real]Absence check using state equation in 215 ms returned sat
[2024-06-02 22:52:58] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:52:58] [INFO ] [Nat]Absence check using 11 positive place invariants in 14 ms returned sat
[2024-06-02 22:52:58] [INFO ] [Nat]Absence check using 11 positive and 1 generalized place invariants in 0 ms returned sat
[2024-06-02 22:52:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 22:52:58] [INFO ] [Nat]Absence check using state equation in 232 ms returned sat
[2024-06-02 22:52:59] [INFO ] Computed and/alt/rep : 741/1099/741 causal constraints (skipped 200 transitions) in 51 ms.
[2024-06-02 22:53:00] [INFO ] Deduced a trap composed of 18 places in 147 ms of which 0 ms to minimize.
[2024-06-02 22:53:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 223 ms
[2024-06-02 22:53:00] [INFO ] Added : 123 causal constraints over 25 iterations in 1486 ms. Result :sat
Minimization took 99 ms.
[2024-06-02 22:53:00] [INFO ] [Real]Absence check using 11 positive place invariants in 13 ms returned sat
[2024-06-02 22:53:00] [INFO ] [Real]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-02 22:53:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 22:53:00] [INFO ] [Real]Absence check using state equation in 206 ms returned sat
[2024-06-02 22:53:00] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:53:01] [INFO ] [Nat]Absence check using 11 positive place invariants in 12 ms returned sat
[2024-06-02 22:53:01] [INFO ] [Nat]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-02 22:53:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 22:53:01] [INFO ] [Nat]Absence check using state equation in 234 ms returned sat
[2024-06-02 22:53:01] [INFO ] Computed and/alt/rep : 741/1099/741 causal constraints (skipped 200 transitions) in 58 ms.
[2024-06-02 22:53:02] [INFO ] Added : 102 causal constraints over 21 iterations in 1016 ms. Result :sat
Minimization took 100 ms.
[2024-06-02 22:53:02] [INFO ] [Real]Absence check using 11 positive place invariants in 11 ms returned sat
[2024-06-02 22:53:02] [INFO ] [Real]Absence check using 11 positive and 1 generalized place invariants in 2 ms returned sat
[2024-06-02 22:53:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 22:53:02] [INFO ] [Real]Absence check using state equation in 222 ms returned sat
[2024-06-02 22:53:02] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:53:02] [INFO ] [Nat]Absence check using 11 positive place invariants in 12 ms returned sat
[2024-06-02 22:53:02] [INFO ] [Nat]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-02 22:53:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 22:53:03] [INFO ] [Nat]Absence check using state equation in 223 ms returned sat
[2024-06-02 22:53:03] [INFO ] Computed and/alt/rep : 741/1099/741 causal constraints (skipped 200 transitions) in 51 ms.
[2024-06-02 22:53:04] [INFO ] Added : 136 causal constraints over 28 iterations in 1365 ms. Result :sat
Minimization took 105 ms.
[2024-06-02 22:53:04] [INFO ] [Real]Absence check using 11 positive place invariants in 11 ms returned sat
[2024-06-02 22:53:04] [INFO ] [Real]Absence check using 11 positive and 1 generalized place invariants in 2 ms returned sat
[2024-06-02 22:53:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 22:53:05] [INFO ] [Real]Absence check using state equation in 209 ms returned sat
[2024-06-02 22:53:05] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:53:05] [INFO ] [Nat]Absence check using 11 positive place invariants in 11 ms returned sat
[2024-06-02 22:53:05] [INFO ] [Nat]Absence check using 11 positive and 1 generalized place invariants in 3 ms returned sat
[2024-06-02 22:53:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 22:53:05] [INFO ] [Nat]Absence check using state equation in 212 ms returned sat
[2024-06-02 22:53:05] [INFO ] Computed and/alt/rep : 741/1099/741 causal constraints (skipped 200 transitions) in 43 ms.
[2024-06-02 22:53:06] [INFO ] Deduced a trap composed of 125 places in 159 ms of which 1 ms to minimize.
[2024-06-02 22:53:06] [INFO ] Deduced a trap composed of 70 places in 54 ms of which 0 ms to minimize.
[2024-06-02 22:53:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 325 ms
[2024-06-02 22:53:07] [INFO ] Added : 128 causal constraints over 26 iterations in 1547 ms. Result :sat
Minimization took 99 ms.
[2024-06-02 22:53:07] [INFO ] [Real]Absence check using 11 positive place invariants in 12 ms returned sat
[2024-06-02 22:53:07] [INFO ] [Real]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-02 22:53:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 22:53:07] [INFO ] [Real]Absence check using state equation in 220 ms returned sat
[2024-06-02 22:53:07] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:53:07] [INFO ] [Nat]Absence check using 11 positive place invariants in 12 ms returned sat
[2024-06-02 22:53:07] [INFO ] [Nat]Absence check using 11 positive and 1 generalized place invariants in 0 ms returned sat
[2024-06-02 22:53:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 22:53:07] [INFO ] [Nat]Absence check using state equation in 214 ms returned sat
[2024-06-02 22:53:07] [INFO ] Computed and/alt/rep : 741/1099/741 causal constraints (skipped 200 transitions) in 40 ms.
[2024-06-02 22:53:09] [INFO ] Added : 141 causal constraints over 29 iterations in 1379 ms. Result :sat
Minimization took 113 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-16-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-16-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-16-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-16-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 4 out of 721 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 721/721 places, 942/942 transitions.
Graph (trivial) has 743 edges and 721 vertex of which 2 / 721 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 1392 edges and 720 vertex of which 675 are kept as prefixes of interest. Removing 45 places using SCC suffix rule.2 ms
Discarding 45 places :
Also discarding 20 output transitions
Drop transitions removed 20 transitions
Drop transitions removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Drop transitions removed 354 transitions
Trivial Post-agglo rules discarded 354 transitions
Performed 354 trivial Post agglomeration. Transition count delta: 354
Iterating post reduction 0 with 385 rules applied. Total rules applied 387 place count 675 transition count 535
Reduce places removed 354 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 1 with 383 rules applied. Total rules applied 770 place count 321 transition count 506
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 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 29 rules applied. Total rules applied 799 place count 308 transition count 490
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 808 place count 305 transition count 484
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 817 place count 302 transition count 478
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 823 place count 299 transition count 475
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 823 place count 299 transition count 474
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 825 place count 298 transition count 474
Discarding 49 places :
Symmetric choice reduction at 6 with 49 rule applications. Total rules 874 place count 249 transition count 425
Iterating global reduction 6 with 49 rules applied. Total rules applied 923 place count 249 transition count 425
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 14 Pre rules applied. Total rules applied 923 place count 249 transition count 411
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 6 with 28 rules applied. Total rules applied 951 place count 235 transition count 411
Discarding 31 places :
Symmetric choice reduction at 6 with 31 rule applications. Total rules 982 place count 204 transition count 356
Iterating global reduction 6 with 31 rules applied. Total rules applied 1013 place count 204 transition count 356
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 1020 place count 204 transition count 349
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1021 place count 203 transition count 349
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 1025 place count 199 transition count 344
Iterating global reduction 8 with 4 rules applied. Total rules applied 1029 place count 199 transition count 344
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 1033 place count 199 transition count 340
Performed 74 Post agglomeration using F-continuation condition with reduction of 10 identical transitions.
Deduced a syphon composed of 74 places in 1 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 9 with 148 rules applied. Total rules applied 1181 place count 125 transition count 256
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 1185 place count 125 transition count 252
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: -41
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 10 with 76 rules applied. Total rules applied 1261 place count 87 transition count 293
Drop transitions removed 56 transitions
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 75 transitions.
Iterating post reduction 10 with 75 rules applied. Total rules applied 1336 place count 87 transition count 218
Discarding 27 places :
Symmetric choice reduction at 11 with 27 rule applications. Total rules 1363 place count 60 transition count 154
Iterating global reduction 11 with 27 rules applied. Total rules applied 1390 place count 60 transition count 154
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 11 with 19 rules applied. Total rules applied 1409 place count 60 transition count 135
Discarding 5 places :
Symmetric choice reduction at 12 with 5 rule applications. Total rules 1414 place count 55 transition count 114
Iterating global reduction 12 with 5 rules applied. Total rules applied 1419 place count 55 transition count 114
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 12 with 3 rules applied. Total rules applied 1422 place count 55 transition count 111
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 13 with 5 rules applied. Total rules applied 1427 place count 55 transition count 106
Discarding 1 places :
Symmetric choice reduction at 13 with 1 rule applications. Total rules 1428 place count 54 transition count 104
Iterating global reduction 13 with 1 rules applied. Total rules applied 1429 place count 54 transition count 104
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 1430 place count 54 transition count 103
Free-agglomeration rule applied 11 times.
Iterating global reduction 14 with 11 rules applied. Total rules applied 1441 place count 54 transition count 92
Reduce places removed 11 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 14 with 13 rules applied. Total rules applied 1454 place count 43 transition count 90
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 15 with 1 rules applied. Total rules applied 1455 place count 43 transition count 90
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 15 with 1 rules applied. Total rules applied 1456 place count 42 transition count 89
Reduce places removed 3 places and 0 transitions.
Graph (trivial) has 26 edges and 39 vertex of which 5 / 39 are part of one of the 2 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 15 with 4 rules applied. Total rules applied 1460 place count 36 transition count 89
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (trivial) has 29 edges and 35 vertex of which 6 / 35 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Iterating post reduction 16 with 10 rules applied. Total rules applied 1470 place count 30 transition count 81
Drop transitions removed 10 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 17 with 17 rules applied. Total rules applied 1487 place count 30 transition count 64
Discarding 1 places :
Symmetric choice reduction at 18 with 1 rule applications. Total rules 1488 place count 29 transition count 62
Iterating global reduction 18 with 1 rules applied. Total rules applied 1489 place count 29 transition count 62
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 18 with 1 rules applied. Total rules applied 1490 place count 29 transition count 61
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 19 with 2 rules applied. Total rules applied 1492 place count 28 transition count 66
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 19 with 3 rules applied. Total rules applied 1495 place count 28 transition count 63
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 20 with 8 rules applied. Total rules applied 1503 place count 28 transition count 55
Free-agglomeration rule applied 2 times.
Iterating global reduction 20 with 2 rules applied. Total rules applied 1505 place count 28 transition count 53
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 20 with 2 rules applied. Total rules applied 1507 place count 26 transition count 53
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 21 with 4 rules applied. Total rules applied 1511 place count 26 transition count 49
Free-agglomeration rule applied 1 times.
Iterating global reduction 21 with 1 rules applied. Total rules applied 1512 place count 26 transition count 48
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 21 with 1 rules applied. Total rules applied 1513 place count 25 transition count 48
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 22 with 2 rules applied. Total rules applied 1515 place count 25 transition count 46
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 22 with 1 rules applied. Total rules applied 1516 place count 25 transition count 46
Applied a total of 1516 rules in 188 ms. Remains 25 /721 variables (removed 696) and now considering 46/942 (removed 896) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 189 ms. Remains : 25/721 places, 46/942 transitions.
Successfully produced net in file /tmp/petri1000_14542180817521170282.dot
Successfully produced net in file /tmp/petri1001_13755192414482720256.dot
Drop transitions removed 2 transitions
Dominated transitions for bounds rules discarded 2 transitions
Normalized transition count is 37 out of 44 initially.
// Phase 1: matrix 37 rows 25 cols
[2024-06-02 22:53:09] [INFO ] Computed 7 invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 930 ms. (steps per millisecond=1075 ) properties (out of 4) seen :4
FORMULA CO4-PT-16-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CO4-PT-16-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CO4-PT-16-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CO4-PT-16-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 22358 ms.

BK_STOP 1717368792101

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

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