About the Execution of ITS-Tools for SwimmingPool-PT-03
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 10295.623 | 3600000.00 | 3852675.00 | 76615.60 | TFTTTFFFTFFF?TFF | 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.r254-tall-162106746400733.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 SwimmingPool-PT-03, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r254-tall-162106746400733
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 388K
-rw-r--r-- 1 mcc users 14K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 117K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 93K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Mar 28 16:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Mar 28 16:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Mar 27 14:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 27 14:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Mar 25 20:10 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 25 20:10 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 08:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 08:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:52 equiv_col
-rw-r--r-- 1 mcc users 3 May 5 16:52 instance
-rw-r--r-- 1 mcc users 6 May 5 16:52 iscolored
-rw-r--r-- 1 mcc users 3.9K May 5 16:52 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 SwimmingPool-PT-03-00
FORMULA_NAME SwimmingPool-PT-03-01
FORMULA_NAME SwimmingPool-PT-03-02
FORMULA_NAME SwimmingPool-PT-03-03
FORMULA_NAME SwimmingPool-PT-03-04
FORMULA_NAME SwimmingPool-PT-03-05
FORMULA_NAME SwimmingPool-PT-03-06
FORMULA_NAME SwimmingPool-PT-03-07
FORMULA_NAME SwimmingPool-PT-03-08
FORMULA_NAME SwimmingPool-PT-03-09
FORMULA_NAME SwimmingPool-PT-03-10
FORMULA_NAME SwimmingPool-PT-03-11
FORMULA_NAME SwimmingPool-PT-03-12
FORMULA_NAME SwimmingPool-PT-03-13
FORMULA_NAME SwimmingPool-PT-03-14
FORMULA_NAME SwimmingPool-PT-03-15
=== Now, execution of the tool begins
BK_START 1621269612145
Running Version 0
[2021-05-17 16:40:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -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-17 16:40:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 16:40:14] [INFO ] Load time of PNML (sax parser for PT used): 19 ms
[2021-05-17 16:40:14] [INFO ] Transformed 9 places.
[2021-05-17 16:40:14] [INFO ] Transformed 7 transitions.
[2021-05-17 16:40:14] [INFO ] Parsed PT model containing 9 places and 7 transitions in 54 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2021-05-17 16:40:14] [INFO ] Initial state test concluded for 2 properties.
Support contains 9 out of 9 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 28 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 16:40:14] [INFO ] Computed 3 place invariants in 4 ms
[2021-05-17 16:40:14] [INFO ] Implicit Places using invariants in 71 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 16:40:14] [INFO ] Computed 3 place invariants in 2 ms
[2021-05-17 16:40:14] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 134 ms to find 0 implicit places.
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 16:40:14] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-17 16:40:14] [INFO ] Dead Transitions using invariants and state equation in 16 ms returned []
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 7/7 transitions.
[2021-05-17 16:40:14] [INFO ] Initial state reduction rules for LTL removed 5 formulas.
[2021-05-17 16:40:14] [INFO ] Flatten gal took : 16 ms
FORMULA SwimmingPool-PT-03-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SwimmingPool-PT-03-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SwimmingPool-PT-03-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SwimmingPool-PT-03-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SwimmingPool-PT-03-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-17 16:40:14] [INFO ] Flatten gal took : 3 ms
[2021-05-17 16:40:14] [INFO ] Input system was already deterministic with 7 transitions.
Finished random walk after 216 steps, including 0 resets, run visited all 9 properties in 2 ms. (steps per millisecond=108 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)||X(X(G(p1)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 9 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 3 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 16:40:15] [INFO ] Computed 3 place invariants in 2 ms
[2021-05-17 16:40:15] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 16:40:15] [INFO ] Computed 3 place invariants in 2 ms
[2021-05-17 16:40:15] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 16:40:15] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 16:40:15] [INFO ] Dead Transitions using invariants and state equation in 12 ms returned []
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 7/7 transitions.
Stuttering acceptance computed with spot in 228 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : SwimmingPool-PT-03-00 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (LT s4 1) (GEQ s3 1) (GEQ s7 1)), p1:(AND (GEQ s0 1) (GEQ s7 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 10198 reset in 221 ms.
Product exploration explored 100000 steps with 10233 reset in 144 ms.
Knowledge obtained : [(NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 10201 reset in 95 ms.
Product exploration explored 100000 steps with 10263 reset in 208 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 9 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 9/9 places, 7/7 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 9 transition count 7
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 9 transition count 7
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 1 rules in 6 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
[2021-05-17 16:40:16] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 16:40:16] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-17 16:40:16] [INFO ] Dead Transitions using invariants and state equation in 21 ms returned []
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 7/7 transitions.
Product exploration explored 100000 steps with 15078 reset in 239 ms.
Product exploration explored 100000 steps with 15168 reset in 143 ms.
[2021-05-17 16:40:16] [INFO ] Flatten gal took : 2 ms
[2021-05-17 16:40:16] [INFO ] Flatten gal took : 2 ms
[2021-05-17 16:40:16] [INFO ] Time to serialize gal into /tmp/LTL18444181006859423285.gal : 0 ms
[2021-05-17 16:40:16] [INFO ] Time to serialize properties into /tmp/LTL12020603036346275368.ltl : 0 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-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL18444181006859423285.gal, -t, CGAL, -LTL, /tmp/LTL12020603036346275368.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL18444181006859423285.gal -t CGAL -LTL /tmp/LTL12020603036346275368.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((F("(((Dress<1)&&(InBath>=1))&&(Cabins>=1))"))||(X(X(G("((Entered>=1)&&(Cabins>=1))"))))))
Formula 0 simplified : !(F"(((Dress<1)&&(InBath>=1))&&(Cabins>=1))" | XXG"((Entered>=1)&&(Cabins>=1))")
Detected timeout of ITS tools.
[2021-05-17 16:40:31] [INFO ] Flatten gal took : 2 ms
[2021-05-17 16:40:31] [INFO ] Applying decomposition
[2021-05-17 16:40:31] [INFO ] Flatten gal took : 1 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/graph16808112016812468773.txt, -o, /tmp/graph16808112016812468773.bin, -w, /tmp/graph16808112016812468773.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/graph16808112016812468773.bin, -l, -1, -v, -w, /tmp/graph16808112016812468773.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 16:40:31] [INFO ] Decomposing Gal with order
[2021-05-17 16:40:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 16:40:31] [INFO ] Flatten gal took : 18 ms
[2021-05-17 16:40:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-17 16:40:31] [INFO ] Time to serialize gal into /tmp/LTL7042291543945887171.gal : 1 ms
[2021-05-17 16:40:31] [INFO ] Time to serialize properties into /tmp/LTL7240913588547458676.ltl : 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-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL7042291543945887171.gal, -t, CGAL, -LTL, /tmp/LTL7240913588547458676.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL7042291543945887171.gal -t CGAL -LTL /tmp/LTL7240913588547458676.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !(((F("(((u0.Dress<1)&&(u0.InBath>=1))&&(u2.Cabins>=1))"))||(X(X(G("((u1.Entered>=1)&&(u2.Cabins>=1))"))))))
Formula 0 simplified : !(F"(((u0.Dress<1)&&(u0.InBath>=1))&&(u2.Cabins>=1))" | XXG"((u1.Entered>=1)&&(u2.Cabins>=1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12490631658889185830
[2021-05-17 16:40:46] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12490631658889185830
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin12490631658889185830]
Compilation finished in 157 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin12490631658889185830]
Link finished in 40 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, (<>((LTLAPp0==true))||X(X([]((LTLAPp1==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin12490631658889185830]
LTSmin run took 951 ms.
FORMULA SwimmingPool-PT-03-00 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property SwimmingPool-PT-03-00 finished in 33109 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(G(p0))||G(p1)))], workingDir=/home/mcc/execution]
Support contains 3 out of 9 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 16:40:48] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-17 16:40:48] [INFO ] Implicit Places using invariants in 9 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 16:40:48] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-17 16:40:48] [INFO ] Implicit Places using invariants and state equation in 12 ms returned []
Implicit Place search using SMT with State Equation took 22 ms to find 0 implicit places.
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 16:40:48] [INFO ] Computed 3 place invariants in 2 ms
[2021-05-17 16:40:48] [INFO ] Dead Transitions using invariants and state equation in 10 ms returned []
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 7/7 transitions.
Stuttering acceptance computed with spot in 173 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : SwimmingPool-PT-03-01 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 2}, { cond=(AND p1 p0), acceptance={} source=3 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=1, aps=[p1:(OR (LT s1 1) (LT s8 1)), p0:(GEQ s5 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA SwimmingPool-PT-03-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SwimmingPool-PT-03-01 finished in 216 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 1 out of 9 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 9/9 places, 7/7 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 9 transition count 6
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 8 transition count 6
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 8 transition count 5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 7 transition count 5
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 6 transition count 4
Applied a total of 6 rules in 11 ms. Remains 6 /9 variables (removed 3) and now considering 4/7 (removed 3) transitions.
// Phase 1: matrix 4 rows 6 cols
[2021-05-17 16:40:48] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 16:40:48] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 4 rows 6 cols
[2021-05-17 16:40:48] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 16:40:48] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 35 ms to find 0 implicit places.
[2021-05-17 16:40:48] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 4 rows 6 cols
[2021-05-17 16:40:48] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 16:40:48] [INFO ] Dead Transitions using invariants and state equation in 12 ms returned []
Finished structural reductions, in 1 iterations. Remains : 6/9 places, 4/7 transitions.
Stuttering acceptance computed with spot in 22 ms :[(NOT p0)]
Running random walk in product with property : SwimmingPool-PT-03-02 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s2 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 15102 reset in 78 ms.
Product exploration explored 100000 steps with 15093 reset in 79 ms.
Knowledge obtained : [(NOT p0)]
Stuttering acceptance computed with spot in 23 ms :[(NOT p0)]
Product exploration explored 100000 steps with 15140 reset in 63 ms.
Product exploration explored 100000 steps with 15169 reset in 75 ms.
[2021-05-17 16:40:48] [INFO ] Flatten gal took : 1 ms
[2021-05-17 16:40:48] [INFO ] Flatten gal took : 0 ms
[2021-05-17 16:40:48] [INFO ] Time to serialize gal into /tmp/LTL12784198158279017229.gal : 0 ms
[2021-05-17 16:40:48] [INFO ] Time to serialize properties into /tmp/LTL15467866192927543365.ltl : 0 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-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL12784198158279017229.gal, -t, CGAL, -LTL, /tmp/LTL15467866192927543365.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL12784198158279017229.gal -t CGAL -LTL /tmp/LTL15467866192927543365.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F("(Dress>=1)")))
Formula 0 simplified : !F"(Dress>=1)"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
84 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.856629,28876,1,0,530,56907,20,107,369,58990,1063
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA SwimmingPool-PT-03-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property SwimmingPool-PT-03-02 finished in 1342 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((p0||X(p0)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 9 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 16:40:49] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-17 16:40:49] [INFO ] Implicit Places using invariants in 9 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 16:40:49] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 16:40:49] [INFO ] Implicit Places using invariants and state equation in 11 ms returned []
Implicit Place search using SMT with State Equation took 21 ms to find 0 implicit places.
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 16:40:49] [INFO ] Computed 3 place invariants in 6 ms
[2021-05-17 16:40:49] [INFO ] Dead Transitions using invariants and state equation in 15 ms returned []
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 7/7 transitions.
Stuttering acceptance computed with spot in 46 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SwimmingPool-PT-03-04 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s3 1) (GEQ s7 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 10203 reset in 70 ms.
Product exploration explored 100000 steps with 10268 reset in 79 ms.
Knowledge obtained : [(NOT p0)]
Stuttering acceptance computed with spot in 44 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 10257 reset in 70 ms.
Product exploration explored 100000 steps with 10232 reset in 93 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 43 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 9 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 9/9 places, 7/7 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 9 transition count 7
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 1 place count 9 transition count 7
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 3 place count 9 transition count 7
Deduced a syphon composed of 3 places in 0 ms
Applied a total of 3 rules in 2 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
[2021-05-17 16:40:50] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 16:40:50] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 16:40:50] [INFO ] Dead Transitions using invariants and state equation in 11 ms returned []
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 7/7 transitions.
Product exploration explored 100000 steps with 19059 reset in 116 ms.
Product exploration explored 100000 steps with 19039 reset in 95 ms.
[2021-05-17 16:40:50] [INFO ] Flatten gal took : 1 ms
[2021-05-17 16:40:50] [INFO ] Flatten gal took : 1 ms
[2021-05-17 16:40:50] [INFO ] Time to serialize gal into /tmp/LTL5045468300354677291.gal : 0 ms
[2021-05-17 16:40:50] [INFO ] Time to serialize properties into /tmp/LTL17101125590505520342.ltl : 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-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL5045468300354677291.gal, -t, CGAL, -LTL, /tmp/LTL17101125590505520342.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL5045468300354677291.gal -t CGAL -LTL /tmp/LTL17101125590505520342.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F((X("((InBath>=1)&&(Cabins>=1))"))||("((InBath>=1)&&(Cabins>=1))")))))
Formula 0 simplified : !XF("((InBath>=1)&&(Cabins>=1))" | X"((InBath>=1)&&(Cabins>=1))")
Detected timeout of ITS tools.
[2021-05-17 16:41:05] [INFO ] Flatten gal took : 1 ms
[2021-05-17 16:41:05] [INFO ] Applying decomposition
[2021-05-17 16:41:05] [INFO ] Flatten gal took : 1 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/graph4521352521645768504.txt, -o, /tmp/graph4521352521645768504.bin, -w, /tmp/graph4521352521645768504.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/graph4521352521645768504.bin, -l, -1, -v, -w, /tmp/graph4521352521645768504.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 16:41:05] [INFO ] Decomposing Gal with order
[2021-05-17 16:41:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 16:41:05] [INFO ] Flatten gal took : 2 ms
[2021-05-17 16:41:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-17 16:41:05] [INFO ] Time to serialize gal into /tmp/LTL11163132421913181341.gal : 0 ms
[2021-05-17 16:41:05] [INFO ] Time to serialize properties into /tmp/LTL13893623879128746824.ltl : 0 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-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL11163132421913181341.gal, -t, CGAL, -LTL, /tmp/LTL13893623879128746824.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL11163132421913181341.gal -t CGAL -LTL /tmp/LTL13893623879128746824.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(F((X("((u2.InBath>=1)&&(u1.Cabins>=1))"))||("((u2.InBath>=1)&&(u1.Cabins>=1))")))))
Formula 0 simplified : !XF("((u2.InBath>=1)&&(u1.Cabins>=1))" | X"((u2.InBath>=1)&&(u1.Cabins>=1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8088105493383290575
[2021-05-17 16:41:20] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8088105493383290575
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin8088105493383290575]
Compilation finished in 93 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin8088105493383290575]
Link finished in 31 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(<>((X((LTLAPp0==true))||(LTLAPp0==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin8088105493383290575]
LTSmin run took 520 ms.
FORMULA SwimmingPool-PT-03-04 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property SwimmingPool-PT-03-04 finished in 31556 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(!p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 9 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 9/9 places, 7/7 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 9 transition count 6
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 8 transition count 6
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 8 transition count 5
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 7 transition count 5
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 6 transition count 4
Applied a total of 6 rules in 3 ms. Remains 6 /9 variables (removed 3) and now considering 4/7 (removed 3) transitions.
// Phase 1: matrix 4 rows 6 cols
[2021-05-17 16:41:21] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 16:41:21] [INFO ] Implicit Places using invariants in 11 ms returned []
// Phase 1: matrix 4 rows 6 cols
[2021-05-17 16:41:21] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 16:41:21] [INFO ] Implicit Places using invariants and state equation in 11 ms returned []
Implicit Place search using SMT with State Equation took 23 ms to find 0 implicit places.
[2021-05-17 16:41:21] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 4 rows 6 cols
[2021-05-17 16:41:21] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 16:41:21] [INFO ] Dead Transitions using invariants and state equation in 12 ms returned []
Finished structural reductions, in 1 iterations. Remains : 6/9 places, 4/7 transitions.
Stuttering acceptance computed with spot in 26 ms :[p0]
Running random walk in product with property : SwimmingPool-PT-03-06 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s2 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 105 ms.
Stack based approach found an accepted trace after 3 steps with 0 reset with depth 4 and stack size 4 in 0 ms.
FORMULA SwimmingPool-PT-03-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SwimmingPool-PT-03-06 finished in 181 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)&&F((X(p1)&&G(p2)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 9 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 16:41:21] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 16:41:21] [INFO ] Implicit Places using invariants in 8 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 16:41:21] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-17 16:41:21] [INFO ] Implicit Places using invariants and state equation in 12 ms returned []
Implicit Place search using SMT with State Equation took 20 ms to find 0 implicit places.
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 16:41:21] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-17 16:41:21] [INFO ] Dead Transitions using invariants and state equation in 9 ms returned []
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 7/7 transitions.
Stuttering acceptance computed with spot in 142 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (NOT p0), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Running random walk in product with property : SwimmingPool-PT-03-07 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}, { cond=p2, acceptance={} source=0 dest: 3}, { cond=p2, acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}, { cond=p2, acceptance={0} source=2 dest: 3}, { cond=p2, acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 2}, { cond=p2, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(GEQ s4 1), p2:(GEQ s6 1), p1:(AND (GEQ s3 1) (GEQ s7 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 107 reset in 85 ms.
Stack based approach found an accepted trace after 6878 steps with 9 reset with depth 985 and stack size 978 in 17 ms.
FORMULA SwimmingPool-PT-03-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SwimmingPool-PT-03-07 finished in 285 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((p0&&G((F(G(!p1)) U p0)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 9 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 9/9 places, 7/7 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 9 transition count 6
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 8 transition count 6
Applied a total of 2 rules in 1 ms. Remains 8 /9 variables (removed 1) and now considering 6/7 (removed 1) transitions.
// Phase 1: matrix 6 rows 8 cols
[2021-05-17 16:41:21] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 16:41:21] [INFO ] Implicit Places using invariants in 9 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2021-05-17 16:41:21] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 16:41:21] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 30 ms to find 0 implicit places.
[2021-05-17 16:41:21] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2021-05-17 16:41:21] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 16:41:21] [INFO ] Dead Transitions using invariants and state equation in 13 ms returned []
Finished structural reductions, in 1 iterations. Remains : 8/9 places, 6/7 transitions.
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (NOT p0), (AND (NOT p0) p1), (NOT p0)]
Running random walk in product with property : SwimmingPool-PT-03-09 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0, 1} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={1} source=2 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0, 1} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=(NOT p0), acceptance={0, 1} source=3 dest: 3}]], initial=0, aps=[p0:(GEQ s5 1), p1:(OR (LT s1 1) (LT s7 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 0 reset in 207 ms.
Stack based approach found an accepted trace after 3703 steps with 0 reset with depth 3704 and stack size 3571 in 10 ms.
FORMULA SwimmingPool-PT-03-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SwimmingPool-PT-03-09 finished in 386 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(G(!p0))||G((!p1&&F(p2)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 9 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 16:41:22] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 16:41:22] [INFO ] Implicit Places using invariants in 9 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 16:41:22] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 16:41:22] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 28 ms to find 0 implicit places.
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 16:41:22] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-17 16:41:22] [INFO ] Dead Transitions using invariants and state equation in 12 ms returned []
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 7/7 transitions.
Stuttering acceptance computed with spot in 128 ms :[(OR (AND p0 (NOT p2)) (AND p0 p1)), p0, (OR (AND p0 (NOT p2)) (AND p0 p1)), true, (NOT p2), (OR (NOT p2) p1)]
Running random walk in product with property : SwimmingPool-PT-03-11 automaton TGBA [mat=[[{ cond=p1, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 2}, { cond=(AND p1 p0), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}], [{ cond=p1, acceptance={} source=5 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=5 dest: 4}, { cond=(NOT p1), acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(GEQ s4 1), p0:(GEQ s6 1), p2:(AND (GEQ s6 1) (GEQ s0 1) (GEQ s7 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 16 steps with 0 reset in 0 ms.
FORMULA SwimmingPool-PT-03-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SwimmingPool-PT-03-11 finished in 182 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G((p0 U (F(p1)||X(G(!p2)))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 9 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 16:41:22] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 16:41:22] [INFO ] Implicit Places using invariants in 8 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 16:41:22] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 16:41:22] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 23 ms to find 0 implicit places.
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 16:41:22] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 16:41:22] [INFO ] Dead Transitions using invariants and state equation in 12 ms returned []
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 7/7 transitions.
Stuttering acceptance computed with spot in 128 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2), (NOT p1)]
Running random walk in product with property : SwimmingPool-PT-03-12 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p0 p2), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(GEQ s6 1), p0:(GEQ s4 1), p2:(OR (LT s1 1) (LT s8 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 67 reset in 87 ms.
Product exploration explored 100000 steps with 74 reset in 100 ms.
Knowledge obtained : [p1, (NOT p0), p2]
Stuttering acceptance computed with spot in 117 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2), (NOT p1)]
Product exploration explored 100000 steps with 66 reset in 123 ms.
Product exploration explored 100000 steps with 70 reset in 140 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 215 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2), (NOT p1)]
Support contains 4 out of 9 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 9/9 places, 7/7 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 9 transition count 7
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 1 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
[2021-05-17 16:41:23] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 16:41:23] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 16:41:23] [INFO ] Dead Transitions using invariants and state equation in 9 ms returned []
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 7/7 transitions.
Product exploration explored 100000 steps with 70 reset in 204 ms.
Product exploration explored 100000 steps with 65 reset in 259 ms.
[2021-05-17 16:41:23] [INFO ] Flatten gal took : 1 ms
[2021-05-17 16:41:23] [INFO ] Flatten gal took : 1 ms
[2021-05-17 16:41:23] [INFO ] Time to serialize gal into /tmp/LTL16591381720685752870.gal : 0 ms
[2021-05-17 16:41:23] [INFO ] Time to serialize properties into /tmp/LTL5154166413857591373.ltl : 0 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-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL16591381720685752870.gal, -t, CGAL, -LTL, /tmp/LTL5154166413857591373.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL16591381720685752870.gal -t CGAL -LTL /tmp/LTL5154166413857591373.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(G(("(Dress>=1)")U((F("(Out>=1)"))||(X(G("((WaitBag>=1)&&(Bags>=1))"))))))))
Formula 0 simplified : !XG("(Dress>=1)" U (F"(Out>=1)" | XG"((WaitBag>=1)&&(Bags>=1))"))
Detected timeout of ITS tools.
[2021-05-17 16:41:38] [INFO ] Flatten gal took : 1 ms
[2021-05-17 16:41:38] [INFO ] Applying decomposition
[2021-05-17 16:41:38] [INFO ] Flatten gal took : 1 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/graph12746186402556629461.txt, -o, /tmp/graph12746186402556629461.bin, -w, /tmp/graph12746186402556629461.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/graph12746186402556629461.bin, -l, -1, -v, -w, /tmp/graph12746186402556629461.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 16:41:38] [INFO ] Decomposing Gal with order
[2021-05-17 16:41:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 16:41:38] [INFO ] Flatten gal took : 2 ms
[2021-05-17 16:41:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-17 16:41:38] [INFO ] Time to serialize gal into /tmp/LTL8228546539743466560.gal : 1 ms
[2021-05-17 16:41:38] [INFO ] Time to serialize properties into /tmp/LTL17477132571879430809.ltl : 0 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-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL8228546539743466560.gal, -t, CGAL, -LTL, /tmp/LTL17477132571879430809.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL8228546539743466560.gal -t CGAL -LTL /tmp/LTL17477132571879430809.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(G(("(u1.Dress>=1)")U((F("(u0.Out>=1)"))||(X(G("((u2.WaitBag>=1)&&(u1.Bags>=1))"))))))))
Formula 0 simplified : !XG("(u1.Dress>=1)" U (F"(u0.Out>=1)" | XG"((u2.WaitBag>=1)&&(u1.Bags>=1))"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin514731171644119842
[2021-05-17 16:41:53] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin514731171644119842
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin514731171644119842]
Compilation finished in 93 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin514731171644119842]
Link finished in 30 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X([](((LTLAPp0==true) U (<>((LTLAPp1==true))||X([]((LTLAPp2==true))))))), --buchi-type=spotba], workingDir=/tmp/ltsmin514731171644119842]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property SwimmingPool-PT-03-12 finished in 46696 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(((X(p0)&&F((p0&&F(!p1))))||X(G(p0)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 9 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 16:42:08] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 16:42:09] [INFO ] Implicit Places using invariants in 8 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 16:42:09] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 16:42:09] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 24 ms to find 0 implicit places.
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 16:42:09] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 16:42:09] [INFO ] Dead Transitions using invariants and state equation in 20 ms returned []
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 7/7 transitions.
Stuttering acceptance computed with spot in 147 ms :[p1, (NOT p0), (NOT p0), (NOT p0), (AND p1 (NOT p0)), true, (NOT p0)]
Running random walk in product with property : SwimmingPool-PT-03-14 automaton TGBA [mat=[[{ cond=p1, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(OR (NOT p0) p1), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 0}, { cond=(AND p0 p1), acceptance={} source=4 dest: 4}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(AND p0 p1), acceptance={} source=6 dest: 4}, { cond=(NOT p0), acceptance={} source=6 dest: 5}]], initial=2, aps=[p1:(GEQ s4 1), p0:(OR (LT s1 1) (LT s8 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 8 steps with 2 reset in 0 ms.
FORMULA SwimmingPool-PT-03-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SwimmingPool-PT-03-14 finished in 203 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((G(p0)||X((p1||X((!p0&&X(!p0))))))))], workingDir=/home/mcc/execution]
Support contains 2 out of 9 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 16:42:09] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 16:42:09] [INFO ] Implicit Places using invariants in 12 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 16:42:09] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 16:42:09] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 27 ms to find 0 implicit places.
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 16:42:09] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 16:42:09] [INFO ] Dead Transitions using invariants and state equation in 9 ms returned []
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 7/7 transitions.
Stuttering acceptance computed with spot in 171 ms :[false, (AND p0 (NOT p1)), false, false, p0, true, p0, (NOT p0)]
Running random walk in product with property : SwimmingPool-PT-03-15 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 6}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 6}, { cond=p0, acceptance={} source=3 dest: 7}], [{ cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 1}, { cond=p0, acceptance={} source=4 dest: 5}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p0) p1), acceptance={} source=6 dest: 4}, { cond=p0, acceptance={} source=6 dest: 5}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=6 dest: 6}], [{ cond=(NOT p0), acceptance={} source=7 dest: 5}, { cond=p0, acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(GEQ s4 1), p1:(GEQ s6 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 708 steps with 0 reset in 1 ms.
FORMULA SwimmingPool-PT-03-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SwimmingPool-PT-03-15 finished in 218 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin13063848794401391886
[2021-05-17 16:42:09] [INFO ] Computing symmetric may disable matrix : 7 transitions.
[2021-05-17 16:42:09] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-17 16:42:09] [INFO ] Applying decomposition
[2021-05-17 16:42:09] [INFO ] Computing symmetric may enable matrix : 7 transitions.
[2021-05-17 16:42:09] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-17 16:42:09] [INFO ] Computing Do-Not-Accords matrix : 7 transitions.
[2021-05-17 16:42:09] [INFO ] Flatten gal took : 1 ms
[2021-05-17 16:42:09] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-17 16:42:09] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13063848794401391886
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin13063848794401391886]
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/graph17214181972562299846.txt, -o, /tmp/graph17214181972562299846.bin, -w, /tmp/graph17214181972562299846.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/graph17214181972562299846.bin, -l, -1, -v, -w, /tmp/graph17214181972562299846.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 16:42:09] [INFO ] Decomposing Gal with order
[2021-05-17 16:42:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 16:42:09] [INFO ] Flatten gal took : 1 ms
[2021-05-17 16:42:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-17 16:42:09] [INFO ] Time to serialize gal into /tmp/LTLFireability7350612707120533964.gal : 0 ms
[2021-05-17 16:42:09] [INFO ] Time to serialize properties into /tmp/LTLFireability1988621469184511264.ltl : 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-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTLFireability7350612707120533964.gal, -t, CGAL, -LTL, /tmp/LTLFireability1988621469184511264.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireability7350612707120533964.gal -t CGAL -LTL /tmp/LTLFireability1988621469184511264.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(G(("(u1.Dress>=1)")U((F("(u2.Out>=1)"))||(X(G("((u0.WaitBag>=1)&&(u1.Bags>=1))"))))))))
Formula 0 simplified : !XG("(u1.Dress>=1)" U (F"(u2.Out>=1)" | XG"((u0.WaitBag>=1)&&(u1.Bags>=1))"))
Compilation finished in 122 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin13063848794401391886]
Link finished in 32 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X([](((LTLAPp0==true) U (<>((LTLAPp1==true))||X([](!(LTLAPp2==true))))))), --buchi-type=spotba], workingDir=/tmp/ltsmin13063848794401391886]
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.024: Loading model from ./gal.so
pins2lts-mc-linux64( 5/ 8), 0.015: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.035: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.035: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.035: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.035: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.036: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.023: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.036: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.023: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.015: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.015: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.047: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.047: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.015: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.043: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.043: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.223: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.223: LTL layer: formula: X([](((LTLAPp0==true) U (<>((LTLAPp1==true))||X([](!(LTLAPp2==true)))))))
pins2lts-mc-linux64( 3/ 8), 0.223: "X([](((LTLAPp0==true) U (<>((LTLAPp1==true))||X([](!(LTLAPp2==true)))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 3/ 8), 0.223: Using Spin LTL semantics
pins2lts-mc-linux64( 2/ 8), 0.239: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.231: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.223: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.239: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.231: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.231: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.252: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.265: There are 11 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.266: State length is 10, there are 20 groups
pins2lts-mc-linux64( 0/ 8), 0.266: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.266: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.266: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.266: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 2/ 8), 0.344: [Blue] ~120 levels ~960 states ~2352 transitions
pins2lts-mc-linux64( 1/ 8), 0.353: [Blue] ~168 levels ~1920 states ~3752 transitions
pins2lts-mc-linux64( 1/ 8), 0.357: [Blue] ~257 levels ~3840 states ~5984 transitions
pins2lts-mc-linux64( 1/ 8), 0.358: [Blue] ~302 levels ~7680 states ~11216 transitions
pins2lts-mc-linux64( 1/ 8), 0.359: [Blue] ~302 levels ~15360 states ~24080 transitions
pins2lts-mc-linux64( 1/ 8), 0.362: [Blue] ~302 levels ~30720 states ~53896 transitions
pins2lts-mc-linux64( 1/ 8), 0.382: [Blue] ~302 levels ~61440 states ~122096 transitions
pins2lts-mc-linux64( 5/ 8), 0.387: [Blue] ~296 levels ~122880 states ~287864 transitions
pins2lts-mc-linux64( 6/ 8), 0.449: [Blue] ~295 levels ~245760 states ~603944 transitions
pins2lts-mc-linux64( 2/ 8), 0.596: [Blue] ~297 levels ~491520 states ~1243424 transitions
pins2lts-mc-linux64( 2/ 8), 0.856: [Blue] ~297 levels ~983040 states ~2558648 transitions
pins2lts-mc-linux64( 2/ 8), 1.417: [Blue] ~297 levels ~1966080 states ~5251784 transitions
pins2lts-mc-linux64( 2/ 8), 2.510: [Blue] ~297 levels ~3932160 states ~10871224 transitions
pins2lts-mc-linux64( 1/ 8), 4.748: [Blue] ~302 levels ~7864320 states ~22026888 transitions
pins2lts-mc-linux64( 7/ 8), 11.538: [Blue] ~486873 levels ~15728640 states ~57327376 transitions
pins2lts-mc-linux64( 7/ 8), 30.964: [Blue] ~2379915 levels ~31457280 states ~154149288 transitions
pins2lts-mc-linux64( 5/ 8), 73.773: [Blue] ~6074280 levels ~62914560 states ~366257608 transitions
pins2lts-mc-linux64( 7/ 8), 159.356: [Blue] ~13742578 levels ~125829120 states ~758369904 transitions
pins2lts-mc-linux64( 0/ 8), 183.002, file cndfs.c, line 199: assertion "onstack != FSET_FULL" failed
*** segmentation fault ***
Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): invalid chunk size
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X([](((LTLAPp0==true) U (<>((LTLAPp1==true))||X([](!(LTLAPp2==true))))))), --buchi-type=spotba], workingDir=/tmp/ltsmin13063848794401391886]
134
java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X([](((LTLAPp0==true) U (<>((LTLAPp1==true))||X([](!(LTLAPp2==true))))))), --buchi-type=spotba], workingDir=/tmp/ltsmin13063848794401391886]
134
at fr.lip6.move.gal.application.LTSminRunner.checkProperty(LTSminRunner.java:214)
at fr.lip6.move.gal.application.LTSminRunner.access$10(LTSminRunner.java:165)
at fr.lip6.move.gal.application.LTSminRunner$1.checkProperties(LTSminRunner.java:154)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:98)
at java.base/java.lang.Thread.run(Thread.java:834)
Detected timeout of ITS tools.
[2021-05-17 17:02:47] [INFO ] Flatten gal took : 1 ms
[2021-05-17 17:02:47] [INFO ] Time to serialize gal into /tmp/LTLFireability7238351998328773783.gal : 0 ms
[2021-05-17 17:02:47] [INFO ] Time to serialize properties into /tmp/LTLFireability11521975384001845431.ltl : 0 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-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTLFireability7238351998328773783.gal, -t, CGAL, -LTL, /tmp/LTLFireability11521975384001845431.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireability7238351998328773783.gal -t CGAL -LTL /tmp/LTLFireability11521975384001845431.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(G(("(Dress>=1)")U((F("(Out>=1)"))||(X(G("((WaitBag>=1)&&(Bags>=1))"))))))))
Formula 0 simplified : !XG("(Dress>=1)" U (F"(Out>=1)" | XG"((WaitBag>=1)&&(Bags>=1))"))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2021-05-17 17:23:25] [INFO ] Flatten gal took : 1 ms
[2021-05-17 17:23:25] [INFO ] Input system was already deterministic with 7 transitions.
[2021-05-17 17:23:25] [INFO ] Transformed 9 places.
[2021-05-17 17:23:25] [INFO ] Transformed 7 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
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-17 17:23:25] [INFO ] Time to serialize gal into /tmp/LTLFireability7739354199308250660.gal : 0 ms
[2021-05-17 17:23:25] [INFO ] Time to serialize properties into /tmp/LTLFireability16758298375763799818.ltl : 0 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-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTLFireability7739354199308250660.gal, -t, CGAL, -LTL, /tmp/LTLFireability16758298375763799818.ltl, -c, -stutter-deadlock, --load-order, /home/mcc/execution/model.ord, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireability7739354199308250660.gal -t CGAL -LTL /tmp/LTLFireability16758298375763799818.ltl -c -stutter-deadlock --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X(G(("(Dress>=1)")U((F("(Out>=1)"))||(X(G("((WaitBag>=1)&&(Bags>=1))"))))))))
Formula 0 simplified : !XG("(Dress>=1)" U (F"(Out>=1)" | XG"((WaitBag>=1)&&(Bags>=1))"))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
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
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -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 LTLFireability -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="SwimmingPool-PT-03"
export BK_EXAMINATION="LTLFireability"
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 SwimmingPool-PT-03, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r254-tall-162106746400733"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/SwimmingPool-PT-03.tgz
mv SwimmingPool-PT-03 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;