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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 568K
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K 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 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.0K Apr 23 07:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 23 07:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 07:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 116K Apr 12 07:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Apr 12 07:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K Apr 12 07:33 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 133K 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-3A-ReachabilityFireability-2024-00
FORMULA_NAME NoC3x3-PT-3A-ReachabilityFireability-2024-01
FORMULA_NAME NoC3x3-PT-3A-ReachabilityFireability-2024-02
FORMULA_NAME NoC3x3-PT-3A-ReachabilityFireability-2024-03
FORMULA_NAME NoC3x3-PT-3A-ReachabilityFireability-2024-04
FORMULA_NAME NoC3x3-PT-3A-ReachabilityFireability-2024-05
FORMULA_NAME NoC3x3-PT-3A-ReachabilityFireability-2024-06
FORMULA_NAME NoC3x3-PT-3A-ReachabilityFireability-2024-07
FORMULA_NAME NoC3x3-PT-3A-ReachabilityFireability-2024-08
FORMULA_NAME NoC3x3-PT-3A-ReachabilityFireability-2024-09
FORMULA_NAME NoC3x3-PT-3A-ReachabilityFireability-2024-10
FORMULA_NAME NoC3x3-PT-3A-ReachabilityFireability-2024-11
FORMULA_NAME NoC3x3-PT-3A-ReachabilityFireability-2024-12
FORMULA_NAME NoC3x3-PT-3A-ReachabilityFireability-2024-13
FORMULA_NAME NoC3x3-PT-3A-ReachabilityFireability-2024-14
FORMULA_NAME NoC3x3-PT-3A-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717240767121

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-3A
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 11:19:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 11:19:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 11:19:28] [INFO ] Load time of PNML (sax parser for PT used): 103 ms
[2024-06-01 11:19:28] [INFO ] Transformed 370 places.
[2024-06-01 11:19:28] [INFO ] Transformed 450 transitions.
[2024-06-01 11:19:28] [INFO ] Found NUPN structural information;
[2024-06-01 11:19:28] [INFO ] Parsed PT model containing 370 places and 450 transitions and 1773 arcs in 206 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
RANDOM walk for 40000 steps (8 resets) in 1805 ms. (22 steps per ms) remains 3/16 properties
FORMULA NoC3x3-PT-3A-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3A-ReachabilityFireability-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3A-ReachabilityFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3A-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3A-ReachabilityFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3A-ReachabilityFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3A-ReachabilityFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3A-ReachabilityFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3A-ReachabilityFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3A-ReachabilityFireability-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3A-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3A-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3A-ReachabilityFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 408 ms. (97 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 184 ms. (216 steps per ms) remains 2/3 properties
FORMULA NoC3x3-PT-3A-ReachabilityFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 1384 ms. (28 steps per ms) remains 1/2 properties
FORMULA NoC3x3-PT-3A-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2024-06-01 11:19:29] [INFO ] Flow matrix only has 394 transitions (discarded 55 similar events)
// Phase 1: matrix 394 rows 370 cols
[2024-06-01 11:19:29] [INFO ] Computed 127 invariants in 36 ms
[2024-06-01 11:19:29] [INFO ] State equation strengthened by 12 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 61/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 112/173 variables, 42/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/173 variables, 112/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/173 variables, 1/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/173 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 102/275 variables, 34/252 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/275 variables, 102/354 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/275 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 95/370 variables, 48/402 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/370 variables, 95/497 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/370 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 393/763 variables, 370/867 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/763 variables, 11/878 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/763 variables, 0/878 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1/764 variables, 1/879 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/764 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/764 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 764/764 variables, and 879 constraints, problems are : Problem set: 0 solved, 1 unsolved in 538 ms.
Refiners :[Domain max(s): 370/370 constraints, Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 51/51 constraints, State Equation: 370/370 constraints, ReadFeed: 12/12 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/61 variables, 61/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 112/173 variables, 42/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/173 variables, 112/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/173 variables, 1/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/173 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 102/275 variables, 34/252 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/275 variables, 102/354 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/275 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 95/370 variables, 48/402 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/370 variables, 95/497 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/370 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 393/763 variables, 370/867 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/763 variables, 11/878 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/763 variables, 1/879 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/763 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1/764 variables, 1/880 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/764 variables, 0/880 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/764 variables, 0/880 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 764/764 variables, and 880 constraints, problems are : Problem set: 0 solved, 1 unsolved in 575 ms.
Refiners :[Domain max(s): 370/370 constraints, Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 51/51 constraints, State Equation: 370/370 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1258ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 115 ms.
Support contains 61 out of 370 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 370/370 places, 449/449 transitions.
Ensure Unique test removed 15 places
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 355 transition count 433
Reduce places removed 7 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 11 rules applied. Total rules applied 42 place count 348 transition count 429
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 46 place count 344 transition count 429
Discarding 97 places :
Symmetric choice reduction at 3 with 97 rule applications. Total rules 143 place count 247 transition count 312
Ensure Unique test removed 38 places
Iterating global reduction 3 with 135 rules applied. Total rules applied 278 place count 209 transition count 312
Ensure Unique test removed 66 transitions
Reduce isomorphic transitions removed 66 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 3 with 77 rules applied. Total rules applied 355 place count 209 transition count 235
Reduce places removed 11 places and 0 transitions.
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Iterating post reduction 4 with 27 rules applied. Total rules applied 382 place count 198 transition count 219
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 5 with 16 rules applied. Total rules applied 398 place count 182 transition count 219
Drop transitions (Redundant composition of simpler transitions.) removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 6 with 24 rules applied. Total rules applied 422 place count 182 transition count 195
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 427 place count 177 transition count 195
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 7 with 7 rules applied. Total rules applied 434 place count 177 transition count 188
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 7 with 7 rules applied. Total rules applied 441 place count 170 transition count 188
Partial Free-agglomeration rule applied 11 times.
Drop transitions (Partial Free agglomeration) removed 11 transitions
Iterating global reduction 8 with 11 rules applied. Total rules applied 452 place count 170 transition count 188
Applied a total of 452 rules in 90 ms. Remains 170 /370 variables (removed 200) and now considering 188/449 (removed 261) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 101 ms. Remains : 170/370 places, 188/449 transitions.
RANDOM walk for 40000 steps (8 resets) in 510 ms. (78 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 250 ms. (159 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1146549 steps, run timeout after 3001 ms. (steps per millisecond=382 ) properties seen :0 out of 1
Probabilistic random walk after 1146549 steps, saw 895359 distinct states, run finished after 3007 ms. (steps per millisecond=381 ) properties seen :0
[2024-06-01 11:19:34] [INFO ] Flow matrix only has 184 transitions (discarded 4 similar events)
// Phase 1: matrix 184 rows 170 cols
[2024-06-01 11:19:34] [INFO ] Computed 69 invariants in 3 ms
[2024-06-01 11:19:34] [INFO ] State equation strengthened by 32 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 59/120 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 41/161 variables, 21/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/161 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 9/170 variables, 6/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/170 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 184/354 variables, 170/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/354 variables, 32/271 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/354 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/354 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 354/354 variables, and 271 constraints, problems are : Problem set: 0 solved, 1 unsolved in 143 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 170/170 constraints, ReadFeed: 32/32 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/61 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 59/120 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 41/161 variables, 21/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/161 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 9/170 variables, 6/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/170 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 184/354 variables, 170/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/354 variables, 32/271 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/354 variables, 1/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/354 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/354 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 354/354 variables, and 272 constraints, problems are : Problem set: 0 solved, 1 unsolved in 250 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 170/170 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 431ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 79 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=39 )
FORMULA NoC3x3-PT-3A-ReachabilityFireability-2024-02 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 10 ms.
All properties solved without resorting to model-checking.
Total runtime 6651 ms.
ITS solved all properties within timeout

BK_STOP 1717240775031

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

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