fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r113-smll-171624274400175
Last Updated
July 7, 2024

About the Execution of GreatSPN+red for DLCround-PT-06b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
516.632 13822.00 29595.00 215.30 FTTTFFTTTTTTTTTT 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.r113-smll-171624274400175.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 DLCround-PT-06b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r113-smll-171624274400175
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 7.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:38 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:38 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:38 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.5K Apr 13 13:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 72K Apr 13 13:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Apr 13 13:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 41K Apr 13 13:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:38 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:38 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 813K May 18 16:42 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 DLCround-PT-06b-ReachabilityFireability-2024-00
FORMULA_NAME DLCround-PT-06b-ReachabilityFireability-2024-01
FORMULA_NAME DLCround-PT-06b-ReachabilityFireability-2024-02
FORMULA_NAME DLCround-PT-06b-ReachabilityFireability-2024-03
FORMULA_NAME DLCround-PT-06b-ReachabilityFireability-2024-04
FORMULA_NAME DLCround-PT-06b-ReachabilityFireability-2024-05
FORMULA_NAME DLCround-PT-06b-ReachabilityFireability-2024-06
FORMULA_NAME DLCround-PT-06b-ReachabilityFireability-2024-07
FORMULA_NAME DLCround-PT-06b-ReachabilityFireability-2024-08
FORMULA_NAME DLCround-PT-06b-ReachabilityFireability-2024-09
FORMULA_NAME DLCround-PT-06b-ReachabilityFireability-2024-10
FORMULA_NAME DLCround-PT-06b-ReachabilityFireability-2024-11
FORMULA_NAME DLCround-PT-06b-ReachabilityFireability-2024-12
FORMULA_NAME DLCround-PT-06b-ReachabilityFireability-2024-13
FORMULA_NAME DLCround-PT-06b-ReachabilityFireability-2024-14
FORMULA_NAME DLCround-PT-06b-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716362932290

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DLCround-PT-06b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 07:28:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-22 07:28:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 07:28:54] [INFO ] Load time of PNML (sax parser for PT used): 496 ms
[2024-05-22 07:28:54] [INFO ] Transformed 2340 places.
[2024-05-22 07:28:54] [INFO ] Transformed 3456 transitions.
[2024-05-22 07:28:54] [INFO ] Found NUPN structural information;
[2024-05-22 07:28:54] [INFO ] Parsed PT model containing 2340 places and 3456 transitions and 9288 arcs in 854 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 23 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (8 resets) in 1578 ms. (25 steps per ms) remains 4/16 properties
FORMULA DLCround-PT-06b-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-06b-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-06b-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-06b-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-06b-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-06b-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-06b-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-06b-ReachabilityFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-06b-ReachabilityFireability-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-06b-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-06b-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-06b-ReachabilityFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 138 ms. (287 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 246 ms. (161 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 87 ms. (454 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 341 ms. (116 steps per ms) remains 4/4 properties
// Phase 1: matrix 3456 rows 2340 cols
[2024-05-22 07:28:56] [INFO ] Computed 109 invariants in 61 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 51/51 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 1996/2047 variables, 100/151 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2047 variables, 1996/2147 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2047 variables, 0/2147 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 293/2340 variables, 9/2156 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2340 variables, 293/2449 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2340 variables, 0/2449 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 3456/5796 variables, 2340/4789 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/5796 variables, 0/4789 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 0/5796 variables, 0/4789 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5796/5796 variables, and 4789 constraints, problems are : Problem set: 0 solved, 4 unsolved in 3728 ms.
Refiners :[Domain max(s): 2340/2340 constraints, Positive P Invariants (semi-flows): 109/109 constraints, State Equation: 2340/2340 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 51/51 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 1996/2047 variables, 100/151 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2047 variables, 1996/2147 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2047 variables, 0/2147 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 293/2340 variables, 9/2156 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2340 variables, 293/2449 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2340 variables, 0/2449 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 3456/5796 variables, 2340/4789 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/5796 variables, 4/4793 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/5796 variables, 0/4793 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-22 07:29:04] [INFO ] Deduced a trap composed of 149 places in 457 ms of which 59 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 5796/5796 variables, and 4794 constraints, problems are : Problem set: 0 solved, 4 unsolved in 5010 ms.
Refiners :[Domain max(s): 2340/2340 constraints, Positive P Invariants (semi-flows): 109/109 constraints, State Equation: 2340/2340 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints]
After SMT, in 8975ms problems are : Problem set: 0 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 51 out of 2340 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2340/2340 places, 3456/3456 transitions.
Graph (trivial) has 2122 edges and 2340 vertex of which 397 / 2340 are part of one of the 32 SCC in 12 ms
Free SCC test removed 365 places
Drop transitions (Empty/Sink Transition effects.) removed 411 transitions
Reduce isomorphic transitions removed 411 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 861 transitions
Trivial Post-agglo rules discarded 861 transitions
Performed 861 trivial Post agglomeration. Transition count delta: 861
Iterating post reduction 0 with 861 rules applied. Total rules applied 862 place count 1975 transition count 2184
Reduce places removed 861 places and 0 transitions.
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 1 with 917 rules applied. Total rules applied 1779 place count 1114 transition count 2128
Reduce places removed 25 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 2 with 33 rules applied. Total rules applied 1812 place count 1089 transition count 2120
Reduce places removed 4 places and 0 transitions.
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Iterating post reduction 3 with 20 rules applied. Total rules applied 1832 place count 1085 transition count 2104
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 4 with 16 rules applied. Total rules applied 1848 place count 1069 transition count 2104
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 21 Pre rules applied. Total rules applied 1848 place count 1069 transition count 2083
Deduced a syphon composed of 21 places in 8 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 5 with 42 rules applied. Total rules applied 1890 place count 1048 transition count 2083
Discarding 277 places :
Symmetric choice reduction at 5 with 277 rule applications. Total rules 2167 place count 771 transition count 1806
Iterating global reduction 5 with 277 rules applied. Total rules applied 2444 place count 771 transition count 1806
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 2446 place count 771 transition count 1804
Performed 109 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 109 Pre rules applied. Total rules applied 2446 place count 771 transition count 1695
Deduced a syphon composed of 109 places in 8 ms
Reduce places removed 109 places and 0 transitions.
Iterating global reduction 6 with 218 rules applied. Total rules applied 2664 place count 662 transition count 1695
Discarding 40 places :
Symmetric choice reduction at 6 with 40 rule applications. Total rules 2704 place count 622 transition count 1319
Iterating global reduction 6 with 40 rules applied. Total rules applied 2744 place count 622 transition count 1319
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 6 with 14 rules applied. Total rules applied 2758 place count 622 transition count 1305
Performed 151 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 151 places in 1 ms
Reduce places removed 151 places and 0 transitions.
Iterating global reduction 7 with 302 rules applied. Total rules applied 3060 place count 471 transition count 1151
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 3062 place count 471 transition count 1149
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 3064 place count 469 transition count 1129
Iterating global reduction 8 with 2 rules applied. Total rules applied 3066 place count 469 transition count 1129
Performed 51 Post agglomeration using F-continuation condition with reduction of 21 identical transitions.
Deduced a syphon composed of 51 places in 1 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 8 with 102 rules applied. Total rules applied 3168 place count 418 transition count 1561
Drop transitions (Empty/Sink Transition effects.) removed 53 transitions
Reduce isomorphic transitions removed 53 transitions.
Iterating post reduction 8 with 53 rules applied. Total rules applied 3221 place count 418 transition count 1508
Discarding 11 places :
Symmetric choice reduction at 9 with 11 rule applications. Total rules 3232 place count 407 transition count 1291
Iterating global reduction 9 with 11 rules applied. Total rules applied 3243 place count 407 transition count 1291
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 9 with 25 rules applied. Total rules applied 3268 place count 407 transition count 1266
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -25
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 10 with 4 rules applied. Total rules applied 3272 place count 405 transition count 1291
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 3276 place count 405 transition count 1287
Drop transitions (Redundant composition of simpler transitions.) removed 110 transitions
Redundant transition composition rules discarded 110 transitions
Iterating global reduction 11 with 110 rules applied. Total rules applied 3386 place count 405 transition count 1177
Discarding 6 places :
Symmetric choice reduction at 11 with 6 rule applications. Total rules 3392 place count 399 transition count 1105
Iterating global reduction 11 with 6 rules applied. Total rules applied 3398 place count 399 transition count 1105
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 11 with 7 rules applied. Total rules applied 3405 place count 399 transition count 1098
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 12 with 6 rules applied. Total rules applied 3411 place count 396 transition count 1128
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 12 with 4 rules applied. Total rules applied 3415 place count 396 transition count 1124
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 13 with 12 rules applied. Total rules applied 3427 place count 396 transition count 1112
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 3429 place count 395 transition count 1122
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 3430 place count 395 transition count 1121
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 14 with 2 rules applied. Total rules applied 3432 place count 395 transition count 1119
Free-agglomeration rule applied 164 times with reduction of 82 identical transitions.
Iterating global reduction 14 with 164 rules applied. Total rules applied 3596 place count 395 transition count 873
Reduce places removed 164 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 203 transitions
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 213 transitions.
Graph (complete) has 796 edges and 231 vertex of which 228 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Iterating post reduction 14 with 378 rules applied. Total rules applied 3974 place count 228 transition count 660
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 15 with 2 rules applied. Total rules applied 3976 place count 228 transition count 658
Discarding 15 places :
Symmetric choice reduction at 16 with 15 rule applications. Total rules 3991 place count 213 transition count 624
Iterating global reduction 16 with 15 rules applied. Total rules applied 4006 place count 213 transition count 624
Drop transitions (Redundant composition of simpler transitions.) removed 69 transitions
Redundant transition composition rules discarded 69 transitions
Iterating global reduction 16 with 69 rules applied. Total rules applied 4075 place count 213 transition count 555
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 698 edges and 212 vertex of which 204 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 8 output transitions
Drop transitions (Output transitions of discarded places.) removed 8 transitions
Iterating post reduction 16 with 2 rules applied. Total rules applied 4077 place count 204 transition count 547
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 17 with 22 rules applied. Total rules applied 4099 place count 204 transition count 525
Discarding 6 places :
Symmetric choice reduction at 18 with 6 rule applications. Total rules 4105 place count 198 transition count 510
Iterating global reduction 18 with 6 rules applied. Total rules applied 4111 place count 198 transition count 510
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 18 with 1 rules applied. Total rules applied 4112 place count 198 transition count 517
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 18 with 7 rules applied. Total rules applied 4119 place count 197 transition count 511
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 19 with 2 rules applied. Total rules applied 4121 place count 197 transition count 509
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 19 with 5 rules applied. Total rules applied 4126 place count 197 transition count 509
Applied a total of 4126 rules in 866 ms. Remains 197 /2340 variables (removed 2143) and now considering 509/3456 (removed 2947) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 883 ms. Remains : 197/2340 places, 509/3456 transitions.
RANDOM walk for 20364 steps (5 resets) in 457 ms. (44 steps per ms) remains 0/4 properties
FORMULA DLCround-PT-06b-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-06b-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-06b-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-06b-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 12027 ms.
ITS solved all properties within timeout

BK_STOP 1716362946112

--------------------
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 ReachabilityFireability -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="DLCround-PT-06b"
export BK_EXAMINATION="ReachabilityFireability"
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 DLCround-PT-06b, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r113-smll-171624274400175"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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