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

About the Execution of LTSMin+red for StigmergyElection-PT-09b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
2994.436 251343.00 508192.00 729.40 F 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.r538-tall-171690547800233.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 ltsminxred
Input is StigmergyElection-PT-09b, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r538-tall-171690547800233
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 38M
-rw-r--r-- 1 mcc users 8.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 93K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 19 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 16:44 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:25 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 11 18:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 165K Apr 11 18:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Apr 11 18:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 36K Apr 11 18:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 08:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 08:00 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 37M 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

FORMULA_NAME StableMarking

=== Now, execution of the tool begins

BK_START 1717229244388

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=StigmergyElection-PT-09b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 08:07:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2024-06-01 08:07:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 08:07:27] [INFO ] Load time of PNML (sax parser for PT used): 1577 ms
[2024-06-01 08:07:27] [INFO ] Transformed 1243 places.
[2024-06-01 08:07:27] [INFO ] Transformed 41210 transitions.
[2024-06-01 08:07:27] [INFO ] Found NUPN structural information;
[2024-06-01 08:07:27] [INFO ] Parsed PT model containing 1243 places and 41210 transitions and 720585 arcs in 1938 ms.
Graph (trivial) has 1269 edges and 1243 vertex of which 189 / 1243 are part of one of the 27 SCC in 12 ms
Free SCC test removed 162 places
Structural test allowed to assert that 797 places are NOT stable. Took 120 ms.
Ensure Unique test removed 180 transitions
Reduce redundant transitions removed 180 transitions.
RANDOM walk for 40000 steps (258 resets) in 3379 ms. (11 steps per ms) remains 446/446 properties
BEST_FIRST walk for 404 steps (8 resets) in 24 ms. (16 steps per ms) remains 446/446 properties
BEST_FIRST walk for 403 steps (8 resets) in 15 ms. (25 steps per ms) remains 446/446 properties
BEST_FIRST walk for 404 steps (8 resets) in 16 ms. (23 steps per ms) remains 446/446 properties
BEST_FIRST walk for 404 steps (8 resets) in 37 ms. (10 steps per ms) remains 446/446 properties
BEST_FIRST walk for 404 steps (8 resets) in 22 ms. (17 steps per ms) remains 446/446 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 446/446 properties
BEST_FIRST walk for 403 steps (8 resets) in 16 ms. (23 steps per ms) remains 446/446 properties
BEST_FIRST walk for 402 steps (8 resets) in 14 ms. (26 steps per ms) remains 446/446 properties
BEST_FIRST walk for 403 steps (8 resets) in 20 ms. (19 steps per ms) remains 446/446 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 446/446 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 446/446 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 446/446 properties
BEST_FIRST walk for 403 steps (8 resets) in 18 ms. (21 steps per ms) remains 446/446 properties
BEST_FIRST walk for 404 steps (8 resets) in 13 ms. (28 steps per ms) remains 446/446 properties
BEST_FIRST walk for 403 steps (8 resets) in 13 ms. (28 steps per ms) remains 446/446 properties
BEST_FIRST walk for 403 steps (8 resets) in 14 ms. (26 steps per ms) remains 446/446 properties
BEST_FIRST walk for 403 steps (8 resets) in 11 ms. (33 steps per ms) remains 446/446 properties
BEST_FIRST walk for 403 steps (8 resets) in 11 ms. (33 steps per ms) remains 446/446 properties
BEST_FIRST walk for 403 steps (8 resets) in 10 ms. (36 steps per ms) remains 446/446 properties
BEST_FIRST walk for 404 steps (8 resets) in 14 ms. (26 steps per ms) remains 446/446 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 446/446 properties
BEST_FIRST walk for 403 steps (8 resets) in 11 ms. (33 steps per ms) remains 446/446 properties
BEST_FIRST walk for 404 steps (8 resets) in 13 ms. (28 steps per ms) remains 446/446 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 446/446 properties
BEST_FIRST walk for 404 steps (8 resets) in 13 ms. (28 steps per ms) remains 446/446 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 446/446 properties
BEST_FIRST walk for 401 steps (8 resets) in 14 ms. (26 steps per ms) remains 446/446 properties
BEST_FIRST walk for 402 steps (8 resets) in 10 ms. (36 steps per ms) remains 446/446 properties
BEST_FIRST walk for 402 steps (8 resets) in 12 ms. (30 steps per ms) remains 446/446 properties
BEST_FIRST walk for 403 steps (8 resets) in 10 ms. (36 steps per ms) remains 446/446 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 446/446 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 446/446 properties
BEST_FIRST walk for 402 steps (8 resets) in 13 ms. (28 steps per ms) remains 446/446 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 446/446 properties
BEST_FIRST walk for 403 steps (8 resets) in 11 ms. (33 steps per ms) remains 446/446 properties
BEST_FIRST walk for 403 steps (8 resets) in 11 ms. (33 steps per ms) remains 446/446 properties
BEST_FIRST walk for 403 steps (8 resets) in 11 ms. (33 steps per ms) remains 446/446 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 446/446 properties
BEST_FIRST walk for 403 steps (8 resets) in 10 ms. (36 steps per ms) remains 446/446 properties
BEST_FIRST walk for 403 steps (8 resets) in 12 ms. (31 steps per ms) remains 446/446 properties
BEST_FIRST walk for 403 steps (8 resets) in 11 ms. (33 steps per ms) remains 446/446 properties
BEST_FIRST walk for 403 steps (8 resets) in 10 ms. (36 steps per ms) remains 446/446 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 446/446 properties
BEST_FIRST walk for 403 steps (8 resets) in 10 ms. (36 steps per ms) remains 446/446 properties
BEST_FIRST walk for 403 steps (8 resets) in 10 ms. (36 steps per ms) remains 446/446 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 446/446 properties
BEST_FIRST walk for 403 steps (8 resets) in 10 ms. (36 steps per ms) remains 446/446 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 446/446 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 446/446 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 446/446 properties
Interrupted probabilistic random walk after 26247 steps, run timeout after 3001 ms. (steps per millisecond=8 ) properties seen :77 out of 446
Probabilistic random walk after 26247 steps, saw 9604 distinct states, run finished after 3006 ms. (steps per millisecond=8 ) properties seen :77
[2024-06-01 08:07:32] [INFO ] Flow matrix only has 41004 transitions (discarded 26 similar events)
// Phase 1: matrix 41004 rows 1081 cols
[2024-06-01 08:07:33] [INFO ] Computed 10 invariants in 752 ms
[2024-06-01 08:07:33] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/369 variables, 369/369 constraints. Problems are: Problem set: 0 solved, 369 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 369/42085 variables, and 369 constraints, problems are : Problem set: 0 solved, 369 unsolved in 5062 ms.
Refiners :[Domain max(s): 369/1081 constraints, Positive P Invariants (semi-flows): 0/10 constraints, State Equation: 0/1081 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 369/325 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 369 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/369 variables, 369/369 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/369 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 2 (OVERLAPS) 712/1081 variables, 10/379 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1081 variables, 712/1091 constraints. Problems are: Problem set: 0 solved, 369 unsolved
[2024-06-01 08:08:09] [INFO ] Deduced a trap composed of 178 places in 24934 ms of which 67 ms to minimize.
SMT process timed out in 36844ms, After SMT, problems are : Problem set: 0 solved, 369 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 369 out of 1081 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1081/1081 places, 41030/41030 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 533 transitions
Trivial Post-agglo rules discarded 533 transitions
Performed 533 trivial Post agglomeration. Transition count delta: 533
Iterating post reduction 0 with 560 rules applied. Total rules applied 560 place count 1081 transition count 40470
Reduce places removed 533 places and 0 transitions.
Iterating post reduction 1 with 533 rules applied. Total rules applied 1093 place count 548 transition count 40470
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 1093 place count 548 transition count 40452
Deduced a syphon composed of 18 places in 25 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 1129 place count 530 transition count 40452
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 1132 place count 527 transition count 40449
Iterating global reduction 2 with 3 rules applied. Total rules applied 1135 place count 527 transition count 40449
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 15 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 1175 place count 507 transition count 40429
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 21 places in 17 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 1217 place count 486 transition count 40446
Free-agglomeration rule applied 70 times.
Iterating global reduction 2 with 70 rules applied. Total rules applied 1287 place count 486 transition count 40376
Reduce places removed 70 places and 0 transitions.
Iterating post reduction 2 with 70 rules applied. Total rules applied 1357 place count 416 transition count 40376
Applied a total of 1357 rules in 16290 ms. Remains 416 /1081 variables (removed 665) and now considering 40376/41030 (removed 654) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16311 ms. Remains : 416/1081 places, 40376/41030 transitions.
RANDOM walk for 9262 steps (8 resets) in 121030 ms. (0 steps per ms) remains 26/369 properties
BEST_FIRST walk for 400004 steps (8 resets) in 6499 ms. (61 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (8 resets) in 4733 ms. (84 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (8 resets) in 4742 ms. (84 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (8 resets) in 4672 ms. (85 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (8 resets) in 7904 ms. (50 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (8 resets) in 9134 ms. (43 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (8 resets) in 9241 ms. (43 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (8 resets) in 9484 ms. (42 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (8 resets) in 9304 ms. (42 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (8 resets) in 9483 ms. (42 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (8 resets) in 8025 ms. (49 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (8 resets) in 9277 ms. (43 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (8 resets) in 6248 ms. (64 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (8 resets) in 5848 ms. (68 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (8 resets) in 5746 ms. (69 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (8 resets) in 4797 ms. (83 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (8 resets) in 5194 ms. (76 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (8 resets) in 5425 ms. (73 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (8 resets) in 5927 ms. (67 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (8 resets) in 5270 ms. (75 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (8 resets) in 6034 ms. (66 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (8 resets) in 5860 ms. (68 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (8 resets) in 5280 ms. (75 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (8 resets) in 5613 ms. (71 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (8 resets) in 4676 ms. (85 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (8 resets) in 4684 ms. (85 steps per ms) remains 26/26 properties
[2024-06-01 08:09:41] [INFO ] Flow matrix only has 40375 transitions (discarded 1 similar events)
// Phase 1: matrix 40375 rows 416 cols
[2024-06-01 08:09:42] [INFO ] Computed 10 invariants in 392 ms
[2024-06-01 08:09:43] [INFO ] State equation strengthened by 6614 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (OVERLAPS) 66/92 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 3 (OVERLAPS) 324/416 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/416 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 5 (OVERLAPS) 40375/40791 variables, 416/426 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/40791 variables, 6614/7040 constraints. Problems are: Problem set: 0 solved, 26 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 40791/40791 variables, and 7040 constraints, problems are : Problem set: 0 solved, 26 unsolved in 45103 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 416/416 constraints, ReadFeed: 6614/6614 constraints, PredecessorRefiner: 26/26 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 26 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (OVERLAPS) 66/92 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 3 (OVERLAPS) 324/416 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 26 unsolved
[2024-06-01 08:10:52] [INFO ] Deduced a trap composed of 48 places in 20586 ms of which 12 ms to minimize.
[2024-06-01 08:11:13] [INFO ] Deduced a trap composed of 48 places in 20873 ms of which 12 ms to minimize.
[2024-06-01 08:11:33] [INFO ] Deduced a trap composed of 48 places in 20254 ms of which 7 ms to minimize.
SMT process timed out in 111814ms, After SMT, problems are : Problem set: 0 solved, 26 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 26 out of 416 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 416/416 places, 40376/40376 transitions.
Graph (complete) has 1170 edges and 416 vertex of which 398 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.75 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 213 transitions
Trivial Post-agglo rules discarded 213 transitions
Performed 213 trivial Post agglomeration. Transition count delta: 213
Iterating post reduction 0 with 222 rules applied. Total rules applied 223 place count 398 transition count 40145
Reduce places removed 213 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 231 rules applied. Total rules applied 454 place count 185 transition count 40127
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 463 place count 176 transition count 40127
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 16 Pre rules applied. Total rules applied 463 place count 176 transition count 40111
Deduced a syphon composed of 16 places in 11 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 495 place count 160 transition count 40111
Discarding 68 places :
Symmetric choice reduction at 3 with 68 rule applications. Total rules 563 place count 92 transition count 40043
Iterating global reduction 3 with 68 rules applied. Total rules applied 631 place count 92 transition count 40043
Ensure Unique test removed 38088 transitions
Reduce isomorphic transitions removed 38088 transitions.
Iterating post reduction 3 with 38088 rules applied. Total rules applied 38719 place count 92 transition count 1955
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 38722 place count 89 transition count 1952
Iterating global reduction 4 with 3 rules applied. Total rules applied 38725 place count 89 transition count 1952
Performed 10 Post agglomeration using F-continuation condition with reduction of 264 identical transitions.
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 38745 place count 79 transition count 1678
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 46 transitions
Reduce isomorphic transitions removed 47 transitions.
Iterating post reduction 4 with 47 rules applied. Total rules applied 38792 place count 79 transition count 1631
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 38800 place count 71 transition count 1623
Iterating global reduction 5 with 8 rules applied. Total rules applied 38808 place count 71 transition count 1623
Ensure Unique test removed 127 transitions
Reduce isomorphic transitions removed 127 transitions.
Iterating post reduction 5 with 127 rules applied. Total rules applied 38935 place count 71 transition count 1496
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 6 with 18 rules applied. Total rules applied 38953 place count 62 transition count 1487
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 6 with 9 rules applied. Total rules applied 38962 place count 62 transition count 1478
Discarding 9 places :
Symmetric choice reduction at 7 with 9 rule applications. Total rules 38971 place count 53 transition count 1469
Iterating global reduction 7 with 9 rules applied. Total rules applied 38980 place count 53 transition count 1469
Ensure Unique test removed 511 transitions
Reduce isomorphic transitions removed 511 transitions.
Iterating post reduction 7 with 511 rules applied. Total rules applied 39491 place count 53 transition count 958
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 8 with 13 rules applied. Total rules applied 39504 place count 53 transition count 945
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 8 with 10 rules applied. Total rules applied 39514 place count 48 transition count 940
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 8 with 7 rules applied. Total rules applied 39521 place count 48 transition count 933
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 39522 place count 47 transition count 932
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 39523 place count 46 transition count 932
Performed 9 Post agglomeration using F-continuation condition with reduction of 862 identical transitions.
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 9 with 25 rules applied. Total rules applied 39548 place count 30 transition count 61
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 9 with 30 rules applied. Total rules applied 39578 place count 30 transition count 31
Applied a total of 39578 rules in 1972 ms. Remains 30 /416 variables (removed 386) and now considering 31/40376 (removed 40345) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1972 ms. Remains : 30/416 places, 31/40376 transitions.
RANDOM walk for 182 steps (0 resets) in 26 ms. (6 steps per ms) remains 0/26 properties
Able to resolve query StableMarking after proving 448 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PROBABILISTIC_WALK MARKED_SUFFIX_TEST TRIVIAL_UNMARKED_SCC_TEST TOPOLOGICAL
Total runtime 250076 ms.
ITS solved all properties within timeout

BK_STOP 1717229495731

--------------------
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 StableMarking -timeout 180 -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="StigmergyElection-PT-09b"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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 ltsminxred"
echo " Input is StigmergyElection-PT-09b, examination is StableMarking"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r538-tall-171690547800233"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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