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

About the Execution of LTSMin+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
477.995 16913.00 36384.00 1190.60 TTFFTFTTTFFFTTFF 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.r484-smll-171624275400174.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 DLCround-PT-06b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r484-smll-171624275400174
=====================================================================

--------------------
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-ReachabilityCardinality-2024-00
FORMULA_NAME DLCround-PT-06b-ReachabilityCardinality-2024-01
FORMULA_NAME DLCround-PT-06b-ReachabilityCardinality-2024-02
FORMULA_NAME DLCround-PT-06b-ReachabilityCardinality-2024-03
FORMULA_NAME DLCround-PT-06b-ReachabilityCardinality-2024-04
FORMULA_NAME DLCround-PT-06b-ReachabilityCardinality-2024-05
FORMULA_NAME DLCround-PT-06b-ReachabilityCardinality-2024-06
FORMULA_NAME DLCround-PT-06b-ReachabilityCardinality-2024-07
FORMULA_NAME DLCround-PT-06b-ReachabilityCardinality-2024-08
FORMULA_NAME DLCround-PT-06b-ReachabilityCardinality-2024-09
FORMULA_NAME DLCround-PT-06b-ReachabilityCardinality-2024-10
FORMULA_NAME DLCround-PT-06b-ReachabilityCardinality-2024-11
FORMULA_NAME DLCround-PT-06b-ReachabilityCardinality-2024-12
FORMULA_NAME DLCround-PT-06b-ReachabilityCardinality-2024-13
FORMULA_NAME DLCround-PT-06b-ReachabilityCardinality-2024-14
FORMULA_NAME DLCround-PT-06b-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717224609843

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DLCround-PT-06b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 06:50:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 06:50:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 06:50:14] [INFO ] Load time of PNML (sax parser for PT used): 529 ms
[2024-06-01 06:50:14] [INFO ] Transformed 2340 places.
[2024-06-01 06:50:14] [INFO ] Transformed 3456 transitions.
[2024-06-01 06:50:14] [INFO ] Found NUPN structural information;
[2024-06-01 06:50:14] [INFO ] Parsed PT model containing 2340 places and 3456 transitions and 9288 arcs in 862 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 36 ms.
Working with output stream class java.io.PrintStream
FORMULA DLCround-PT-06b-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-06b-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-06b-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8 resets) in 2393 ms. (16 steps per ms) remains 2/13 properties
FORMULA DLCround-PT-06b-ReachabilityCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-06b-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-06b-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-06b-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-06b-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-06b-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-06b-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-06b-ReachabilityCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-06b-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-06b-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-06b-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 588 ms. (67 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 221 ms. (180 steps per ms) remains 2/2 properties
// Phase 1: matrix 3456 rows 2340 cols
[2024-06-01 06:50:16] [INFO ] Computed 109 invariants in 79 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 1618/1657 variables, 61/100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1657 variables, 1618/1718 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1657 variables, 0/1718 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 683/2340 variables, 48/1766 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2340 variables, 683/2449 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2340 variables, 0/2449 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 3456/5796 variables, 2340/4789 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/5796 variables, 0/4789 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/5796 variables, 0/4789 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5796/5796 variables, and 4789 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3896 ms.
Refiners :[Domain max(s): 2340/2340 constraints, Positive P Invariants (semi-flows): 109/109 constraints, State Equation: 2340/2340 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 1618/1657 variables, 61/100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1657 variables, 1618/1718 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 06:50:21] [INFO ] Deduced a trap composed of 196 places in 377 ms of which 45 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1657 variables, 1/1719 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1657 variables, 0/1719 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 683/2340 variables, 48/1767 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2340 variables, 683/2450 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2340 variables, 0/2450 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 3456/5796 variables, 2340/4790 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/5796 variables, 2/4792 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 06:50:25] [INFO ] Deduced a trap composed of 184 places in 648 ms of which 12 ms to minimize.
SMT process timed out in 9213ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 39 out of 2340 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2340/2340 places, 3456/3456 transitions.
Graph (trivial) has 2133 edges and 2340 vertex of which 356 / 2340 are part of one of the 32 SCC in 18 ms
Free SCC test removed 324 places
Drop transitions (Empty/Sink Transition effects.) removed 366 transitions
Reduce isomorphic transitions removed 366 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 879 transitions
Trivial Post-agglo rules discarded 879 transitions
Performed 879 trivial Post agglomeration. Transition count delta: 879
Iterating post reduction 0 with 879 rules applied. Total rules applied 880 place count 2016 transition count 2211
Reduce places removed 879 places and 0 transitions.
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 1 with 932 rules applied. Total rules applied 1812 place count 1137 transition count 2158
Reduce places removed 23 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 30 rules applied. Total rules applied 1842 place count 1114 transition count 2151
Reduce places removed 3 places and 0 transitions.
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Iterating post reduction 3 with 24 rules applied. Total rules applied 1866 place count 1111 transition count 2130
Reduce places removed 21 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 23 rules applied. Total rules applied 1889 place count 1090 transition count 2128
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1890 place count 1089 transition count 2128
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 27 Pre rules applied. Total rules applied 1890 place count 1089 transition count 2101
Deduced a syphon composed of 27 places in 30 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 6 with 54 rules applied. Total rules applied 1944 place count 1062 transition count 2101
Discarding 264 places :
Symmetric choice reduction at 6 with 264 rule applications. Total rules 2208 place count 798 transition count 1837
Iterating global reduction 6 with 264 rules applied. Total rules applied 2472 place count 798 transition count 1837
Performed 105 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 105 Pre rules applied. Total rules applied 2472 place count 798 transition count 1732
Deduced a syphon composed of 105 places in 16 ms
Reduce places removed 105 places and 0 transitions.
Iterating global reduction 6 with 210 rules applied. Total rules applied 2682 place count 693 transition count 1732
Discarding 40 places :
Symmetric choice reduction at 6 with 40 rule applications. Total rules 2722 place count 653 transition count 1347
Iterating global reduction 6 with 40 rules applied. Total rules applied 2762 place count 653 transition count 1347
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 6 with 11 rules applied. Total rules applied 2773 place count 653 transition count 1336
Performed 175 Post agglomeration using F-continuation condition with reduction of 5 identical transitions.
Deduced a syphon composed of 175 places in 1 ms
Reduce places removed 175 places and 0 transitions.
Iterating global reduction 7 with 350 rules applied. Total rules applied 3123 place count 478 transition count 1156
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 3126 place count 478 transition count 1153
Discarding 7 places :
Symmetric choice reduction at 8 with 7 rule applications. Total rules 3133 place count 471 transition count 1083
Iterating global reduction 8 with 7 rules applied. Total rules applied 3140 place count 471 transition count 1083
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 3141 place count 471 transition count 1082
Performed 53 Post agglomeration using F-continuation condition with reduction of 21 identical transitions.
Deduced a syphon composed of 53 places in 1 ms
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 9 with 106 rules applied. Total rules applied 3247 place count 418 transition count 1528
Drop transitions (Empty/Sink Transition effects.) removed 54 transitions
Reduce isomorphic transitions removed 54 transitions.
Iterating post reduction 9 with 54 rules applied. Total rules applied 3301 place count 418 transition count 1474
Discarding 14 places :
Symmetric choice reduction at 10 with 14 rule applications. Total rules 3315 place count 404 transition count 1192
Iterating global reduction 10 with 14 rules applied. Total rules applied 3329 place count 404 transition count 1192
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 10 with 25 rules applied. Total rules applied 3354 place count 404 transition count 1167
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 3356 place count 403 transition count 1179
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 3358 place count 403 transition count 1177
Drop transitions (Redundant composition of simpler transitions.) removed 132 transitions
Redundant transition composition rules discarded 132 transitions
Iterating global reduction 12 with 132 rules applied. Total rules applied 3490 place count 403 transition count 1045
Discarding 6 places :
Symmetric choice reduction at 12 with 6 rule applications. Total rules 3496 place count 397 transition count 977
Iterating global reduction 12 with 6 rules applied. Total rules applied 3502 place count 397 transition count 977
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 12 with 7 rules applied. Total rules applied 3509 place count 397 transition count 970
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -35
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 13 with 8 rules applied. Total rules applied 3517 place count 393 transition count 1005
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 13 with 5 rules applied. Total rules applied 3522 place count 393 transition count 1000
Drop transitions (Redundant composition of simpler transitions.) removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 14 with 18 rules applied. Total rules applied 3540 place count 393 transition count 982
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -25
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 14 with 6 rules applied. Total rules applied 3546 place count 390 transition count 1007
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 14 with 3 rules applied. Total rules applied 3549 place count 390 transition count 1004
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 15 with 14 rules applied. Total rules applied 3563 place count 390 transition count 990
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 15 with 4 rules applied. Total rules applied 3567 place count 388 transition count 1006
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 3569 place count 388 transition count 1004
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 16 with 2 rules applied. Total rules applied 3571 place count 388 transition count 1002
Free-agglomeration rule applied 168 times with reduction of 72 identical transitions.
Iterating global reduction 16 with 168 rules applied. Total rules applied 3739 place count 388 transition count 762
Reduce places removed 168 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 212 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 219 transitions.
Graph (complete) has 641 edges and 220 vertex of which 215 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 0 output transitions
Iterating post reduction 16 with 388 rules applied. Total rules applied 4127 place count 215 transition count 543
Discarding 10 places :
Symmetric choice reduction at 17 with 10 rule applications. Total rules 4137 place count 205 transition count 524
Iterating global reduction 17 with 10 rules applied. Total rules applied 4147 place count 205 transition count 524
Drop transitions (Redundant composition of simpler transitions.) removed 61 transitions
Redundant transition composition rules discarded 61 transitions
Iterating global reduction 17 with 61 rules applied. Total rules applied 4208 place count 205 transition count 463
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 577 edges and 203 vertex of which 197 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 0 output transitions
Iterating post reduction 17 with 3 rules applied. Total rules applied 4211 place count 197 transition count 463
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 18 with 10 rules applied. Total rules applied 4221 place count 197 transition count 453
Discarding 17 places :
Symmetric choice reduction at 19 with 17 rule applications. Total rules 4238 place count 180 transition count 423
Iterating global reduction 19 with 17 rules applied. Total rules applied 4255 place count 180 transition count 423
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 19 with 2 rules applied. Total rules applied 4257 place count 179 transition count 431
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 19 with 8 rules applied. Total rules applied 4265 place count 179 transition count 423
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 20 with 2 rules applied. Total rules applied 4267 place count 179 transition count 421
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 20 with 3 rules applied. Total rules applied 4270 place count 179 transition count 421
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 20 with 1 rules applied. Total rules applied 4271 place count 178 transition count 420
Reduce places removed 11 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Graph (trivial) has 21 edges and 167 vertex of which 2 / 167 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 20 with 28 rules applied. Total rules applied 4299 place count 166 transition count 404
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 21 with 7 rules applied. Total rules applied 4306 place count 166 transition count 397
Performed 4 Post agglomeration using F-continuation condition with reduction of 11 identical transitions.
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 22 with 8 rules applied. Total rules applied 4314 place count 162 transition count 382
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 22 with 13 rules applied. Total rules applied 4327 place count 162 transition count 369
Discarding 3 places :
Symmetric choice reduction at 23 with 3 rule applications. Total rules 4330 place count 159 transition count 364
Iterating global reduction 23 with 3 rules applied. Total rules applied 4333 place count 159 transition count 364
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 23 with 3 rules applied. Total rules applied 4336 place count 157 transition count 363
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 23 with 3 rules applied. Total rules applied 4339 place count 157 transition count 360
Drop transitions (Redundant composition of simpler transitions.) removed 69 transitions
Redundant transition composition rules discarded 69 transitions
Iterating global reduction 24 with 69 rules applied. Total rules applied 4408 place count 157 transition count 291
Graph (complete) has 372 edges and 157 vertex of which 155 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Iterating post reduction 24 with 1 rules applied. Total rules applied 4409 place count 155 transition count 291
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 25 with 4 rules applied. Total rules applied 4413 place count 155 transition count 287
Discarding 9 places :
Symmetric choice reduction at 26 with 9 rule applications. Total rules 4422 place count 146 transition count 269
Iterating global reduction 26 with 9 rules applied. Total rules applied 4431 place count 146 transition count 269
Free-agglomeration rule applied 5 times.
Iterating global reduction 26 with 5 rules applied. Total rules applied 4436 place count 146 transition count 264
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 26 with 5 rules applied. Total rules applied 4441 place count 141 transition count 264
Applied a total of 4441 rules in 1165 ms. Remains 141 /2340 variables (removed 2199) and now considering 264/3456 (removed 3192) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1183 ms. Remains : 141/2340 places, 264/3456 transitions.
RANDOM walk for 40000 steps (8 resets) in 1200 ms. (33 steps per ms) remains 1/2 properties
FORMULA DLCround-PT-06b-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 6311 steps (0 resets) in 13 ms. (450 steps per ms) remains 0/1 properties
FORMULA DLCround-PT-06b-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
All properties solved without resorting to model-checking.
Total runtime 13034 ms.
ITS solved all properties within timeout

BK_STOP 1717224626756

--------------------
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="DLCround-PT-06b"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is DLCround-PT-06b, 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 r484-smll-171624275400174"
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 [ "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 ;