Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2020-input.r006-smll-158897515600112.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/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 itstools
Input is ASLink-PT-07a, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r006-smll-158897515600112
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 856K
-rw-r--r-- 1 mcc users 3.0K Mar 25 09:45 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 25 09:45 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 25 09:37 CTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 25 09:37 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.6K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 8 14:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Apr 8 14:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Mar 25 09:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 25 09:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 25 08:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 25 08:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 25 09:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 25 09:04 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 677K 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 ASLink-PT-07a-ReachabilityFireability-00
FORMULA_NAME ASLink-PT-07a-ReachabilityFireability-01
FORMULA_NAME ASLink-PT-07a-ReachabilityFireability-02
FORMULA_NAME ASLink-PT-07a-ReachabilityFireability-03
FORMULA_NAME ASLink-PT-07a-ReachabilityFireability-04
FORMULA_NAME ASLink-PT-07a-ReachabilityFireability-05
FORMULA_NAME ASLink-PT-07a-ReachabilityFireability-06
FORMULA_NAME ASLink-PT-07a-ReachabilityFireability-07
FORMULA_NAME ASLink-PT-07a-ReachabilityFireability-08
FORMULA_NAME ASLink-PT-07a-ReachabilityFireability-09
FORMULA_NAME ASLink-PT-07a-ReachabilityFireability-10
FORMULA_NAME ASLink-PT-07a-ReachabilityFireability-11
FORMULA_NAME ASLink-PT-07a-ReachabilityFireability-12
FORMULA_NAME ASLink-PT-07a-ReachabilityFireability-13
FORMULA_NAME ASLink-PT-07a-ReachabilityFireability-14
FORMULA_NAME ASLink-PT-07a-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1589332159589

[2020-05-13 01:09:22] [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-13 01:09:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-13 01:09:22] [INFO ] Load time of PNML (sax parser for PT used): 343 ms
[2020-05-13 01:09:22] [INFO ] Transformed 1601 places.
[2020-05-13 01:09:22] [INFO ] Transformed 2373 transitions.
[2020-05-13 01:09:22] [INFO ] Found NUPN structural information;
[2020-05-13 01:09:22] [INFO ] Parsed PT model containing 1601 places and 2373 transitions in 461 ms.
Ensure Unique test removed 25 transitions
Reduce redundant transitions removed 25 transitions.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 62 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 43 resets, run finished after 182 ms. (steps per millisecond=54 ) properties seen :[0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1]
FORMULA ASLink-PT-07a-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-07a-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-07a-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-07a-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 35 ms. (steps per millisecond=285 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 40 ms. (steps per millisecond=250 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 83 ms. (steps per millisecond=120 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 71 ms. (steps per millisecond=140 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 33 ms. (steps per millisecond=303 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 33 ms. (steps per millisecond=303 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 32 ms. (steps per millisecond=312 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 6 resets, run finished after 26 ms. (steps per millisecond=384 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 36 ms. (steps per millisecond=277 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 27 ms. (steps per millisecond=370 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 29 ms. (steps per millisecond=344 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 31 ms. (steps per millisecond=322 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 2348 rows 1601 cols
[2020-05-13 01:09:23] [INFO ] Computed 308 place invariants in 248 ms
[2020-05-13 01:09:24] [INFO ] [Real]Absence check using 75 positive place invariants in 165 ms returned sat
[2020-05-13 01:09:25] [INFO ] [Real]Absence check using 75 positive and 233 generalized place invariants in 500 ms returned sat
[2020-05-13 01:09:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-13 01:09:28] [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 (= s553 (- t230 t2168))") while checking expression at index 0
[2020-05-13 01:09:29] [INFO ] [Real]Absence check using 75 positive place invariants in 237 ms returned sat
[2020-05-13 01:09:30] [INFO ] [Real]Absence check using 75 positive and 233 generalized place invariants in 574 ms returned sat
[2020-05-13 01:09:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-13 01:09:33] [INFO ] [Real]Absence check using state equation in 3605 ms returned (error "Solver has unexpectedly terminated")
[2020-05-13 01:09:34] [INFO ] [Real]Absence check using 75 positive place invariants in 168 ms returned sat
[2020-05-13 01:09:35] [INFO ] [Real]Absence check using 75 positive and 233 generalized place invariants in 544 ms returned sat
[2020-05-13 01:09:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-13 01:09:38] [INFO ] [Real]Absence check using state equation in 3756 ms returned (error "Solver has unexpectedly terminated")
[2020-05-13 01:09:39] [INFO ] [Real]Absence check using 75 positive place invariants in 207 ms returned sat
[2020-05-13 01:09:40] [INFO ] [Real]Absence check using 75 positive and 233 generalized place invariants in 480 ms returned sat
[2020-05-13 01:09:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-13 01:09:43] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-13 01:09:43] [INFO ] [Real]Absence check using state equation in 3912 ms returned (error "Failed to check-sat")
[2020-05-13 01:09:44] [INFO ] [Real]Absence check using 75 positive place invariants in 171 ms returned sat
[2020-05-13 01:09:45] [INFO ] [Real]Absence check using 75 positive and 233 generalized place invariants in 469 ms returned sat
[2020-05-13 01:09:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-13 01:09:49] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-13 01:09:49] [INFO ] [Real]Absence check using state equation in 3873 ms returned (error "Failed to check-sat")
[2020-05-13 01:09:49] [INFO ] [Real]Absence check using 75 positive place invariants in 136 ms returned sat
[2020-05-13 01:09:49] [INFO ] [Real]Absence check using 75 positive and 233 generalized place invariants in 360 ms returned sat
[2020-05-13 01:09:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-13 01:09:54] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-13 01:09:54] [INFO ] [Real]Absence check using state equation in 4053 ms returned (error "Failed to check-sat")
[2020-05-13 01:09:54] [INFO ] [Real]Absence check using 75 positive place invariants in 214 ms returned sat
[2020-05-13 01:09:55] [INFO ] [Real]Absence check using 75 positive and 233 generalized place invariants in 573 ms returned sat
[2020-05-13 01:09:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-13 01:09:59] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-13 01:09:59] [INFO ] [Real]Absence check using state equation in 3712 ms returned (error "Failed to check-sat")
[2020-05-13 01:09:59] [INFO ] [Real]Absence check using 75 positive place invariants in 133 ms returned sat
[2020-05-13 01:09:59] [INFO ] [Real]Absence check using 75 positive and 233 generalized place invariants in 342 ms returned sat
[2020-05-13 01:09:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-13 01:10:04] [INFO ] [Real]Absence check using state equation in 4207 ms returned (error "Solver has unexpectedly terminated")
[2020-05-13 01:10:04] [INFO ] [Real]Absence check using 75 positive place invariants in 222 ms returned sat
[2020-05-13 01:10:05] [INFO ] [Real]Absence check using 75 positive and 233 generalized place invariants in 544 ms returned sat
[2020-05-13 01:10:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-13 01:10:09] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-13 01:10:09] [INFO ] [Real]Absence check using state equation in 3776 ms returned (error "Failed to check-sat")
[2020-05-13 01:10:09] [INFO ] [Real]Absence check using 75 positive place invariants in 153 ms returned sat
[2020-05-13 01:10:09] [INFO ] [Real]Absence check using 75 positive and 233 generalized place invariants in 315 ms returned sat
[2020-05-13 01:10:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-13 01:10:14] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-13 01:10:14] [INFO ] [Real]Absence check using state equation in 4150 ms returned (error "Failed to check-sat")
[2020-05-13 01:10:14] [INFO ] [Real]Absence check using 75 positive place invariants in 135 ms returned sat
[2020-05-13 01:10:15] [INFO ] [Real]Absence check using 75 positive and 233 generalized place invariants in 365 ms returned sat
[2020-05-13 01:10:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-13 01:10:19] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-13 01:10:19] [INFO ] [Real]Absence check using state equation in 4062 ms returned (error "Failed to check-sat")
[2020-05-13 01:10:19] [INFO ] [Real]Absence check using 75 positive place invariants in 141 ms returned sat
[2020-05-13 01:10:20] [INFO ] [Real]Absence check using 75 positive and 233 generalized place invariants in 380 ms returned sat
[2020-05-13 01:10:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-13 01:10:24] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-13 01:10:24] [INFO ] [Real]Absence check using state equation in 4050 ms returned (error "Failed to check-sat")
Support contains 71 out of 1601 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1601/1601 places, 2348/2348 transitions.
Ensure Unique test removed 28 places
Discarding 14 places :
Implicit places reduction removed 14 places
Performed 142 Post agglomeration using F-continuation condition.Transition count delta: 142
Iterating post reduction 0 with 184 rules applied. Total rules applied 184 place count 1559 transition count 2206
Reduce places removed 142 places and 0 transitions.
Iterating post reduction 1 with 142 rules applied. Total rules applied 326 place count 1417 transition count 2206
Performed 144 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 144 Pre rules applied. Total rules applied 326 place count 1417 transition count 2062
Deduced a syphon composed of 144 places in 7 ms
Ensure Unique test removed 56 places
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 2 with 344 rules applied. Total rules applied 670 place count 1217 transition count 2062
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 671 place count 1217 transition count 2061
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 672 place count 1216 transition count 2061
Symmetric choice reduction at 4 with 6 rule applications. Total rules 678 place count 1216 transition count 2061
Deduced a syphon composed of 6 places in 19 ms
Reduce places removed 6 places and 31 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 690 place count 1210 transition count 2030
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 4 with 4 rules applied. Total rules applied 694 place count 1209 transition count 2027
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 696 place count 1207 transition count 2027
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: 45
Deduced a syphon composed of 45 places in 21 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 6 with 90 rules applied. Total rules applied 786 place count 1162 transition count 1982
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 6 with 2 rules applied. Total rules applied 788 place count 1162 transition count 1980
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 790 place count 1160 transition count 1980
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 7 with 6 rules applied. Total rules applied 796 place count 1160 transition count 1980
Partial Post-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 7 with 7 rules applied. Total rules applied 803 place count 1160 transition count 1980
Applied a total of 803 rules in 1104 ms. Remains 1160 /1601 variables (removed 441) and now considering 1980/2348 (removed 368) transitions.
Finished structural reductions, in 1 iterations. Remains : 1160/1601 places, 1980/2348 transitions.
Incomplete random walk after 1000000 steps, including 8326 resets, run finished after 7547 ms. (steps per millisecond=132 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 1272 resets, run finished after 2481 ms. (steps per millisecond=403 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 1210 resets, run finished after 2409 ms. (steps per millisecond=415 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 1150 resets, run finished after 2907 ms. (steps per millisecond=343 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 1127 resets, run finished after 2709 ms. (steps per millisecond=369 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 1275 resets, run finished after 2302 ms. (steps per millisecond=434 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 1246 resets, run finished after 2560 ms. (steps per millisecond=390 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 1265 resets, run finished after 2535 ms. (steps per millisecond=394 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 1241 resets, run finished after 2321 ms. (steps per millisecond=430 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 1126 resets, run finished after 2653 ms. (steps per millisecond=376 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 1271 resets, run finished after 2420 ms. (steps per millisecond=413 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 1275 resets, run finished after 2513 ms. (steps per millisecond=397 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 1436 resets, run finished after 2711 ms. (steps per millisecond=368 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted probabilistic random walk after 2145741 steps, run timeout after 30001 ms. (steps per millisecond=71 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Probabilistic random walk after 2145741 steps, saw 396811 distinct states, run finished after 30001 ms. (steps per millisecond=71 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 1980 rows 1160 cols
[2020-05-13 01:11:33] [INFO ] Computed 209 place invariants in 107 ms
[2020-05-13 01:11:33] [INFO ] [Real]Absence check using 58 positive place invariants in 136 ms returned sat
[2020-05-13 01:11:34] [INFO ] [Real]Absence check using 58 positive and 151 generalized place invariants in 259 ms returned sat
[2020-05-13 01:11:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-13 01:11:42] [INFO ] [Real]Absence check using state equation in 7923 ms returned sat
[2020-05-13 01:11:42] [INFO ] Solution in real domain found non-integer solution.
[2020-05-13 01:11:42] [INFO ] [Nat]Absence check using 58 positive place invariants in 96 ms returned sat
[2020-05-13 01:11:42] [INFO ] [Nat]Absence check using 58 positive and 151 generalized place invariants in 207 ms returned sat
[2020-05-13 01:11:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-13 01:11:50] [INFO ] [Nat]Absence check using state equation in 7294 ms returned sat
[2020-05-13 01:11:50] [INFO ] State equation strengthened by 49 read => feed constraints.
[2020-05-13 01:11:50] [INFO ] [Nat]Added 49 Read/Feed constraints in 494 ms returned sat
[2020-05-13 01:11:51] [INFO ] Deduced a trap composed of 64 places in 800 ms
[2020-05-13 01:11:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 932 ms
[2020-05-13 01:11:52] [INFO ] [Real]Absence check using 58 positive place invariants in 149 ms returned sat
[2020-05-13 01:11:52] [INFO ] [Real]Absence check using 58 positive and 151 generalized place invariants in 288 ms returned sat
[2020-05-13 01:11:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-13 01:11:59] [INFO ] [Real]Absence check using state equation in 7474 ms returned sat
[2020-05-13 01:11:59] [INFO ] Solution in real domain found non-integer solution.
[2020-05-13 01:12:00] [INFO ] [Nat]Absence check using 58 positive place invariants in 137 ms returned sat
[2020-05-13 01:12:00] [INFO ] [Nat]Absence check using 58 positive and 151 generalized place invariants in 274 ms returned sat
[2020-05-13 01:12:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-13 01:12:10] [INFO ] [Nat]Absence check using state equation in 9447 ms returned unsat
[2020-05-13 01:12:10] [INFO ] [Real]Absence check using 58 positive place invariants in 138 ms returned sat
[2020-05-13 01:12:10] [INFO ] [Real]Absence check using 58 positive and 151 generalized place invariants in 182 ms returned sat
[2020-05-13 01:12:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-13 01:12:18] [INFO ] [Real]Absence check using state equation in 7412 ms returned sat
[2020-05-13 01:12:18] [INFO ] Solution in real domain found non-integer solution.
[2020-05-13 01:12:18] [INFO ] [Nat]Absence check using 58 positive place invariants in 138 ms returned sat
[2020-05-13 01:12:19] [INFO ] [Nat]Absence check using 58 positive and 151 generalized place invariants in 273 ms returned sat
[2020-05-13 01:12:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-13 01:12:26] [INFO ] [Nat]Absence check using state equation in 7304 ms returned sat
[2020-05-13 01:12:26] [INFO ] [Nat]Added 49 Read/Feed constraints in 424 ms returned sat
[2020-05-13 01:12:27] [INFO ] Deduced a trap composed of 46 places in 301 ms
[2020-05-13 01:12:30] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-13 01:13:05] [INFO ] Deduced a trap composed of 2 places in 1925 ms
[2020-05-13 01:13:05] [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: Stream closed (> (+ s0 s304) 0)") while checking expression at index 2
[2020-05-13 01:13:05] [INFO ] [Real]Absence check using 58 positive place invariants in 135 ms returned sat
[2020-05-13 01:13:05] [INFO ] [Real]Absence check using 58 positive and 151 generalized place invariants in 279 ms returned sat
[2020-05-13 01:13:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-13 01:13:12] [INFO ] [Real]Absence check using state equation in 6686 ms returned sat
[2020-05-13 01:13:12] [INFO ] Solution in real domain found non-integer solution.
[2020-05-13 01:13:13] [INFO ] [Nat]Absence check using 58 positive place invariants in 86 ms returned sat
[2020-05-13 01:13:13] [INFO ] [Nat]Absence check using 58 positive and 151 generalized place invariants in 234 ms returned sat
[2020-05-13 01:13:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-13 01:13:16] [INFO ] [Nat]Absence check using state equation in 3227 ms returned unsat
[2020-05-13 01:13:17] [INFO ] [Real]Absence check using 58 positive place invariants in 130 ms returned sat
[2020-05-13 01:13:17] [INFO ] [Real]Absence check using 58 positive and 151 generalized place invariants in 245 ms returned sat
[2020-05-13 01:13:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-13 01:13:24] [INFO ] [Real]Absence check using state equation in 6900 ms returned sat
[2020-05-13 01:13:24] [INFO ] Solution in real domain found non-integer solution.
[2020-05-13 01:13:24] [INFO ] [Nat]Absence check using 58 positive place invariants in 88 ms returned sat
[2020-05-13 01:13:24] [INFO ] [Nat]Absence check using 58 positive and 151 generalized place invariants in 160 ms returned sat
[2020-05-13 01:13:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-13 01:13:31] [INFO ] [Nat]Absence check using state equation in 6920 ms returned unsat
[2020-05-13 01:13:32] [INFO ] [Real]Absence check using 58 positive place invariants in 92 ms returned sat
[2020-05-13 01:13:32] [INFO ] [Real]Absence check using 58 positive and 151 generalized place invariants in 194 ms returned sat
[2020-05-13 01:13:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-13 01:13:39] [INFO ] [Real]Absence check using state equation in 7277 ms returned sat
[2020-05-13 01:13:39] [INFO ] Solution in real domain found non-integer solution.
[2020-05-13 01:13:39] [INFO ] [Nat]Absence check using 58 positive place invariants in 120 ms returned sat
[2020-05-13 01:13:40] [INFO ] [Nat]Absence check using 58 positive and 151 generalized place invariants in 213 ms returned sat
[2020-05-13 01:13:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-13 01:13:42] [INFO ] [Nat]Absence check using state equation in 2904 ms returned unsat
[2020-05-13 01:13:43] [INFO ] [Real]Absence check using 58 positive place invariants in 145 ms returned sat
[2020-05-13 01:13:43] [INFO ] [Real]Absence check using 58 positive and 151 generalized place invariants in 290 ms returned sat
[2020-05-13 01:13:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-13 01:13:51] [INFO ] [Real]Absence check using state equation in 7638 ms returned sat
[2020-05-13 01:13:51] [INFO ] Solution in real domain found non-integer solution.
[2020-05-13 01:13:51] [INFO ] [Nat]Absence check using 58 positive place invariants in 95 ms returned sat
[2020-05-13 01:13:52] [INFO ] [Nat]Absence check using 58 positive and 151 generalized place invariants in 211 ms returned sat
[2020-05-13 01:13:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-13 01:13:54] [INFO ] [Nat]Absence check using state equation in 2317 ms returned unsat
[2020-05-13 01:13:54] [INFO ] [Real]Absence check using 58 positive place invariants in 125 ms returned sat
[2020-05-13 01:13:55] [INFO ] [Real]Absence check using 58 positive and 151 generalized place invariants in 257 ms returned sat
[2020-05-13 01:13:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-13 01:14:02] [INFO ] [Real]Absence check using state equation in 7620 ms returned sat
[2020-05-13 01:14:02] [INFO ] Solution in real domain found non-integer solution.
[2020-05-13 01:14:03] [INFO ] [Nat]Absence check using 58 positive place invariants in 136 ms returned sat
[2020-05-13 01:14:03] [INFO ] [Nat]Absence check using 58 positive and 151 generalized place invariants in 234 ms returned sat
[2020-05-13 01:14:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-13 01:14:09] [INFO ] [Nat]Absence check using state equation in 6207 ms returned unsat
[2020-05-13 01:14:10] [INFO ] [Real]Absence check using 58 positive place invariants in 141 ms returned sat
[2020-05-13 01:14:10] [INFO ] [Real]Absence check using 58 positive and 151 generalized place invariants in 283 ms returned sat
[2020-05-13 01:14:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-13 01:14:18] [INFO ] [Real]Absence check using state equation in 8055 ms returned sat
[2020-05-13 01:14:18] [INFO ] Solution in real domain found non-integer solution.
[2020-05-13 01:14:18] [INFO ] [Nat]Absence check using 58 positive place invariants in 143 ms returned sat
[2020-05-13 01:14:19] [INFO ] [Nat]Absence check using 58 positive and 151 generalized place invariants in 267 ms returned sat
[2020-05-13 01:14:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-13 01:14:23] [INFO ] [Nat]Absence check using state equation in 4218 ms returned unsat
[2020-05-13 01:14:23] [INFO ] [Real]Absence check using 58 positive place invariants in 88 ms returned sat
[2020-05-13 01:14:24] [INFO ] [Real]Absence check using 58 positive and 151 generalized place invariants in 231 ms returned sat
[2020-05-13 01:14:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-13 01:14:30] [INFO ] [Real]Absence check using state equation in 6717 ms returned sat
[2020-05-13 01:14:30] [INFO ] Solution in real domain found non-integer solution.
[2020-05-13 01:14:31] [INFO ] [Nat]Absence check using 58 positive place invariants in 83 ms returned sat
[2020-05-13 01:14:31] [INFO ] [Nat]Absence check using 58 positive and 151 generalized place invariants in 157 ms returned sat
[2020-05-13 01:14:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-13 01:14:37] [INFO ] [Nat]Absence check using state equation in 6286 ms returned unsat
[2020-05-13 01:14:38] [INFO ] [Real]Absence check using 58 positive place invariants in 131 ms returned sat
[2020-05-13 01:14:38] [INFO ] [Real]Absence check using 58 positive and 151 generalized place invariants in 197 ms returned sat
[2020-05-13 01:14:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-13 01:14:45] [INFO ] [Real]Absence check using state equation in 7115 ms returned sat
[2020-05-13 01:14:45] [INFO ] Solution in real domain found non-integer solution.
[2020-05-13 01:14:45] [INFO ] [Nat]Absence check using 58 positive place invariants in 87 ms returned sat
[2020-05-13 01:14:45] [INFO ] [Nat]Absence check using 58 positive and 151 generalized place invariants in 174 ms returned sat
[2020-05-13 01:14:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-13 01:14:48] [INFO ] [Nat]Absence check using state equation in 2788 ms returned unsat
[2020-05-13 01:14:49] [INFO ] [Real]Absence check using 58 positive place invariants in 96 ms returned sat
[2020-05-13 01:14:49] [INFO ] [Real]Absence check using 58 positive and 151 generalized place invariants in 185 ms returned sat
[2020-05-13 01:14:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-13 01:14:56] [INFO ] [Real]Absence check using state equation in 6776 ms returned sat
[2020-05-13 01:14:56] [INFO ] Solution in real domain found non-integer solution.
[2020-05-13 01:14:56] [INFO ] [Nat]Absence check using 58 positive place invariants in 96 ms returned sat
[2020-05-13 01:14:56] [INFO ] [Nat]Absence check using 58 positive and 151 generalized place invariants in 203 ms returned sat
[2020-05-13 01:14:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-13 01:15:04] [INFO ] [Nat]Absence check using state equation in 7663 ms returned sat
[2020-05-13 01:15:04] [INFO ] [Nat]Added 49 Read/Feed constraints in 283 ms returned sat
[2020-05-13 01:15:04] [INFO ] Deduced a trap composed of 53 places in 174 ms
[2020-05-13 01:15:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 237 ms
FORMULA ASLink-PT-07a-ReachabilityFireability-14 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-07a-ReachabilityFireability-13 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-07a-ReachabilityFireability-12 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-07a-ReachabilityFireability-11 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-07a-ReachabilityFireability-09 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-07a-ReachabilityFireability-08 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-07a-ReachabilityFireability-07 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-07a-ReachabilityFireability-06 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-07a-ReachabilityFireability-05 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-07a-ReachabilityFireability-02 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-07a-ReachabilityFireability-00 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Support contains 12 out of 1160 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1160/1160 places, 1980/1980 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 1160 transition count 1977
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 1157 transition count 1977
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 6 place count 1157 transition count 1972
Deduced a syphon composed of 5 places in 3 ms
Ensure Unique test removed 3 places
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 13 rules applied. Total rules applied 19 place count 1149 transition count 1972
Symmetric choice reduction at 2 with 1 rule applications. Total rules 20 place count 1149 transition count 1972
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 9 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 22 place count 1148 transition count 1963
Symmetric choice reduction at 2 with 1 rule applications. Total rules 23 place count 1148 transition count 1963
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 8 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 25 place count 1147 transition count 1955
Symmetric choice reduction at 2 with 1 rule applications. Total rules 26 place count 1147 transition count 1955
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 8 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 28 place count 1146 transition count 1947
Symmetric choice reduction at 2 with 1 rule applications. Total rules 29 place count 1146 transition count 1947
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 8 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 31 place count 1145 transition count 1939
Symmetric choice reduction at 2 with 1 rule applications. Total rules 32 place count 1145 transition count 1939
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 8 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 34 place count 1144 transition count 1931
Symmetric choice reduction at 2 with 1 rule applications. Total rules 35 place count 1144 transition count 1931
Deduced a syphon composed of 1 places in 9 ms
Reduce places removed 1 places and 8 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 37 place count 1143 transition count 1923
Symmetric choice reduction at 2 with 1 rule applications. Total rules 38 place count 1143 transition count 1923
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 8 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 40 place count 1142 transition count 1915
Symmetric choice reduction at 2 with 1 rule applications. Total rules 41 place count 1142 transition count 1915
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 8 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 43 place count 1141 transition count 1907
Symmetric choice reduction at 2 with 1 rule applications. Total rules 44 place count 1141 transition count 1907
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 8 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 46 place count 1140 transition count 1899
Symmetric choice reduction at 2 with 1 rule applications. Total rules 47 place count 1140 transition count 1899
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 8 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 49 place count 1139 transition count 1891
Symmetric choice reduction at 2 with 1 rule applications. Total rules 50 place count 1139 transition count 1891
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 8 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 52 place count 1138 transition count 1883
Symmetric choice reduction at 2 with 1 rule applications. Total rules 53 place count 1138 transition count 1883
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 8 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 55 place count 1137 transition count 1875
Symmetric choice reduction at 2 with 1 rule applications. Total rules 56 place count 1137 transition count 1875
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 8 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 58 place count 1136 transition count 1867
Symmetric choice reduction at 2 with 1 rule applications. Total rules 59 place count 1136 transition count 1867
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 8 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 61 place count 1135 transition count 1859
Symmetric choice reduction at 2 with 1 rule applications. Total rules 62 place count 1135 transition count 1859
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 8 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 64 place count 1134 transition count 1851
Symmetric choice reduction at 2 with 1 rule applications. Total rules 65 place count 1134 transition count 1851
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 8 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 67 place count 1133 transition count 1843
Symmetric choice reduction at 2 with 1 rule applications. Total rules 68 place count 1133 transition count 1843
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 8 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 70 place count 1132 transition count 1835
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 3 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 76 place count 1129 transition count 1832
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 2 with 4 rules applied. Total rules applied 80 place count 1129 transition count 1828
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 84 place count 1125 transition count 1828
Applied a total of 84 rules in 1428 ms. Remains 1125 /1160 variables (removed 35) and now considering 1828/1980 (removed 152) transitions.
Finished structural reductions, in 1 iterations. Remains : 1125/1160 places, 1828/1980 transitions.
Incomplete random walk after 1000000 steps, including 8676 resets, run finished after 5145 ms. (steps per millisecond=194 ) properties seen :[0]
Incomplete Best-First random walk after 1000001 steps, including 1210 resets, run finished after 2728 ms. (steps per millisecond=366 ) properties seen :[0]
Interrupted probabilistic random walk after 2385692 steps, run timeout after 30001 ms. (steps per millisecond=79 ) properties seen :[0]
Probabilistic random walk after 2385692 steps, saw 423787 distinct states, run finished after 30001 ms. (steps per millisecond=79 ) properties seen :[0]
// Phase 1: matrix 1828 rows 1125 cols
[2020-05-13 01:15:44] [INFO ] Computed 206 place invariants in 88 ms
[2020-05-13 01:15:44] [INFO ] [Real]Absence check using 58 positive place invariants in 92 ms returned sat
[2020-05-13 01:15:44] [INFO ] [Real]Absence check using 58 positive and 148 generalized place invariants in 194 ms returned sat
[2020-05-13 01:15:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-13 01:15:51] [INFO ] [Real]Absence check using state equation in 6646 ms returned sat
[2020-05-13 01:15:51] [INFO ] Solution in real domain found non-integer solution.
[2020-05-13 01:15:51] [INFO ] [Nat]Absence check using 58 positive place invariants in 119 ms returned sat
[2020-05-13 01:15:52] [INFO ] [Nat]Absence check using 58 positive and 148 generalized place invariants in 193 ms returned sat
[2020-05-13 01:15:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-13 01:16:04] [INFO ] [Nat]Absence check using state equation in 12197 ms returned sat
[2020-05-13 01:16:04] [INFO ] State equation strengthened by 51 read => feed constraints.
[2020-05-13 01:16:04] [INFO ] [Nat]Added 51 Read/Feed constraints in 162 ms returned sat
[2020-05-13 01:16:04] [INFO ] Deduced a trap composed of 30 places in 401 ms
[2020-05-13 01:16:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 453 ms
FORMULA ASLink-PT-07a-ReachabilityFireability-04 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
All properties solved without resorting to model-checking.

BK_STOP 1589332565994

--------------------
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="ASLink-PT-07a"
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 ASLink-PT-07a, 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 r006-smll-158897515600112"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ASLink-PT-07a.tgz
mv ASLink-PT-07a 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 ;