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.r536-tall-171690531700174.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 StigmergyCommit-PT-07a, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r536-tall-171690531700174
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.8M
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 07:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 23 07:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 07:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 11 17:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 107K Apr 11 17:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Apr 11 17:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Apr 11 17:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:59 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 5.4M May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717232494149

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyCommit-PT-07a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 09:01:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 09:01:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 09:01:35] [INFO ] Load time of PNML (sax parser for PT used): 485 ms
[2024-06-01 09:01:35] [INFO ] Transformed 292 places.
[2024-06-01 09:01:36] [INFO ] Transformed 7108 transitions.
[2024-06-01 09:01:36] [INFO ] Found NUPN structural information;
[2024-06-01 09:01:36] [INFO ] Parsed PT model containing 292 places and 7108 transitions and 108222 arcs in 722 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 20 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 6218 transitions
Reduce redundant transitions removed 6218 transitions.
FORMULA StigmergyCommit-PT-07a-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-07a-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-07a-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-07a-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-07a-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-07a-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (10 resets) in 4002 ms. (9 steps per ms) remains 5/10 properties
FORMULA StigmergyCommit-PT-07a-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-07a-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-07a-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-07a-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-07a-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (12 resets) in 130 ms. (305 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 310 ms. (128 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 633 ms. (63 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 528 ms. (75 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 64 ms. (615 steps per ms) remains 5/5 properties
[2024-06-01 09:01:37] [INFO ] Flow matrix only has 866 transitions (discarded 24 similar events)
// Phase 1: matrix 866 rows 292 cols
[2024-06-01 09:01:37] [INFO ] Computed 9 invariants in 24 ms
[2024-06-01 09:01:38] [INFO ] State equation strengthened by 621 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 245/291 variables, 8/54 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/291 variables, 245/299 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/291 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 1/292 variables, 1/300 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/292 variables, 1/301 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/292 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 865/1157 variables, 292/593 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1157 variables, 620/1213 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1157 variables, 0/1213 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 1/1158 variables, 1/1214 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1158 variables, 0/1214 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 0/1158 variables, 0/1214 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1158/1158 variables, and 1214 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1337 ms.
Refiners :[Domain max(s): 292/292 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 292/292 constraints, ReadFeed: 621/621 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 245/291 variables, 8/54 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/291 variables, 245/299 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 09:01:39] [INFO ] Deduced a trap composed of 17 places in 267 ms of which 24 ms to minimize.
[2024-06-01 09:01:40] [INFO ] Deduced a trap composed of 17 places in 254 ms of which 3 ms to minimize.
[2024-06-01 09:01:40] [INFO ] Deduced a trap composed of 16 places in 237 ms of which 2 ms to minimize.
[2024-06-01 09:01:40] [INFO ] Deduced a trap composed of 18 places in 233 ms of which 4 ms to minimize.
[2024-06-01 09:01:40] [INFO ] Deduced a trap composed of 16 places in 233 ms of which 2 ms to minimize.
[2024-06-01 09:01:41] [INFO ] Deduced a trap composed of 17 places in 179 ms of which 2 ms to minimize.
[2024-06-01 09:01:41] [INFO ] Deduced a trap composed of 17 places in 153 ms of which 1 ms to minimize.
[2024-06-01 09:01:41] [INFO ] Deduced a trap composed of 16 places in 126 ms of which 2 ms to minimize.
[2024-06-01 09:01:41] [INFO ] Deduced a trap composed of 18 places in 190 ms of which 2 ms to minimize.
[2024-06-01 09:01:41] [INFO ] Deduced a trap composed of 17 places in 180 ms of which 2 ms to minimize.
[2024-06-01 09:01:41] [INFO ] Deduced a trap composed of 16 places in 146 ms of which 2 ms to minimize.
[2024-06-01 09:01:42] [INFO ] Deduced a trap composed of 16 places in 128 ms of which 1 ms to minimize.
[2024-06-01 09:01:42] [INFO ] Deduced a trap composed of 16 places in 104 ms of which 2 ms to minimize.
[2024-06-01 09:01:42] [INFO ] Deduced a trap composed of 16 places in 102 ms of which 1 ms to minimize.
[2024-06-01 09:01:42] [INFO ] Deduced a trap composed of 16 places in 82 ms of which 1 ms to minimize.
[2024-06-01 09:01:42] [INFO ] Deduced a trap composed of 16 places in 126 ms of which 2 ms to minimize.
[2024-06-01 09:01:42] [INFO ] Deduced a trap composed of 18 places in 123 ms of which 1 ms to minimize.
[2024-06-01 09:01:42] [INFO ] Deduced a trap composed of 16 places in 107 ms of which 1 ms to minimize.
Problem StigmergyCommit-PT-07a-ReachabilityCardinality-2024-00 is UNSAT
FORMULA StigmergyCommit-PT-07a-ReachabilityCardinality-2024-00 FALSE TECHNIQUES SMT_REFINEMENT
Problem StigmergyCommit-PT-07a-ReachabilityCardinality-2024-02 is UNSAT
FORMULA StigmergyCommit-PT-07a-ReachabilityCardinality-2024-02 FALSE TECHNIQUES SMT_REFINEMENT
[2024-06-01 09:01:42] [INFO ] Deduced a trap composed of 16 places in 155 ms of which 1 ms to minimize.
[2024-06-01 09:01:43] [INFO ] Deduced a trap composed of 16 places in 145 ms of which 2 ms to minimize.
Problem StigmergyCommit-PT-07a-ReachabilityCardinality-2024-00 is UNSAT
Problem StigmergyCommit-PT-07a-ReachabilityCardinality-2024-02 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/291 variables, 20/319 constraints. Problems are: Problem set: 2 solved, 3 unsolved
[2024-06-01 09:01:43] [INFO ] Deduced a trap composed of 18 places in 117 ms of which 2 ms to minimize.
[2024-06-01 09:01:43] [INFO ] Deduced a trap composed of 16 places in 116 ms of which 2 ms to minimize.
[2024-06-01 09:01:43] [INFO ] Deduced a trap composed of 16 places in 131 ms of which 1 ms to minimize.
[2024-06-01 09:01:43] [INFO ] Deduced a trap composed of 16 places in 106 ms of which 1 ms to minimize.
Problem StigmergyCommit-PT-07a-ReachabilityCardinality-2024-04 is UNSAT
FORMULA StigmergyCommit-PT-07a-ReachabilityCardinality-2024-04 TRUE TECHNIQUES SMT_REFINEMENT
[2024-06-01 09:01:43] [INFO ] Deduced a trap composed of 16 places in 154 ms of which 2 ms to minimize.
[2024-06-01 09:01:43] [INFO ] Deduced a trap composed of 16 places in 113 ms of which 2 ms to minimize.
[2024-06-01 09:01:43] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 1 ms to minimize.
[2024-06-01 09:01:43] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 1 ms to minimize.
Problem StigmergyCommit-PT-07a-ReachabilityCardinality-2024-10 is UNSAT
FORMULA StigmergyCommit-PT-07a-ReachabilityCardinality-2024-10 TRUE TECHNIQUES SMT_REFINEMENT
[2024-06-01 09:01:44] [INFO ] Deduced a trap composed of 17 places in 114 ms of which 2 ms to minimize.
[2024-06-01 09:01:44] [INFO ] Deduced a trap composed of 16 places in 81 ms of which 1 ms to minimize.
[2024-06-01 09:01:44] [INFO ] Deduced a trap composed of 16 places in 123 ms of which 1 ms to minimize.
[2024-06-01 09:01:44] [INFO ] Deduced a trap composed of 16 places in 109 ms of which 1 ms to minimize.
[2024-06-01 09:01:44] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 1 ms to minimize.
SMT process timed out in 6682ms, After SMT, problems are : Problem set: 2 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 292 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 292/292 places, 890/890 transitions.
Graph (complete) has 651 edges and 292 vertex of which 284 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.7 ms
Discarding 8 places :
Also discarding 8 output transitions
Drop transitions (Output transitions of discarded places.) removed 8 transitions
Drop transitions (Empty/Sink Transition effects.) removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 74 rules applied. Total rules applied 75 place count 284 transition count 808
Reduce places removed 49 places and 0 transitions.
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 89 rules applied. Total rules applied 164 place count 235 transition count 768
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 172 place count 227 transition count 768
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 56 Pre rules applied. Total rules applied 172 place count 227 transition count 712
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 3 with 112 rules applied. Total rules applied 284 place count 171 transition count 712
Discarding 41 places :
Symmetric choice reduction at 3 with 41 rule applications. Total rules 325 place count 130 transition count 671
Iterating global reduction 3 with 41 rules applied. Total rules applied 366 place count 130 transition count 671
Discarding 40 places :
Symmetric choice reduction at 3 with 40 rule applications. Total rules 406 place count 90 transition count 631
Iterating global reduction 3 with 40 rules applied. Total rules applied 446 place count 90 transition count 631
Ensure Unique test removed 262 transitions
Reduce isomorphic transitions removed 262 transitions.
Iterating post reduction 3 with 262 rules applied. Total rules applied 708 place count 90 transition count 369
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 717 place count 81 transition count 360
Iterating global reduction 4 with 9 rules applied. Total rules applied 726 place count 81 transition count 360
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 735 place count 72 transition count 351
Iterating global reduction 4 with 9 rules applied. Total rules applied 744 place count 72 transition count 351
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 752 place count 72 transition count 343
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 5 with 30 rules applied. Total rules applied 782 place count 57 transition count 328
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 5 with 14 rules applied. Total rules applied 796 place count 57 transition count 314
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 803 place count 50 transition count 307
Iterating global reduction 6 with 7 rules applied. Total rules applied 810 place count 50 transition count 307
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 817 place count 43 transition count 300
Iterating global reduction 6 with 7 rules applied. Total rules applied 824 place count 43 transition count 300
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 831 place count 36 transition count 293
Iterating global reduction 6 with 7 rules applied. Total rules applied 838 place count 36 transition count 293
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 839 place count 36 transition count 292
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 841 place count 36 transition count 292
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 842 place count 36 transition count 291
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 843 place count 35 transition count 290
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 6 with 8 rules applied. Total rules applied 851 place count 34 transition count 283
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 7 with 7 rules applied. Total rules applied 858 place count 27 transition count 283
Performed 9 Post agglomeration using F-continuation condition with reduction of 246 identical transitions.
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 8 with 18 rules applied. Total rules applied 876 place count 18 transition count 28
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 8 with 9 rules applied. Total rules applied 885 place count 18 transition count 19
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 9 with 21 rules applied. Total rules applied 906 place count 4 transition count 12
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (trivial) has 3 edges and 4 vertex of which 2 / 4 are part of one of the 1 SCC in 2 ms
Free SCC test removed 1 places
Iterating post reduction 9 with 8 rules applied. Total rules applied 914 place count 3 transition count 5
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 916 place count 3 transition count 3
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 917 place count 3 transition count 3
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 918 place count 2 transition count 2
Iterating global reduction 11 with 1 rules applied. Total rules applied 919 place count 2 transition count 2
Applied a total of 919 rules in 265 ms. Remains 2 /292 variables (removed 290) and now considering 2/890 (removed 888) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 275 ms. Remains : 2/292 places, 2/890 transitions.
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
FORMULA StigmergyCommit-PT-07a-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 9563 ms.
ITS solved all properties within timeout

BK_STOP 1717232504902

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="StigmergyCommit-PT-07a"
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 StigmergyCommit-PT-07a, 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 r536-tall-171690531700174"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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