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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 740K
-rw-r--r-- 1 mcc users 5.6K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 57K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 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 11K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K 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 344K 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-21-UpperBounds-00
FORMULA_NAME CO4-PT-21-UpperBounds-01
FORMULA_NAME CO4-PT-21-UpperBounds-02
FORMULA_NAME CO4-PT-21-UpperBounds-03
FORMULA_NAME CO4-PT-21-UpperBounds-04
FORMULA_NAME CO4-PT-21-UpperBounds-05
FORMULA_NAME CO4-PT-21-UpperBounds-06
FORMULA_NAME CO4-PT-21-UpperBounds-07
FORMULA_NAME CO4-PT-21-UpperBounds-08
FORMULA_NAME CO4-PT-21-UpperBounds-09
FORMULA_NAME CO4-PT-21-UpperBounds-10
FORMULA_NAME CO4-PT-21-UpperBounds-11
FORMULA_NAME CO4-PT-21-UpperBounds-12
FORMULA_NAME CO4-PT-21-UpperBounds-13
FORMULA_NAME CO4-PT-21-UpperBounds-14
FORMULA_NAME CO4-PT-21-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717368971850

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-21
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202304061127
[2024-06-02 22:56:13] [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:56:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 22:56:13] [INFO ] Load time of PNML (sax parser for PT used): 90 ms
[2024-06-02 22:56:13] [INFO ] Transformed 1400 places.
[2024-06-02 22:56:13] [INFO ] Transformed 1583 transitions.
[2024-06-02 22:56:13] [INFO ] Found NUPN structural information;
[2024-06-02 22:56:13] [INFO ] Parsed PT model containing 1400 places and 1583 transitions and 3434 arcs in 160 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
Deduced a syphon composed of 307 places in 17 ms
Reduce places removed 307 places and 347 transitions.
FORMULA CO4-PT-21-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-21-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-21-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-21-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-21-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 1236 rows 1093 cols
[2024-06-02 22:56:13] [INFO ] Computed 9 invariants in 32 ms
Incomplete random walk after 10000 steps, including 75 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 11) seen :2
FORMULA CO4-PT-21-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CO4-PT-21-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 44 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 9 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 6 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 6 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 48 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 9) seen :0
[2024-06-02 22:56:13] [INFO ] Invariant cache hit.
[2024-06-02 22:56:14] [INFO ] [Real]Absence check using 9 positive place invariants in 26 ms returned sat
[2024-06-02 22:56:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 22:56:14] [INFO ] [Real]Absence check using state equation in 421 ms returned sat
[2024-06-02 22:56:14] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:56:15] [INFO ] [Nat]Absence check using 9 positive place invariants in 20 ms returned sat
[2024-06-02 22:56:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 22:56:15] [INFO ] [Nat]Absence check using state equation in 355 ms returned sat
[2024-06-02 22:56:15] [INFO ] Deduced a trap composed of 125 places in 331 ms of which 3 ms to minimize.
[2024-06-02 22:56:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 462 ms
[2024-06-02 22:56:16] [INFO ] Computed and/alt/rep : 1121/1303/1121 causal constraints (skipped 114 transitions) in 74 ms.
[2024-06-02 22:56:18] [INFO ] Deduced a trap composed of 78 places in 139 ms of which 1 ms to minimize.
[2024-06-02 22:56:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 251 ms
[2024-06-02 22:56:18] [INFO ] Added : 193 causal constraints over 40 iterations in 2809 ms. Result :sat
Minimization took 142 ms.
[2024-06-02 22:56:19] [INFO ] [Real]Absence check using 9 positive place invariants in 18 ms returned sat
[2024-06-02 22:56:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 22:56:19] [INFO ] [Real]Absence check using state equation in 341 ms returned sat
[2024-06-02 22:56:19] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:56:19] [INFO ] [Nat]Absence check using 9 positive place invariants in 18 ms returned sat
[2024-06-02 22:56:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 22:56:20] [INFO ] [Nat]Absence check using state equation in 352 ms returned sat
[2024-06-02 22:56:20] [INFO ] Computed and/alt/rep : 1121/1303/1121 causal constraints (skipped 114 transitions) in 71 ms.
[2024-06-02 22:56:22] [INFO ] Added : 195 causal constraints over 39 iterations in 2261 ms. Result :sat
Minimization took 117 ms.
[2024-06-02 22:56:22] [INFO ] [Real]Absence check using 9 positive place invariants in 17 ms returned sat
[2024-06-02 22:56:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 22:56:23] [INFO ] [Real]Absence check using state equation in 357 ms returned sat
[2024-06-02 22:56:23] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:56:23] [INFO ] [Nat]Absence check using 9 positive place invariants in 19 ms returned sat
[2024-06-02 22:56:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 22:56:23] [INFO ] [Nat]Absence check using state equation in 337 ms returned sat
[2024-06-02 22:56:23] [INFO ] Computed and/alt/rep : 1121/1303/1121 causal constraints (skipped 114 transitions) in 71 ms.
[2024-06-02 22:56:25] [INFO ] Added : 188 causal constraints over 38 iterations in 2279 ms. Result :sat
Minimization took 119 ms.
[2024-06-02 22:56:26] [INFO ] [Real]Absence check using 9 positive place invariants in 18 ms returned sat
[2024-06-02 22:56:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 22:56:26] [INFO ] [Real]Absence check using state equation in 353 ms returned sat
[2024-06-02 22:56:26] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:56:26] [INFO ] [Nat]Absence check using 9 positive place invariants in 18 ms returned sat
[2024-06-02 22:56:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 22:56:27] [INFO ] [Nat]Absence check using state equation in 328 ms returned sat
[2024-06-02 22:56:27] [INFO ] Deduced a trap composed of 297 places in 304 ms of which 1 ms to minimize.
[2024-06-02 22:56:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 391 ms
[2024-06-02 22:56:27] [INFO ] Computed and/alt/rep : 1121/1303/1121 causal constraints (skipped 114 transitions) in 73 ms.
[2024-06-02 22:56:30] [INFO ] Added : 238 causal constraints over 48 iterations in 2830 ms. Result :sat
Minimization took 149 ms.
[2024-06-02 22:56:30] [INFO ] [Real]Absence check using 9 positive place invariants in 17 ms returned sat
[2024-06-02 22:56:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 22:56:31] [INFO ] [Real]Absence check using state equation in 349 ms returned sat
[2024-06-02 22:56:31] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:56:31] [INFO ] [Nat]Absence check using 9 positive place invariants in 19 ms returned sat
[2024-06-02 22:56:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 22:56:31] [INFO ] [Nat]Absence check using state equation in 346 ms returned sat
[2024-06-02 22:56:32] [INFO ] Deduced a trap composed of 741 places in 296 ms of which 1 ms to minimize.
[2024-06-02 22:56:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 398 ms
[2024-06-02 22:56:32] [INFO ] Computed and/alt/rep : 1121/1303/1121 causal constraints (skipped 114 transitions) in 60 ms.
[2024-06-02 22:56:34] [INFO ] Added : 183 causal constraints over 37 iterations in 2131 ms. Result :sat
Minimization took 137 ms.
[2024-06-02 22:56:34] [INFO ] [Real]Absence check using 9 positive place invariants in 17 ms returned sat
[2024-06-02 22:56:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 22:56:34] [INFO ] [Real]Absence check using state equation in 330 ms returned sat
[2024-06-02 22:56:35] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:56:35] [INFO ] [Nat]Absence check using 9 positive place invariants in 18 ms returned sat
[2024-06-02 22:56:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 22:56:35] [INFO ] [Nat]Absence check using state equation in 346 ms returned sat
[2024-06-02 22:56:35] [INFO ] Computed and/alt/rep : 1121/1303/1121 causal constraints (skipped 114 transitions) in 61 ms.
[2024-06-02 22:56:38] [INFO ] Added : 206 causal constraints over 42 iterations in 2428 ms. Result :sat
Minimization took 130 ms.
[2024-06-02 22:56:38] [INFO ] [Real]Absence check using 9 positive place invariants in 17 ms returned sat
[2024-06-02 22:56:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 22:56:38] [INFO ] [Real]Absence check using state equation in 350 ms returned sat
[2024-06-02 22:56:38] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:56:38] [INFO ] [Nat]Absence check using 9 positive place invariants in 17 ms returned sat
[2024-06-02 22:56:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 22:56:39] [INFO ] [Nat]Absence check using state equation in 344 ms returned sat
[2024-06-02 22:56:39] [INFO ] Computed and/alt/rep : 1121/1303/1121 causal constraints (skipped 114 transitions) in 61 ms.
[2024-06-02 22:56:41] [INFO ] Added : 220 causal constraints over 44 iterations in 2534 ms. Result :sat
Minimization took 134 ms.
[2024-06-02 22:56:42] [INFO ] [Real]Absence check using 9 positive place invariants in 17 ms returned sat
[2024-06-02 22:56:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 22:56:42] [INFO ] [Real]Absence check using state equation in 334 ms returned sat
[2024-06-02 22:56:42] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:56:42] [INFO ] [Nat]Absence check using 9 positive place invariants in 17 ms returned sat
[2024-06-02 22:56:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 22:56:43] [INFO ] [Nat]Absence check using state equation in 316 ms returned sat
[2024-06-02 22:56:43] [INFO ] Deduced a trap composed of 125 places in 289 ms of which 1 ms to minimize.
[2024-06-02 22:56:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 375 ms
[2024-06-02 22:56:43] [INFO ] Computed and/alt/rep : 1121/1303/1121 causal constraints (skipped 114 transitions) in 59 ms.
[2024-06-02 22:56:45] [INFO ] Deduced a trap composed of 368 places in 311 ms of which 1 ms to minimize.
[2024-06-02 22:56:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 414 ms
[2024-06-02 22:56:46] [INFO ] Added : 194 causal constraints over 39 iterations in 2713 ms. Result :sat
Minimization took 130 ms.
[2024-06-02 22:56:46] [INFO ] [Real]Absence check using 9 positive place invariants in 17 ms returned sat
[2024-06-02 22:56:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 22:56:46] [INFO ] [Real]Absence check using state equation in 350 ms returned sat
[2024-06-02 22:56:46] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:56:47] [INFO ] [Nat]Absence check using 9 positive place invariants in 19 ms returned sat
[2024-06-02 22:56:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 22:56:47] [INFO ] [Nat]Absence check using state equation in 359 ms returned sat
[2024-06-02 22:56:47] [INFO ] Computed and/alt/rep : 1121/1303/1121 causal constraints (skipped 114 transitions) in 53 ms.
[2024-06-02 22:56:49] [INFO ] Added : 209 causal constraints over 42 iterations in 2404 ms. Result :sat
Minimization took 159 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
FORMULA CO4-PT-21-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-21-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-21-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-21-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-21-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-21-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-21-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 2 out of 1093 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1093/1093 places, 1236/1236 transitions.
Graph (trivial) has 1117 edges and 1093 vertex of which 3 / 1093 are part of one of the 1 SCC in 7 ms
Free SCC test removed 2 places
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (complete) has 1468 edges and 1091 vertex of which 1027 are kept as prefixes of interest. Removing 64 places using SCC suffix rule.3 ms
Discarding 64 places :
Also discarding 38 output transitions
Drop transitions removed 38 transitions
Drop transitions removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Drop transitions removed 685 transitions
Trivial Post-agglo rules discarded 685 transitions
Performed 685 trivial Post agglomeration. Transition count delta: 685
Iterating post reduction 0 with 713 rules applied. Total rules applied 715 place count 1027 transition count 482
Reduce places removed 685 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 694 rules applied. Total rules applied 1409 place count 342 transition count 473
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 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 10 rules applied. Total rules applied 1419 place count 338 transition count 467
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 4 rules applied. Total rules applied 1423 place count 336 transition count 465
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 3 rules applied. Total rules applied 1426 place count 335 transition count 463
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 3 rules applied. Total rules applied 1429 place count 334 transition count 461
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1430 place count 333 transition count 461
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 2 Pre rules applied. Total rules applied 1430 place count 333 transition count 459
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 1434 place count 331 transition count 459
Discarding 42 places :
Symmetric choice reduction at 7 with 42 rule applications. Total rules 1476 place count 289 transition count 417
Iterating global reduction 7 with 42 rules applied. Total rules applied 1518 place count 289 transition count 417
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 17 Pre rules applied. Total rules applied 1518 place count 289 transition count 400
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 7 with 34 rules applied. Total rules applied 1552 place count 272 transition count 400
Discarding 27 places :
Symmetric choice reduction at 7 with 27 rule applications. Total rules 1579 place count 245 transition count 373
Iterating global reduction 7 with 27 rules applied. Total rules applied 1606 place count 245 transition count 373
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 7 with 4 rules applied. Total rules applied 1610 place count 245 transition count 369
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1611 place count 244 transition count 369
Performed 110 Post agglomeration using F-continuation condition with reduction of 14 identical transitions.
Deduced a syphon composed of 110 places in 0 ms
Reduce places removed 110 places and 0 transitions.
Iterating global reduction 9 with 220 rules applied. Total rules applied 1831 place count 134 transition count 245
Drop transitions removed 4 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 9 with 8 rules applied. Total rules applied 1839 place count 134 transition count 237
Discarding 5 places :
Symmetric choice reduction at 10 with 5 rule applications. Total rules 1844 place count 129 transition count 232
Iterating global reduction 10 with 5 rules applied. Total rules applied 1849 place count 129 transition count 232
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 1850 place count 129 transition count 231
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 11 with 4 rules applied. Total rules applied 1854 place count 127 transition count 229
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 1856 place count 127 transition count 227
Discarding 2 places :
Symmetric choice reduction at 12 with 2 rule applications. Total rules 1858 place count 125 transition count 225
Iterating global reduction 12 with 2 rules applied. Total rules applied 1860 place count 125 transition count 225
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 12 with 2 rules applied. Total rules applied 1862 place count 125 transition count 223
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 40 places in 2 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 13 with 80 rules applied. Total rules applied 1942 place count 85 transition count 226
Drop transitions removed 16 transitions
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 44 transitions.
Iterating post reduction 13 with 44 rules applied. Total rules applied 1986 place count 85 transition count 182
Discarding 36 places :
Symmetric choice reduction at 14 with 36 rule applications. Total rules 2022 place count 49 transition count 124
Iterating global reduction 14 with 36 rules applied. Total rules applied 2058 place count 49 transition count 124
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 14 with 28 rules applied. Total rules applied 2086 place count 49 transition count 96
Discarding 7 places :
Symmetric choice reduction at 15 with 7 rule applications. Total rules 2093 place count 42 transition count 76
Iterating global reduction 15 with 7 rules applied. Total rules applied 2100 place count 42 transition count 76
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 15 with 5 rules applied. Total rules applied 2105 place count 42 transition count 71
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 16 with 3 rules applied. Total rules applied 2108 place count 42 transition count 68
Discarding 1 places :
Symmetric choice reduction at 16 with 1 rule applications. Total rules 2109 place count 41 transition count 67
Iterating global reduction 16 with 1 rules applied. Total rules applied 2110 place count 41 transition count 67
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 16 with 1 rules applied. Total rules applied 2111 place count 41 transition count 66
Free-agglomeration rule applied 6 times.
Iterating global reduction 17 with 6 rules applied. Total rules applied 2117 place count 41 transition count 60
Reduce places removed 6 places and 0 transitions.
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 17 with 9 rules applied. Total rules applied 2126 place count 35 transition count 57
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 18 with 2 rules applied. Total rules applied 2128 place count 35 transition count 57
Graph (complete) has 108 edges and 35 vertex of which 34 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 18 with 1 rules applied. Total rules applied 2129 place count 34 transition count 57
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 19 with 1 rules applied. Total rules applied 2130 place count 34 transition count 56
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 20 with 1 rules applied. Total rules applied 2131 place count 34 transition count 55
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 20 with 1 rules applied. Total rules applied 2132 place count 34 transition count 55
Graph (complete) has 105 edges and 34 vertex of which 33 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 20 with 1 rules applied. Total rules applied 2133 place count 33 transition count 55
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 21 with 1 rules applied. Total rules applied 2134 place count 33 transition count 54
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 22 with 1 rules applied. Total rules applied 2135 place count 33 transition count 54
Graph (complete) has 102 edges and 33 vertex of which 32 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 22 with 1 rules applied. Total rules applied 2136 place count 32 transition count 54
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 23 with 1 rules applied. Total rules applied 2137 place count 32 transition count 53
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 24 with 1 rules applied. Total rules applied 2138 place count 32 transition count 53
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 24 with 1 rules applied. Total rules applied 2139 place count 31 transition count 52
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t173.t174.t1374 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 22 edges and 27 vertex of which 3 / 27 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 24 with 3 rules applied. Total rules applied 2142 place count 25 transition count 50
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t81.t82.t83.t1355.t317.t318.t319.t1514.t60.t336 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 5 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (trivial) has 22 edges and 23 vertex of which 5 / 23 are part of one of the 1 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 25 with 8 rules applied. Total rules applied 2150 place count 19 transition count 43
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 26 with 7 rules applied. Total rules applied 2157 place count 19 transition count 36
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 27 with 6 rules applied. Total rules applied 2163 place count 19 transition count 30
Discarding 4 places :
Symmetric choice reduction at 27 with 4 rule applications. Total rules 2167 place count 15 transition count 26
Iterating global reduction 27 with 4 rules applied. Total rules applied 2171 place count 15 transition count 26
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 27 with 4 rules applied. Total rules applied 2175 place count 15 transition count 22
Discarding 2 places :
Symmetric choice reduction at 28 with 2 rule applications. Total rules 2177 place count 13 transition count 20
Iterating global reduction 28 with 2 rules applied. Total rules applied 2179 place count 13 transition count 20
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 28 with 2 rules applied. Total rules applied 2181 place count 13 transition count 18
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 29 with 2 rules applied. Total rules applied 2183 place count 12 transition count 21
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 29 with 1 rules applied. Total rules applied 2184 place count 12 transition count 20
Free-agglomeration rule applied 3 times.
Iterating global reduction 30 with 3 rules applied. Total rules applied 2187 place count 12 transition count 17
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 30 with 3 rules applied. Total rules applied 2190 place count 9 transition count 17
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 31 with 2 rules applied. Total rules applied 2192 place count 9 transition count 15
Applied a total of 2192 rules in 343 ms. Remains 9 /1093 variables (removed 1084) and now considering 15/1236 (removed 1221) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 345 ms. Remains : 9/1093 places, 15/1236 transitions.
// Phase 1: matrix 15 rows 9 cols
[2024-06-02 22:56:50] [INFO ] Computed 2 invariants in 15 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 625 ms. (steps per millisecond=1600 ) properties (out of 2) seen :2
FORMULA CO4-PT-21-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CO4-PT-21-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 38289 ms.

BK_STOP 1717369012588

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

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