About the Execution of ITS-LoLa for Philosophers-COL-001000
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15740.800 | 3600000.00 | 3645692.00 | 2140.10 | ?????????????T?? | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2020-input.r176-tajo-158987871300060.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is Philosophers-COL-001000, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r176-tajo-158987871300060
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 236K
-rw-r--r-- 1 mcc users 4.4K Apr 27 15:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 27 15:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 27 15:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 27 15:14 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 27 15:14 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Apr 27 15:14 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.1K Apr 27 15:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 27 15:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Apr 27 15:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Apr 27 15:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Apr 27 15:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 27 15:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 27 15:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 27 15:14 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Apr 27 15:14 equiv_pt
-rw-r--r-- 1 mcc users 7 Apr 27 15:14 instance
-rw-r--r-- 1 mcc users 5 Apr 27 15:14 iscolored
-rw-r--r-- 1 mcc users 52K Apr 27 15:14 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 Philosophers-COL-001000-CTLFireability-00
FORMULA_NAME Philosophers-COL-001000-CTLFireability-01
FORMULA_NAME Philosophers-COL-001000-CTLFireability-02
FORMULA_NAME Philosophers-COL-001000-CTLFireability-03
FORMULA_NAME Philosophers-COL-001000-CTLFireability-04
FORMULA_NAME Philosophers-COL-001000-CTLFireability-05
FORMULA_NAME Philosophers-COL-001000-CTLFireability-06
FORMULA_NAME Philosophers-COL-001000-CTLFireability-07
FORMULA_NAME Philosophers-COL-001000-CTLFireability-08
FORMULA_NAME Philosophers-COL-001000-CTLFireability-09
FORMULA_NAME Philosophers-COL-001000-CTLFireability-10
FORMULA_NAME Philosophers-COL-001000-CTLFireability-11
FORMULA_NAME Philosophers-COL-001000-CTLFireability-12
FORMULA_NAME Philosophers-COL-001000-CTLFireability-13
FORMULA_NAME Philosophers-COL-001000-CTLFireability-14
FORMULA_NAME Philosophers-COL-001000-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1591124358617
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-02 18:59:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-02 18:59:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-02 18:59:20] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
SLF4J: Failed to load class "org.slf4j.impl.StaticLoggerBinder".
SLF4J: Defaulting to no-operation (NOP) logger implementation
SLF4J: See http://www.slf4j.org/codes.html#StaticLoggerBinder for further details.
[2020-06-02 18:59:20] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 515 ms
[2020-06-02 18:59:20] [INFO ] sort/places :
Philo->think,fork,catch1,catch2,eat,
[2020-06-02 18:59:20] [INFO ] Imported 5 HL places and 5 HL transitions for a total of 5000 PT places and 5000.0 transition bindings in 20 ms.
[2020-06-02 18:59:20] [INFO ] Computed order based on color domains.
[2020-06-02 18:59:20] [INFO ] Unfolded HLPN to a Petri net with 5000 places and 5000 transitions in 45 ms.
[2020-06-02 18:59:20] [INFO ] Unfolded HLPN properties in 8 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 498 ms.
Incomplete random walk after 100000 steps, including 0 resets, run finished after 8799 ms. (steps per millisecond=11 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1]
// Phase 1: matrix 5000 rows 5000 cols
[2020-06-02 18:59:30] [INFO ] Computed 2000 place invariants in 109 ms
[2020-06-02 18:59:35] [INFO ] [Real]Absence check using 2000 positive place invariants in 4753 ms returned sat
[2020-06-02 18:59:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 18:59:50] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 18:59:50] [INFO ] [Real]Absence check using state equation in 14634 ms returned (error "Failed to check-sat")
[2020-06-02 18:59:55] [INFO ] [Real]Absence check using 2000 positive place invariants in 4051 ms returned sat
[2020-06-02 18:59:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 19:00:10] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 19:00:10] [INFO ] [Real]Absence check using state equation in 15489 ms returned (error "Failed to check-sat")
[2020-06-02 19:00:15] [INFO ] [Real]Absence check using 2000 positive place invariants in 4068 ms returned sat
[2020-06-02 19:00:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 19:00:30] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 19:00:30] [INFO ] [Real]Absence check using state equation in 15504 ms returned (error "Failed to check-sat")
[2020-06-02 19:00:34] [INFO ] [Real]Absence check using 2000 positive place invariants in 3627 ms returned sat
[2020-06-02 19:00:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 19:00:50] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 19:00:50] [INFO ] [Real]Absence check using state equation in 15991 ms returned (error "Failed to check-sat")
[2020-06-02 19:00:55] [INFO ] [Real]Absence check using 2000 positive place invariants in 4198 ms returned sat
[2020-06-02 19:00:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 19:01:10] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 19:01:10] [INFO ] [Real]Absence check using state equation in 15231 ms returned unknown
[2020-06-02 19:01:14] [INFO ] [Real]Absence check using 2000 positive place invariants in 3939 ms returned sat
[2020-06-02 19:01:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 19:01:30] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 19:01:30] [INFO ] [Real]Absence check using state equation in 15674 ms returned unknown
[2020-06-02 19:01:34] [INFO ] [Real]Absence check using 2000 positive place invariants in 3982 ms returned sat
[2020-06-02 19:01:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 19:01:50] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 19:01:50] [INFO ] [Real]Absence check using state equation in 15632 ms returned unknown
[2020-06-02 19:01:54] [INFO ] [Real]Absence check using 2000 positive place invariants in 3753 ms returned sat
[2020-06-02 19:01:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 19:02:10] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 19:02:10] [INFO ] [Real]Absence check using state equation in 15791 ms returned (error "Failed to check-sat")
[2020-06-02 19:02:14] [INFO ] [Real]Absence check using 2000 positive place invariants in 3866 ms returned sat
[2020-06-02 19:02:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 19:02:30] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 19:02:30] [INFO ] [Real]Absence check using state equation in 15739 ms returned unknown
[2020-06-02 19:02:36] [INFO ] [Real]Absence check using 2000 positive place invariants in 5048 ms returned sat
[2020-06-02 19:02:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 19:02:50] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 19:02:50] [INFO ] [Real]Absence check using state equation in 14391 ms returned (error "Failed to check-sat")
[2020-06-02 19:02:54] [INFO ] [Real]Absence check using 2000 positive place invariants in 3721 ms returned sat
[2020-06-02 19:02:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 19:03:10] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 19:03:10] [INFO ] [Real]Absence check using state equation in 15854 ms returned (error "Failed to check-sat")
[2020-06-02 19:03:14] [INFO ] [Real]Absence check using 2000 positive place invariants in 3706 ms returned sat
[2020-06-02 19:03:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 19:03:30] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 19:03:30] [INFO ] [Real]Absence check using state equation in 15894 ms returned unknown
[2020-06-02 19:03:34] [INFO ] [Real]Absence check using 2000 positive place invariants in 3821 ms returned sat
[2020-06-02 19:03:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 19:03:50] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 19:03:50] [INFO ] [Real]Absence check using state equation in 15714 ms returned (error "Failed to check-sat")
[2020-06-02 19:03:54] [INFO ] [Real]Absence check using 2000 positive place invariants in 3932 ms returned sat
[2020-06-02 19:03:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 19:04:10] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 19:04:10] [INFO ] [Real]Absence check using state equation in 15693 ms returned (error "Failed to check-sat")
[2020-06-02 19:04:14] [INFO ] [Real]Absence check using 2000 positive place invariants in 3880 ms returned sat
[2020-06-02 19:04:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 19:04:30] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 19:04:30] [INFO ] [Real]Absence check using state equation in 15715 ms returned (error "Failed to check-sat")
[2020-06-02 19:04:35] [INFO ] [Real]Absence check using 2000 positive place invariants in 4384 ms returned sat
[2020-06-02 19:04:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 19:04:50] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 19:04:50] [INFO ] [Real]Absence check using state equation in 15232 ms returned (error "Failed to check-sat")
[2020-06-02 19:04:55] [INFO ] [Real]Absence check using 2000 positive place invariants in 3947 ms returned sat
[2020-06-02 19:04:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 19:05:10] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 19:05:10] [INFO ] [Real]Absence check using state equation in 15660 ms returned (error "Failed to check-sat")
[2020-06-02 19:05:14] [INFO ] [Real]Absence check using 2000 positive place invariants in 3834 ms returned sat
[2020-06-02 19:05:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 19:05:30] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 19:05:30] [INFO ] [Real]Absence check using state equation in 15799 ms returned unknown
[2020-06-02 19:05:35] [INFO ] [Real]Absence check using 2000 positive place invariants in 4061 ms returned sat
[2020-06-02 19:05:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 19:05:50] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 19:05:50] [INFO ] [Real]Absence check using state equation in 15555 ms returned (error "Failed to check-sat")
[2020-06-02 19:05:55] [INFO ] [Real]Absence check using 2000 positive place invariants in 4024 ms returned sat
[2020-06-02 19:05:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 19:06:10] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 19:06:10] [INFO ] [Real]Absence check using state equation in 15506 ms returned (error "Failed to check-sat")
[2020-06-02 19:06:14] [INFO ] [Real]Absence check using 2000 positive place invariants in 3788 ms returned sat
[2020-06-02 19:06:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 19:06:30] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 19:06:30] [INFO ] [Real]Absence check using state equation in 15840 ms returned (error "Failed to check-sat")
[2020-06-02 19:06:35] [INFO ] [Real]Absence check using 2000 positive place invariants in 4284 ms returned sat
[2020-06-02 19:06:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 19:06:50] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 19:06:50] [INFO ] [Real]Absence check using state equation in 15245 ms returned (error "Failed to check-sat")
[2020-06-02 19:06:55] [INFO ] [Real]Absence check using 2000 positive place invariants in 4344 ms returned sat
[2020-06-02 19:06:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 19:07:10] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 19:07:10] [INFO ] [Real]Absence check using state equation in 15279 ms returned (error "Failed to check-sat")
[2020-06-02 19:07:14] [INFO ] [Real]Absence check using 2000 positive place invariants in 3801 ms returned sat
[2020-06-02 19:07:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 19:07:30] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 19:07:30] [INFO ] [Real]Absence check using state equation in 15827 ms returned (error "Failed to check-sat")
[2020-06-02 19:07:34] [INFO ] [Real]Absence check using 2000 positive place invariants in 3784 ms returned sat
[2020-06-02 19:07:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 19:07:50] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 19:07:50] [INFO ] [Real]Absence check using state equation in 15856 ms returned (error "Failed to check-sat")
[2020-06-02 19:07:54] [INFO ] [Real]Absence check using 2000 positive place invariants in 3755 ms returned sat
[2020-06-02 19:07:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 19:08:10] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 19:08:10] [INFO ] [Real]Absence check using state equation in 15848 ms returned (error "Failed to check-sat")
[2020-06-02 19:08:15] [INFO ] [Real]Absence check using 2000 positive place invariants in 3817 ms returned sat
[2020-06-02 19:08:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 19:08:30] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 19:08:30] [INFO ] [Real]Absence check using state equation in 15775 ms returned (error "Failed to check-sat")
[2020-06-02 19:08:34] [INFO ] [Real]Absence check using 2000 positive place invariants in 3761 ms returned sat
[2020-06-02 19:08:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 19:08:50] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 19:08:50] [INFO ] [Real]Absence check using state equation in 15857 ms returned unknown
[2020-06-02 19:08:55] [INFO ] [Real]Absence check using 2000 positive place invariants in 4000 ms returned sat
[2020-06-02 19:08:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 19:09:10] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 19:09:10] [INFO ] [Real]Absence check using state equation in 15520 ms returned unknown
[2020-06-02 19:09:15] [INFO ] [Real]Absence check using 2000 positive place invariants in 3917 ms returned sat
[2020-06-02 19:09:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 19:09:30] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 19:09:30] [INFO ] [Real]Absence check using state equation in 15617 ms returned (error "Failed to check-sat")
[2020-06-02 19:09:34] [INFO ] [Real]Absence check using 2000 positive place invariants in 3714 ms returned sat
[2020-06-02 19:09:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 19:09:50] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 19:09:50] [INFO ] [Real]Absence check using state equation in 15902 ms returned (error "Failed to check-sat")
[2020-06-02 19:09:55] [INFO ] [Real]Absence check using 2000 positive place invariants in 3723 ms returned sat
[2020-06-02 19:09:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 19:10:10] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 19:10:10] [INFO ] [Real]Absence check using state equation in 15838 ms returned (error "Failed to check-sat")
[2020-06-02 19:10:15] [INFO ] [Real]Absence check using 2000 positive place invariants in 3827 ms returned sat
[2020-06-02 19:10:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 19:10:30] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 19:10:30] [INFO ] [Real]Absence check using state equation in 15674 ms returned (error "Failed to check-sat")
[2020-06-02 19:10:35] [INFO ] [Real]Absence check using 2000 positive place invariants in 3980 ms returned sat
[2020-06-02 19:10:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 19:10:50] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 19:10:50] [INFO ] [Real]Absence check using state equation in 15600 ms returned (error "Failed to check-sat")
[2020-06-02 19:10:55] [INFO ] [Real]Absence check using 2000 positive place invariants in 4010 ms returned sat
[2020-06-02 19:10:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 19:11:10] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 19:11:10] [INFO ] [Real]Absence check using state equation in 15602 ms returned unknown
[2020-06-02 19:11:15] [INFO ] [Real]Absence check using 2000 positive place invariants in 4046 ms returned sat
[2020-06-02 19:11:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 19:11:30] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 19:11:30] [INFO ] [Real]Absence check using state equation in 15582 ms returned (error "Failed to check-sat")
[2020-06-02 19:11:35] [INFO ] [Real]Absence check using 2000 positive place invariants in 3840 ms returned sat
[2020-06-02 19:11:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 19:11:50] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 19:11:50] [INFO ] [Real]Absence check using state equation in 15778 ms returned (error "Failed to check-sat")
[2020-06-02 19:11:55] [INFO ] [Real]Absence check using 2000 positive place invariants in 4020 ms returned sat
[2020-06-02 19:11:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 19:12:10] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 19:12:10] [INFO ] [Real]Absence check using state equation in 15464 ms returned (error "Failed to check-sat")
[2020-06-02 19:12:15] [INFO ] [Real]Absence check using 2000 positive place invariants in 3795 ms returned sat
[2020-06-02 19:12:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 19:12:30] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 19:12:30] [INFO ] [Real]Absence check using state equation in 15749 ms returned unknown
[2020-06-02 19:12:35] [INFO ] [Real]Absence check using 2000 positive place invariants in 4053 ms returned sat
[2020-06-02 19:12:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 19:12:50] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 19:12:50] [INFO ] [Real]Absence check using state equation in 15589 ms returned (error "Failed to check-sat")
[2020-06-02 19:12:56] [INFO ] [Real]Absence check using 2000 positive place invariants in 4595 ms returned sat
[2020-06-02 19:12:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 19:13:10] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 19:13:10] [INFO ] [Real]Absence check using state equation in 14954 ms returned unknown
[2020-06-02 19:13:15] [INFO ] [Real]Absence check using 2000 positive place invariants in 4345 ms returned sat
[2020-06-02 19:13:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 19:13:30] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 19:13:30] [INFO ] [Real]Absence check using state equation in 15231 ms returned (error "Failed to check-sat")
[2020-06-02 19:13:35] [INFO ] [Real]Absence check using 2000 positive place invariants in 3813 ms returned sat
[2020-06-02 19:13:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 19:13:50] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 19:13:50] [INFO ] [Real]Absence check using state equation in 15815 ms returned (error "Failed to check-sat")
[2020-06-02 19:13:55] [INFO ] [Real]Absence check using 2000 positive place invariants in 3989 ms returned sat
[2020-06-02 19:13:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 19:14:10] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 19:14:10] [INFO ] [Real]Absence check using state equation in 15625 ms returned (error "Failed to check-sat")
[2020-06-02 19:14:14] [INFO ] [Real]Absence check using 2000 positive place invariants in 3685 ms returned sat
[2020-06-02 19:14:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 19:14:30] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 19:14:30] [INFO ] [Real]Absence check using state equation in 16084 ms returned (error "Failed to check-sat")
[2020-06-02 19:14:39] [INFO ] [Real]Absence check using 2000 positive place invariants in 7988 ms returned sat
[2020-06-02 19:14:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 19:14:51] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 19:14:51] [INFO ] [Real]Absence check using state equation in 11625 ms returned unknown
[2020-06-02 19:14:55] [INFO ] [Real]Absence check using 2000 positive place invariants in 3949 ms returned unsat
[2020-06-02 19:14:58] [INFO ] [Real]Absence check using 2000 positive place invariants in 2350 ms returned unsat
Successfully simplified 2 atomic propositions for a total of 2 simplifications.
[2020-06-02 19:15:00] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-06-02 19:15:00] [INFO ] Flatten gal took : 1095 ms
[2020-06-02 19:15:01] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-06-02 19:15:01] [INFO ] Flatten gal took : 533 ms
FORMULA Philosophers-COL-001000-CTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-02 19:15:01] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLFireability.sr.xml took 105 ms.
[2020-06-02 19:15:01] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 40 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLFireability @ Philosophers-COL-001000 @ 3570 seconds
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16427488 kB
MemFree: 11071748 kB
After kill :
MemTotal: 16427488 kB
MemFree: 16103116 kB
--------------------
content from stderr:
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Philosophers-COL-001000"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="itslola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itslola"
echo " Input is Philosophers-COL-001000, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r176-tajo-158987871300060"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Philosophers-COL-001000.tgz
mv Philosophers-COL-001000 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;