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-171654352200678.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 ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r508-tall-171654352200678
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1717245511139

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-8B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 12:38:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 12:38:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 12:38:32] [INFO ] Load time of PNML (sax parser for PT used): 374 ms
[2024-06-01 12:38:32] [INFO ] Transformed 9140 places.
[2024-06-01 12:38:32] [INFO ] Transformed 14577 transitions.
[2024-06-01 12:38:32] [INFO ] Found NUPN structural information;
[2024-06-01 12:38:32] [INFO ] Parsed PT model containing 9140 places and 14577 transitions and 30726 arcs in 575 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 17 ms.
Working with output stream class java.io.PrintStream
FORMULA NoC3x3-PT-8B-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-8B-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (17 resets) in 2361 ms. (16 steps per ms) remains 12/14 properties
FORMULA NoC3x3-PT-8B-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-8B-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 292 ms. (136 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 193 ms. (206 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1174 ms. (34 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 132 ms. (300 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 151 ms. (263 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 151 ms. (263 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 154 ms. (258 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 154 ms. (258 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 96 ms. (412 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 113 ms. (350 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 95 ms. (416 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 103 ms. (384 steps per ms) remains 12/12 properties
// Phase 1: matrix 14577 rows 9140 cols
[2024-06-01 12:38:35] [INFO ] Computed 99 invariants in 204 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 113/113 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/113 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 8041/8154 variables, 38/151 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8154 variables, 8041/8192 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8154 variables, 0/8192 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 986/9140 variables, 61/8253 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/9140 variables, 986/9239 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/9140 variables, 0/9239 constraints. Problems are: Problem set: 0 solved, 12 unsolved
SMT process timed out in 5474ms, After SMT, problems are : Problem set: 0 solved, 12 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 113 out of 9140 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 9140/9140 places, 14577/14577 transitions.
Graph (trivial) has 13282 edges and 9140 vertex of which 2085 / 9140 are part of one of the 29 SCC in 35 ms
Free SCC test removed 2056 places
Drop transitions (Empty/Sink Transition effects.) removed 3260 transitions
Reduce isomorphic transitions removed 3260 transitions.
Graph (complete) has 12794 edges and 7084 vertex of which 6972 are kept as prefixes of interest. Removing 112 places using SCC suffix rule.22 ms
Discarding 112 places :
Also discarding 79 output transitions
Drop transitions (Output transitions of discarded places.) removed 79 transitions
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4122 transitions
Trivial Post-agglo rules discarded 4122 transitions
Performed 4122 trivial Post agglomeration. Transition count delta: 4122
Iterating post reduction 0 with 4224 rules applied. Total rules applied 4226 place count 6972 transition count 7014
Reduce places removed 4122 places and 0 transitions.
Ensure Unique test removed 2292 transitions
Reduce isomorphic transitions removed 2292 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1091 transitions
Trivial Post-agglo rules discarded 1091 transitions
Performed 1091 trivial Post agglomeration. Transition count delta: 1091
Iterating post reduction 1 with 7505 rules applied. Total rules applied 11731 place count 2850 transition count 3631
Reduce places removed 1091 places and 0 transitions.
Ensure Unique test removed 1091 transitions
Reduce isomorphic transitions removed 1091 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 2 with 2186 rules applied. Total rules applied 13917 place count 1759 transition count 2536
Reduce places removed 4 places and 0 transitions.
Performed 139 Post agglomeration using F-continuation condition.Transition count delta: 139
Iterating post reduction 3 with 143 rules applied. Total rules applied 14060 place count 1755 transition count 2397
Reduce places removed 139 places and 0 transitions.
Ensure Unique test removed 99 transitions
Reduce isomorphic transitions removed 99 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 239 rules applied. Total rules applied 14299 place count 1616 transition count 2297
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 14300 place count 1615 transition count 2297
Performed 55 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 55 Pre rules applied. Total rules applied 14300 place count 1615 transition count 2242
Deduced a syphon composed of 55 places in 6 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 6 with 110 rules applied. Total rules applied 14410 place count 1560 transition count 2242
Discarding 496 places :
Symmetric choice reduction at 6 with 496 rule applications. Total rules 14906 place count 1064 transition count 1746
Iterating global reduction 6 with 496 rules applied. Total rules applied 15402 place count 1064 transition count 1746
Ensure Unique test removed 149 transitions
Reduce isomorphic transitions removed 149 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 6 with 197 rules applied. Total rules applied 15599 place count 1064 transition count 1549
Reduce places removed 48 places and 0 transitions.
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 7 with 96 rules applied. Total rules applied 15695 place count 1016 transition count 1501
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 60 Pre rules applied. Total rules applied 15695 place count 1016 transition count 1441
Deduced a syphon composed of 60 places in 10 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 8 with 120 rules applied. Total rules applied 15815 place count 956 transition count 1441
Discarding 72 places :
Symmetric choice reduction at 8 with 72 rule applications. Total rules 15887 place count 884 transition count 1286
Iterating global reduction 8 with 72 rules applied. Total rules applied 15959 place count 884 transition count 1286
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 8 with 21 rules applied. Total rules applied 15980 place count 884 transition count 1265
Performed 248 Post agglomeration using F-continuation condition.Transition count delta: 248
Deduced a syphon composed of 248 places in 0 ms
Reduce places removed 248 places and 0 transitions.
Iterating global reduction 9 with 496 rules applied. Total rules applied 16476 place count 636 transition count 1017
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 9 with 21 rules applied. Total rules applied 16497 place count 636 transition count 996
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 16498 place count 635 transition count 993
Iterating global reduction 10 with 1 rules applied. Total rules applied 16499 place count 635 transition count 993
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 16501 place count 634 transition count 995
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 16502 place count 634 transition count 994
Drop transitions (Redundant composition of simpler transitions.) removed 69 transitions
Redundant transition composition rules discarded 69 transitions
Iterating global reduction 11 with 69 rules applied. Total rules applied 16571 place count 634 transition count 925
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -38
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 11 with 6 rules applied. Total rules applied 16577 place count 631 transition count 963
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 16578 place count 631 transition count 962
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 12 with 6 rules applied. Total rules applied 16584 place count 631 transition count 956
Free-agglomeration rule applied 230 times.
Iterating global reduction 12 with 230 rules applied. Total rules applied 16814 place count 631 transition count 726
Reduce places removed 230 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (complete) has 1122 edges and 401 vertex of which 393 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.0 ms
Discarding 8 places :
Also discarding 0 output transitions
Iterating post reduction 12 with 240 rules applied. Total rules applied 17054 place count 393 transition count 717
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 13 with 8 rules applied. Total rules applied 17062 place count 393 transition count 709
Drop transitions (Redundant composition of simpler transitions.) removed 146 transitions
Redundant transition composition rules discarded 146 transitions
Iterating global reduction 14 with 146 rules applied. Total rules applied 17208 place count 393 transition count 563
Reduce places removed 8 places and 0 transitions.
Graph (complete) has 961 edges and 385 vertex of which 367 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.0 ms
Discarding 18 places :
Also discarding 0 output transitions
Iterating post reduction 14 with 9 rules applied. Total rules applied 17217 place count 367 transition count 563
Drop transitions (Empty/Sink Transition effects.) removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 15 with 18 rules applied. Total rules applied 17235 place count 367 transition count 545
Partial Free-agglomeration rule applied 24 times.
Drop transitions (Partial Free agglomeration) removed 24 transitions
Iterating global reduction 16 with 24 rules applied. Total rules applied 17259 place count 367 transition count 545
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 16 with 1 rules applied. Total rules applied 17260 place count 367 transition count 545
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 16 with 1 rules applied. Total rules applied 17261 place count 366 transition count 544
Reduce places removed 1 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 16 with 3 rules applied. Total rules applied 17264 place count 365 transition count 542
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 17 with 2 rules applied. Total rules applied 17266 place count 363 transition count 542
Free-agglomeration rule applied 1 times.
Iterating global reduction 18 with 1 rules applied. Total rules applied 17267 place count 363 transition count 541
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 18 with 1 rules applied. Total rules applied 17268 place count 362 transition count 541
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 19 with 1 rules applied. Total rules applied 17269 place count 362 transition count 541
Applied a total of 17269 rules in 1075 ms. Remains 362 /9140 variables (removed 8778) and now considering 541/14577 (removed 14036) transitions.
Running 503 sub problems to find dead transitions.
[2024-06-01 12:38:41] [INFO ] Flow matrix only has 540 transitions (discarded 1 similar events)
// Phase 1: matrix 540 rows 362 cols
[2024-06-01 12:38:41] [INFO ] Computed 57 invariants in 9 ms
[2024-06-01 12:38:41] [INFO ] State equation strengthened by 117 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/359 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-06-01 12:38:45] [INFO ] Deduced a trap composed of 10 places in 91 ms of which 9 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/359 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-06-01 12:38:49] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/359 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/359 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 4 (OVERLAPS) 3/362 variables, 9/59 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-06-01 12:38:58] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/362 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 503 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 362/902 variables, and 60 constraints, problems are : Problem set: 0 solved, 503 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 0/362 constraints, ReadFeed: 0/117 constraints, PredecessorRefiner: 503/503 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 503 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/359 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/359 variables, 3/51 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/359 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 3 (OVERLAPS) 3/362 variables, 9/60 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/362 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 503 unsolved
Problem TDEAD538 is UNSAT
At refinement iteration 5 (OVERLAPS) 540/902 variables, 362/422 constraints. Problems are: Problem set: 1 solved, 502 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/902 variables, 117/539 constraints. Problems are: Problem set: 1 solved, 502 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/902 variables, 502/1041 constraints. Problems are: Problem set: 1 solved, 502 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/902 variables, 0/1041 constraints. Problems are: Problem set: 1 solved, 502 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 902/902 variables, and 1041 constraints, problems are : Problem set: 1 solved, 502 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 362/362 constraints, ReadFeed: 117/117 constraints, PredecessorRefiner: 502/503 constraints, Known Traps: 3/3 constraints]
After SMT, in 40213ms problems are : Problem set: 1 solved, 502 unsolved
Search for dead transitions found 1 dead transitions in 40227ms
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 : 362/9140 places, 540/14577 transitions.
Applied a total of 0 rules in 9 ms. Remains 362 /362 variables (removed 0) and now considering 540/540 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41329 ms. Remains : 362/9140 places, 540/14577 transitions.
RANDOM walk for 40000 steps (8 resets) in 754 ms. (52 steps per ms) remains 1/12 properties
FORMULA NoC3x3-PT-8B-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-8B-ReachabilityCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-8B-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-8B-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-8B-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-8B-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-8B-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-8B-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-8B-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-8B-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-8B-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 32467 steps (6 resets) in 123 ms. (261 steps per ms) remains 0/1 properties
FORMULA NoC3x3-PT-8B-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
All properties solved without resorting to model-checking.
Total runtime 49718 ms.
ITS solved all properties within timeout

BK_STOP 1717245562050

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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-8B"
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-8B, 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-171654352200678"
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 [ "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 ;