Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/local/x2003239/mcc2020-input.r174-csrt-158987853100359.qcow2', fmt=qcow2 size=4294967296 backing_file=/local/x2003239/mcc2020-input.qcow2 encryption=off cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is NoC3x3-PT-2B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r174-csrt-158987853100359
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 728K
-rw-r--r-- 1 mcc users 3.8K Apr 8 15:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 8 15:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 7 18:31 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 7 18:31 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.7K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.0K Apr 14 12:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 14 12:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K Apr 6 20:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Apr 6 20:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 6 03:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 6 03:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 6 20:25 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 6 20:25 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 548K Mar 24 05:37 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-2B-ReachabilityFireability-00
FORMULA_NAME NoC3x3-PT-2B-ReachabilityFireability-01
FORMULA_NAME NoC3x3-PT-2B-ReachabilityFireability-02
FORMULA_NAME NoC3x3-PT-2B-ReachabilityFireability-03
FORMULA_NAME NoC3x3-PT-2B-ReachabilityFireability-04
FORMULA_NAME NoC3x3-PT-2B-ReachabilityFireability-05
FORMULA_NAME NoC3x3-PT-2B-ReachabilityFireability-06
FORMULA_NAME NoC3x3-PT-2B-ReachabilityFireability-07
FORMULA_NAME NoC3x3-PT-2B-ReachabilityFireability-08
FORMULA_NAME NoC3x3-PT-2B-ReachabilityFireability-09
FORMULA_NAME NoC3x3-PT-2B-ReachabilityFireability-10
FORMULA_NAME NoC3x3-PT-2B-ReachabilityFireability-11
FORMULA_NAME NoC3x3-PT-2B-ReachabilityFireability-12
FORMULA_NAME NoC3x3-PT-2B-ReachabilityFireability-13
FORMULA_NAME NoC3x3-PT-2B-ReachabilityFireability-14
FORMULA_NAME NoC3x3-PT-2B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1591141734686

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-02 23:48:57] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-02 23:48:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-02 23:48:57] [INFO ] Load time of PNML (sax parser for PT used): 204 ms
[2020-06-02 23:48:57] [INFO ] Transformed 2003 places.
[2020-06-02 23:48:57] [INFO ] Transformed 2292 transitions.
[2020-06-02 23:48:57] [INFO ] Found NUPN structural information;
[2020-06-02 23:48:57] [INFO ] Parsed PT model containing 2003 places and 2292 transitions in 336 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 152 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 16 resets, run finished after 164 ms. (steps per millisecond=60 ) properties seen :[0, 1, 1, 0, 0, 0, 1, 0, 0, 1, 1, 1, 0, 0, 1, 0]
FORMULA NoC3x3-PT-2B-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-2B-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-2B-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-2B-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-2B-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-2B-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-2B-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 1 resets, run finished after 48 ms. (steps per millisecond=208 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 1 resets, run finished after 50 ms. (steps per millisecond=200 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 1 resets, run finished after 22 ms. (steps per millisecond=454 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 1 resets, run finished after 16 ms. (steps per millisecond=625 ) properties seen :[0, 0, 0, 0, 0, 0, 1, 0, 0]
FORMULA NoC3x3-PT-2B-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 1 resets, run finished after 15 ms. (steps per millisecond=666 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 1 resets, run finished after 33 ms. (steps per millisecond=303 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 2292 rows 2003 cols
[2020-06-02 23:48:58] [INFO ] Computed 66 place invariants in 91 ms
[2020-06-02 23:48:59] [INFO ] [Real]Absence check using 66 positive place invariants in 193 ms returned sat
[2020-06-02 23:48:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 23:49:03] [INFO ] [Real]Absence check using state equation in 3840 ms returned (error "Solver has unexpectedly terminated")
[2020-06-02 23:49:04] [INFO ] [Real]Absence check using 66 positive place invariants in 169 ms returned sat
[2020-06-02 23:49:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 23:49:08] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 23:49:08] [INFO ] [Real]Absence check using state equation in 4087 ms returned (error "Failed to check-sat")
[2020-06-02 23:49:09] [INFO ] [Real]Absence check using 66 positive place invariants in 187 ms returned sat
[2020-06-02 23:49:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 23:49:13] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 23:49:13] [INFO ] [Real]Absence check using state equation in 4575 ms returned (error "Failed to check-sat")
[2020-06-02 23:49:14] [INFO ] [Real]Absence check using 66 positive place invariants in 155 ms returned sat
[2020-06-02 23:49:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 23:49:18] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 23:49:18] [INFO ] [Real]Absence check using state equation in 4574 ms returned (error "Failed to check-sat")
[2020-06-02 23:49:19] [INFO ] [Real]Absence check using 66 positive place invariants in 166 ms returned sat
[2020-06-02 23:49:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 23:49:23] [INFO ] [Real]Absence check using state equation in 4582 ms returned (error "Failed to check-sat")
[2020-06-02 23:49:24] [INFO ] [Real]Absence check using 66 positive place invariants in 155 ms returned sat
[2020-06-02 23:49:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 23:49:28] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 23:49:28] [INFO ] [Real]Absence check using state equation in 4614 ms returned (error "Failed to check-sat")
[2020-06-02 23:49:29] [INFO ] [Real]Absence check using 66 positive place invariants in 162 ms returned sat
[2020-06-02 23:49:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 23:49:33] [INFO ] [Real]Absence check using state equation in 4566 ms returned (error "Failed to check-sat")
[2020-06-02 23:49:34] [INFO ] [Real]Absence check using 66 positive place invariants in 158 ms returned sat
[2020-06-02 23:49:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 23:49:38] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 23:49:38] [INFO ] [Real]Absence check using state equation in 4602 ms returned (error "Failed to check-sat")
Support contains 68 out of 2003 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2003/2003 places, 2292/2292 transitions.
Graph (trivial) has 1504 edges and 2003 vertex of which 64 / 2003 are part of one of the 8 SCC in 21 ms
Free SCC test removed 56 places
Drop transitions removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Discarding 9 places :
Implicit places reduction removed 9 places
Performed 391 Post agglomeration using F-continuation condition.Transition count delta: 391
Iterating post reduction 0 with 464 rules applied. Total rules applied 465 place count 1938 transition count 1837
Reduce places removed 391 places and 0 transitions.
Iterating post reduction 1 with 391 rules applied. Total rules applied 856 place count 1547 transition count 1837
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 27 Pre rules applied. Total rules applied 856 place count 1547 transition count 1810
Deduced a syphon composed of 27 places in 4 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 54 rules applied. Total rules applied 910 place count 1520 transition count 1810
Symmetric choice reduction at 2 with 346 rule applications. Total rules 1256 place count 1520 transition count 1810
Deduced a syphon composed of 346 places in 11 ms
Reduce places removed 346 places and 346 transitions.
Iterating global reduction 2 with 692 rules applied. Total rules applied 1948 place count 1174 transition count 1464
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 35 Pre rules applied. Total rules applied 1948 place count 1174 transition count 1429
Deduced a syphon composed of 35 places in 9 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 2018 place count 1139 transition count 1429
Symmetric choice reduction at 2 with 104 rule applications. Total rules 2122 place count 1139 transition count 1429
Deduced a syphon composed of 104 places in 8 ms
Reduce places removed 104 places and 104 transitions.
Iterating global reduction 2 with 208 rules applied. Total rules applied 2330 place count 1035 transition count 1325
Symmetric choice reduction at 2 with 116 rule applications. Total rules 2446 place count 1035 transition count 1325
Deduced a syphon composed of 116 places in 6 ms
Reduce places removed 116 places and 127 transitions.
Iterating global reduction 2 with 232 rules applied. Total rules applied 2678 place count 919 transition count 1198
Symmetric choice reduction at 2 with 40 rule applications. Total rules 2718 place count 919 transition count 1198
Deduced a syphon composed of 40 places in 3 ms
Reduce places removed 40 places and 69 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 2798 place count 879 transition count 1129
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 15 rules applied. Total rules applied 2813 place count 877 transition count 1116
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 2815 place count 875 transition count 1116
Symmetric choice reduction at 4 with 28 rule applications. Total rules 2843 place count 875 transition count 1116
Deduced a syphon composed of 28 places in 2 ms
Reduce places removed 28 places and 28 transitions.
Iterating global reduction 4 with 56 rules applied. Total rules applied 2899 place count 847 transition count 1088
Symmetric choice reduction at 4 with 13 rule applications. Total rules 2912 place count 847 transition count 1088
Deduced a syphon composed of 13 places in 3 ms
Reduce places removed 13 places and 26 transitions.
Iterating global reduction 4 with 26 rules applied. Total rules applied 2938 place count 834 transition count 1062
Symmetric choice reduction at 4 with 13 rule applications. Total rules 2951 place count 834 transition count 1062
Deduced a syphon composed of 13 places in 2 ms
Reduce places removed 13 places and 13 transitions.
Iterating global reduction 4 with 26 rules applied. Total rules applied 2977 place count 821 transition count 1049
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 15 rules applied. Total rules applied 2992 place count 820 transition count 1035
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 2993 place count 819 transition count 1035
Performed 266 Post agglomeration using F-continuation condition.Transition count delta: 266
Deduced a syphon composed of 266 places in 1 ms
Reduce places removed 266 places and 0 transitions.
Iterating global reduction 6 with 532 rules applied. Total rules applied 3525 place count 553 transition count 769
Symmetric choice reduction at 6 with 12 rule applications. Total rules 3537 place count 553 transition count 769
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 12 transitions.
Iterating global reduction 6 with 24 rules applied. Total rules applied 3561 place count 541 transition count 757
Symmetric choice reduction at 6 with 7 rule applications. Total rules 3568 place count 541 transition count 757
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 14 transitions.
Iterating global reduction 6 with 14 rules applied. Total rules applied 3582 place count 534 transition count 743
Symmetric choice reduction at 6 with 1 rule applications. Total rules 3583 place count 534 transition count 743
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 5 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 3585 place count 533 transition count 738
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: -125
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 6 with 58 rules applied. Total rules applied 3643 place count 504 transition count 863
Symmetric choice reduction at 6 with 1 rule applications. Total rules 3644 place count 504 transition count 863
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 3646 place count 503 transition count 861
Free-agglomeration rule applied 27 times.
Iterating global reduction 6 with 27 rules applied. Total rules applied 3673 place count 503 transition count 834
Reduce places removed 27 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 31 rules applied. Total rules applied 3704 place count 476 transition count 830
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 3705 place count 476 transition count 829
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 3706 place count 475 transition count 829
Partial Free-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 8 with 9 rules applied. Total rules applied 3715 place count 475 transition count 829
Partial Post-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 3719 place count 475 transition count 829
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 3722 place count 475 transition count 826
Applied a total of 3722 rules in 1258 ms. Remains 475 /2003 variables (removed 1528) and now considering 826/2292 (removed 1466) transitions.
Finished structural reductions, in 1 iterations. Remains : 475/2003 places, 826/2292 transitions.
Incomplete random walk after 1000000 steps, including 9830 resets, run finished after 4059 ms. (steps per millisecond=246 ) properties seen :[0, 0, 1, 1, 1, 1, 1, 0]
FORMULA NoC3x3-PT-2B-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-2B-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-2B-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-2B-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-2B-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 796 resets, run finished after 1341 ms. (steps per millisecond=745 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 628 resets, run finished after 1430 ms. (steps per millisecond=699 ) properties seen :[0, 1, 0]
FORMULA NoC3x3-PT-2B-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 722 resets, run finished after 1439 ms. (steps per millisecond=694 ) properties seen :[0, 1]
FORMULA NoC3x3-PT-2B-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2020-06-02 23:49:48] [INFO ] Flow matrix only has 778 transitions (discarded 48 similar events)
// Phase 1: matrix 778 rows 475 cols
[2020-06-02 23:49:48] [INFO ] Computed 56 place invariants in 24 ms
[2020-06-02 23:49:48] [INFO ] [Real]Absence check using 56 positive place invariants in 41 ms returned sat
[2020-06-02 23:49:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 23:49:49] [INFO ] [Real]Absence check using state equation in 750 ms returned sat
[2020-06-02 23:49:49] [INFO ] State equation strengthened by 78 read => feed constraints.
[2020-06-02 23:49:49] [INFO ] [Real]Added 78 Read/Feed constraints in 27 ms returned sat
[2020-06-02 23:49:49] [INFO ] Computed and/alt/rep : 824/6550/776 causal constraints in 87 ms.
[2020-06-02 23:49:49] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 23:49:50] [INFO ] [Nat]Absence check using 56 positive place invariants in 87 ms returned sat
[2020-06-02 23:49:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 23:49:50] [INFO ] [Nat]Absence check using state equation in 760 ms returned sat
[2020-06-02 23:49:51] [INFO ] [Nat]Added 78 Read/Feed constraints in 26 ms returned sat
[2020-06-02 23:49:51] [INFO ] Computed and/alt/rep : 824/6550/776 causal constraints in 76 ms.
[2020-06-02 23:50:05] [INFO ] Added : 541 causal constraints over 109 iterations in 14293 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 117 ms.
Finished Parikh walk after 14893 steps, including 72 resets, run visited all 1 properties in 83 ms. (steps per millisecond=179 )
FORMULA NoC3x3-PT-2B-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.

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

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-2B"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="itslola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# 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-4028"
echo " Executing tool itslola"
echo " Input is NoC3x3-PT-2B, 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 r174-csrt-158987853100359"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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