fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r111-csrt-158961257500375
Last Updated
Jun 28, 2020

About the Execution of ITS-Tools for NoC3x3-PT-3B

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15744.620 76049.00 98751.00 96.40 TTTTTTTTTTTTTTTT normal

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.r111-csrt-158961257500375.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 itstools
Input is NoC3x3-PT-3B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r111-csrt-158961257500375
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 764K
-rw-r--r-- 1 mcc users 3.9K Apr 8 15:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 8 15:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 7 18:32 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 7 18:32 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.1K Apr 14 12:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 14 12:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Apr 6 20:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 6 20:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 6 03:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 12K Apr 6 03:58 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 581K 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-3B-ReachabilityFireability-00
FORMULA_NAME NoC3x3-PT-3B-ReachabilityFireability-01
FORMULA_NAME NoC3x3-PT-3B-ReachabilityFireability-02
FORMULA_NAME NoC3x3-PT-3B-ReachabilityFireability-03
FORMULA_NAME NoC3x3-PT-3B-ReachabilityFireability-04
FORMULA_NAME NoC3x3-PT-3B-ReachabilityFireability-05
FORMULA_NAME NoC3x3-PT-3B-ReachabilityFireability-06
FORMULA_NAME NoC3x3-PT-3B-ReachabilityFireability-07
FORMULA_NAME NoC3x3-PT-3B-ReachabilityFireability-08
FORMULA_NAME NoC3x3-PT-3B-ReachabilityFireability-09
FORMULA_NAME NoC3x3-PT-3B-ReachabilityFireability-10
FORMULA_NAME NoC3x3-PT-3B-ReachabilityFireability-11
FORMULA_NAME NoC3x3-PT-3B-ReachabilityFireability-12
FORMULA_NAME NoC3x3-PT-3B-ReachabilityFireability-13
FORMULA_NAME NoC3x3-PT-3B-ReachabilityFireability-14
FORMULA_NAME NoC3x3-PT-3B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1589952822484

[2020-05-20 05:33:44] [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, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2020-05-20 05:33:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-20 05:33:44] [INFO ] Load time of PNML (sax parser for PT used): 207 ms
[2020-05-20 05:33:44] [INFO ] Transformed 2117 places.
[2020-05-20 05:33:44] [INFO ] Transformed 2435 transitions.
[2020-05-20 05:33:44] [INFO ] Found NUPN structural information;
[2020-05-20 05:33:44] [INFO ] Parsed PT model containing 2117 places and 2435 transitions in 282 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 66 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 17 resets, run finished after 102 ms. (steps per millisecond=98 ) properties seen :[1, 1, 0, 0, 0, 0, 1, 0, 1, 1, 1, 1, 0, 0, 0, 0]
FORMULA NoC3x3-PT-3B-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3B-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3B-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3B-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3B-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3B-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3B-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) 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 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 44 ms. (steps per millisecond=227 ) properties seen :[0, 0, 0, 0, 0, 1, 0, 0, 0]
FORMULA NoC3x3-PT-3B-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 1 resets, run finished after 14 ms. (steps per millisecond=714 ) properties seen :[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, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 1 resets, run finished after 14 ms. (steps per millisecond=714 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 1 resets, run finished after 14 ms. (steps per millisecond=714 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 2435 rows 2117 cols
[2020-05-20 05:33:45] [INFO ] Computed 66 place invariants in 100 ms
[2020-05-20 05:33:46] [INFO ] [Real]Absence check using 66 positive place invariants in 216 ms returned sat
[2020-05-20 05:33:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-20 05:33:50] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-20 05:33:50] [INFO ] [Real]Absence check using state equation in 4333 ms returned (error "Failed to check-sat")
[2020-05-20 05:33:50] [INFO ] [Real]Absence check using 66 positive place invariants in 172 ms returned sat
[2020-05-20 05:33:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-20 05:33:55] [INFO ] [Real]Absence check using state equation in 4524 ms returned (error "Solver has unexpectedly terminated")
[2020-05-20 05:33:56] [INFO ] [Real]Absence check using 66 positive place invariants in 169 ms returned sat
[2020-05-20 05:33:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-20 05:34:00] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-20 05:34:00] [INFO ] [Real]Absence check using state equation in 4445 ms returned (error "Failed to check-sat")
[2020-05-20 05:34:01] [INFO ] [Real]Absence check using 66 positive place invariants in 169 ms returned sat
[2020-05-20 05:34:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-20 05:34:05] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-20 05:34:05] [INFO ] [Real]Absence check using state equation in 4545 ms returned (error "Failed to check-sat")
[2020-05-20 05:34:05] [INFO ] [Real]Absence check using 66 positive place invariants in 177 ms returned sat
[2020-05-20 05:34:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-20 05:34:10] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-20 05:34:10] [INFO ] [Real]Absence check using state equation in 4592 ms returned (error "Failed to check-sat")
[2020-05-20 05:34:11] [INFO ] [Real]Absence check using 66 positive place invariants in 165 ms returned sat
[2020-05-20 05:34:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-20 05:34:15] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-20 05:34:15] [INFO ] [Real]Absence check using state equation in 4569 ms returned (error "Failed to check-sat")
[2020-05-20 05:34:16] [INFO ] [Real]Absence check using 66 positive place invariants in 167 ms returned sat
[2020-05-20 05:34:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-20 05:34:20] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-20 05:34:20] [INFO ] [Real]Absence check using state equation in 4573 ms returned (error "Failed to check-sat")
[2020-05-20 05:34:21] [INFO ] [Real]Absence check using 66 positive place invariants in 182 ms returned sat
[2020-05-20 05:34:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-20 05:34:25] [INFO ] [Real]Absence check using state equation in 4574 ms returned (error "Failed to check-sat")
Support contains 40 out of 2117 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2117/2117 places, 2435/2435 transitions.
Graph (trivial) has 1668 edges and 2117 vertex of which 72 / 2117 are part of one of the 9 SCC in 13 ms
Free SCC test removed 63 places
Drop transitions removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Discarding 5 places :
Implicit places reduction removed 5 places
Performed 431 Post agglomeration using F-continuation condition.Transition count delta: 431
Iterating post reduction 0 with 508 rules applied. Total rules applied 509 place count 2049 transition count 1932
Reduce places removed 431 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 437 rules applied. Total rules applied 946 place count 1618 transition count 1926
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 949 place count 1615 transition count 1926
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 23 Pre rules applied. Total rules applied 949 place count 1615 transition count 1903
Deduced a syphon composed of 23 places in 11 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 46 rules applied. Total rules applied 995 place count 1592 transition count 1903
Symmetric choice reduction at 3 with 360 rule applications. Total rules 1355 place count 1592 transition count 1903
Deduced a syphon composed of 360 places in 13 ms
Reduce places removed 360 places and 360 transitions.
Iterating global reduction 3 with 720 rules applied. Total rules applied 2075 place count 1232 transition count 1543
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 39 Pre rules applied. Total rules applied 2075 place count 1232 transition count 1504
Deduced a syphon composed of 39 places in 10 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 3 with 78 rules applied. Total rules applied 2153 place count 1193 transition count 1504
Symmetric choice reduction at 3 with 112 rule applications. Total rules 2265 place count 1193 transition count 1504
Deduced a syphon composed of 112 places in 22 ms
Reduce places removed 112 places and 112 transitions.
Iterating global reduction 3 with 224 rules applied. Total rules applied 2489 place count 1081 transition count 1392
Symmetric choice reduction at 3 with 127 rule applications. Total rules 2616 place count 1081 transition count 1392
Deduced a syphon composed of 127 places in 38 ms
Reduce places removed 127 places and 139 transitions.
Iterating global reduction 3 with 254 rules applied. Total rules applied 2870 place count 954 transition count 1253
Symmetric choice reduction at 3 with 47 rule applications. Total rules 2917 place count 954 transition count 1253
Deduced a syphon composed of 47 places in 3 ms
Reduce places removed 47 places and 90 transitions.
Iterating global reduction 3 with 94 rules applied. Total rules applied 3011 place count 907 transition count 1163
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 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 3 with 16 rules applied. Total rules applied 3027 place count 905 transition count 1149
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 3029 place count 903 transition count 1149
Symmetric choice reduction at 5 with 33 rule applications. Total rules 3062 place count 903 transition count 1149
Deduced a syphon composed of 33 places in 3 ms
Reduce places removed 33 places and 33 transitions.
Iterating global reduction 5 with 66 rules applied. Total rules applied 3128 place count 870 transition count 1116
Discarding 3 places :
Implicit places reduction removed 3 places
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 5 with 6 rules applied. Total rules applied 3134 place count 867 transition count 1113
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 3137 place count 864 transition count 1113
Symmetric choice reduction at 7 with 22 rule applications. Total rules 3159 place count 864 transition count 1113
Deduced a syphon composed of 22 places in 3 ms
Reduce places removed 22 places and 44 transitions.
Iterating global reduction 7 with 44 rules applied. Total rules applied 3203 place count 842 transition count 1069
Symmetric choice reduction at 7 with 22 rule applications. Total rules 3225 place count 842 transition count 1069
Deduced a syphon composed of 22 places in 2 ms
Reduce places removed 22 places and 22 transitions.
Iterating global reduction 7 with 44 rules applied. Total rules applied 3269 place count 820 transition count 1047
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 7 with 30 rules applied. Total rules applied 3299 place count 816 transition count 1021
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 3303 place count 812 transition count 1021
Performed 287 Post agglomeration using F-continuation condition.Transition count delta: 287
Deduced a syphon composed of 287 places in 1 ms
Reduce places removed 287 places and 0 transitions.
Iterating global reduction 9 with 574 rules applied. Total rules applied 3877 place count 525 transition count 734
Symmetric choice reduction at 9 with 15 rule applications. Total rules 3892 place count 525 transition count 734
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 15 transitions.
Iterating global reduction 9 with 30 rules applied. Total rules applied 3922 place count 510 transition count 719
Symmetric choice reduction at 9 with 9 rule applications. Total rules 3931 place count 510 transition count 719
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 18 transitions.
Iterating global reduction 9 with 18 rules applied. Total rules applied 3949 place count 501 transition count 701
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 3951 place count 501 transition count 699
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: -127
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 10 with 54 rules applied. Total rules applied 4005 place count 474 transition count 826
Free-agglomeration rule applied 25 times.
Iterating global reduction 10 with 25 rules applied. Total rules applied 4030 place count 474 transition count 801
Reduce places removed 25 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 10 with 30 rules applied. Total rules applied 4060 place count 449 transition count 796
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 11 with 4 rules applied. Total rules applied 4064 place count 449 transition count 792
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 11 with 4 rules applied. Total rules applied 4068 place count 445 transition count 792
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 12 with 5 rules applied. Total rules applied 4073 place count 445 transition count 792
Partial Post-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 12 with 4 rules applied. Total rules applied 4077 place count 445 transition count 792
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 4078 place count 445 transition count 791
Applied a total of 4078 rules in 2158 ms. Remains 445 /2117 variables (removed 1672) and now considering 791/2435 (removed 1644) transitions.
Finished structural reductions, in 1 iterations. Remains : 445/2117 places, 791/2435 transitions.
Incomplete random walk after 1000000 steps, including 12350 resets, run finished after 4104 ms. (steps per millisecond=243 ) properties seen :[1, 1, 1, 0, 1, 0, 1, 1]
FORMULA NoC3x3-PT-3B-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3B-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3B-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3B-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3B-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3B-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 719 resets, run finished after 1392 ms. (steps per millisecond=718 ) properties seen :[1, 0]
FORMULA NoC3x3-PT-3B-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 825 resets, run finished after 1047 ms. (steps per millisecond=955 ) properties seen :[0]
[2020-05-20 05:34:34] [INFO ] Flow matrix only has 731 transitions (discarded 60 similar events)
// Phase 1: matrix 731 rows 445 cols
[2020-05-20 05:34:34] [INFO ] Computed 54 place invariants in 11 ms
[2020-05-20 05:34:34] [INFO ] [Real]Absence check using 54 positive place invariants in 37 ms returned sat
[2020-05-20 05:34:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-20 05:34:35] [INFO ] [Real]Absence check using state equation in 741 ms returned sat
[2020-05-20 05:34:35] [INFO ] State equation strengthened by 90 read => feed constraints.
[2020-05-20 05:34:35] [INFO ] [Real]Added 90 Read/Feed constraints in 27 ms returned sat
[2020-05-20 05:34:35] [INFO ] Computed and/alt/rep : 785/8504/725 causal constraints in 53 ms.
[2020-05-20 05:34:35] [INFO ] Solution in real domain found non-integer solution.
[2020-05-20 05:34:35] [INFO ] [Nat]Absence check using 54 positive place invariants in 60 ms returned sat
[2020-05-20 05:34:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-20 05:34:36] [INFO ] [Nat]Absence check using state equation in 778 ms returned sat
[2020-05-20 05:34:36] [INFO ] [Nat]Added 90 Read/Feed constraints in 43 ms returned sat
[2020-05-20 05:34:36] [INFO ] Deduced a trap composed of 14 places in 70 ms
[2020-05-20 05:34:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 127 ms
[2020-05-20 05:34:36] [INFO ] Computed and/alt/rep : 785/8504/725 causal constraints in 48 ms.
[2020-05-20 05:34:57] [INFO ] Added : 513 causal constraints over 103 iterations in 21012 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 149 ms.
Finished Parikh walk after 30081 steps, including 218 resets, run visited all 1 properties in 144 ms. (steps per millisecond=208 )
FORMULA NoC3x3-PT-3B-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.

BK_STOP 1589952898533

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution ReachabilityFireability -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination ReachabilityFireability -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6

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-3B"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="itstools"
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 itstools"
echo " Input is NoC3x3-PT-3B, 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 r111-csrt-158961257500375"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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