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.r151-tall-162089151600394.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 gold2020
Input is Philosophers-COL-001000, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r151-tall-162089151600394
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 372K
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 113K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Mar 28 16:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 28 16:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 28 16:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Mar 27 07:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K Mar 27 07:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 25 08:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 25 08:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 09:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_pt
-rw-r--r-- 1 mcc users 7 May 5 16:51 instance
-rw-r--r-- 1 mcc users 5 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 52K May 5 16:51 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME Philosophers-COL-001000-00
FORMULA_NAME Philosophers-COL-001000-01
FORMULA_NAME Philosophers-COL-001000-02
FORMULA_NAME Philosophers-COL-001000-03
FORMULA_NAME Philosophers-COL-001000-04
FORMULA_NAME Philosophers-COL-001000-05
FORMULA_NAME Philosophers-COL-001000-06
FORMULA_NAME Philosophers-COL-001000-07
FORMULA_NAME Philosophers-COL-001000-08
FORMULA_NAME Philosophers-COL-001000-09
FORMULA_NAME Philosophers-COL-001000-10
FORMULA_NAME Philosophers-COL-001000-11
FORMULA_NAME Philosophers-COL-001000-12
FORMULA_NAME Philosophers-COL-001000-13
FORMULA_NAME Philosophers-COL-001000-14
FORMULA_NAME Philosophers-COL-001000-15

=== Now, execution of the tool begins

BK_START 1621042421066

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-15 01:33:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2021-05-15 01:33:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-15 01:33:42] [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.
[2021-05-15 01:33:43] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 672 ms
[2021-05-15 01:33:43] [INFO ] sort/places :
Philo->Think,Fork,Catch1,Catch2,Eat,

[2021-05-15 01:33:43] [INFO ] Imported 5 HL places and 5 HL transitions for a total of 5000 PT places and 5000.0 transition bindings in 35 ms.
[2021-05-15 01:33:43] [INFO ] Computed order based on color domains.
[2021-05-15 01:33:43] [INFO ] Unfolded HLPN to a Petri net with 5000 places and 5000 transitions in 46 ms.
[2021-05-15 01:33:43] [INFO ] Unfolded HLPN properties in 8 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 608 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 6593 ms. (steps per millisecond=15 ) properties seen :[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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 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, 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, 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, 0, 1, 1, 1, 1, 1, 0, 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, 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, 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, 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, 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, 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, 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, 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, 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, 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]
// Phase 1: matrix 5000 rows 5000 cols
[2021-05-15 01:33:50] [INFO ] Computed 2000 place invariants in 89 ms
[2021-05-15 01:33:54] [INFO ] [Real]Absence check using 2000 positive place invariants in 3603 ms returned unsat
[2021-05-15 01:33:59] [INFO ] [Real]Absence check using 2000 positive place invariants in 4179 ms returned sat
[2021-05-15 01:33:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 01:34:14] [INFO ] [Real]Absence check using state equation in 15442 ms returned (error "Solver has unexpectedly terminated")
[2021-05-15 01:34:19] [INFO ] [Real]Absence check using 2000 positive place invariants in 4044 ms returned sat
[2021-05-15 01:34:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 01:34:34] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-15 01:34:34] [INFO ] [Real]Absence check using state equation in 15541 ms returned unknown
[2021-05-15 01:34:39] [INFO ] [Real]Absence check using 2000 positive place invariants in 4051 ms returned sat
[2021-05-15 01:34:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 01:34:54] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-15 01:34:54] [INFO ] [Real]Absence check using state equation in 15552 ms returned unknown
[2021-05-15 01:34:59] [INFO ] [Real]Absence check using 2000 positive place invariants in 4118 ms returned sat
[2021-05-15 01:34:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 01:35:14] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-15 01:35:14] [INFO ] [Real]Absence check using state equation in 15482 ms returned unknown
[2021-05-15 01:35:19] [INFO ] [Real]Absence check using 2000 positive place invariants in 4094 ms returned sat
[2021-05-15 01:35:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 01:35:34] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-15 01:35:34] [INFO ] [Real]Absence check using state equation in 15508 ms returned (error "Failed to check-sat")
[2021-05-15 01:35:39] [INFO ] [Real]Absence check using 2000 positive place invariants in 4110 ms returned sat
[2021-05-15 01:35:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 01:35:54] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-15 01:35:54] [INFO ] [Real]Absence check using state equation in 15485 ms returned unknown
[2021-05-15 01:35:59] [INFO ] [Real]Absence check using 2000 positive place invariants in 4063 ms returned sat
[2021-05-15 01:35:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 01:36:14] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-15 01:36:14] [INFO ] [Real]Absence check using state equation in 15541 ms returned unknown
[2021-05-15 01:36:19] [INFO ] [Real]Absence check using 2000 positive place invariants in 4103 ms returned sat
[2021-05-15 01:36:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 01:36:34] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-15 01:36:34] [INFO ] [Real]Absence check using state equation in 15524 ms returned unknown
[2021-05-15 01:36:39] [INFO ] [Real]Absence check using 2000 positive place invariants in 4083 ms returned sat
[2021-05-15 01:36:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 01:36:54] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-15 01:36:54] [INFO ] [Real]Absence check using state equation in 15513 ms returned (error "Failed to check-sat")
[2021-05-15 01:36:59] [INFO ] [Real]Absence check using 2000 positive place invariants in 4123 ms returned sat
[2021-05-15 01:36:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 01:37:14] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-15 01:37:14] [INFO ] [Real]Absence check using state equation in 15476 ms returned (error "Failed to check-sat")
[2021-05-15 01:37:19] [INFO ] [Real]Absence check using 2000 positive place invariants in 4360 ms returned sat
[2021-05-15 01:37:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 01:37:34] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-15 01:37:34] [INFO ] [Real]Absence check using state equation in 15243 ms returned unknown
[2021-05-15 01:37:39] [INFO ] [Real]Absence check using 2000 positive place invariants in 4266 ms returned sat
[2021-05-15 01:37:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 01:37:54] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-15 01:37:54] [INFO ] [Real]Absence check using state equation in 15335 ms returned unknown
[2021-05-15 01:37:59] [INFO ] [Real]Absence check using 2000 positive place invariants in 4247 ms returned sat
[2021-05-15 01:37:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 01:38:14] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-15 01:38:14] [INFO ] [Real]Absence check using state equation in 15347 ms returned unknown
[2021-05-15 01:38:19] [INFO ] [Real]Absence check using 2000 positive place invariants in 4447 ms returned sat
[2021-05-15 01:38:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 01:38:35] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-15 01:38:35] [INFO ] [Real]Absence check using state equation in 15147 ms returned unknown
[2021-05-15 01:38:39] [INFO ] [Real]Absence check using 2000 positive place invariants in 4285 ms returned sat
[2021-05-15 01:38:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 01:38:55] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-15 01:38:55] [INFO ] [Real]Absence check using state equation in 15309 ms returned (error "Failed to check-sat")
[2021-05-15 01:38:59] [INFO ] [Real]Absence check using 2000 positive place invariants in 4219 ms returned sat
[2021-05-15 01:38:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 01:39:15] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-15 01:39:15] [INFO ] [Real]Absence check using state equation in 15383 ms returned unknown
[2021-05-15 01:39:19] [INFO ] [Real]Absence check using 2000 positive place invariants in 4252 ms returned sat
[2021-05-15 01:39:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 01:39:35] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-15 01:39:35] [INFO ] [Real]Absence check using state equation in 15353 ms returned unknown
[2021-05-15 01:39:39] [INFO ] [Real]Absence check using 2000 positive place invariants in 4263 ms returned sat
[2021-05-15 01:39:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 01:39:55] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-15 01:39:55] [INFO ] [Real]Absence check using state equation in 15336 ms returned unknown
[2021-05-15 01:39:59] [INFO ] [Real]Absence check using 2000 positive place invariants in 4261 ms returned sat
[2021-05-15 01:39:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 01:40:15] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-15 01:40:15] [INFO ] [Real]Absence check using state equation in 15360 ms returned unknown
[2021-05-15 01:40:19] [INFO ] [Real]Absence check using 2000 positive place invariants in 4218 ms returned sat
[2021-05-15 01:40:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 01:40:35] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-15 01:40:35] [INFO ] [Real]Absence check using state equation in 15384 ms returned unknown
Successfully simplified 1 atomic propositions for a total of 1 simplifications.
[2021-05-15 01:40:37] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2021-05-15 01:40:37] [INFO ] Flatten gal took : 1105 ms
FORMULA Philosophers-COL-001000-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-COL-001000-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-COL-001000-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-COL-001000-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-15 01:40:37] [INFO ] Applying decomposition
[2021-05-15 01:40:37] [INFO ] Flatten gal took : 402 ms
[2021-05-15 01:40:38] [INFO ] Decomposing Gal with order
[2021-05-15 01:40:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-15 01:40:41] [INFO ] Removed a total of 1000 redundant transitions.
[2021-05-15 01:40:42] [INFO ] Flatten gal took : 834 ms
[2021-05-15 01:40:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 2000 labels/synchronizations in 197 ms.
[2021-05-15 01:40:43] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 78 ms.
[2021-05-15 01:40:43] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 28 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ Philosophers-COL-001000 @ 3570 seconds
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16427364 kB
MemFree: 11096172 kB
After kill :
MemTotal: 16427364 kB
MemFree: 16107528 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="LTLFireability"
export BK_TOOL="gold2020"
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 gold2020"
echo " Input is Philosophers-COL-001000, 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 r151-tall-162089151600394"
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 [ "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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;