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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 640K
-rw-r--r-- 1 mcc users 7.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K 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.5K Apr 23 07:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 23 07:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 23 07:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 07:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 136K Apr 12 07:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Apr 12 07:45 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Apr 12 07:45 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K 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 144K 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-4A-ReachabilityFireability-2024-00
FORMULA_NAME NoC3x3-PT-4A-ReachabilityFireability-2024-01
FORMULA_NAME NoC3x3-PT-4A-ReachabilityFireability-2024-02
FORMULA_NAME NoC3x3-PT-4A-ReachabilityFireability-2024-03
FORMULA_NAME NoC3x3-PT-4A-ReachabilityFireability-2024-04
FORMULA_NAME NoC3x3-PT-4A-ReachabilityFireability-2024-05
FORMULA_NAME NoC3x3-PT-4A-ReachabilityFireability-2024-06
FORMULA_NAME NoC3x3-PT-4A-ReachabilityFireability-2024-07
FORMULA_NAME NoC3x3-PT-4A-ReachabilityFireability-2024-08
FORMULA_NAME NoC3x3-PT-4A-ReachabilityFireability-2024-09
FORMULA_NAME NoC3x3-PT-4A-ReachabilityFireability-2024-10
FORMULA_NAME NoC3x3-PT-4A-ReachabilityFireability-2024-11
FORMULA_NAME NoC3x3-PT-4A-ReachabilityFireability-2024-12
FORMULA_NAME NoC3x3-PT-4A-ReachabilityFireability-2024-13
FORMULA_NAME NoC3x3-PT-4A-ReachabilityFireability-2024-14
FORMULA_NAME NoC3x3-PT-4A-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717241757049

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-4A
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 11:35:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 11:35:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 11:35:58] [INFO ] Load time of PNML (sax parser for PT used): 100 ms
[2024-06-01 11:35:58] [INFO ] Transformed 293 places.
[2024-06-01 11:35:58] [INFO ] Transformed 608 transitions.
[2024-06-01 11:35:58] [INFO ] Found NUPN structural information;
[2024-06-01 11:35:58] [INFO ] Parsed PT model containing 293 places and 608 transitions and 1905 arcs in 206 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 155 transitions
Reduce redundant transitions removed 155 transitions.
RANDOM walk for 40000 steps (8 resets) in 1861 ms. (21 steps per ms) remains 3/16 properties
FORMULA NoC3x3-PT-4A-ReachabilityFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-4A-ReachabilityFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-4A-ReachabilityFireability-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-4A-ReachabilityFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-4A-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-4A-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-4A-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-4A-ReachabilityFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-4A-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-4A-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-4A-ReachabilityFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-4A-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-4A-ReachabilityFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 223 ms. (178 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 608 ms. (65 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 339 ms. (117 steps per ms) remains 3/3 properties
[2024-06-01 11:35:59] [INFO ] Flow matrix only has 381 transitions (discarded 72 similar events)
// Phase 1: matrix 381 rows 293 cols
[2024-06-01 11:35:59] [INFO ] Computed 66 invariants in 16 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 6/106 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem NoC3x3-PT-4A-ReachabilityFireability-2024-04 is UNSAT
FORMULA NoC3x3-PT-4A-ReachabilityFireability-2024-04 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 3 (OVERLAPS) 193/293 variables, 60/166 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/293 variables, 193/359 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/293 variables, 0/359 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 381/674 variables, 293/652 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/674 variables, 0/652 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/674 variables, 0/652 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 674/674 variables, and 652 constraints, problems are : Problem set: 1 solved, 2 unsolved in 477 ms.
Refiners :[Domain max(s): 293/293 constraints, Positive P Invariants (semi-flows): 66/66 constraints, State Equation: 293/293 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 91/91 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 4/95 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 0/95 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 202/293 variables, 62/157 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/293 variables, 202/359 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/293 variables, 0/359 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 381/674 variables, 293/652 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/674 variables, 2/654 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/674 variables, 0/654 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/674 variables, 0/654 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 674/674 variables, and 654 constraints, problems are : Problem set: 1 solved, 2 unsolved in 679 ms.
Refiners :[Domain max(s): 293/293 constraints, Positive P Invariants (semi-flows): 66/66 constraints, State Equation: 293/293 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 1310ms problems are : Problem set: 1 solved, 2 unsolved
Parikh walk visited 0 properties in 1107 ms.
Support contains 91 out of 293 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 293/293 places, 453/453 transitions.
Graph (trivial) has 27 edges and 293 vertex of which 9 / 293 are part of one of the 4 SCC in 4 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 11 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 14 transitions.
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 40 place count 249 transition count 384
Iterating global reduction 0 with 39 rules applied. Total rules applied 79 place count 249 transition count 384
Drop transitions (Redundant composition of simpler transitions.) removed 85 transitions
Redundant transition composition rules discarded 85 transitions
Iterating global reduction 0 with 85 rules applied. Total rules applied 164 place count 249 transition count 299
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 171 place count 242 transition count 299
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 173 place count 242 transition count 299
Applied a total of 173 rules in 81 ms. Remains 242 /293 variables (removed 51) and now considering 299/453 (removed 154) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 96 ms. Remains : 242/293 places, 299/453 transitions.
RANDOM walk for 40000 steps (8 resets) in 422 ms. (94 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 219 ms. (181 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 304 ms. (131 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 392507 steps, run timeout after 3001 ms. (steps per millisecond=130 ) properties seen :0 out of 2
Probabilistic random walk after 392507 steps, saw 349911 distinct states, run finished after 3007 ms. (steps per millisecond=130 ) properties seen :0
// Phase 1: matrix 299 rows 242 cols
[2024-06-01 11:36:05] [INFO ] Computed 59 invariants in 6 ms
[2024-06-01 11:36:05] [INFO ] State equation strengthened by 12 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 151/242 variables, 55/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/242 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 299/541 variables, 242/301 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/541 variables, 12/313 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/541 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/541 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 541/541 variables, and 313 constraints, problems are : Problem set: 0 solved, 2 unsolved in 216 ms.
Refiners :[Positive P Invariants (semi-flows): 59/59 constraints, State Equation: 242/242 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 151/242 variables, 55/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/242 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 299/541 variables, 242/301 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/541 variables, 12/313 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/541 variables, 2/315 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/541 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/541 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 541/541 variables, and 315 constraints, problems are : Problem set: 0 solved, 2 unsolved in 478 ms.
Refiners :[Positive P Invariants (semi-flows): 59/59 constraints, State Equation: 242/242 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 742ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 913 ms.
Support contains 91 out of 242 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 242/242 places, 299/299 transitions.
Applied a total of 0 rules in 19 ms. Remains 242 /242 variables (removed 0) and now considering 299/299 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 242/242 places, 299/299 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 242/242 places, 299/299 transitions.
Applied a total of 0 rules in 11 ms. Remains 242 /242 variables (removed 0) and now considering 299/299 (removed 0) transitions.
[2024-06-01 11:36:07] [INFO ] Invariant cache hit.
[2024-06-01 11:36:07] [INFO ] Implicit Places using invariants in 117 ms returned [19]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 124 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 241/242 places, 299/299 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 241 transition count 298
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 240 transition count 298
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 3 place count 240 transition count 297
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 239 transition count 297
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 5 place count 239 transition count 297
Applied a total of 5 rules in 31 ms. Remains 239 /241 variables (removed 2) and now considering 297/299 (removed 2) transitions.
// Phase 1: matrix 297 rows 239 cols
[2024-06-01 11:36:07] [INFO ] Computed 58 invariants in 2 ms
[2024-06-01 11:36:07] [INFO ] Implicit Places using invariants in 112 ms returned []
[2024-06-01 11:36:07] [INFO ] Invariant cache hit.
[2024-06-01 11:36:07] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-06-01 11:36:07] [INFO ] Implicit Places using invariants and state equation in 191 ms returned []
Implicit Place search using SMT with State Equation took 306 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 239/242 places, 297/299 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 473 ms. Remains : 239/242 places, 297/299 transitions.
RANDOM walk for 40000 steps (8 resets) in 279 ms. (142 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 143 ms. (277 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 173 ms. (229 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 420852 steps, run timeout after 3001 ms. (steps per millisecond=140 ) properties seen :0 out of 2
Probabilistic random walk after 420852 steps, saw 373361 distinct states, run finished after 3001 ms. (steps per millisecond=140 ) properties seen :0
[2024-06-01 11:36:10] [INFO ] Invariant cache hit.
[2024-06-01 11:36:10] [INFO ] State equation strengthened by 9 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 148/239 variables, 54/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/239 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 297/536 variables, 239/297 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/536 variables, 9/306 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/536 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/536 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 536/536 variables, and 306 constraints, problems are : Problem set: 0 solved, 2 unsolved in 214 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, State Equation: 239/239 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 148/239 variables, 54/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/239 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 297/536 variables, 239/297 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/536 variables, 9/306 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/536 variables, 2/308 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/536 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/536 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 536/536 variables, and 308 constraints, problems are : Problem set: 0 solved, 2 unsolved in 450 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, State Equation: 239/239 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 721ms problems are : Problem set: 0 solved, 2 unsolved
Finished Parikh walk after 897 steps, including 6 resets, run visited all 2 properties in 4 ms. (steps per millisecond=224 )
FORMULA NoC3x3-PT-4A-ReachabilityFireability-2024-09 FALSE TECHNIQUES PARIKH_WALK
FORMULA NoC3x3-PT-4A-ReachabilityFireability-2024-06 FALSE TECHNIQUES PARIKH_WALK
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 2 properties in 8 ms.
All properties solved without resorting to model-checking.
Total runtime 13209 ms.
ITS solved all properties within timeout

BK_STOP 1717241771523

--------------------
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-4A"
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-4A, 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-171654352000607"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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