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.r508-tall-171654352100662.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 NoC3x3-PT-7B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r508-tall-171654352100662
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.4M
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K 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 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K May 19 07:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 16:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 18:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 06:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 106K Apr 12 06:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Apr 12 06:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Apr 12 06:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 2.0M 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 NoC3x3-PT-7B-ReachabilityCardinality-2024-00
FORMULA_NAME NoC3x3-PT-7B-ReachabilityCardinality-2024-01
FORMULA_NAME NoC3x3-PT-7B-ReachabilityCardinality-2024-02
FORMULA_NAME NoC3x3-PT-7B-ReachabilityCardinality-2024-03
FORMULA_NAME NoC3x3-PT-7B-ReachabilityCardinality-2024-04
FORMULA_NAME NoC3x3-PT-7B-ReachabilityCardinality-2024-05
FORMULA_NAME NoC3x3-PT-7B-ReachabilityCardinality-2024-06
FORMULA_NAME NoC3x3-PT-7B-ReachabilityCardinality-2024-07
FORMULA_NAME NoC3x3-PT-7B-ReachabilityCardinality-2024-08
FORMULA_NAME NoC3x3-PT-7B-ReachabilityCardinality-2024-09
FORMULA_NAME NoC3x3-PT-7B-ReachabilityCardinality-2024-10
FORMULA_NAME NoC3x3-PT-7B-ReachabilityCardinality-2024-11
FORMULA_NAME NoC3x3-PT-7B-ReachabilityCardinality-2024-12
FORMULA_NAME NoC3x3-PT-7B-ReachabilityCardinality-2024-13
FORMULA_NAME NoC3x3-PT-7B-ReachabilityCardinality-2024-14
FORMULA_NAME NoC3x3-PT-7B-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717244181179

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NoC3x3-PT-7B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 12:16:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 12:16:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 12:16:22] [INFO ] Load time of PNML (sax parser for PT used): 284 ms
[2024-06-01 12:16:22] [INFO ] Transformed 7014 places.
[2024-06-01 12:16:22] [INFO ] Transformed 8833 transitions.
[2024-06-01 12:16:22] [INFO ] Found NUPN structural information;
[2024-06-01 12:16:22] [INFO ] Parsed PT model containing 7014 places and 8833 transitions and 19619 arcs in 459 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 19 ms.
Working with output stream class java.io.PrintStream
FORMULA NoC3x3-PT-7B-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (14 resets) in 3028 ms. (13 steps per ms) remains 9/15 properties
FORMULA NoC3x3-PT-7B-ReachabilityCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-7B-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-7B-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-7B-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-7B-ReachabilityCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-7B-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 150 ms. (264 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 227 ms. (175 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 933 ms. (42 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 117 ms. (339 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 86 ms. (459 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 98 ms. (404 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 121 ms. (327 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 216 ms. (184 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 69 ms. (571 steps per ms) remains 9/9 properties
// Phase 1: matrix 8833 rows 7014 cols
[2024-06-01 12:16:24] [INFO ] Computed 66 invariants in 91 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 114/114 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/114 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 6192/6306 variables, 35/149 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6306 variables, 6192/6341 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/6306 variables, 0/6341 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 708/7014 variables, 31/6372 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7014 variables, 708/7080 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/7014 variables, 0/7080 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 15847/15847 variables, and 14094 constraints, problems are : Problem set: 0 solved, 9 unsolved in 5080 ms.
Refiners :[Domain max(s): 7014/7014 constraints, Positive P Invariants (semi-flows): 66/66 constraints, State Equation: 7014/7014 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 114/114 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/114 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 6192/6306 variables, 35/149 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6306 variables, 6192/6341 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-01 12:16:31] [INFO ] Deduced a trap composed of 243 places in 236 ms of which 26 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/6306 variables, 1/6342 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/6306 variables, 0/6342 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 708/7014 variables, 31/6373 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/7014 variables, 708/7081 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-01 12:16:35] [INFO ] Deduced a trap composed of 250 places in 521 ms of which 20 ms to minimize.
SMT process timed out in 10568ms, After SMT, problems are : Problem set: 0 solved, 9 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 114 out of 7014 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7014/7014 places, 8833/8833 transitions.
Graph (trivial) has 7602 edges and 7014 vertex of which 3351 / 7014 are part of one of the 25 SCC in 20 ms
Free SCC test removed 3326 places
Drop transitions (Empty/Sink Transition effects.) removed 4066 transitions
Reduce isomorphic transitions removed 4066 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1177 transitions
Trivial Post-agglo rules discarded 1177 transitions
Performed 1177 trivial Post agglomeration. Transition count delta: 1177
Iterating post reduction 0 with 1177 rules applied. Total rules applied 1178 place count 3688 transition count 3590
Reduce places removed 1177 places and 0 transitions.
Ensure Unique test removed 57 transitions
Reduce isomorphic transitions removed 57 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 1 with 1290 rules applied. Total rules applied 2468 place count 2511 transition count 3477
Reduce places removed 56 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 58 rules applied. Total rules applied 2526 place count 2455 transition count 3475
Reduce places removed 1 places and 0 transitions.
Performed 57 Post agglomeration using F-continuation condition.Transition count delta: 57
Iterating post reduction 3 with 58 rules applied. Total rules applied 2584 place count 2454 transition count 3418
Reduce places removed 57 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 4 with 64 rules applied. Total rules applied 2648 place count 2397 transition count 3411
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 2651 place count 2394 transition count 3411
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 14 Pre rules applied. Total rules applied 2651 place count 2394 transition count 3397
Deduced a syphon composed of 14 places in 10 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 6 with 28 rules applied. Total rules applied 2679 place count 2380 transition count 3397
Discarding 640 places :
Symmetric choice reduction at 6 with 640 rule applications. Total rules 3319 place count 1740 transition count 2750
Iterating global reduction 6 with 640 rules applied. Total rules applied 3959 place count 1740 transition count 2750
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 5 rules applied. Total rules applied 3964 place count 1740 transition count 2745
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 3965 place count 1739 transition count 2745
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 45 Pre rules applied. Total rules applied 3965 place count 1739 transition count 2700
Deduced a syphon composed of 45 places in 5 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 8 with 90 rules applied. Total rules applied 4055 place count 1694 transition count 2700
Discarding 359 places :
Symmetric choice reduction at 8 with 359 rule applications. Total rules 4414 place count 1335 transition count 2150
Iterating global reduction 8 with 359 rules applied. Total rules applied 4773 place count 1335 transition count 2150
Ensure Unique test removed 228 transitions
Reduce isomorphic transitions removed 228 transitions.
Iterating post reduction 8 with 228 rules applied. Total rules applied 5001 place count 1335 transition count 1922
Discarding 15 places :
Symmetric choice reduction at 9 with 15 rule applications. Total rules 5016 place count 1320 transition count 1892
Iterating global reduction 9 with 15 rules applied. Total rules applied 5031 place count 1320 transition count 1892
Discarding 15 places :
Symmetric choice reduction at 9 with 15 rule applications. Total rules 5046 place count 1305 transition count 1877
Iterating global reduction 9 with 15 rules applied. Total rules applied 5061 place count 1305 transition count 1877
Discarding 15 places :
Symmetric choice reduction at 9 with 15 rule applications. Total rules 5076 place count 1290 transition count 1857
Iterating global reduction 9 with 15 rules applied. Total rules applied 5091 place count 1290 transition count 1857
Discarding 14 places :
Symmetric choice reduction at 9 with 14 rule applications. Total rules 5105 place count 1276 transition count 1829
Iterating global reduction 9 with 14 rules applied. Total rules applied 5119 place count 1276 transition count 1829
Performed 421 Post agglomeration using F-continuation condition with reduction of 28 identical transitions.
Deduced a syphon composed of 421 places in 1 ms
Reduce places removed 421 places and 0 transitions.
Iterating global reduction 9 with 842 rules applied. Total rules applied 5961 place count 855 transition count 1380
Ensure Unique test removed 38 transitions
Reduce isomorphic transitions removed 38 transitions.
Iterating post reduction 9 with 38 rules applied. Total rules applied 5999 place count 855 transition count 1342
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 10 with 30 rules applied. Total rules applied 6029 place count 840 transition count 1327
Performed 101 Post agglomeration using F-continuation condition with reduction of 122 identical transitions.
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 10 with 202 rules applied. Total rules applied 6231 place count 739 transition count 1497
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 122 transitions
Reduce isomorphic transitions removed 124 transitions.
Iterating post reduction 10 with 124 rules applied. Total rules applied 6355 place count 739 transition count 1373
Performed 72 Post agglomeration using F-continuation condition with reduction of 136 identical transitions.
Deduced a syphon composed of 72 places in 1 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 11 with 144 rules applied. Total rules applied 6499 place count 667 transition count 1611
Ensure Unique test removed 99 transitions
Reduce isomorphic transitions removed 99 transitions.
Iterating post reduction 11 with 99 rules applied. Total rules applied 6598 place count 667 transition count 1512
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 6600 place count 666 transition count 1526
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 12 with 3 rules applied. Total rules applied 6603 place count 666 transition count 1523
Drop transitions (Redundant composition of simpler transitions.) removed 267 transitions
Redundant transition composition rules discarded 267 transitions
Iterating global reduction 13 with 267 rules applied. Total rules applied 6870 place count 666 transition count 1256
Discarding 5 places :
Symmetric choice reduction at 13 with 5 rule applications. Total rules 6875 place count 661 transition count 1249
Iterating global reduction 13 with 5 rules applied. Total rules applied 6880 place count 661 transition count 1249
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 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 6882 place count 660 transition count 1248
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -62
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 13 with 14 rules applied. Total rules applied 6896 place count 653 transition count 1310
Drop transitions (Redundant composition of simpler transitions.) removed 33 transitions
Redundant transition composition rules discarded 33 transitions
Iterating global reduction 13 with 33 rules applied. Total rules applied 6929 place count 653 transition count 1277
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -17
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 6931 place count 652 transition count 1294
Free-agglomeration rule applied 175 times.
Iterating global reduction 13 with 175 rules applied. Total rules applied 7106 place count 652 transition count 1119
Reduce places removed 175 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Graph (complete) has 1815 edges and 477 vertex of which 473 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 0 output transitions
Iterating post reduction 13 with 203 rules applied. Total rules applied 7309 place count 473 transition count 1092
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 14 with 21 rules applied. Total rules applied 7330 place count 473 transition count 1071
Free-agglomeration rule applied 3 times.
Iterating global reduction 14 with 3 rules applied. Total rules applied 7333 place count 473 transition count 1068
Reduce places removed 3 places and 0 transitions.
Graph (complete) has 1794 edges and 470 vertex of which 465 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 14 with 4 rules applied. Total rules applied 7337 place count 465 transition count 1068
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 15 with 7 rules applied. Total rules applied 7344 place count 465 transition count 1061
Partial Free-agglomeration rule applied 54 times.
Drop transitions (Partial Free agglomeration) removed 54 transitions
Iterating global reduction 16 with 54 rules applied. Total rules applied 7398 place count 465 transition count 1061
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 16 with 2 rules applied. Total rules applied 7400 place count 465 transition count 1059
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 17 with 6 rules applied. Total rules applied 7406 place count 465 transition count 1053
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 17 with 1 rules applied. Total rules applied 7407 place count 464 transition count 1052
Applied a total of 7407 rules in 1506 ms. Remains 464 /7014 variables (removed 6550) and now considering 1052/8833 (removed 7781) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1525 ms. Remains : 464/7014 places, 1052/8833 transitions.
RANDOM walk for 40000 steps (8 resets) in 969 ms. (41 steps per ms) remains 1/9 properties
FORMULA NoC3x3-PT-7B-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-7B-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-7B-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-7B-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-7B-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-7B-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-7B-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-7B-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 17788 steps (4 resets) in 54 ms. (323 steps per ms) remains 0/1 properties
FORMULA NoC3x3-PT-7B-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
All properties solved without resorting to model-checking.
Total runtime 14914 ms.
ITS solved all properties within timeout

BK_STOP 1717244197271

--------------------
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="NoC3x3-PT-7B"
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 NoC3x3-PT-7B, 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 r508-tall-171654352100662"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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