fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r007-tall-162037989600156
Last Updated
Jun 28, 2021

About the Execution of ITS-Tools for ASLink-PT-10a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16248.863 3600000.00 2924463.00 326912.30 ???F???????????? normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r007-tall-162037989600156.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-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-10a, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r007-tall-162037989600156
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 18K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 170K May 10 09:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 97K May 10 09:42 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Mar 28 15:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 15:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K Mar 28 15:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 28 15:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Mar 23 01:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 23 01:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 22 09:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 22 09:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 09:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 22 09:09 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 4 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 920K May 5 16:51 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-10a-CTLFireability-00
FORMULA_NAME ASLink-PT-10a-CTLFireability-01
FORMULA_NAME ASLink-PT-10a-CTLFireability-02
FORMULA_NAME ASLink-PT-10a-CTLFireability-03
FORMULA_NAME ASLink-PT-10a-CTLFireability-04
FORMULA_NAME ASLink-PT-10a-CTLFireability-05
FORMULA_NAME ASLink-PT-10a-CTLFireability-06
FORMULA_NAME ASLink-PT-10a-CTLFireability-07
FORMULA_NAME ASLink-PT-10a-CTLFireability-08
FORMULA_NAME ASLink-PT-10a-CTLFireability-09
FORMULA_NAME ASLink-PT-10a-CTLFireability-10
FORMULA_NAME ASLink-PT-10a-CTLFireability-11
FORMULA_NAME ASLink-PT-10a-CTLFireability-12
FORMULA_NAME ASLink-PT-10a-CTLFireability-13
FORMULA_NAME ASLink-PT-10a-CTLFireability-14
FORMULA_NAME ASLink-PT-10a-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1620735795601

Running Version 0
[2021-05-11 12:23:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-11 12:23:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-11 12:23:17] [INFO ] Load time of PNML (sax parser for PT used): 166 ms
[2021-05-11 12:23:18] [INFO ] Transformed 2186 places.
[2021-05-11 12:23:18] [INFO ] Transformed 3192 transitions.
[2021-05-11 12:23:18] [INFO ] Found NUPN structural information;
[2021-05-11 12:23:18] [INFO ] Parsed PT model containing 2186 places and 3192 transitions in 236 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 13 ms.
Ensure Unique test removed 34 transitions
Reduce redundant transitions removed 34 transitions.
Support contains 767 out of 2186 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2186/2186 places, 3158/3158 transitions.
Ensure Unique test removed 33 places
Discarding 15 places :
Implicit places reduction removed 15 places
Iterating post reduction 0 with 48 rules applied. Total rules applied 48 place count 2138 transition count 3158
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 50 place count 2136 transition count 3156
Ensure Unique test removed 1 places
Iterating global reduction 1 with 3 rules applied. Total rules applied 53 place count 2135 transition count 3156
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 54 place count 2135 transition count 3155
Applied a total of 54 rules in 298 ms. Remains 2135 /2186 variables (removed 51) and now considering 3155/3158 (removed 3) transitions.
// Phase 1: matrix 3155 rows 2135 cols
[2021-05-11 12:23:18] [INFO ] Computed 373 place invariants in 421 ms
[2021-05-11 12:23:19] [INFO ] Implicit Places using invariants in 1463 ms returned [1, 19, 20, 23, 70, 199, 216, 222, 450, 579, 601, 602, 786, 792, 812, 830, 981, 1020, 1151, 1167, 1211, 1356, 1400, 1547, 1552, 1553, 1591, 1720, 1781, 1911, 1916, 1933, 1934, 1972, 1996, 1997, 2015, 2023, 2037, 2043, 2049, 2055, 2063, 2069, 2075, 2083]
Discarding 46 places :
Implicit Place search using SMT only with invariants took 1517 ms to find 46 implicit places.
// Phase 1: matrix 3155 rows 2089 cols
[2021-05-11 12:23:20] [INFO ] Computed 327 place invariants in 82 ms
[2021-05-11 12:23:22] [INFO ] Dead Transitions using invariants and state equation in 2284 ms returned []
Starting structural reductions, iteration 1 : 2089/2186 places, 3155/3158 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 2079 transition count 3145
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 2079 transition count 3145
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 25 place count 2074 transition count 3140
Iterating global reduction 0 with 5 rules applied. Total rules applied 30 place count 2074 transition count 3140
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 2073 transition count 3139
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 2073 transition count 3139
Applied a total of 32 rules in 619 ms. Remains 2073 /2089 variables (removed 16) and now considering 3139/3155 (removed 16) transitions.
// Phase 1: matrix 3139 rows 2073 cols
[2021-05-11 12:23:23] [INFO ] Computed 327 place invariants in 267 ms
[2021-05-11 12:23:23] [INFO ] Implicit Places using invariants in 1061 ms returned []
// Phase 1: matrix 3139 rows 2073 cols
[2021-05-11 12:23:23] [INFO ] Computed 327 place invariants in 57 ms
[2021-05-11 12:23:26] [INFO ] Implicit Places using invariants and state equation in 2786 ms returned []
Implicit Place search using SMT with State Equation took 3849 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 2073/2186 places, 3139/3158 transitions.
[2021-05-11 12:23:27] [INFO ] Flatten gal took : 537 ms
[2021-05-11 12:23:28] [INFO ] Flatten gal took : 398 ms
[2021-05-11 12:23:29] [INFO ] Input system was already deterministic with 3139 transitions.
Incomplete random walk after 100000 steps, including 431 resets, run finished after 1610 ms. (steps per millisecond=62 ) properties (out of 92) seen :76
Running SMT prover for 16 properties.
// Phase 1: matrix 3139 rows 2073 cols
[2021-05-11 12:23:31] [INFO ] Computed 327 place invariants in 49 ms
[2021-05-11 12:23:31] [INFO ] [Real]Absence check using 57 positive place invariants in 51 ms returned sat
[2021-05-11 12:23:31] [INFO ] [Real]Absence check using 57 positive and 270 generalized place invariants in 135 ms returned sat
[2021-05-11 12:23:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 12:23:32] [INFO ] [Real]Absence check using state equation in 1345 ms returned sat
[2021-05-11 12:23:32] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 12:23:33] [INFO ] [Nat]Absence check using 57 positive place invariants in 26 ms returned sat
[2021-05-11 12:23:33] [INFO ] [Nat]Absence check using 57 positive and 270 generalized place invariants in 65 ms returned sat
[2021-05-11 12:23:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 12:23:39] [INFO ] [Nat]Absence check using state equation in 6551 ms returned unknown
[2021-05-11 12:23:40] [INFO ] [Real]Absence check using 57 positive place invariants in 28 ms returned sat
[2021-05-11 12:23:40] [INFO ] [Real]Absence check using 57 positive and 270 generalized place invariants in 78 ms returned sat
[2021-05-11 12:23:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 12:23:42] [INFO ] [Real]Absence check using state equation in 1845 ms returned sat
[2021-05-11 12:23:42] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 12:23:42] [INFO ] [Nat]Absence check using 57 positive place invariants in 28 ms returned sat
[2021-05-11 12:23:42] [INFO ] [Nat]Absence check using 57 positive and 270 generalized place invariants in 72 ms returned sat
[2021-05-11 12:23:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 12:23:43] [INFO ] [Nat]Absence check using state equation in 1167 ms returned unsat
[2021-05-11 12:23:43] [INFO ] [Real]Absence check using 57 positive place invariants in 26 ms returned sat
[2021-05-11 12:23:43] [INFO ] [Real]Absence check using 57 positive and 270 generalized place invariants in 74 ms returned sat
[2021-05-11 12:23:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 12:23:45] [INFO ] [Real]Absence check using state equation in 1432 ms returned sat
[2021-05-11 12:23:45] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 12:23:45] [INFO ] [Nat]Absence check using 57 positive place invariants in 28 ms returned sat
[2021-05-11 12:23:45] [INFO ] [Nat]Absence check using 57 positive and 270 generalized place invariants in 74 ms returned sat
[2021-05-11 12:23:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 12:23:53] [INFO ] [Nat]Absence check using state equation in 7734 ms returned unknown
[2021-05-11 12:23:53] [INFO ] [Real]Absence check using 57 positive place invariants in 26 ms returned sat
[2021-05-11 12:23:53] [INFO ] [Real]Absence check using 57 positive and 270 generalized place invariants in 75 ms returned sat
[2021-05-11 12:23:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 12:23:55] [INFO ] [Real]Absence check using state equation in 1708 ms returned sat
[2021-05-11 12:23:55] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 12:23:55] [INFO ] [Nat]Absence check using 57 positive place invariants in 26 ms returned sat
[2021-05-11 12:23:55] [INFO ] [Nat]Absence check using 57 positive and 270 generalized place invariants in 76 ms returned sat
[2021-05-11 12:23:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 12:24:02] [INFO ] [Nat]Absence check using state equation in 6542 ms returned unknown
[2021-05-11 12:24:02] [INFO ] [Real]Absence check using 57 positive place invariants in 26 ms returned sat
[2021-05-11 12:24:02] [INFO ] [Real]Absence check using 57 positive and 270 generalized place invariants in 77 ms returned sat
[2021-05-11 12:24:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 12:24:04] [INFO ] [Real]Absence check using state equation in 1674 ms returned sat
[2021-05-11 12:24:04] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 12:24:04] [INFO ] [Nat]Absence check using 57 positive place invariants in 26 ms returned sat
[2021-05-11 12:24:04] [INFO ] [Nat]Absence check using 57 positive and 270 generalized place invariants in 77 ms returned sat
[2021-05-11 12:24:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 12:24:11] [INFO ] [Nat]Absence check using state equation in 6571 ms returned unknown
[2021-05-11 12:24:11] [INFO ] [Real]Absence check using 57 positive place invariants in 26 ms returned sat
[2021-05-11 12:24:11] [INFO ] [Real]Absence check using 57 positive and 270 generalized place invariants in 80 ms returned sat
[2021-05-11 12:24:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 12:24:13] [INFO ] [Real]Absence check using state equation in 1565 ms returned sat
[2021-05-11 12:24:13] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 12:24:13] [INFO ] [Nat]Absence check using 57 positive place invariants in 30 ms returned sat
[2021-05-11 12:24:13] [INFO ] [Nat]Absence check using 57 positive and 270 generalized place invariants in 78 ms returned sat
[2021-05-11 12:24:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 12:24:19] [INFO ] [Nat]Absence check using state equation in 6318 ms returned unknown
[2021-05-11 12:24:20] [INFO ] [Real]Absence check using 57 positive place invariants in 25 ms returned sat
[2021-05-11 12:24:20] [INFO ] [Real]Absence check using 57 positive and 270 generalized place invariants in 70 ms returned sat
[2021-05-11 12:24:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 12:24:21] [INFO ] [Real]Absence check using state equation in 1411 ms returned sat
[2021-05-11 12:24:21] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 12:24:21] [INFO ] [Nat]Absence check using 57 positive place invariants in 27 ms returned sat
[2021-05-11 12:24:22] [INFO ] [Nat]Absence check using 57 positive and 270 generalized place invariants in 73 ms returned sat
[2021-05-11 12:24:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 12:24:23] [INFO ] [Nat]Absence check using state equation in 1747 ms returned sat
[2021-05-11 12:24:24] [INFO ] Deduced a trap composed of 43 places in 286 ms of which 4 ms to minimize.
[2021-05-11 12:24:24] [INFO ] Deduced a trap composed of 34 places in 157 ms of which 2 ms to minimize.
[2021-05-11 12:24:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 763 ms
[2021-05-11 12:24:24] [INFO ] Computed and/alt/rep : 1352/4301/1352 causal constraints (skipped 1786 transitions) in 193 ms.
[2021-05-11 12:24:41] [INFO ] Added : 530 causal constraints over 106 iterations in 17181 ms. Result :unknown
[2021-05-11 12:24:42] [INFO ] [Real]Absence check using 57 positive place invariants in 31 ms returned sat
[2021-05-11 12:24:42] [INFO ] [Real]Absence check using 57 positive and 270 generalized place invariants in 73 ms returned sat
[2021-05-11 12:24:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 12:24:43] [INFO ] [Real]Absence check using state equation in 1513 ms returned sat
[2021-05-11 12:24:43] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 12:24:43] [INFO ] [Nat]Absence check using 57 positive place invariants in 29 ms returned sat
[2021-05-11 12:24:44] [INFO ] [Nat]Absence check using 57 positive and 270 generalized place invariants in 71 ms returned sat
[2021-05-11 12:24:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 12:24:46] [INFO ] [Nat]Absence check using state equation in 2199 ms returned sat
[2021-05-11 12:24:46] [INFO ] Deduced a trap composed of 78 places in 318 ms of which 1 ms to minimize.
[2021-05-11 12:24:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 520 ms
[2021-05-11 12:24:46] [INFO ] Computed and/alt/rep : 1352/4301/1352 causal constraints (skipped 1786 transitions) in 217 ms.
[2021-05-11 12:25:04] [INFO ] Deduced a trap composed of 5 places in 1233 ms of which 4 ms to minimize.
[2021-05-11 12:25:04] [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 close... while checking expression at index 7
[2021-05-11 12:25:05] [INFO ] [Real]Absence check using 57 positive place invariants in 25 ms returned sat
[2021-05-11 12:25:05] [INFO ] [Real]Absence check using 57 positive and 270 generalized place invariants in 74 ms returned sat
[2021-05-11 12:25:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 12:25:07] [INFO ] [Real]Absence check using state equation in 1978 ms returned sat
[2021-05-11 12:25:07] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 12:25:07] [INFO ] [Nat]Absence check using 57 positive place invariants in 27 ms returned sat
[2021-05-11 12:25:07] [INFO ] [Nat]Absence check using 57 positive and 270 generalized place invariants in 71 ms returned sat
[2021-05-11 12:25:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 12:25:14] [INFO ] [Nat]Absence check using state equation in 6390 ms returned unknown
[2021-05-11 12:25:14] [INFO ] [Real]Absence check using 57 positive place invariants in 26 ms returned sat
[2021-05-11 12:25:14] [INFO ] [Real]Absence check using 57 positive and 270 generalized place invariants in 95 ms returned sat
[2021-05-11 12:25:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 12:25:16] [INFO ] [Real]Absence check using state equation in 2197 ms returned sat
[2021-05-11 12:25:16] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 12:25:17] [INFO ] [Nat]Absence check using 57 positive place invariants in 27 ms returned sat
[2021-05-11 12:25:17] [INFO ] [Nat]Absence check using 57 positive and 270 generalized place invariants in 90 ms returned sat
[2021-05-11 12:25:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 12:25:24] [INFO ] [Nat]Absence check using state equation in 7334 ms returned unknown
[2021-05-11 12:25:24] [INFO ] [Real]Absence check using 57 positive place invariants in 28 ms returned sat
[2021-05-11 12:25:24] [INFO ] [Real]Absence check using 57 positive and 270 generalized place invariants in 101 ms returned sat
[2021-05-11 12:25:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 12:25:27] [INFO ] [Real]Absence check using state equation in 2640 ms returned sat
[2021-05-11 12:25:27] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 12:25:27] [INFO ] [Nat]Absence check using 57 positive place invariants in 28 ms returned sat
[2021-05-11 12:25:27] [INFO ] [Nat]Absence check using 57 positive and 270 generalized place invariants in 117 ms returned sat
[2021-05-11 12:25:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 12:25:36] [INFO ] [Nat]Absence check using state equation in 8253 ms returned unknown
[2021-05-11 12:25:36] [INFO ] [Real]Absence check using 57 positive place invariants in 25 ms returned sat
[2021-05-11 12:25:36] [INFO ] [Real]Absence check using 57 positive and 270 generalized place invariants in 73 ms returned sat
[2021-05-11 12:25:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 12:25:37] [INFO ] [Real]Absence check using state equation in 1593 ms returned sat
[2021-05-11 12:25:38] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 12:25:38] [INFO ] [Nat]Absence check using 57 positive place invariants in 25 ms returned sat
[2021-05-11 12:25:38] [INFO ] [Nat]Absence check using 57 positive and 270 generalized place invariants in 68 ms returned sat
[2021-05-11 12:25:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 12:25:43] [INFO ] [Nat]Absence check using state equation in 5439 ms returned sat
[2021-05-11 12:25:44] [INFO ] Deduced a trap composed of 26 places in 300 ms of which 0 ms to minimize.
[2021-05-11 12:25:44] [INFO ] Deduced a trap composed of 24 places in 241 ms of which 0 ms to minimize.
[2021-05-11 12:25:44] [INFO ] Deduced a trap composed of 26 places in 196 ms of which 1 ms to minimize.
[2021-05-11 12:25:44] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1096 ms
[2021-05-11 12:25:45] [INFO ] Computed and/alt/rep : 1352/4301/1352 causal constraints (skipped 1786 transitions) in 196 ms.
[2021-05-11 12:25:49] [INFO ] Added : 138 causal constraints over 28 iterations in 4313 ms. Result :sat
[2021-05-11 12:25:49] [INFO ] [Real]Absence check using 57 positive place invariants in 24 ms returned sat
[2021-05-11 12:25:49] [INFO ] [Real]Absence check using 57 positive and 270 generalized place invariants in 75 ms returned sat
[2021-05-11 12:25:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 12:25:51] [INFO ] [Real]Absence check using state equation in 1785 ms returned sat
[2021-05-11 12:25:51] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 12:25:51] [INFO ] [Nat]Absence check using 57 positive place invariants in 28 ms returned sat
[2021-05-11 12:25:51] [INFO ] [Nat]Absence check using 57 positive and 270 generalized place invariants in 72 ms returned sat
[2021-05-11 12:25:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 12:25:58] [INFO ] [Nat]Absence check using state equation in 6660 ms returned unknown
[2021-05-11 12:25:58] [INFO ] [Real]Absence check using 57 positive place invariants in 25 ms returned sat
[2021-05-11 12:25:58] [INFO ] [Real]Absence check using 57 positive and 270 generalized place invariants in 69 ms returned sat
[2021-05-11 12:25:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 12:26:00] [INFO ] [Real]Absence check using state equation in 1572 ms returned sat
[2021-05-11 12:26:00] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 12:26:00] [INFO ] [Nat]Absence check using 57 positive place invariants in 36 ms returned sat
[2021-05-11 12:26:00] [INFO ] [Nat]Absence check using 57 positive and 270 generalized place invariants in 72 ms returned sat
[2021-05-11 12:26:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 12:26:10] [INFO ] [Nat]Absence check using state equation in 9414 ms returned unknown
[2021-05-11 12:26:10] [INFO ] [Real]Absence check using 57 positive place invariants in 25 ms returned sat
[2021-05-11 12:26:10] [INFO ] [Real]Absence check using 57 positive and 270 generalized place invariants in 65 ms returned sat
[2021-05-11 12:26:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 12:26:11] [INFO ] [Real]Absence check using state equation in 1306 ms returned sat
[2021-05-11 12:26:11] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 12:26:11] [INFO ] [Nat]Absence check using 57 positive place invariants in 27 ms returned sat
[2021-05-11 12:26:12] [INFO ] [Nat]Absence check using 57 positive and 270 generalized place invariants in 65 ms returned sat
[2021-05-11 12:26:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 12:26:13] [INFO ] [Nat]Absence check using state equation in 1721 ms returned sat
[2021-05-11 12:26:13] [INFO ] Deduced a trap composed of 37 places in 143 ms of which 0 ms to minimize.
[2021-05-11 12:26:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 339 ms
[2021-05-11 12:26:14] [INFO ] Computed and/alt/rep : 1352/4301/1352 causal constraints (skipped 1786 transitions) in 203 ms.
[2021-05-11 12:26:31] [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 ... while checking expression at index 14
[2021-05-11 12:26:32] [INFO ] [Real]Absence check using 57 positive place invariants in 26 ms returned sat
[2021-05-11 12:26:32] [INFO ] [Real]Absence check using 57 positive and 270 generalized place invariants in 79 ms returned sat
[2021-05-11 12:26:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 12:26:33] [INFO ] [Real]Absence check using state equation in 1634 ms returned sat
[2021-05-11 12:26:33] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 12:26:34] [INFO ] [Nat]Absence check using 57 positive place invariants in 26 ms returned sat
[2021-05-11 12:26:34] [INFO ] [Nat]Absence check using 57 positive and 270 generalized place invariants in 73 ms returned sat
[2021-05-11 12:26:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 12:26:41] [INFO ] [Nat]Absence check using state equation in 6931 ms returned unknown
Successfully simplified 1 atomic propositions for a total of 16 simplifications.
[2021-05-11 12:26:41] [INFO ] Initial state test concluded for 1 properties.
FORMULA ASLink-PT-10a-CTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Ensure Unique test removed 6 places
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions removed 220 transitions
Trivial Post-agglo rules discarded 220 transitions
Performed 220 trivial Post agglomeration. Transition count delta: 220
Iterating post reduction 0 with 225 rules applied. Total rules applied 225 place count 2062 transition count 2919
Reduce places removed 220 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 222 rules applied. Total rules applied 447 place count 1842 transition count 2917
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 449 place count 1840 transition count 2917
Performed 227 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 227 Pre rules applied. Total rules applied 449 place count 1840 transition count 2690
Deduced a syphon composed of 227 places in 5 ms
Ensure Unique test removed 81 places
Reduce places removed 308 places and 0 transitions.
Iterating global reduction 3 with 535 rules applied. Total rules applied 984 place count 1532 transition count 2690
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 3 with 5 rules applied. Total rules applied 989 place count 1531 transition count 2686
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 5 rules applied. Total rules applied 994 place count 1527 transition count 2685
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 995 place count 1526 transition count 2685
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 12 Pre rules applied. Total rules applied 995 place count 1526 transition count 2673
Deduced a syphon composed of 12 places in 25 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 6 with 24 rules applied. Total rules applied 1019 place count 1514 transition count 2673
Discarding 17 places :
Symmetric choice reduction at 6 with 17 rule applications. Total rules 1036 place count 1497 transition count 2608
Iterating global reduction 6 with 17 rules applied. Total rules applied 1053 place count 1497 transition count 2608
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 6 with 7 rules applied. Total rules applied 1060 place count 1493 transition count 2605
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 1062 place count 1491 transition count 2605
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 1062 place count 1491 transition count 2604
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1064 place count 1490 transition count 2604
Discarding 5 places :
Symmetric choice reduction at 8 with 5 rule applications. Total rules 1069 place count 1485 transition count 2599
Iterating global reduction 8 with 5 rules applied. Total rules applied 1074 place count 1485 transition count 2599
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Deduced a syphon composed of 100 places in 10 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 8 with 200 rules applied. Total rules applied 1274 place count 1385 transition count 2499
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 1278 place count 1381 transition count 2495
Iterating global reduction 8 with 4 rules applied. Total rules applied 1282 place count 1381 transition count 2495
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 1284 place count 1381 transition count 2495
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1286 place count 1379 transition count 2493
Iterating global reduction 8 with 2 rules applied. Total rules applied 1288 place count 1379 transition count 2493
Applied a total of 1288 rules in 707 ms. Remains 1379 /2073 variables (removed 694) and now considering 2493/3139 (removed 646) transitions.
[2021-05-11 12:26:42] [INFO ] Flatten gal took : 94 ms
[2021-05-11 12:26:42] [INFO ] Flatten gal took : 101 ms
[2021-05-11 12:26:42] [INFO ] Input system was already deterministic with 2493 transitions.
[2021-05-11 12:26:42] [INFO ] Flatten gal took : 94 ms
[2021-05-11 12:26:42] [INFO ] Flatten gal took : 95 ms
[2021-05-11 12:26:42] [INFO ] Time to serialize gal into /tmp/CTLFireability9732397457978292520.gal : 50 ms
[2021-05-11 12:26:42] [INFO ] Time to serialize properties into /tmp/CTLFireability15829544251563276189.ctl : 13 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability9732397457978292520.gal, -t, CGAL, -ctl, /tmp/CTLFireability15829544251563276189.ctl, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability9732397457978292520.gal -t CGAL -ctl /tmp/CTLFireability15829544251563276189.ctl --gen-order FOLLOW
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2021-05-11 12:27:12] [INFO ] Flatten gal took : 127 ms
[2021-05-11 12:27:12] [INFO ] Applying decomposition
[2021-05-11 12:27:12] [INFO ] Flatten gal took : 95 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph5257719240981605010.txt, -o, /tmp/graph5257719240981605010.bin, -w, /tmp/graph5257719240981605010.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph5257719240981605010.bin, -l, -1, -v, -w, /tmp/graph5257719240981605010.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-11 12:27:13] [INFO ] Decomposing Gal with order
[2021-05-11 12:27:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-11 12:27:13] [INFO ] Removed a total of 4188 redundant transitions.
[2021-05-11 12:27:13] [INFO ] Flatten gal took : 338 ms
[2021-05-11 12:27:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 81 labels/synchronizations in 71 ms.
[2021-05-11 12:27:13] [INFO ] Time to serialize gal into /tmp/CTLFireability16901515410855227168.gal : 28 ms
[2021-05-11 12:27:13] [INFO ] Time to serialize properties into /tmp/CTLFireability6051022159089274816.ctl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability16901515410855227168.gal, -t, CGAL, -ctl, /tmp/CTLFireability6051022159089274816.ctl], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability16901515410855227168.gal -t CGAL -ctl /tmp/CTLFireability6051022159089274816.ctl
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2021-05-11 12:27:44] [INFO ] Flatten gal took : 219 ms
[2021-05-11 12:27:44] [INFO ] Flatten gal took : 114 ms
[2021-05-11 12:27:44] [INFO ] Applying decomposition
[2021-05-11 12:27:44] [INFO ] Flatten gal took : 109 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph15378308251843617378.txt, -o, /tmp/graph15378308251843617378.bin, -w, /tmp/graph15378308251843617378.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph15378308251843617378.bin, -l, -1, -v, -w, /tmp/graph15378308251843617378.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-11 12:27:44] [INFO ] Decomposing Gal with order
[2021-05-11 12:27:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-11 12:27:45] [INFO ] Removed a total of 4150 redundant transitions.
[2021-05-11 12:27:45] [INFO ] Flatten gal took : 196 ms
[2021-05-11 12:27:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 74 labels/synchronizations in 53 ms.
[2021-05-11 12:27:45] [INFO ] Time to serialize gal into /tmp/CTLFireability16378103290504041389.gal : 19 ms
[2021-05-11 12:27:45] [INFO ] Time to serialize properties into /tmp/CTLFireability16556534585997252092.ctl : 7 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability16378103290504041389.gal, -t, CGAL, -ctl, /tmp/CTLFireability16556534585997252092.ctl], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability16378103290504041389.gal -t CGAL -ctl /tmp/CTLFireability16556534585997252092.ctl
No direction supplied, using forward translation only.
Parsed 15 CTL formulae.
Detected timeout of ITS tools.
[2021-05-11 12:49:13] [INFO ] Applying decomposition
[2021-05-11 12:49:13] [INFO ] Flatten gal took : 134 ms
[2021-05-11 12:49:13] [INFO ] Decomposing Gal with order
[2021-05-11 12:49:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-11 12:49:14] [INFO ] Removed a total of 3682 redundant transitions.
[2021-05-11 12:49:14] [INFO ] Flatten gal took : 238 ms
[2021-05-11 12:49:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 1325 labels/synchronizations in 82 ms.
[2021-05-11 12:49:20] [INFO ] Time to serialize gal into /tmp/CTLFireability8213126024383148613.gal : 6039 ms
[2021-05-11 12:49:20] [INFO ] Time to serialize properties into /tmp/CTLFireability9666436520204918169.ctl : 79 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability8213126024383148613.gal, -t, CGAL, -ctl, /tmp/CTLFireability9666436520204918169.ctl], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability8213126024383148613.gal -t CGAL -ctl /tmp/CTLFireability9666436520204918169.ctl
No direction supplied, using forward translation only.
Parsed 15 CTL formulae.
Detected timeout of ITS tools.
[2021-05-11 13:11:08] [INFO ] Flatten gal took : 436 ms
[2021-05-11 13:11:10] [INFO ] Input system was already deterministic with 3139 transitions.
[2021-05-11 13:11:11] [INFO ] Transformed 2073 places.
[2021-05-11 13:11:11] [INFO ] Transformed 3139 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2021-05-11 13:11:50] [INFO ] Time to serialize gal into /tmp/CTLFireability6754694774066171198.gal : 18 ms
[2021-05-11 13:11:50] [INFO ] Time to serialize properties into /tmp/CTLFireability143525718470420554.ctl : 5 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability6754694774066171198.gal, -t, CGAL, -ctl, /tmp/CTLFireability143525718470420554.ctl, --load-order, /home/mcc/execution/model.ord, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability6754694774066171198.gal -t CGAL -ctl /tmp/CTLFireability143525718470420554.ctl --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.
Parsed 15 CTL formulae.

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination CTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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-10a"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is ASLink-PT-10a, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r007-tall-162037989600156"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ASLink-PT-10a.tgz
mv ASLink-PT-10a execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;