fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r549-tall-171734897900141
Last Updated
July 7, 2024

About the Execution of GreatSPN+red for CO4-PT-18

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
520.747 32673.00 46637.00 110.20 1 1 1 1 1 1 1 1 1 1 0 0 1 1 0 0 normal

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.r549-tall-171734897900141.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 greatspnxred
Input is CO4-PT-18, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r549-tall-171734897900141
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 732K
-rw-r--r-- 1 mcc users 5.7K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K 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.0K 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 14K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 157K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K 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 239K 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-18-UpperBounds-00
FORMULA_NAME CO4-PT-18-UpperBounds-01
FORMULA_NAME CO4-PT-18-UpperBounds-02
FORMULA_NAME CO4-PT-18-UpperBounds-03
FORMULA_NAME CO4-PT-18-UpperBounds-04
FORMULA_NAME CO4-PT-18-UpperBounds-05
FORMULA_NAME CO4-PT-18-UpperBounds-06
FORMULA_NAME CO4-PT-18-UpperBounds-07
FORMULA_NAME CO4-PT-18-UpperBounds-08
FORMULA_NAME CO4-PT-18-UpperBounds-09
FORMULA_NAME CO4-PT-18-UpperBounds-10
FORMULA_NAME CO4-PT-18-UpperBounds-11
FORMULA_NAME CO4-PT-18-UpperBounds-12
FORMULA_NAME CO4-PT-18-UpperBounds-13
FORMULA_NAME CO4-PT-18-UpperBounds-14
FORMULA_NAME CO4-PT-18-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717361016984

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CO4-PT-18
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-06-02 20:43:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-02 20:43:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 20:43:38] [INFO ] Load time of PNML (sax parser for PT used): 106 ms
[2024-06-02 20:43:38] [INFO ] Transformed 979 places.
[2024-06-02 20:43:38] [INFO ] Transformed 1111 transitions.
[2024-06-02 20:43:38] [INFO ] Found NUPN structural information;
[2024-06-02 20:43:38] [INFO ] Parsed PT model containing 979 places and 1111 transitions and 2420 arcs in 212 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Deduced a syphon composed of 157 places in 13 ms
Reduce places removed 157 places and 177 transitions.
FORMULA CO4-PT-18-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-18-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-18-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-18-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 934 rows 822 cols
[2024-06-02 20:43:38] [INFO ] Computed 8 invariants in 25 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (27 resets) in 39 ms. (250 steps per ms)
FORMULA CO4-PT-18-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-18-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 100000 steps (229 resets) in 161 ms. (617 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-02 20:43:38] [INFO ] Invariant cache hit.
[2024-06-02 20:43:39] [INFO ] [Real]Absence check using 8 positive place invariants in 18 ms returned sat
[2024-06-02 20:43:39] [INFO ] [Real]Absence check using state equation in 262 ms returned sat
[2024-06-02 20:43:39] [INFO ] Computed and/alt/rep : 848/1016/848 causal constraints (skipped 85 transitions) in 70 ms.
[2024-06-02 20:43:39] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 20:43:39] [INFO ] [Nat]Absence check using 8 positive place invariants in 15 ms returned sat
[2024-06-02 20:43:40] [INFO ] [Nat]Absence check using state equation in 267 ms returned sat
[2024-06-02 20:43:40] [INFO ] Computed and/alt/rep : 848/1016/848 causal constraints (skipped 85 transitions) in 55 ms.
[2024-06-02 20:43:41] [INFO ] Added : 153 causal constraints over 31 iterations in 1596 ms. Result :sat
Minimization took 339 ms.
[2024-06-02 20:43:42] [INFO ] [Real]Absence check using 8 positive place invariants in 14 ms returned sat
[2024-06-02 20:43:42] [INFO ] [Real]Absence check using state equation in 269 ms returned sat
[2024-06-02 20:43:42] [INFO ] Computed and/alt/rep : 848/1016/848 causal constraints (skipped 85 transitions) in 49 ms.
[2024-06-02 20:43:42] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 20:43:42] [INFO ] [Nat]Absence check using 8 positive place invariants in 16 ms returned sat
[2024-06-02 20:43:43] [INFO ] [Nat]Absence check using state equation in 248 ms returned sat
[2024-06-02 20:43:43] [INFO ] Computed and/alt/rep : 848/1016/848 causal constraints (skipped 85 transitions) in 60 ms.
[2024-06-02 20:43:45] [INFO ] Added : 207 causal constraints over 42 iterations in 2048 ms. Result :sat
Minimization took 330 ms.
[2024-06-02 20:43:45] [INFO ] [Real]Absence check using 8 positive place invariants in 15 ms returned sat
[2024-06-02 20:43:45] [INFO ] [Real]Absence check using state equation in 251 ms returned sat
[2024-06-02 20:43:46] [INFO ] Computed and/alt/rep : 848/1016/848 causal constraints (skipped 85 transitions) in 53 ms.
[2024-06-02 20:43:46] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 20:43:46] [INFO ] [Nat]Absence check using 8 positive place invariants in 16 ms returned sat
[2024-06-02 20:43:46] [INFO ] [Nat]Absence check using state equation in 238 ms returned sat
[2024-06-02 20:43:46] [INFO ] Computed and/alt/rep : 848/1016/848 causal constraints (skipped 85 transitions) in 51 ms.
[2024-06-02 20:43:47] [INFO ] Added : 133 causal constraints over 27 iterations in 1321 ms. Result :sat
Minimization took 317 ms.
[2024-06-02 20:43:48] [INFO ] [Real]Absence check using 8 positive place invariants in 16 ms returned sat
[2024-06-02 20:43:48] [INFO ] [Real]Absence check using state equation in 229 ms returned sat
[2024-06-02 20:43:48] [INFO ] Computed and/alt/rep : 848/1016/848 causal constraints (skipped 85 transitions) in 49 ms.
[2024-06-02 20:43:48] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 20:43:49] [INFO ] [Nat]Absence check using 8 positive place invariants in 15 ms returned sat
[2024-06-02 20:43:49] [INFO ] [Nat]Absence check using state equation in 253 ms returned sat
[2024-06-02 20:43:49] [INFO ] Computed and/alt/rep : 848/1016/848 causal constraints (skipped 85 transitions) in 40 ms.
[2024-06-02 20:43:51] [INFO ] Added : 176 causal constraints over 36 iterations in 1680 ms. Result :sat
Minimization took 311 ms.
[2024-06-02 20:43:51] [INFO ] [Real]Absence check using 8 positive place invariants in 15 ms returned sat
[2024-06-02 20:43:51] [INFO ] [Real]Absence check using state equation in 246 ms returned sat
[2024-06-02 20:43:51] [INFO ] Computed and/alt/rep : 848/1016/848 causal constraints (skipped 85 transitions) in 40 ms.
[2024-06-02 20:43:51] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 20:43:52] [INFO ] [Nat]Absence check using 8 positive place invariants in 15 ms returned sat
[2024-06-02 20:43:52] [INFO ] [Nat]Absence check using state equation in 227 ms returned sat
[2024-06-02 20:43:52] [INFO ] Computed and/alt/rep : 848/1016/848 causal constraints (skipped 85 transitions) in 45 ms.
[2024-06-02 20:43:53] [INFO ] Added : 139 causal constraints over 28 iterations in 1326 ms. Result :sat
Minimization took 300 ms.
[2024-06-02 20:43:54] [INFO ] [Real]Absence check using 8 positive place invariants in 13 ms returned sat
[2024-06-02 20:43:54] [INFO ] [Real]Absence check using state equation in 249 ms returned sat
[2024-06-02 20:43:54] [INFO ] Computed and/alt/rep : 848/1016/848 causal constraints (skipped 85 transitions) in 47 ms.
[2024-06-02 20:43:54] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 20:43:54] [INFO ] [Nat]Absence check using 8 positive place invariants in 15 ms returned sat
[2024-06-02 20:43:54] [INFO ] [Nat]Absence check using state equation in 256 ms returned sat
[2024-06-02 20:43:55] [INFO ] Computed and/alt/rep : 848/1016/848 causal constraints (skipped 85 transitions) in 45 ms.
[2024-06-02 20:43:57] [INFO ] Added : 218 causal constraints over 44 iterations in 2048 ms. Result :sat
Minimization took 327 ms.
[2024-06-02 20:43:57] [INFO ] [Real]Absence check using 8 positive place invariants in 19 ms returned sat
[2024-06-02 20:43:57] [INFO ] [Real]Absence check using state equation in 225 ms returned sat
[2024-06-02 20:43:57] [INFO ] Deduced a trap composed of 22 places in 134 ms of which 24 ms to minimize.
[2024-06-02 20:43:58] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 20:43:58] [INFO ] [Nat]Absence check using 8 positive place invariants in 14 ms returned sat
[2024-06-02 20:43:58] [INFO ] [Nat]Absence check using state equation in 227 ms returned sat
[2024-06-02 20:43:58] [INFO ] Deduced a trap composed of 22 places in 113 ms of which 3 ms to minimize.
[2024-06-02 20:43:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 196 ms
[2024-06-02 20:43:58] [INFO ] Computed and/alt/rep : 848/1016/848 causal constraints (skipped 85 transitions) in 48 ms.
[2024-06-02 20:44:00] [INFO ] Added : 155 causal constraints over 31 iterations in 1437 ms. Result :sat
Minimization took 326 ms.
[2024-06-02 20:44:00] [INFO ] [Real]Absence check using 8 positive place invariants in 14 ms returned sat
[2024-06-02 20:44:00] [INFO ] [Real]Absence check using state equation in 270 ms returned sat
[2024-06-02 20:44:00] [INFO ] Computed and/alt/rep : 848/1016/848 causal constraints (skipped 85 transitions) in 46 ms.
[2024-06-02 20:44:01] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 20:44:01] [INFO ] [Nat]Absence check using 8 positive place invariants in 15 ms returned sat
[2024-06-02 20:44:01] [INFO ] [Nat]Absence check using state equation in 225 ms returned sat
[2024-06-02 20:44:01] [INFO ] Computed and/alt/rep : 848/1016/848 causal constraints (skipped 85 transitions) in 57 ms.
[2024-06-02 20:44:02] [INFO ] Added : 149 causal constraints over 30 iterations in 1393 ms. Result :sat
Minimization took 306 ms.
[2024-06-02 20:44:03] [INFO ] [Real]Absence check using 8 positive place invariants in 14 ms returned sat
[2024-06-02 20:44:03] [INFO ] [Real]Absence check using state equation in 248 ms returned sat
[2024-06-02 20:44:03] [INFO ] Computed and/alt/rep : 848/1016/848 causal constraints (skipped 85 transitions) in 47 ms.
[2024-06-02 20:44:03] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 20:44:03] [INFO ] [Nat]Absence check using 8 positive place invariants in 15 ms returned sat
[2024-06-02 20:44:04] [INFO ] [Nat]Absence check using state equation in 244 ms returned sat
[2024-06-02 20:44:04] [INFO ] Computed and/alt/rep : 848/1016/848 causal constraints (skipped 85 transitions) in 43 ms.
[2024-06-02 20:44:05] [INFO ] Added : 144 causal constraints over 29 iterations in 1358 ms. Result :sat
Minimization took 307 ms.
[2024-06-02 20:44:06] [INFO ] [Real]Absence check using 8 positive place invariants in 14 ms returned sat
[2024-06-02 20:44:06] [INFO ] [Real]Absence check using state equation in 235 ms returned sat
[2024-06-02 20:44:06] [INFO ] Computed and/alt/rep : 848/1016/848 causal constraints (skipped 85 transitions) in 44 ms.
[2024-06-02 20:44:06] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 20:44:06] [INFO ] [Nat]Absence check using 8 positive place invariants in 14 ms returned sat
[2024-06-02 20:44:06] [INFO ] [Nat]Absence check using state equation in 233 ms returned sat
[2024-06-02 20:44:06] [INFO ] Computed and/alt/rep : 848/1016/848 causal constraints (skipped 85 transitions) in 42 ms.
[2024-06-02 20:44:08] [INFO ] Added : 133 causal constraints over 27 iterations in 1283 ms. Result :sat
Minimization took 305 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
FORMULA CO4-PT-18-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-18-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-18-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-18-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-18-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-18-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-18-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CO4-PT-18-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 0] Max Struct:[1, 1]
Support contains 2 out of 822 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 822/822 places, 934/934 transitions.
Graph (trivial) has 840 edges and 822 vertex of which 3 / 822 are part of one of the 1 SCC in 6 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (complete) has 1118 edges and 820 vertex of which 778 are kept as prefixes of interest. Removing 42 places using SCC suffix rule.3 ms
Discarding 42 places :
Also discarding 23 output transitions
Drop transitions (Output transitions of discarded places.) removed 23 transitions
Drop transitions (Empty/Sink Transition effects.) removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 512 transitions
Trivial Post-agglo rules discarded 512 transitions
Performed 512 trivial Post agglomeration. Transition count delta: 512
Iterating post reduction 0 with 535 rules applied. Total rules applied 537 place count 778 transition count 373
Reduce places removed 512 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 524 rules applied. Total rules applied 1061 place count 266 transition count 361
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 13 rules applied. Total rules applied 1074 place count 260 transition count 354
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) 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 1078 place count 258 transition count 352
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) 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 1081 place count 257 transition count 350
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 5 with 4 rules applied. Total rules applied 1085 place count 256 transition count 347
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 1087 place count 254 transition count 347
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 1087 place count 254 transition count 346
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1089 place count 253 transition count 346
Discarding 38 places :
Symmetric choice reduction at 7 with 38 rule applications. Total rules 1127 place count 215 transition count 308
Iterating global reduction 7 with 38 rules applied. Total rules applied 1165 place count 215 transition count 308
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 13 Pre rules applied. Total rules applied 1165 place count 215 transition count 295
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 7 with 26 rules applied. Total rules applied 1191 place count 202 transition count 295
Discarding 23 places :
Symmetric choice reduction at 7 with 23 rule applications. Total rules 1214 place count 179 transition count 272
Iterating global reduction 7 with 23 rules applied. Total rules applied 1237 place count 179 transition count 272
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 5 rules applied. Total rules applied 1242 place count 179 transition count 267
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1243 place count 178 transition count 267
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 1245 place count 176 transition count 264
Iterating global reduction 9 with 2 rules applied. Total rules applied 1247 place count 176 transition count 264
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 1249 place count 176 transition count 262
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 10 with 150 rules applied. Total rules applied 1399 place count 101 transition count 177
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 10 with 6 rules applied. Total rules applied 1405 place count 101 transition count 171
Discarding 3 places :
Symmetric choice reduction at 11 with 3 rule applications. Total rules 1408 place count 98 transition count 168
Iterating global reduction 11 with 3 rules applied. Total rules applied 1411 place count 98 transition count 168
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 1412 place count 98 transition count 167
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 12 with 4 rules applied. Total rules applied 1416 place count 96 transition count 165
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 12 with 2 rules applied. Total rules applied 1418 place count 96 transition count 163
Discarding 2 places :
Symmetric choice reduction at 13 with 2 rule applications. Total rules 1420 place count 94 transition count 161
Iterating global reduction 13 with 2 rules applied. Total rules applied 1422 place count 94 transition count 161
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 1423 place count 94 transition count 160
Discarding 1 places :
Symmetric choice reduction at 14 with 1 rule applications. Total rules 1424 place count 93 transition count 159
Iterating global reduction 14 with 1 rules applied. Total rules applied 1425 place count 93 transition count 159
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 1426 place count 93 transition count 158
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 15 with 58 rules applied. Total rules applied 1484 place count 64 transition count 160
Drop transitions (Empty/Sink Transition effects.) removed 17 transitions
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 37 transitions.
Iterating post reduction 15 with 37 rules applied. Total rules applied 1521 place count 64 transition count 123
Discarding 26 places :
Symmetric choice reduction at 16 with 26 rule applications. Total rules 1547 place count 38 transition count 86
Iterating global reduction 16 with 26 rules applied. Total rules applied 1573 place count 38 transition count 86
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 16 with 20 rules applied. Total rules applied 1593 place count 38 transition count 66
Discarding 3 places :
Symmetric choice reduction at 17 with 3 rule applications. Total rules 1596 place count 35 transition count 58
Iterating global reduction 17 with 3 rules applied. Total rules applied 1599 place count 35 transition count 58
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 17 with 3 rules applied. Total rules applied 1602 place count 35 transition count 55
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 18 with 2 rules applied. Total rules applied 1604 place count 34 transition count 63
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 18 with 3 rules applied. Total rules applied 1607 place count 34 transition count 60
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 19 with 4 rules applied. Total rules applied 1611 place count 34 transition count 56
Discarding 1 places :
Symmetric choice reduction at 19 with 1 rule applications. Total rules 1612 place count 33 transition count 55
Iterating global reduction 19 with 1 rules applied. Total rules applied 1613 place count 33 transition count 55
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 19 with 1 rules applied. Total rules applied 1614 place count 33 transition count 54
Free-agglomeration rule applied 5 times.
Iterating global reduction 20 with 5 rules applied. Total rules applied 1619 place count 33 transition count 49
Reduce places removed 5 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 20 with 7 rules applied. Total rules applied 1626 place count 28 transition count 47
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 21 with 2 rules applied. Total rules applied 1628 place count 28 transition count 47
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 79 edges and 28 vertex of which 27 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 21 with 2 rules applied. Total rules applied 1630 place count 27 transition count 46
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 22 with 1 rules applied. Total rules applied 1631 place count 27 transition count 45
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 23 with 1 rules applied. Total rules applied 1632 place count 27 transition count 45
Graph (complete) has 76 edges and 27 vertex of which 26 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 23 with 1 rules applied. Total rules applied 1633 place count 26 transition count 45
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 24 with 1 rules applied. Total rules applied 1634 place count 26 transition count 44
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 25 with 1 rules applied. Total rules applied 1635 place count 26 transition count 44
Graph (complete) has 73 edges and 26 vertex of which 25 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 25 with 1 rules applied. Total rules applied 1636 place count 25 transition count 44
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 26 with 1 rules applied. Total rules applied 1637 place count 25 transition count 43
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 27 with 1 rules applied. Total rules applied 1638 place count 24 transition count 42
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t154.t155.t973 and 1 places that fell out of Prefix Of Interest.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 16 edges and 20 vertex of which 3 / 20 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 27 with 3 rules applied. Total rules applied 1641 place count 18 transition count 40
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t62.t63.t64.t955.t298.t299.t300.t1068.t37.t317 and 1 places that fell out of Prefix Of Interest.
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (trivial) has 13 edges and 16 vertex of which 3 / 16 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 28 with 9 rules applied. Total rules applied 1650 place count 14 transition count 32
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 13 transitions.
Graph (complete) has 24 edges and 13 vertex of which 12 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 29 with 15 rules applied. Total rules applied 1665 place count 12 transition count 19
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 30 with 1 rules applied. Total rules applied 1666 place count 12 transition count 18
Discarding 1 places :
Symmetric choice reduction at 31 with 1 rule applications. Total rules 1667 place count 11 transition count 17
Iterating global reduction 31 with 1 rules applied. Total rules applied 1668 place count 11 transition count 17
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 31 with 1 rules applied. Total rules applied 1669 place count 11 transition count 16
Discarding 1 places :
Symmetric choice reduction at 32 with 1 rule applications. Total rules 1670 place count 10 transition count 15
Iterating global reduction 32 with 1 rules applied. Total rules applied 1671 place count 10 transition count 15
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 32 with 1 rules applied. Total rules applied 1672 place count 10 transition count 14
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 33 with 1 rules applied. Total rules applied 1673 place count 10 transition count 13
Free-agglomeration rule applied 3 times.
Iterating global reduction 33 with 3 rules applied. Total rules applied 1676 place count 10 transition count 10
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 33 with 3 rules applied. Total rules applied 1679 place count 7 transition count 10
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 34 with 1 rules applied. Total rules applied 1680 place count 7 transition count 9
Free-agglomeration rule applied 1 times.
Iterating global reduction 34 with 1 rules applied. Total rules applied 1681 place count 7 transition count 8
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 34 with 2 rules applied. Total rules applied 1683 place count 6 transition count 7
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 35 with 1 rules applied. Total rules applied 1684 place count 6 transition count 7
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 35 with 1 rules applied. Total rules applied 1685 place count 6 transition count 6
Applied a total of 1685 rules in 160 ms. Remains 6 /822 variables (removed 816) and now considering 6/934 (removed 928) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 169 ms. Remains : 6/822 places, 6/934 transitions.
// Phase 1: matrix 6 rows 6 cols
[2024-06-02 20:44:08] [INFO ] Computed 2 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1, 0] Max Struct:[1, 1]
FORMULA CO4-PT-18-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (2 resets) in 433 ms. (2304 steps per ms)
FORMULA CO4-PT-18-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000000 steps (2 resets) in 215 ms. (4629 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 31466 ms.
ITS solved all properties within timeout

BK_STOP 1717361049657

--------------------
content from stderr:

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML

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-18"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is CO4-PT-18, 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 r549-tall-171734897900141"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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