fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r211-tajo-159033477100183
Last Updated
Jun 28, 2020

About the Execution of ITS-LoLa for ShieldIIPs-PT-040B

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15740.140 3600000.00 6951006.00 436.00 TTTTFTTTFTTTT?TT normal

Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2020-input.r211-tajo-159033477100183.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.......................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is ShieldIIPs-PT-040B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r211-tajo-159033477100183
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 832K
-rw-r--r-- 1 mcc users 3.1K May 14 00:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 16K May 14 00:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 13 17:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 13 17:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K May 14 10:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 14 10:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 14 10:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 14 10:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 20:42 NewModel
-rw-r--r-- 1 mcc users 3.0K May 13 13:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 14K May 13 13:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 13 07:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K May 13 07:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 13 16:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 13 16:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 20:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 12 20:42 instance
-rw-r--r-- 1 mcc users 6 May 12 20:42 iscolored
-rw-r--r-- 1 mcc users 675K May 12 20:42 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 ShieldIIPs-PT-040B-ReachabilityFireability-00
FORMULA_NAME ShieldIIPs-PT-040B-ReachabilityFireability-01
FORMULA_NAME ShieldIIPs-PT-040B-ReachabilityFireability-02
FORMULA_NAME ShieldIIPs-PT-040B-ReachabilityFireability-03
FORMULA_NAME ShieldIIPs-PT-040B-ReachabilityFireability-04
FORMULA_NAME ShieldIIPs-PT-040B-ReachabilityFireability-05
FORMULA_NAME ShieldIIPs-PT-040B-ReachabilityFireability-06
FORMULA_NAME ShieldIIPs-PT-040B-ReachabilityFireability-07
FORMULA_NAME ShieldIIPs-PT-040B-ReachabilityFireability-08
FORMULA_NAME ShieldIIPs-PT-040B-ReachabilityFireability-09
FORMULA_NAME ShieldIIPs-PT-040B-ReachabilityFireability-10
FORMULA_NAME ShieldIIPs-PT-040B-ReachabilityFireability-11
FORMULA_NAME ShieldIIPs-PT-040B-ReachabilityFireability-12
FORMULA_NAME ShieldIIPs-PT-040B-ReachabilityFireability-13
FORMULA_NAME ShieldIIPs-PT-040B-ReachabilityFireability-14
FORMULA_NAME ShieldIIPs-PT-040B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1591291611928

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-04 17:26:53] [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-04 17:26:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-04 17:26:53] [INFO ] Load time of PNML (sax parser for PT used): 148 ms
[2020-06-04 17:26:53] [INFO ] Transformed 2403 places.
[2020-06-04 17:26:53] [INFO ] Transformed 2363 transitions.
[2020-06-04 17:26:53] [INFO ] Found NUPN structural information;
[2020-06-04 17:26:53] [INFO ] Parsed PT model containing 2403 places and 2363 transitions in 275 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 68 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 152 ms. (steps per millisecond=65 ) properties seen :[1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 0, 1, 1]
FORMULA ShieldIIPs-PT-040B-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040B-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040B-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040B-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040B-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040B-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040B-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040B-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040B-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040B-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040B-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040B-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040B-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 23 ms. (steps per millisecond=434 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 27 ms. (steps per millisecond=370 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 21 ms. (steps per millisecond=476 ) properties seen :[0, 0, 0]
// Phase 1: matrix 2363 rows 2403 cols
[2020-06-04 17:26:54] [INFO ] Computed 361 place invariants in 71 ms
[2020-06-04 17:26:55] [INFO ] [Real]Absence check using 361 positive place invariants in 602 ms returned sat
[2020-06-04 17:26:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 17:26:59] [INFO ] [Real]Absence check using state equation in 4036 ms returned (error "Solver has unexpectedly terminated")
[2020-06-04 17:26:59] [INFO ] [Real]Absence check using 361 positive place invariants in 438 ms returned sat
[2020-06-04 17:26:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 17:27:04] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 17:27:04] [INFO ] [Real]Absence check using state equation in 4340 ms returned unknown
[2020-06-04 17:27:05] [INFO ] [Real]Absence check using 361 positive place invariants in 431 ms returned sat
[2020-06-04 17:27:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 17:27:09] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 17:27:09] [INFO ] [Real]Absence check using state equation in 4156 ms returned (error "Failed to check-sat")
Support contains 13 out of 2403 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2403/2403 places, 2363/2363 transitions.
Performed 198 Post agglomeration using F-continuation condition.Transition count delta: 198
Iterating post reduction 0 with 198 rules applied. Total rules applied 198 place count 2403 transition count 2165
Reduce places removed 198 places and 0 transitions.
Iterating post reduction 1 with 198 rules applied. Total rules applied 396 place count 2205 transition count 2165
Performed 202 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 202 Pre rules applied. Total rules applied 396 place count 2205 transition count 1963
Deduced a syphon composed of 202 places in 13 ms
Reduce places removed 202 places and 0 transitions.
Iterating global reduction 2 with 404 rules applied. Total rules applied 800 place count 2003 transition count 1963
Symmetric choice reduction at 2 with 278 rule applications. Total rules 1078 place count 2003 transition count 1963
Deduced a syphon composed of 278 places in 5 ms
Reduce places removed 278 places and 278 transitions.
Iterating global reduction 2 with 556 rules applied. Total rules applied 1634 place count 1725 transition count 1685
Performed 117 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 117 Pre rules applied. Total rules applied 1634 place count 1725 transition count 1568
Deduced a syphon composed of 117 places in 8 ms
Reduce places removed 117 places and 0 transitions.
Iterating global reduction 2 with 234 rules applied. Total rules applied 1868 place count 1608 transition count 1568
Performed 594 Post agglomeration using F-continuation condition.Transition count delta: 594
Deduced a syphon composed of 594 places in 3 ms
Reduce places removed 594 places and 0 transitions.
Iterating global reduction 2 with 1188 rules applied. Total rules applied 3056 place count 1014 transition count 974
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 273 times.
Drop transitions removed 273 transitions
Iterating global reduction 2 with 273 rules applied. Total rules applied 3329 place count 1014 transition count 974
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 3330 place count 1014 transition count 974
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 3331 place count 1013 transition count 973
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3332 place count 1012 transition count 973
Applied a total of 3332 rules in 1390 ms. Remains 1012 /2403 variables (removed 1391) and now considering 973/2363 (removed 1390) transitions.
Finished structural reductions, in 1 iterations. Remains : 1012/2403 places, 973/2363 transitions.
Incomplete random walk after 1000000 steps, including 7 resets, run finished after 7189 ms. (steps per millisecond=139 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 8 resets, run finished after 4261 ms. (steps per millisecond=234 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 3 resets, run finished after 4279 ms. (steps per millisecond=233 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 9 resets, run finished after 3791 ms. (steps per millisecond=263 ) properties seen :[0, 0, 0]
Interrupted probabilistic random walk after 1803766 steps, run timeout after 30001 ms. (steps per millisecond=60 ) properties seen :[0, 0, 0]
Probabilistic random walk after 1803766 steps, saw 279759 distinct states, run finished after 30001 ms. (steps per millisecond=60 ) properties seen :[0, 0, 0]
// Phase 1: matrix 973 rows 1012 cols
[2020-06-04 17:28:00] [INFO ] Computed 360 place invariants in 113 ms
[2020-06-04 17:28:00] [INFO ] [Real]Absence check using 357 positive place invariants in 169 ms returned sat
[2020-06-04 17:28:00] [INFO ] [Real]Absence check using 357 positive and 3 generalized place invariants in 3 ms returned sat
[2020-06-04 17:28:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 17:28:02] [INFO ] [Real]Absence check using state equation in 1998 ms returned sat
[2020-06-04 17:28:02] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 17:28:03] [INFO ] [Nat]Absence check using 357 positive place invariants in 234 ms returned sat
[2020-06-04 17:28:03] [INFO ] [Nat]Absence check using 357 positive and 3 generalized place invariants in 5 ms returned sat
[2020-06-04 17:28:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 17:28:05] [INFO ] [Nat]Absence check using state equation in 2343 ms returned sat
[2020-06-04 17:28:05] [INFO ] Deduced a trap composed of 3 places in 186 ms
[2020-06-04 17:28:06] [INFO ] Deduced a trap composed of 6 places in 254 ms
[2020-06-04 17:28:06] [INFO ] Deduced a trap composed of 5 places in 183 ms
[2020-06-04 17:28:06] [INFO ] Deduced a trap composed of 5 places in 232 ms
[2020-06-04 17:28:06] [INFO ] Deduced a trap composed of 7 places in 178 ms
[2020-06-04 17:28:06] [INFO ] Deduced a trap composed of 4 places in 113 ms
[2020-06-04 17:28:07] [INFO ] Deduced a trap composed of 6 places in 142 ms
[2020-06-04 17:28:07] [INFO ] Deduced a trap composed of 17 places in 146 ms
[2020-06-04 17:28:07] [INFO ] Deduced a trap composed of 11 places in 134 ms
[2020-06-04 17:28:07] [INFO ] Deduced a trap composed of 11 places in 212 ms
[2020-06-04 17:28:09] [INFO ] Deduced a trap composed of 4 places in 1123 ms
[2020-06-04 17:28:09] [INFO ] Deduced a trap composed of 9 places in 102 ms
[2020-06-04 17:28:09] [INFO ] Deduced a trap composed of 9 places in 110 ms
[2020-06-04 17:28:09] [INFO ] Deduced a trap composed of 15 places in 77 ms
[2020-06-04 17:28:09] [INFO ] Deduced a trap composed of 3 places in 65 ms
[2020-06-04 17:28:09] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 4050 ms
[2020-06-04 17:28:09] [INFO ] Computed and/alt/rep : 966/3271/966 causal constraints in 68 ms.
[2020-06-04 17:28:30] [INFO ] Added : 805 causal constraints over 161 iterations in 20465 ms.(timeout) Result :sat
[2020-06-04 17:28:30] [INFO ] Deduced a trap composed of 7 places in 114 ms
[2020-06-04 17:28:30] [INFO ] Deduced a trap composed of 8 places in 117 ms
[2020-06-04 17:28:30] [INFO ] Deduced a trap composed of 5 places in 89 ms
[2020-06-04 17:28:30] [INFO ] Deduced a trap composed of 5 places in 62 ms
[2020-06-04 17:28:31] [INFO ] Deduced a trap composed of 9 places in 82 ms
[2020-06-04 17:28:31] [INFO ] Deduced a trap composed of 7 places in 96 ms
[2020-06-04 17:28:31] [INFO ] Deduced a trap composed of 9 places in 67 ms
[2020-06-04 17:28:31] [INFO ] Deduced a trap composed of 5 places in 52 ms
[2020-06-04 17:28:31] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1957 ms
Attempting to minimize the solution found.
Minimization took 95 ms.
[2020-06-04 17:28:32] [INFO ] [Real]Absence check using 357 positive place invariants in 232 ms returned sat
[2020-06-04 17:28:32] [INFO ] [Real]Absence check using 357 positive and 3 generalized place invariants in 4 ms returned sat
[2020-06-04 17:28:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 17:28:34] [INFO ] [Real]Absence check using state equation in 1817 ms returned sat
[2020-06-04 17:28:34] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 17:28:34] [INFO ] [Nat]Absence check using 357 positive place invariants in 227 ms returned sat
[2020-06-04 17:28:34] [INFO ] [Nat]Absence check using 357 positive and 3 generalized place invariants in 3 ms returned sat
[2020-06-04 17:28:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 17:28:36] [INFO ] [Nat]Absence check using state equation in 2004 ms returned sat
[2020-06-04 17:28:37] [INFO ] Deduced a trap composed of 7 places in 202 ms
[2020-06-04 17:28:37] [INFO ] Deduced a trap composed of 6 places in 153 ms
[2020-06-04 17:28:37] [INFO ] Deduced a trap composed of 4 places in 231 ms
[2020-06-04 17:28:37] [INFO ] Deduced a trap composed of 9 places in 232 ms
[2020-06-04 17:28:38] [INFO ] Deduced a trap composed of 6 places in 223 ms
[2020-06-04 17:28:38] [INFO ] Deduced a trap composed of 5 places in 192 ms
[2020-06-04 17:28:38] [INFO ] Deduced a trap composed of 6 places in 208 ms
[2020-06-04 17:28:38] [INFO ] Deduced a trap composed of 7 places in 187 ms
[2020-06-04 17:28:39] [INFO ] Deduced a trap composed of 3 places in 134 ms
[2020-06-04 17:28:39] [INFO ] Deduced a trap composed of 11 places in 124 ms
[2020-06-04 17:28:39] [INFO ] Deduced a trap composed of 7 places in 87 ms
[2020-06-04 17:28:39] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 2544 ms
[2020-06-04 17:28:39] [INFO ] Computed and/alt/rep : 966/3271/966 causal constraints in 71 ms.
[2020-06-04 17:28:59] [INFO ] Added : 790 causal constraints over 158 iterations in 20075 ms.(timeout) Result :sat
[2020-06-04 17:28:59] [INFO ] Deduced a trap composed of 6 places in 26 ms
[2020-06-04 17:28:59] [INFO ] Deduced a trap composed of 6 places in 26 ms
[2020-06-04 17:28:59] [INFO ] Deduced a trap composed of 8 places in 36 ms
[2020-06-04 17:29:00] [INFO ] Deduced a trap composed of 9 places in 33 ms
[2020-06-04 17:29:00] [INFO ] Deduced a trap composed of 9 places in 30 ms
[2020-06-04 17:29:00] [INFO ] Deduced a trap composed of 5 places in 31 ms
[2020-06-04 17:29:00] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1045 ms
Attempting to minimize the solution found.
Minimization took 97 ms.
[2020-06-04 17:29:01] [INFO ] [Real]Absence check using 357 positive place invariants in 223 ms returned sat
[2020-06-04 17:29:01] [INFO ] [Real]Absence check using 357 positive and 3 generalized place invariants in 3 ms returned sat
[2020-06-04 17:29:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 17:29:03] [INFO ] [Real]Absence check using state equation in 2036 ms returned sat
[2020-06-04 17:29:03] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 17:29:03] [INFO ] [Nat]Absence check using 357 positive place invariants in 325 ms returned sat
[2020-06-04 17:29:03] [INFO ] [Nat]Absence check using 357 positive and 3 generalized place invariants in 3 ms returned sat
[2020-06-04 17:29:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 17:29:05] [INFO ] [Nat]Absence check using state equation in 1952 ms returned sat
[2020-06-04 17:29:05] [INFO ] Deduced a trap composed of 5 places in 183 ms
[2020-06-04 17:29:06] [INFO ] Deduced a trap composed of 6 places in 128 ms
[2020-06-04 17:29:06] [INFO ] Deduced a trap composed of 6 places in 152 ms
[2020-06-04 17:29:06] [INFO ] Deduced a trap composed of 10 places in 151 ms
[2020-06-04 17:29:06] [INFO ] Deduced a trap composed of 5 places in 178 ms
[2020-06-04 17:29:06] [INFO ] Deduced a trap composed of 4 places in 172 ms
[2020-06-04 17:29:07] [INFO ] Deduced a trap composed of 6 places in 159 ms
[2020-06-04 17:29:07] [INFO ] Deduced a trap composed of 11 places in 166 ms
[2020-06-04 17:29:07] [INFO ] Deduced a trap composed of 9 places in 155 ms
[2020-06-04 17:29:07] [INFO ] Deduced a trap composed of 16 places in 129 ms
[2020-06-04 17:29:07] [INFO ] Deduced a trap composed of 15 places in 113 ms
[2020-06-04 17:29:08] [INFO ] Deduced a trap composed of 17 places in 86 ms
[2020-06-04 17:29:08] [INFO ] Deduced a trap composed of 14 places in 83 ms
[2020-06-04 17:29:08] [INFO ] Deduced a trap composed of 11 places in 146 ms
[2020-06-04 17:29:08] [INFO ] Deduced a trap composed of 20 places in 119 ms
[2020-06-04 17:29:08] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 2849 ms
[2020-06-04 17:29:08] [INFO ] Computed and/alt/rep : 966/3271/966 causal constraints in 62 ms.
[2020-06-04 17:29:28] [INFO ] Added : 770 causal constraints over 154 iterations in 20289 ms.(timeout) Result :sat
[2020-06-04 17:29:29] [INFO ] Deduced a trap composed of 14 places in 155 ms
[2020-06-04 17:29:29] [INFO ] Deduced a trap composed of 5 places in 127 ms
[2020-06-04 17:29:29] [INFO ] Deduced a trap composed of 8 places in 129 ms
[2020-06-04 17:29:29] [INFO ] Deduced a trap composed of 16 places in 115 ms
[2020-06-04 17:29:30] [INFO ] Deduced a trap composed of 17 places in 84 ms
[2020-06-04 17:29:30] [INFO ] Deduced a trap composed of 4 places in 82 ms
[2020-06-04 17:29:30] [INFO ] Deduced a trap composed of 7 places in 86 ms
[2020-06-04 17:29:30] [INFO ] Deduced a trap composed of 8 places in 60 ms
[2020-06-04 17:29:31] [INFO ] Deduced a trap composed of 4 places in 31 ms
[2020-06-04 17:29:31] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 2275 ms
Attempting to minimize the solution found.
Minimization took 105 ms.
Incomplete Parikh walk after 167700 steps, including 895 resets, run finished after 1639 ms. (steps per millisecond=102 ) properties seen :[0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 145700 steps, including 958 resets, run finished after 931 ms. (steps per millisecond=156 ) properties seen :[0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 153000 steps, including 790 resets, run finished after 916 ms. (steps per millisecond=167 ) properties seen :[0, 0, 0] could not realise parikh vector
Support contains 13 out of 1012 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1012/1012 places, 973/973 transitions.
Applied a total of 0 rules in 23 ms. Remains 1012 /1012 variables (removed 0) and now considering 973/973 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1012/1012 places, 973/973 transitions.
Starting structural reductions, iteration 0 : 1012/1012 places, 973/973 transitions.
Applied a total of 0 rules in 22 ms. Remains 1012 /1012 variables (removed 0) and now considering 973/973 (removed 0) transitions.
// Phase 1: matrix 973 rows 1012 cols
[2020-06-04 17:29:34] [INFO ] Computed 360 place invariants in 28 ms
[2020-06-04 17:29:37] [INFO ] Implicit Places using invariants in 3030 ms returned []
// Phase 1: matrix 973 rows 1012 cols
[2020-06-04 17:29:37] [INFO ] Computed 360 place invariants in 12 ms
[2020-06-04 17:29:47] [INFO ] Implicit Places using invariants and state equation in 9856 ms returned []
Implicit Place search using SMT with State Equation took 12901 ms to find 0 implicit places.
[2020-06-04 17:29:47] [INFO ] Redundant transitions in 187 ms returned []
// Phase 1: matrix 973 rows 1012 cols
[2020-06-04 17:29:47] [INFO ] Computed 360 place invariants in 11 ms
[2020-06-04 17:29:50] [INFO ] Dead Transitions using invariants and state equation in 2104 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1012/1012 places, 973/973 transitions.
Incomplete random walk after 100000 steps, including 11 resets, run finished after 880 ms. (steps per millisecond=113 ) properties seen :[0, 0, 0]
// Phase 1: matrix 973 rows 1012 cols
[2020-06-04 17:29:50] [INFO ] Computed 360 place invariants in 10 ms
[2020-06-04 17:29:51] [INFO ] [Real]Absence check using 357 positive place invariants in 223 ms returned sat
[2020-06-04 17:29:51] [INFO ] [Real]Absence check using 357 positive and 3 generalized place invariants in 3 ms returned sat
[2020-06-04 17:29:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 17:29:53] [INFO ] [Real]Absence check using state equation in 2122 ms returned sat
[2020-06-04 17:29:53] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 17:29:53] [INFO ] [Nat]Absence check using 357 positive place invariants in 199 ms returned sat
[2020-06-04 17:29:53] [INFO ] [Nat]Absence check using 357 positive and 3 generalized place invariants in 2 ms returned sat
[2020-06-04 17:29:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 17:29:55] [INFO ] [Nat]Absence check using state equation in 1852 ms returned sat
[2020-06-04 17:29:55] [INFO ] Deduced a trap composed of 3 places in 153 ms
[2020-06-04 17:29:56] [INFO ] Deduced a trap composed of 6 places in 134 ms
[2020-06-04 17:29:56] [INFO ] Deduced a trap composed of 5 places in 149 ms
[2020-06-04 17:29:56] [INFO ] Deduced a trap composed of 5 places in 119 ms
[2020-06-04 17:29:56] [INFO ] Deduced a trap composed of 7 places in 95 ms
[2020-06-04 17:29:56] [INFO ] Deduced a trap composed of 4 places in 126 ms
[2020-06-04 17:29:56] [INFO ] Deduced a trap composed of 6 places in 134 ms
[2020-06-04 17:29:56] [INFO ] Deduced a trap composed of 17 places in 78 ms
[2020-06-04 17:29:57] [INFO ] Deduced a trap composed of 11 places in 75 ms
[2020-06-04 17:29:57] [INFO ] Deduced a trap composed of 11 places in 82 ms
[2020-06-04 17:29:57] [INFO ] Deduced a trap composed of 4 places in 110 ms
[2020-06-04 17:29:57] [INFO ] Deduced a trap composed of 9 places in 86 ms
[2020-06-04 17:29:57] [INFO ] Deduced a trap composed of 9 places in 83 ms
[2020-06-04 17:29:57] [INFO ] Deduced a trap composed of 15 places in 66 ms
[2020-06-04 17:29:57] [INFO ] Deduced a trap composed of 3 places in 63 ms
[2020-06-04 17:29:57] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 2104 ms
[2020-06-04 17:29:57] [INFO ] Computed and/alt/rep : 966/3271/966 causal constraints in 42 ms.
[2020-06-04 17:30:13] [INFO ] Added : 690 causal constraints over 138 iterations in 15730 ms. Result :unknown
[2020-06-04 17:30:13] [INFO ] [Real]Absence check using 357 positive place invariants in 230 ms returned sat
[2020-06-04 17:30:13] [INFO ] [Real]Absence check using 357 positive and 3 generalized place invariants in 2 ms returned sat
[2020-06-04 17:30:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 17:30:15] [INFO ] [Real]Absence check using state equation in 1993 ms returned sat
[2020-06-04 17:30:15] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 17:30:16] [INFO ] [Nat]Absence check using 357 positive place invariants in 245 ms returned sat
[2020-06-04 17:30:16] [INFO ] [Nat]Absence check using 357 positive and 3 generalized place invariants in 4 ms returned sat
[2020-06-04 17:30:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 17:30:18] [INFO ] [Nat]Absence check using state equation in 1928 ms returned sat
[2020-06-04 17:30:18] [INFO ] Deduced a trap composed of 7 places in 153 ms
[2020-06-04 17:30:18] [INFO ] Deduced a trap composed of 6 places in 137 ms
[2020-06-04 17:30:18] [INFO ] Deduced a trap composed of 4 places in 139 ms
[2020-06-04 17:30:19] [INFO ] Deduced a trap composed of 9 places in 118 ms
[2020-06-04 17:30:19] [INFO ] Deduced a trap composed of 6 places in 149 ms
[2020-06-04 17:30:19] [INFO ] Deduced a trap composed of 5 places in 87 ms
[2020-06-04 17:30:19] [INFO ] Deduced a trap composed of 6 places in 130 ms
[2020-06-04 17:30:19] [INFO ] Deduced a trap composed of 7 places in 130 ms
[2020-06-04 17:30:20] [INFO ] Deduced a trap composed of 3 places in 151 ms
[2020-06-04 17:30:20] [INFO ] Deduced a trap composed of 11 places in 115 ms
[2020-06-04 17:30:20] [INFO ] Deduced a trap composed of 7 places in 99 ms
[2020-06-04 17:30:20] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 2113 ms
[2020-06-04 17:30:20] [INFO ] Computed and/alt/rep : 966/3271/966 causal constraints in 109 ms.
[2020-06-04 17:30:36] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe (=> (> t768 0) (or (and (> t483 0) (< o483 o768)) (and (> t487 0) (< o487 o768))))") while checking expression at index 1
[2020-06-04 17:30:36] [INFO ] [Real]Absence check using 357 positive place invariants in 238 ms returned sat
[2020-06-04 17:30:36] [INFO ] [Real]Absence check using 357 positive and 3 generalized place invariants in 13 ms returned sat
[2020-06-04 17:30:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 17:30:38] [INFO ] [Real]Absence check using state equation in 1915 ms returned sat
[2020-06-04 17:30:38] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 17:30:39] [INFO ] [Nat]Absence check using 357 positive place invariants in 277 ms returned sat
[2020-06-04 17:30:39] [INFO ] [Nat]Absence check using 357 positive and 3 generalized place invariants in 5 ms returned sat
[2020-06-04 17:30:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 17:30:41] [INFO ] [Nat]Absence check using state equation in 2251 ms returned sat
[2020-06-04 17:30:41] [INFO ] Deduced a trap composed of 5 places in 172 ms
[2020-06-04 17:30:41] [INFO ] Deduced a trap composed of 6 places in 167 ms
[2020-06-04 17:30:41] [INFO ] Deduced a trap composed of 6 places in 202 ms
[2020-06-04 17:30:42] [INFO ] Deduced a trap composed of 10 places in 140 ms
[2020-06-04 17:30:42] [INFO ] Deduced a trap composed of 5 places in 120 ms
[2020-06-04 17:30:42] [INFO ] Deduced a trap composed of 4 places in 118 ms
[2020-06-04 17:30:42] [INFO ] Deduced a trap composed of 6 places in 118 ms
[2020-06-04 17:30:42] [INFO ] Deduced a trap composed of 11 places in 127 ms
[2020-06-04 17:30:42] [INFO ] Deduced a trap composed of 9 places in 143 ms
[2020-06-04 17:30:43] [INFO ] Deduced a trap composed of 16 places in 122 ms
[2020-06-04 17:30:43] [INFO ] Deduced a trap composed of 15 places in 76 ms
[2020-06-04 17:30:43] [INFO ] Deduced a trap composed of 17 places in 128 ms
[2020-06-04 17:30:43] [INFO ] Deduced a trap composed of 14 places in 74 ms
[2020-06-04 17:30:43] [INFO ] Deduced a trap composed of 11 places in 70 ms
[2020-06-04 17:30:43] [INFO ] Deduced a trap composed of 20 places in 89 ms
[2020-06-04 17:30:43] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 2471 ms
[2020-06-04 17:30:43] [INFO ] Computed and/alt/rep : 966/3271/966 causal constraints in 69 ms.
[2020-06-04 17:30:58] [INFO ] Added : 700 causal constraints over 140 iterations in 14690 ms. Result :(error "Failed to check-sat")
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 1012 transition count 973
Applied a total of 1 rules in 57 ms. Remains 1012 /1012 variables (removed 0) and now considering 973/973 (removed 0) transitions.
// Phase 1: matrix 973 rows 1012 cols
[2020-06-04 17:30:58] [INFO ] Computed 360 place invariants in 11 ms
[2020-06-04 17:30:59] [INFO ] [Real]Absence check using 357 positive place invariants in 227 ms returned sat
[2020-06-04 17:30:59] [INFO ] [Real]Absence check using 357 positive and 3 generalized place invariants in 3 ms returned sat
[2020-06-04 17:30:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 17:31:01] [INFO ] [Real]Absence check using state equation in 2044 ms returned sat
[2020-06-04 17:31:01] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 17:31:01] [INFO ] [Nat]Absence check using 357 positive place invariants in 167 ms returned sat
[2020-06-04 17:31:01] [INFO ] [Nat]Absence check using 357 positive and 3 generalized place invariants in 2 ms returned sat
[2020-06-04 17:31:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 17:31:03] [INFO ] [Nat]Absence check using state equation in 2002 ms returned sat
[2020-06-04 17:31:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2020-06-04 17:31:03] [INFO ] [Nat]Added 1 Read/Feed constraints in 8 ms returned sat
[2020-06-04 17:31:03] [INFO ] Deduced a trap composed of 6 places in 176 ms
[2020-06-04 17:31:04] [INFO ] Deduced a trap composed of 4 places in 134 ms
[2020-06-04 17:31:04] [INFO ] Deduced a trap composed of 9 places in 108 ms
[2020-06-04 17:31:04] [INFO ] Deduced a trap composed of 5 places in 188 ms
[2020-06-04 17:31:04] [INFO ] Deduced a trap composed of 8 places in 94 ms
[2020-06-04 17:31:04] [INFO ] Deduced a trap composed of 9 places in 94 ms
[2020-06-04 17:31:04] [INFO ] Deduced a trap composed of 8 places in 154 ms
[2020-06-04 17:31:04] [INFO ] Deduced a trap composed of 5 places in 136 ms
[2020-06-04 17:31:05] [INFO ] Deduced a trap composed of 6 places in 238 ms
[2020-06-04 17:31:05] [INFO ] Deduced a trap composed of 3 places in 184 ms
[2020-06-04 17:31:05] [INFO ] Deduced a trap composed of 6 places in 239 ms
[2020-06-04 17:31:05] [INFO ] Deduced a trap composed of 12 places in 141 ms
[2020-06-04 17:31:06] [INFO ] Deduced a trap composed of 11 places in 130 ms
[2020-06-04 17:31:06] [INFO ] Deduced a trap composed of 9 places in 128 ms
[2020-06-04 17:31:06] [INFO ] Deduced a trap composed of 4 places in 133 ms
[2020-06-04 17:31:06] [INFO ] Deduced a trap composed of 3 places in 101 ms
[2020-06-04 17:31:06] [INFO ] Deduced a trap composed of 9 places in 109 ms
[2020-06-04 17:31:06] [INFO ] Deduced a trap composed of 5 places in 125 ms
[2020-06-04 17:31:07] [INFO ] Deduced a trap composed of 15 places in 162 ms
[2020-06-04 17:31:07] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 3527 ms
[2020-06-04 17:31:07] [INFO ] Computed and/alt/rep : 966/3275/966 causal constraints in 65 ms.
[2020-06-04 17:31:27] [INFO ] Added : 815 causal constraints over 163 iterations in 20200 ms.(timeout) Result :sat
[2020-06-04 17:31:27] [INFO ] Deduced a trap composed of 7 places in 55 ms
[2020-06-04 17:31:27] [INFO ] Deduced a trap composed of 6 places in 61 ms
[2020-06-04 17:31:27] [INFO ] Deduced a trap composed of 8 places in 72 ms
[2020-06-04 17:31:28] [INFO ] Deduced a trap composed of 4 places in 45 ms
[2020-06-04 17:31:28] [INFO ] Deduced a trap composed of 5 places in 40 ms
[2020-06-04 17:31:28] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1091 ms
Attempting to minimize the solution found.
Minimization took 115 ms.
[2020-06-04 17:31:29] [INFO ] [Real]Absence check using 357 positive place invariants in 232 ms returned sat
[2020-06-04 17:31:29] [INFO ] [Real]Absence check using 357 positive and 3 generalized place invariants in 3 ms returned sat
[2020-06-04 17:31:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 17:31:31] [INFO ] [Real]Absence check using state equation in 1976 ms returned sat
[2020-06-04 17:31:31] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 17:31:31] [INFO ] [Nat]Absence check using 357 positive place invariants in 366 ms returned sat
[2020-06-04 17:31:31] [INFO ] [Nat]Absence check using 357 positive and 3 generalized place invariants in 8 ms returned sat
[2020-06-04 17:31:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 17:31:34] [INFO ] [Nat]Absence check using state equation in 2552 ms returned sat
[2020-06-04 17:31:34] [INFO ] [Nat]Added 1 Read/Feed constraints in 8 ms returned sat
[2020-06-04 17:31:34] [INFO ] Deduced a trap composed of 7 places in 136 ms
[2020-06-04 17:31:34] [INFO ] Deduced a trap composed of 6 places in 131 ms
[2020-06-04 17:31:34] [INFO ] Deduced a trap composed of 4 places in 135 ms
[2020-06-04 17:31:34] [INFO ] Deduced a trap composed of 9 places in 116 ms
[2020-06-04 17:31:35] [INFO ] Deduced a trap composed of 6 places in 134 ms
[2020-06-04 17:31:35] [INFO ] Deduced a trap composed of 5 places in 206 ms
[2020-06-04 17:31:35] [INFO ] Deduced a trap composed of 14 places in 135 ms
[2020-06-04 17:31:35] [INFO ] Deduced a trap composed of 5 places in 127 ms
[2020-06-04 17:31:35] [INFO ] Deduced a trap composed of 3 places in 103 ms
[2020-06-04 17:31:36] [INFO ] Deduced a trap composed of 17 places in 125 ms
[2020-06-04 17:31:36] [INFO ] Deduced a trap composed of 11 places in 80 ms
[2020-06-04 17:31:36] [INFO ] Deduced a trap composed of 5 places in 65 ms
[2020-06-04 17:31:36] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 2118 ms
[2020-06-04 17:31:36] [INFO ] Computed and/alt/rep : 966/3275/966 causal constraints in 57 ms.
[2020-06-04 17:31:56] [INFO ] Added : 785 causal constraints over 157 iterations in 20208 ms.(timeout) Result :sat
[2020-06-04 17:31:56] [INFO ] Deduced a trap composed of 14 places in 145 ms
[2020-06-04 17:31:56] [INFO ] Deduced a trap composed of 8 places in 135 ms
[2020-06-04 17:31:57] [INFO ] Deduced a trap composed of 8 places in 117 ms
[2020-06-04 17:31:57] [INFO ] Deduced a trap composed of 9 places in 90 ms
[2020-06-04 17:31:57] [INFO ] Deduced a trap composed of 8 places in 70 ms
[2020-06-04 17:31:57] [INFO ] Deduced a trap composed of 6 places in 45 ms
[2020-06-04 17:31:57] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1442 ms
Attempting to minimize the solution found.
Minimization took 110 ms.
[2020-06-04 17:31:58] [INFO ] [Real]Absence check using 357 positive place invariants in 233 ms returned sat
[2020-06-04 17:31:58] [INFO ] [Real]Absence check using 357 positive and 3 generalized place invariants in 6 ms returned sat
[2020-06-04 17:31:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 17:32:00] [INFO ] [Real]Absence check using state equation in 2205 ms returned sat
[2020-06-04 17:32:00] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 17:32:01] [INFO ] [Nat]Absence check using 357 positive place invariants in 215 ms returned sat
[2020-06-04 17:32:01] [INFO ] [Nat]Absence check using 357 positive and 3 generalized place invariants in 2 ms returned sat
[2020-06-04 17:32:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 17:32:03] [INFO ] [Nat]Absence check using state equation in 2141 ms returned sat
[2020-06-04 17:32:03] [INFO ] [Nat]Added 1 Read/Feed constraints in 9 ms returned sat
[2020-06-04 17:32:03] [INFO ] Deduced a trap composed of 5 places in 169 ms
[2020-06-04 17:32:03] [INFO ] Deduced a trap composed of 6 places in 173 ms
[2020-06-04 17:32:03] [INFO ] Deduced a trap composed of 6 places in 146 ms
[2020-06-04 17:32:04] [INFO ] Deduced a trap composed of 10 places in 170 ms
[2020-06-04 17:32:04] [INFO ] Deduced a trap composed of 5 places in 132 ms
[2020-06-04 17:32:04] [INFO ] Deduced a trap composed of 4 places in 149 ms
[2020-06-04 17:32:04] [INFO ] Deduced a trap composed of 6 places in 129 ms
[2020-06-04 17:32:04] [INFO ] Deduced a trap composed of 11 places in 142 ms
[2020-06-04 17:32:04] [INFO ] Deduced a trap composed of 9 places in 109 ms
[2020-06-04 17:32:05] [INFO ] Deduced a trap composed of 16 places in 125 ms
[2020-06-04 17:32:05] [INFO ] Deduced a trap composed of 15 places in 108 ms
[2020-06-04 17:32:05] [INFO ] Deduced a trap composed of 17 places in 93 ms
[2020-06-04 17:32:05] [INFO ] Deduced a trap composed of 14 places in 93 ms
[2020-06-04 17:32:05] [INFO ] Deduced a trap composed of 11 places in 113 ms
[2020-06-04 17:32:05] [INFO ] Deduced a trap composed of 20 places in 85 ms
[2020-06-04 17:32:05] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 2495 ms
[2020-06-04 17:32:05] [INFO ] Computed and/alt/rep : 966/3275/966 causal constraints in 53 ms.
[2020-06-04 17:32:25] [INFO ] Added : 830 causal constraints over 166 iterations in 20060 ms.(timeout) Result :sat
[2020-06-04 17:32:25] [INFO ] Deduced a trap composed of 4 places in 93 ms
[2020-06-04 17:32:26] [INFO ] Deduced a trap composed of 4 places in 81 ms
[2020-06-04 17:32:26] [INFO ] Deduced a trap composed of 8 places in 91 ms
[2020-06-04 17:32:26] [INFO ] Deduced a trap composed of 14 places in 70 ms
[2020-06-04 17:32:26] [INFO ] Deduced a trap composed of 8 places in 63 ms
[2020-06-04 17:32:27] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1229 ms
Attempting to minimize the solution found.
Minimization took 101 ms.
[2020-06-04 17:32:27] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 7 ms.
[2020-06-04 17:32:27] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 32 ms.
[2020-06-04 17:32:27] [INFO ] Flatten gal took : 157 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityFireability @ ShieldIIPs-PT-040B @ 3570 seconds

FORMULA ShieldIIPs-PT-040B-ReachabilityFireability-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPs-PT-040B-ReachabilityFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16427456 kB
MemFree: 3121512 kB
After kill :
MemTotal: 16427456 kB
MemFree: 16134160 kB

--------------------
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="ShieldIIPs-PT-040B"
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 ShieldIIPs-PT-040B, 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 r211-tajo-159033477100183"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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