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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.4M
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K 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.1K May 19 07:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.9K Apr 12 07:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 79K Apr 12 07:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K Apr 12 07:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 80K Apr 12 07:24 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 3.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-8B-ReachabilityFireability-2024-00
FORMULA_NAME NoC3x3-PT-8B-ReachabilityFireability-2024-01
FORMULA_NAME NoC3x3-PT-8B-ReachabilityFireability-2024-02
FORMULA_NAME NoC3x3-PT-8B-ReachabilityFireability-2024-03
FORMULA_NAME NoC3x3-PT-8B-ReachabilityFireability-2024-04
FORMULA_NAME NoC3x3-PT-8B-ReachabilityFireability-2024-05
FORMULA_NAME NoC3x3-PT-8B-ReachabilityFireability-2024-06
FORMULA_NAME NoC3x3-PT-8B-ReachabilityFireability-2024-07
FORMULA_NAME NoC3x3-PT-8B-ReachabilityFireability-2024-08
FORMULA_NAME NoC3x3-PT-8B-ReachabilityFireability-2024-09
FORMULA_NAME NoC3x3-PT-8B-ReachabilityFireability-2024-10
FORMULA_NAME NoC3x3-PT-8B-ReachabilityFireability-2024-11
FORMULA_NAME NoC3x3-PT-8B-ReachabilityFireability-2024-12
FORMULA_NAME NoC3x3-PT-8B-ReachabilityFireability-2024-13
FORMULA_NAME NoC3x3-PT-8B-ReachabilityFireability-2024-14
FORMULA_NAME NoC3x3-PT-8B-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717245572145

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NoC3x3-PT-8B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 12:39:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 12:39:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 12:39:33] [INFO ] Load time of PNML (sax parser for PT used): 407 ms
[2024-06-01 12:39:33] [INFO ] Transformed 9140 places.
[2024-06-01 12:39:33] [INFO ] Transformed 14577 transitions.
[2024-06-01 12:39:33] [INFO ] Found NUPN structural information;
[2024-06-01 12:39:33] [INFO ] Parsed PT model containing 9140 places and 14577 transitions and 30726 arcs in 627 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 19 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (17 resets) in 2442 ms. (16 steps per ms) remains 10/16 properties
FORMULA NoC3x3-PT-8B-ReachabilityFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-8B-ReachabilityFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-8B-ReachabilityFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-8B-ReachabilityFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-8B-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-8B-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 313 ms. (127 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 543 ms. (73 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 116 ms. (341 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 128 ms. (310 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 393 ms. (101 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 102 ms. (388 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 124 ms. (320 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 192 ms. (207 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 133 ms. (298 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 118 ms. (336 steps per ms) remains 10/10 properties
// Phase 1: matrix 14577 rows 9140 cols
[2024-06-01 12:39:35] [INFO ] Computed 99 invariants in 148 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 141/141 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/141 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Problem NoC3x3-PT-8B-ReachabilityFireability-2024-00 is UNSAT
FORMULA NoC3x3-PT-8B-ReachabilityFireability-2024-00 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 8977/9118 variables, 95/236 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9118 variables, 8977/9213 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9118 variables, 0/9213 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 22/9140 variables, 4/9217 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/9140 variables, 22/9239 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/9140 variables, 0/9239 constraints. Problems are: Problem set: 1 solved, 9 unsolved
SMT process timed out in 5500ms, After SMT, problems are : Problem set: 1 solved, 9 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 131 out of 9140 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 9140/9140 places, 14577/14577 transitions.
Graph (trivial) has 12246 edges and 9140 vertex of which 1183 / 9140 are part of one of the 30 SCC in 25 ms
Free SCC test removed 1153 places
Drop transitions (Empty/Sink Transition effects.) removed 1759 transitions
Reduce isomorphic transitions removed 1759 transitions.
Graph (complete) has 14295 edges and 7987 vertex of which 7874 are kept as prefixes of interest. Removing 113 places using SCC suffix rule.19 ms
Discarding 113 places :
Also discarding 80 output transitions
Drop transitions (Output transitions of discarded places.) removed 80 transitions
Ensure Unique test removed 104 transitions
Reduce isomorphic transitions removed 104 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4612 transitions
Trivial Post-agglo rules discarded 4612 transitions
Performed 4612 trivial Post agglomeration. Transition count delta: 4612
Iterating post reduction 0 with 4716 rules applied. Total rules applied 4718 place count 7874 transition count 8022
Reduce places removed 4612 places and 0 transitions.
Ensure Unique test removed 2539 transitions
Reduce isomorphic transitions removed 2539 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 477 transitions
Trivial Post-agglo rules discarded 477 transitions
Performed 477 trivial Post agglomeration. Transition count delta: 477
Iterating post reduction 1 with 7628 rules applied. Total rules applied 12346 place count 3262 transition count 5006
Reduce places removed 477 places and 0 transitions.
Ensure Unique test removed 477 transitions
Reduce isomorphic transitions removed 477 transitions.
Performed 1136 Post agglomeration using F-continuation condition.Transition count delta: 1136
Iterating post reduction 2 with 2090 rules applied. Total rules applied 14436 place count 2785 transition count 3393
Reduce places removed 1136 places and 0 transitions.
Ensure Unique test removed 1065 transitions
Reduce isomorphic transitions removed 1065 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 3 with 2203 rules applied. Total rules applied 16639 place count 1649 transition count 2326
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 16641 place count 1647 transition count 2326
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 65 Pre rules applied. Total rules applied 16641 place count 1647 transition count 2261
Deduced a syphon composed of 65 places in 4 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 5 with 130 rules applied. Total rules applied 16771 place count 1582 transition count 2261
Discarding 494 places :
Symmetric choice reduction at 5 with 494 rule applications. Total rules 17265 place count 1088 transition count 1767
Iterating global reduction 5 with 494 rules applied. Total rules applied 17759 place count 1088 transition count 1767
Ensure Unique test removed 146 transitions
Reduce isomorphic transitions removed 146 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 5 with 195 rules applied. Total rules applied 17954 place count 1088 transition count 1572
Reduce places removed 49 places and 0 transitions.
Ensure Unique test removed 49 transitions
Reduce isomorphic transitions removed 49 transitions.
Iterating post reduction 6 with 98 rules applied. Total rules applied 18052 place count 1039 transition count 1523
Performed 57 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 57 Pre rules applied. Total rules applied 18052 place count 1039 transition count 1466
Deduced a syphon composed of 57 places in 32 ms
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 7 with 114 rules applied. Total rules applied 18166 place count 982 transition count 1466
Discarding 60 places :
Symmetric choice reduction at 7 with 60 rule applications. Total rules 18226 place count 922 transition count 1336
Iterating global reduction 7 with 60 rules applied. Total rules applied 18286 place count 922 transition count 1336
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 7 with 8 rules applied. Total rules applied 18294 place count 922 transition count 1328
Performed 246 Post agglomeration using F-continuation condition.Transition count delta: 246
Deduced a syphon composed of 246 places in 3 ms
Reduce places removed 246 places and 0 transitions.
Iterating global reduction 8 with 492 rules applied. Total rules applied 18786 place count 676 transition count 1082
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 8 with 21 rules applied. Total rules applied 18807 place count 676 transition count 1061
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -67
Deduced a syphon composed of 7 places in 3 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 9 with 14 rules applied. Total rules applied 18821 place count 669 transition count 1128
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 9 with 9 rules applied. Total rules applied 18830 place count 669 transition count 1119
Drop transitions (Redundant composition of simpler transitions.) removed 78 transitions
Redundant transition composition rules discarded 78 transitions
Iterating global reduction 10 with 78 rules applied. Total rules applied 18908 place count 669 transition count 1041
Free-agglomeration rule applied 222 times.
Iterating global reduction 10 with 222 rules applied. Total rules applied 19130 place count 669 transition count 819
Reduce places removed 222 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (complete) has 1229 edges and 447 vertex of which 445 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Iterating post reduction 10 with 234 rules applied. Total rules applied 19364 place count 445 transition count 808
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 19366 place count 445 transition count 806
Drop transitions (Redundant composition of simpler transitions.) removed 165 transitions
Redundant transition composition rules discarded 165 transitions
Iterating global reduction 12 with 165 rules applied. Total rules applied 19531 place count 445 transition count 641
Reduce places removed 7 places and 0 transitions.
Graph (complete) has 1057 edges and 438 vertex of which 416 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.0 ms
Discarding 22 places :
Also discarding 0 output transitions
Iterating post reduction 12 with 8 rules applied. Total rules applied 19539 place count 416 transition count 641
Drop transitions (Empty/Sink Transition effects.) removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 13 with 22 rules applied. Total rules applied 19561 place count 416 transition count 619
Free-agglomeration rule applied 1 times.
Iterating global reduction 14 with 1 rules applied. Total rules applied 19562 place count 416 transition count 618
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 19563 place count 415 transition count 618
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 15 with 1 rules applied. Total rules applied 19564 place count 415 transition count 617
Partial Free-agglomeration rule applied 34 times.
Drop transitions (Partial Free agglomeration) removed 34 transitions
Iterating global reduction 15 with 34 rules applied. Total rules applied 19598 place count 415 transition count 617
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 15 with 5 rules applied. Total rules applied 19603 place count 415 transition count 612
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 15 with 1 rules applied. Total rules applied 19604 place count 415 transition count 612
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 15 with 1 rules applied. Total rules applied 19605 place count 414 transition count 611
Applied a total of 19605 rules in 1181 ms. Remains 414 /9140 variables (removed 8726) and now considering 611/14577 (removed 13966) transitions.
Running 609 sub problems to find dead transitions.
[2024-06-01 12:39:42] [INFO ] Flow matrix only has 610 transitions (discarded 1 similar events)
// Phase 1: matrix 610 rows 414 cols
[2024-06-01 12:39:42] [INFO ] Computed 59 invariants in 8 ms
[2024-06-01 12:39:42] [INFO ] State equation strengthened by 148 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/412 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 609 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/412 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 609 unsolved
At refinement iteration 2 (OVERLAPS) 2/414 variables, 57/59 constraints. Problems are: Problem set: 0 solved, 609 unsolved
[2024-06-01 12:39:51] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 10 ms to minimize.
[2024-06-01 12:39:51] [INFO ] Deduced a trap composed of 9 places in 98 ms of which 1 ms to minimize.
[2024-06-01 12:39:51] [INFO ] Deduced a trap composed of 7 places in 71 ms of which 1 ms to minimize.
[2024-06-01 12:39:51] [INFO ] Deduced a trap composed of 8 places in 63 ms of which 1 ms to minimize.
[2024-06-01 12:39:51] [INFO ] Deduced a trap composed of 11 places in 95 ms of which 1 ms to minimize.
[2024-06-01 12:39:52] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 2 ms to minimize.
[2024-06-01 12:39:52] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 1 ms to minimize.
[2024-06-01 12:39:52] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 1 ms to minimize.
[2024-06-01 12:39:52] [INFO ] Deduced a trap composed of 8 places in 76 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/414 variables, 9/68 constraints. Problems are: Problem set: 0 solved, 609 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 414/1024 variables, and 68 constraints, problems are : Problem set: 0 solved, 609 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 59/59 constraints, State Equation: 0/414 constraints, ReadFeed: 0/148 constraints, PredecessorRefiner: 609/609 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 609 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/412 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 609 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/412 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 609 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/412 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 609 unsolved
At refinement iteration 3 (OVERLAPS) 2/414 variables, 57/60 constraints. Problems are: Problem set: 0 solved, 609 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/414 variables, 8/68 constraints. Problems are: Problem set: 0 solved, 609 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/414 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 609 unsolved
Problem TDEAD610 is UNSAT
At refinement iteration 6 (OVERLAPS) 610/1024 variables, 414/482 constraints. Problems are: Problem set: 1 solved, 608 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1024 variables, 148/630 constraints. Problems are: Problem set: 1 solved, 608 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1024 variables, 608/1238 constraints. Problems are: Problem set: 1 solved, 608 unsolved
[2024-06-01 12:40:17] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 2 ms to minimize.
[2024-06-01 12:40:21] [INFO ] Deduced a trap composed of 18 places in 83 ms of which 2 ms to minimize.
[2024-06-01 12:40:21] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 2 ms to minimize.
[2024-06-01 12:40:21] [INFO ] Deduced a trap composed of 11 places in 69 ms of which 1 ms to minimize.
[2024-06-01 12:40:21] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 1 ms to minimize.
[2024-06-01 12:40:21] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 2 ms to minimize.
[2024-06-01 12:40:21] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1024/1024 variables, and 1245 constraints, problems are : Problem set: 1 solved, 608 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 59/59 constraints, State Equation: 414/414 constraints, ReadFeed: 148/148 constraints, PredecessorRefiner: 608/609 constraints, Known Traps: 16/16 constraints]
After SMT, in 40244ms problems are : Problem set: 1 solved, 608 unsolved
Search for dead transitions found 1 dead transitions in 40253ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 1 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 414/9140 places, 610/14577 transitions.
Applied a total of 0 rules in 8 ms. Remains 414 /414 variables (removed 0) and now considering 610/610 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41457 ms. Remains : 414/9140 places, 610/14577 transitions.
RANDOM walk for 40000 steps (8 resets) in 620 ms. (64 steps per ms) remains 1/9 properties
FORMULA NoC3x3-PT-8B-ReachabilityFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-8B-ReachabilityFireability-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-8B-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-8B-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-8B-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-8B-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-8B-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-8B-ReachabilityFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 163 ms. (243 steps per ms) remains 1/1 properties
[2024-06-01 12:40:22] [INFO ] Flow matrix only has 609 transitions (discarded 1 similar events)
// Phase 1: matrix 609 rows 414 cols
[2024-06-01 12:40:22] [INFO ] Computed 59 invariants in 2 ms
[2024-06-01 12:40:22] [INFO ] State equation strengthened by 148 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 205/238 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/238 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 150/388 variables, 27/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/388 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 585/973 variables, 388/445 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/973 variables, 141/586 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/973 variables, 0/586 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 38/1011 variables, 19/605 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1011 variables, 3/608 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1011 variables, 0/608 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 6/1017 variables, 2/610 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1017 variables, 0/610 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 6/1023 variables, 7/617 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1023 variables, 4/621 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1023 variables, 0/621 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/1023 variables, 0/621 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1023/1023 variables, and 621 constraints, problems are : Problem set: 0 solved, 1 unsolved in 377 ms.
Refiners :[Positive P Invariants (semi-flows): 59/59 constraints, State Equation: 414/414 constraints, ReadFeed: 148/148 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 205/238 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 12:40:23] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-06-01 12:40:23] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/238 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/238 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 150/388 variables, 27/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/388 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 585/973 variables, 388/447 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/973 variables, 141/588 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/973 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 38/1011 variables, 19/607 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1011 variables, 3/610 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1011 variables, 1/611 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1011 variables, 0/611 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 6/1017 variables, 2/613 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1017 variables, 0/613 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 6/1023 variables, 7/620 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1023 variables, 4/624 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1023 variables, 0/624 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/1023 variables, 0/624 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1023/1023 variables, and 624 constraints, problems are : Problem set: 0 solved, 1 unsolved in 560 ms.
Refiners :[Positive P Invariants (semi-flows): 59/59 constraints, State Equation: 414/414 constraints, ReadFeed: 148/148 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 960ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 74 ms.
Support contains 33 out of 414 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 414/414 places, 610/610 transitions.
Graph (trivial) has 211 edges and 414 vertex of which 24 / 414 are part of one of the 6 SCC in 0 ms
Free SCC test removed 18 places
Drop transitions (Empty/Sink Transition effects.) removed 35 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 40 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 62 transitions
Trivial Post-agglo rules discarded 62 transitions
Performed 62 trivial Post agglomeration. Transition count delta: 62
Iterating post reduction 0 with 62 rules applied. Total rules applied 63 place count 396 transition count 508
Reduce places removed 62 places and 0 transitions.
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Graph (complete) has 907 edges and 334 vertex of which 333 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output 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 1 with 88 rules applied. Total rules applied 151 place count 333 transition count 483
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 2 with 11 rules applied. Total rules applied 162 place count 330 transition count 475
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 171 place count 323 transition count 473
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 12 Pre rules applied. Total rules applied 171 place count 323 transition count 461
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 195 place count 311 transition count 461
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 200 place count 306 transition count 455
Iterating global reduction 4 with 5 rules applied. Total rules applied 205 place count 306 transition count 455
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 208 place count 306 transition count 452
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 5 with 34 rules applied. Total rules applied 242 place count 289 transition count 435
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 250 place count 285 transition count 440
Drop transitions (Redundant composition of simpler transitions.) removed 42 transitions
Redundant transition composition rules discarded 42 transitions
Iterating global reduction 5 with 42 rules applied. Total rules applied 292 place count 285 transition count 398
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 296 place count 281 transition count 390
Iterating global reduction 5 with 4 rules applied. Total rules applied 300 place count 281 transition count 390
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 302 place count 281 transition count 388
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 6 with 2 rules applied. Total rules applied 304 place count 280 transition count 405
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 306 place count 280 transition count 403
Free-agglomeration rule applied 13 times.
Iterating global reduction 7 with 13 rules applied. Total rules applied 319 place count 280 transition count 390
Reduce places removed 14 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (complete) has 754 edges and 266 vertex of which 265 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 7 with 26 rules applied. Total rules applied 345 place count 265 transition count 379
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 347 place count 263 transition count 379
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 9 with 3 rules applied. Total rules applied 350 place count 263 transition count 376
Graph (complete) has 751 edges and 263 vertex of which 262 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 9 with 1 rules applied. Total rules applied 351 place count 262 transition count 376
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 352 place count 262 transition count 375
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 11 with 5 rules applied. Total rules applied 357 place count 262 transition count 375
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 11 with 2 rules applied. Total rules applied 359 place count 262 transition count 373
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 360 place count 261 transition count 372
Reduce places removed 2 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 11 with 4 rules applied. Total rules applied 364 place count 259 transition count 370
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 12 with 2 rules applied. Total rules applied 366 place count 257 transition count 370
Applied a total of 366 rules in 86 ms. Remains 257 /414 variables (removed 157) and now considering 370/610 (removed 240) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 86 ms. Remains : 257/414 places, 370/610 transitions.
RANDOM walk for 35969 steps (8 resets) in 261 ms. (137 steps per ms) remains 0/1 properties
FORMULA NoC3x3-PT-8B-ReachabilityFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 50929 ms.
ITS solved all properties within timeout

BK_STOP 1717245624313

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="NoC3x3-PT-8B"
export BK_EXAMINATION="ReachabilityFireability"
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-8B, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r508-tall-171654352200679"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/NoC3x3-PT-8B.tgz
mv NoC3x3-PT-8B execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;