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

About the Execution of GreatSPN+red for StigmergyCommit-PT-10b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
9919.188 425438.00 528751.00 1477.30 TTFTTTFFFTFFFFTT 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.r399-tall-171690529900230.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 StigmergyCommit-PT-10b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r399-tall-171690529900230
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 416M
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 19 16:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 19 07:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 19:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 144K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 19 15:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 416M May 18 16:43 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME StigmergyCommit-PT-10b-ReachabilityCardinality-2024-00
FORMULA_NAME StigmergyCommit-PT-10b-ReachabilityCardinality-2024-01
FORMULA_NAME StigmergyCommit-PT-10b-ReachabilityCardinality-2024-02
FORMULA_NAME StigmergyCommit-PT-10b-ReachabilityCardinality-2024-03
FORMULA_NAME StigmergyCommit-PT-10b-ReachabilityCardinality-2024-04
FORMULA_NAME StigmergyCommit-PT-10b-ReachabilityCardinality-2024-05
FORMULA_NAME StigmergyCommit-PT-10b-ReachabilityCardinality-2024-06
FORMULA_NAME StigmergyCommit-PT-10b-ReachabilityCardinality-2024-07
FORMULA_NAME StigmergyCommit-PT-10b-ReachabilityCardinality-2024-08
FORMULA_NAME StigmergyCommit-PT-10b-ReachabilityCardinality-2023-09
FORMULA_NAME StigmergyCommit-PT-10b-ReachabilityCardinality-2023-10
FORMULA_NAME StigmergyCommit-PT-10b-ReachabilityCardinality-2024-11
FORMULA_NAME StigmergyCommit-PT-10b-ReachabilityCardinality-2024-12
FORMULA_NAME StigmergyCommit-PT-10b-ReachabilityCardinality-2023-13
FORMULA_NAME StigmergyCommit-PT-10b-ReachabilityCardinality-2024-14
FORMULA_NAME StigmergyCommit-PT-10b-ReachabilityCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1717003607583

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyCommit-PT-10b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-29 17:26:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-29 17:26:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 17:27:01] [INFO ] Load time of PNML (sax parser for PT used): 12814 ms
[2024-05-29 17:27:02] [INFO ] Transformed 3352 places.
[2024-05-29 17:27:03] [INFO ] Transformed 359880 transitions.
[2024-05-29 17:27:03] [INFO ] Found NUPN structural information;
[2024-05-29 17:27:03] [INFO ] Parsed PT model containing 3352 places and 359880 transitions and 7847007 arcs in 14530 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 28 ms.
Working with output stream class java.io.PrintStream
FORMULA StigmergyCommit-PT-10b-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-10b-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (199 resets) in 9129 ms. (4 steps per ms) remains 8/14 properties
FORMULA StigmergyCommit-PT-10b-ReachabilityCardinality-2023-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-10b-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-10b-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-10b-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-10b-ReachabilityCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-10b-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (20 resets) in 1001 ms. (39 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (20 resets) in 810 ms. (49 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (22 resets) in 1093 ms. (36 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (20 resets) in 715 ms. (55 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (19 resets) in 716 ms. (55 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (20 resets) in 807 ms. (49 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (20 resets) in 692 ms. (57 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (23 resets) in 736 ms. (54 steps per ms) remains 8/8 properties
// Phase 1: matrix 359880 rows 3352 cols
[2024-05-29 17:27:32] [INFO ] Computed 12 invariants in 20915 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 73/73 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 3260/3333 variables, 11/84 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3333 variables, 3260/3344 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3333 variables, 0/3344 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 19/3352 variables, 1/3345 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3352 variables, 19/3364 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3352 variables, 0/3364 constraints. Problems are: Problem set: 0 solved, 8 unsolved
SMT process timed out in 28639ms, After SMT, problems are : Problem set: 0 solved, 8 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 73 out of 3352 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3352/3352 places, 359880/359880 transitions.
Graph (trivial) has 3190 edges and 3352 vertex of which 205 / 3352 are part of one of the 29 SCC in 42 ms
Free SCC test removed 176 places
Drop transitions (Empty/Sink Transition effects.) removed 224 transitions
Reduce isomorphic transitions removed 224 transitions.
Graph (complete) has 6210 edges and 3176 vertex of which 3158 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.935 ms
Discarding 18 places :
Also discarding 9 output transitions
Drop transitions (Output transitions of discarded places.) removed 9 transitions
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2382 transitions
Trivial Post-agglo rules discarded 2382 transitions
Performed 2382 trivial Post agglomeration. Transition count delta: 2382
Iterating post reduction 0 with 2391 rules applied. Total rules applied 2393 place count 3158 transition count 357256
Reduce places removed 2382 places and 0 transitions.
Ensure Unique test removed 46 transitions
Reduce isomorphic transitions removed 46 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 1 with 2456 rules applied. Total rules applied 4849 place count 776 transition count 357182
Reduce places removed 28 places and 0 transitions.
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Iterating post reduction 2 with 84 rules applied. Total rules applied 4933 place count 748 transition count 357126
Reduce places removed 56 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 57 rules applied. Total rules applied 4990 place count 692 transition count 357125
Performed 116 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 116 Pre rules applied. Total rules applied 4990 place count 692 transition count 357009
Deduced a syphon composed of 116 places in 465 ms
Reduce places removed 116 places and 0 transitions.
Iterating global reduction 4 with 232 rules applied. Total rules applied 5222 place count 576 transition count 357009
Discarding 120 places :
Symmetric choice reduction at 4 with 120 rule applications. Total rules 5342 place count 456 transition count 356889
Iterating global reduction 4 with 120 rules applied. Total rules applied 5462 place count 456 transition count 356889
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 2 rules applied. Total rules applied 5464 place count 456 transition count 356887
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 5465 place count 455 transition count 356887
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 5465 place count 455 transition count 356886
Deduced a syphon composed of 1 places in 383 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 5467 place count 454 transition count 356886
Discarding 58 places :
Symmetric choice reduction at 6 with 58 rule applications. Total rules 5525 place count 396 transition count 12515
Iterating global reduction 6 with 58 rules applied. Total rules applied 5583 place count 396 transition count 12515
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 6 with 16 rules applied. Total rules applied 5599 place count 396 transition count 12499
Discarding 14 places :
Symmetric choice reduction at 7 with 14 rule applications. Total rules 5613 place count 382 transition count 12485
Iterating global reduction 7 with 14 rules applied. Total rules applied 5627 place count 382 transition count 12485
Discarding 13 places :
Symmetric choice reduction at 7 with 13 rule applications. Total rules 5640 place count 369 transition count 12472
Iterating global reduction 7 with 13 rules applied. Total rules applied 5653 place count 369 transition count 12472
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 7 with 11 rules applied. Total rules applied 5664 place count 369 transition count 12461
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Deduced a syphon composed of 37 places in 10 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 8 with 74 rules applied. Total rules applied 5738 place count 332 transition count 12424
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 5739 place count 332 transition count 12423
Discarding 11 places :
Symmetric choice reduction at 9 with 11 rule applications. Total rules 5750 place count 321 transition count 12412
Iterating global reduction 9 with 11 rules applied. Total rules applied 5761 place count 321 transition count 12412
Discarding 9 places :
Symmetric choice reduction at 9 with 9 rule applications. Total rules 5770 place count 312 transition count 12403
Iterating global reduction 9 with 9 rules applied. Total rules applied 5779 place count 312 transition count 12403
Discarding 8 places :
Symmetric choice reduction at 9 with 8 rule applications. Total rules 5787 place count 304 transition count 12395
Iterating global reduction 9 with 8 rules applied. Total rules applied 5795 place count 304 transition count 12395
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 4 places in 7 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 9 with 8 rules applied. Total rules applied 5803 place count 300 transition count 12403
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 9 with 3 rules applied. Total rules applied 5806 place count 300 transition count 12400
Free-agglomeration rule applied 84 times.
Iterating global reduction 9 with 84 rules applied. Total rules applied 5890 place count 300 transition count 12316
Reduce places removed 84 places and 0 transitions.
Iterating post reduction 9 with 84 rules applied. Total rules applied 5974 place count 216 transition count 12316
Renaming transitions due to excessive name length > 1024 char.
Discarding 11 places :
Symmetric choice reduction at 10 with 11 rule applications. Total rules 5985 place count 205 transition count 12305
Iterating global reduction 10 with 11 rules applied. Total rules applied 5996 place count 205 transition count 12305
Drop transitions (Redundant composition of simpler transitions.) removed 3080 transitions
Redundant transition composition rules discarded 3080 transitions
Iterating global reduction 10 with 3080 rules applied. Total rules applied 9076 place count 205 transition count 9225
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 10 with 4 rules applied. Total rules applied 9080 place count 203 transition count 9235
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 10 with 2 rules applied. Total rules applied 9082 place count 203 transition count 9233
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 9084 place count 201 transition count 9233
Partial Free-agglomeration rule applied 13 times.
Drop transitions (Partial Free agglomeration) removed 13 transitions
Iterating global reduction 11 with 13 rules applied. Total rules applied 9097 place count 201 transition count 9233
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 11 with 7 rules applied. Total rules applied 9104 place count 201 transition count 9226
Applied a total of 9104 rules in 253301 ms. Remains 201 /3352 variables (removed 3151) and now considering 9226/359880 (removed 350654) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 253316 ms. Remains : 201/3352 places, 9226/359880 transitions.
RANDOM walk for 40000 steps (777 resets) in 1971 ms. (20 steps per ms) remains 6/8 properties
FORMULA StigmergyCommit-PT-10b-ReachabilityCardinality-2023-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-10b-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (69 resets) in 210 ms. (189 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (69 resets) in 228 ms. (174 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (67 resets) in 225 ms. (177 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (69 resets) in 193 ms. (206 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (68 resets) in 138 ms. (287 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (71 resets) in 144 ms. (275 steps per ms) remains 6/6 properties
// Phase 1: matrix 9226 rows 201 cols
[2024-05-29 17:31:54] [INFO ] Computed 12 invariants in 60 ms
[2024-05-29 17:31:59] [INFO ] State equation strengthened by 8764 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 152/200 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/200 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 1/201 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/201 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 9226/9427 variables, 201/213 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/9427 variables, 8764/8977 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/9427 variables, 0/8977 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 0/9427 variables, 0/8977 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 9427/9427 variables, and 8977 constraints, problems are : Problem set: 0 solved, 6 unsolved in 24251 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 201/201 constraints, ReadFeed: 8764/8764 constraints, PredecessorRefiner: 6/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 152/200 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-29 17:32:27] [INFO ] Deduced a trap composed of 21 places in 3496 ms of which 15 ms to minimize.
[2024-05-29 17:32:31] [INFO ] Deduced a trap composed of 21 places in 3463 ms of which 3 ms to minimize.
[2024-05-29 17:32:34] [INFO ] Deduced a trap composed of 33 places in 3074 ms of which 1 ms to minimize.
[2024-05-29 17:32:37] [INFO ] Deduced a trap composed of 27 places in 2845 ms of which 1 ms to minimize.
[2024-05-29 17:32:40] [INFO ] Deduced a trap composed of 19 places in 3453 ms of which 1 ms to minimize.
[2024-05-29 17:32:44] [INFO ] Deduced a trap composed of 18 places in 3050 ms of which 1 ms to minimize.
[2024-05-29 17:32:47] [INFO ] Deduced a trap composed of 21 places in 2996 ms of which 1 ms to minimize.
[2024-05-29 17:32:49] [INFO ] Deduced a trap composed of 19 places in 2813 ms of which 4 ms to minimize.
[2024-05-29 17:32:52] [INFO ] Deduced a trap composed of 22 places in 2618 ms of which 2 ms to minimize.
[2024-05-29 17:32:55] [INFO ] Deduced a trap composed of 20 places in 2993 ms of which 13 ms to minimize.
[2024-05-29 17:32:58] [INFO ] Deduced a trap composed of 17 places in 2786 ms of which 1 ms to minimize.
[2024-05-29 17:33:01] [INFO ] Deduced a trap composed of 13 places in 3239 ms of which 2 ms to minimize.
[2024-05-29 17:33:04] [INFO ] Deduced a trap composed of 18 places in 2975 ms of which 2 ms to minimize.
[2024-05-29 17:33:07] [INFO ] Deduced a trap composed of 22 places in 2582 ms of which 1 ms to minimize.
[2024-05-29 17:33:10] [INFO ] Deduced a trap composed of 25 places in 3009 ms of which 1 ms to minimize.
SMT process timed out in 75505ms, After SMT, problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 48 out of 201 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 201/201 places, 9226/9226 transitions.
Graph (trivial) has 66 edges and 201 vertex of which 4 / 201 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 1071 edges and 199 vertex of which 198 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.16 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 21 rules applied. Total rules applied 23 place count 198 transition count 9201
Reduce places removed 20 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 22 rules applied. Total rules applied 45 place count 178 transition count 9199
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 47 place count 176 transition count 9199
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 47 place count 176 transition count 9198
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 49 place count 175 transition count 9198
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 3 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 65 place count 167 transition count 9190
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 66 place count 167 transition count 9189
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 70 place count 163 transition count 9185
Iterating global reduction 4 with 4 rules applied. Total rules applied 74 place count 163 transition count 9185
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 76 place count 163 transition count 9183
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 77 place count 162 transition count 9182
Iterating global reduction 5 with 1 rules applied. Total rules applied 78 place count 162 transition count 9182
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 79 place count 162 transition count 9181
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 81 place count 162 transition count 9179
Free-agglomeration rule applied 8 times.
Iterating global reduction 6 with 8 rules applied. Total rules applied 89 place count 162 transition count 9171
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 97 place count 154 transition count 9171
Drop transitions (Redundant composition of simpler transitions.) removed 2306 transitions
Redundant transition composition rules discarded 2306 transitions
Iterating global reduction 7 with 2306 rules applied. Total rules applied 2403 place count 154 transition count 6865
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 2406 place count 154 transition count 6865
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 2407 place count 154 transition count 6864
Applied a total of 2407 rules in 34481 ms. Remains 154 /201 variables (removed 47) and now considering 6864/9226 (removed 2362) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34481 ms. Remains : 154/201 places, 6864/9226 transitions.
[2024-05-29 17:33:44] [INFO ] Export to MCC of 6 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 5 ms.
[2024-05-29 17:33:44] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 154 places, 6864 transitions and 147524 arcs took 92 ms.
[2024-05-29 17:33:46] [INFO ] Flatten gal took : 1089 ms
Total runtime 417066 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running StigmergyCommit-PT-10b

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/416/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 154
TRANSITIONS: 6864
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.617s, Sys 0.029s]


SAVING FILE /home/mcc/execution/416/model (.net / .def) ...
EXPORT TIME: [User 0.051s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 671
MODEL NAME: /home/mcc/execution/416/model
154 places, 6864 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA StigmergyCommit-PT-10b-ReachabilityCardinality-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA StigmergyCommit-PT-10b-ReachabilityCardinality-2023-09 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA StigmergyCommit-PT-10b-ReachabilityCardinality-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA StigmergyCommit-PT-10b-ReachabilityCardinality-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA StigmergyCommit-PT-10b-ReachabilityCardinality-2023-10 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA StigmergyCommit-PT-10b-ReachabilityCardinality-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1717004033021

--------------------
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 ReachabilityCardinality -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="StigmergyCommit-PT-10b"
export BK_EXAMINATION="ReachabilityCardinality"
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 StigmergyCommit-PT-10b, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r399-tall-171690529900230"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/StigmergyCommit-PT-10b.tgz
mv StigmergyCommit-PT-10b execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;