Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2021-input.r035-tajo-162038167800121.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/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 CSRepetitions-COL-02, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r035-tajo-162038167800121
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 384K
-rw-r--r-- 1 mcc users 16K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 101K May 10 09:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 78K May 10 09:42 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.1K Mar 28 15:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 28 15:49 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 28 15:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 15:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.8K Mar 23 03:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 23 03:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.0K Mar 22 12:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 22K Mar 22 12:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Mar 22 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_pt
-rw-r--r-- 1 mcc users 3 May 5 16:51 instance
-rw-r--r-- 1 mcc users 5 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 13K 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 CSRepetitions-COL-02-CTLCardinality-00
FORMULA_NAME CSRepetitions-COL-02-CTLCardinality-01
FORMULA_NAME CSRepetitions-COL-02-CTLCardinality-02
FORMULA_NAME CSRepetitions-COL-02-CTLCardinality-03
FORMULA_NAME CSRepetitions-COL-02-CTLCardinality-04
FORMULA_NAME CSRepetitions-COL-02-CTLCardinality-05
FORMULA_NAME CSRepetitions-COL-02-CTLCardinality-06
FORMULA_NAME CSRepetitions-COL-02-CTLCardinality-07
FORMULA_NAME CSRepetitions-COL-02-CTLCardinality-08
FORMULA_NAME CSRepetitions-COL-02-CTLCardinality-09
FORMULA_NAME CSRepetitions-COL-02-CTLCardinality-10
FORMULA_NAME CSRepetitions-COL-02-CTLCardinality-11
FORMULA_NAME CSRepetitions-COL-02-CTLCardinality-12
FORMULA_NAME CSRepetitions-COL-02-CTLCardinality-13
FORMULA_NAME CSRepetitions-COL-02-CTLCardinality-14
FORMULA_NAME CSRepetitions-COL-02-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1620908127754

[2021-05-13 12:15:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-13 12:15:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 12:15:29] [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-13 12:15:29] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 497 ms
[2021-05-13 12:15:29] [INFO ] sort/places :
Server->Server_Waiting,
Computation->Server_Anwering,
Dot->RequestBufferSlots,
Client->Client_Sending,RequestBuffer,Client_Waiting,

[2021-05-13 12:15:29] [INFO ] Imported 6 HL places and 5 HL transitions for a total of 23 PT places and 28.0 transition bindings in 11 ms.
[2021-05-13 12:15:29] [INFO ] Computed order based on color domains.
[2021-05-13 12:15:29] [INFO ] Unfolded HLPN to a Petri net with 23 places and 28 transitions in 17 ms.
[2021-05-13 12:15:29] [INFO ] Unfolded HLPN properties in 2 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 51 ms.
Incomplete random walk after 100000 steps, including 5552 resets, run finished after 1731 ms. (steps per millisecond=57 ) properties seen :[1, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 1, 1, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 0]
// Phase 1: matrix 28 rows 23 cols
[2021-05-13 12:15:31] [INFO ] Computed 6 place invariants in 4 ms
[2021-05-13 12:15:31] [INFO ] [Real]Absence check using 6 positive place invariants in 17 ms returned sat
[2021-05-13 12:15:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 12:15:31] [INFO ] [Real]Absence check using state equation in 14 ms returned unsat
[2021-05-13 12:15:31] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2021-05-13 12:15:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 12:15:31] [INFO ] [Real]Absence check using state equation in 12 ms returned unsat
[2021-05-13 12:15:31] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2021-05-13 12:15:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 12:15:31] [INFO ] [Real]Absence check using state equation in 12 ms returned unsat
[2021-05-13 12:15:31] [INFO ] [Real]Absence check using 6 positive place invariants in 14 ms returned unsat
[2021-05-13 12:15:31] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned unsat
[2021-05-13 12:15:31] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned unsat
[2021-05-13 12:15:31] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned unsat
[2021-05-13 12:15:31] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2021-05-13 12:15:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 12:15:31] [INFO ] [Real]Absence check using state equation in 8 ms returned unsat
[2021-05-13 12:15:31] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2021-05-13 12:15:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 12:15:31] [INFO ] [Real]Absence check using state equation in 9 ms returned unsat
[2021-05-13 12:15:31] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2021-05-13 12:15:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 12:15:31] [INFO ] [Real]Absence check using state equation in 6 ms returned unsat
[2021-05-13 12:15:31] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2021-05-13 12:15:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 12:15:31] [INFO ] [Real]Absence check using state equation in 7 ms returned unsat
[2021-05-13 12:15:31] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned unsat
[2021-05-13 12:15:31] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2021-05-13 12:15:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 12:15:31] [INFO ] [Real]Absence check using state equation in 6 ms returned unsat
[2021-05-13 12:15:31] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2021-05-13 12:15:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 12:15:32] [INFO ] [Real]Absence check using state equation in 26 ms returned unsat
[2021-05-13 12:15:32] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned unsat
[2021-05-13 12:15:32] [INFO ] [Real]Absence check using 6 positive place invariants in 6 ms returned sat
[2021-05-13 12:15:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 12:15:32] [INFO ] [Real]Absence check using state equation in 7 ms returned unsat
[2021-05-13 12:15:32] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2021-05-13 12:15:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 12:15:32] [INFO ] [Real]Absence check using state equation in 6 ms returned unsat
[2021-05-13 12:15:32] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2021-05-13 12:15:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 12:15:32] [INFO ] [Real]Absence check using state equation in 6 ms returned unsat
[2021-05-13 12:15:32] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2021-05-13 12:15:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 12:15:32] [INFO ] [Real]Absence check using state equation in 16 ms returned unsat
[2021-05-13 12:15:32] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2021-05-13 12:15:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 12:15:32] [INFO ] [Real]Absence check using state equation in 7 ms returned unsat
[2021-05-13 12:15:32] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2021-05-13 12:15:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 12:15:32] [INFO ] [Real]Absence check using state equation in 7 ms returned unsat
[2021-05-13 12:15:32] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned unsat
[2021-05-13 12:15:32] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2021-05-13 12:15:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 12:15:32] [INFO ] [Real]Absence check using state equation in 8 ms returned unsat
[2021-05-13 12:15:32] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned unsat
[2021-05-13 12:15:32] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned unsat
[2021-05-13 12:15:32] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned unsat
[2021-05-13 12:15:32] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2021-05-13 12:15:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 12:15:32] [INFO ] [Real]Absence check using state equation in 6 ms returned unsat
[2021-05-13 12:15:32] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2021-05-13 12:15:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 12:15:32] [INFO ] [Real]Absence check using state equation in 6 ms returned unsat
[2021-05-13 12:15:32] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned unsat
[2021-05-13 12:15:32] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2021-05-13 12:15:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 12:15:32] [INFO ] [Real]Absence check using state equation in 10 ms returned unsat
[2021-05-13 12:15:32] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2021-05-13 12:15:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 12:15:32] [INFO ] [Real]Absence check using state equation in 8 ms returned unsat
[2021-05-13 12:15:32] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2021-05-13 12:15:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 12:15:32] [INFO ] [Real]Absence check using state equation in 6 ms returned unsat
[2021-05-13 12:15:32] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2021-05-13 12:15:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 12:15:32] [INFO ] [Real]Absence check using state equation in 5 ms returned unsat
[2021-05-13 12:15:32] [INFO ] [Real]Absence check using 6 positive place invariants in 9 ms returned sat
[2021-05-13 12:15:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 12:15:32] [INFO ] [Real]Absence check using state equation in 6 ms returned unsat
[2021-05-13 12:15:32] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned unsat
[2021-05-13 12:15:32] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned unsat
[2021-05-13 12:15:32] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2021-05-13 12:15:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 12:15:32] [INFO ] [Real]Absence check using state equation in 5 ms returned unsat
[2021-05-13 12:15:32] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2021-05-13 12:15:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 12:15:32] [INFO ] [Real]Absence check using state equation in 5 ms returned unsat
[2021-05-13 12:15:32] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned unsat
[2021-05-13 12:15:32] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2021-05-13 12:15:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 12:15:32] [INFO ] [Real]Absence check using state equation in 13 ms returned unsat
[2021-05-13 12:15:32] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned unsat
[2021-05-13 12:15:32] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2021-05-13 12:15:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 12:15:32] [INFO ] [Real]Absence check using state equation in 5 ms returned unsat
[2021-05-13 12:15:32] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned unsat
[2021-05-13 12:15:32] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned unsat
[2021-05-13 12:15:32] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2021-05-13 12:15:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 12:15:32] [INFO ] [Real]Absence check using state equation in 4 ms returned unsat
[2021-05-13 12:15:32] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2021-05-13 12:15:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 12:15:32] [INFO ] [Real]Absence check using state equation in 5 ms returned unsat
[2021-05-13 12:15:32] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2021-05-13 12:15:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 12:15:32] [INFO ] [Real]Absence check using state equation in 7 ms returned unsat
[2021-05-13 12:15:32] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned unsat
[2021-05-13 12:15:32] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned unsat
[2021-05-13 12:15:32] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned unsat
[2021-05-13 12:15:32] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned unsat
[2021-05-13 12:15:32] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2021-05-13 12:15:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 12:15:32] [INFO ] [Real]Absence check using state equation in 6 ms returned unsat
[2021-05-13 12:15:32] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2021-05-13 12:15:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 12:15:32] [INFO ] [Real]Absence check using state equation in 5 ms returned unsat
[2021-05-13 12:15:32] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned unsat
[2021-05-13 12:15:32] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2021-05-13 12:15:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 12:15:32] [INFO ] [Real]Absence check using state equation in 5 ms returned unsat
[2021-05-13 12:15:32] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned unsat
[2021-05-13 12:15:32] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2021-05-13 12:15:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 12:15:32] [INFO ] [Real]Absence check using state equation in 5 ms returned unsat
[2021-05-13 12:15:32] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2021-05-13 12:15:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 12:15:32] [INFO ] [Real]Absence check using state equation in 4 ms returned unsat
[2021-05-13 12:15:32] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2021-05-13 12:15:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 12:15:32] [INFO ] [Real]Absence check using state equation in 5 ms returned unsat
[2021-05-13 12:15:32] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2021-05-13 12:15:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 12:15:32] [INFO ] [Real]Absence check using state equation in 5 ms returned unsat
[2021-05-13 12:15:32] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2021-05-13 12:15:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 12:15:32] [INFO ] [Real]Absence check using state equation in 4 ms returned unsat
[2021-05-13 12:15:32] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2021-05-13 12:15:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 12:15:32] [INFO ] [Real]Absence check using state equation in 4 ms returned unsat
[2021-05-13 12:15:32] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned unsat
[2021-05-13 12:15:32] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2021-05-13 12:15:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 12:15:32] [INFO ] [Real]Absence check using state equation in 4 ms returned unsat
[2021-05-13 12:15:32] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned unsat
[2021-05-13 12:15:32] [INFO ] [Real]Absence check using 6 positive place invariants in 6 ms returned unsat
[2021-05-13 12:15:32] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2021-05-13 12:15:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 12:15:32] [INFO ] [Real]Absence check using state equation in 5 ms returned unsat
Successfully simplified 67 atomic propositions for a total of 67 simplifications.
[2021-05-13 12:15:32] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2021-05-13 12:15:32] [INFO ] Flatten gal took : 34 ms
[2021-05-13 12:15:32] [INFO ] Initial state reduction rules for CTL removed 7 formulas.
[2021-05-13 12:15:32] [INFO ] Flatten gal took : 7 ms
FORMULA CSRepetitions-COL-02-CTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-COL-02-CTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-COL-02-CTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-COL-02-CTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-COL-02-CTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-COL-02-CTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-COL-02-CTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-13 12:15:32] [INFO ] Applying decomposition
[2021-05-13 12:15:32] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/convert-linux64, -i, /tmp/graph10301463516354838527.txt, -o, /tmp/graph10301463516354838527.bin, -w, /tmp/graph10301463516354838527.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/louvain-linux64, /tmp/graph10301463516354838527.bin, -l, -1, -v, -w, /tmp/graph10301463516354838527.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-13 12:15:32] [INFO ] Decomposing Gal with order
[2021-05-13 12:15:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-13 12:15:33] [INFO ] Removed a total of 15 redundant transitions.
[2021-05-13 12:15:33] [INFO ] Flatten gal took : 46 ms
[2021-05-13 12:15:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 1 ms.
[2021-05-13 12:15:33] [INFO ] Time to serialize gal into /home/mcc/execution/CTLCardinality.pnml.gal : 1 ms
[2021-05-13 12:15:33] [INFO ] Time to serialize properties into /home/mcc/execution/CTLCardinality.ctl : 9 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /home/mcc/execution/CTLCardinality.pnml.gal, -t, CGAL, -ctl, /home/mcc/execution/CTLCardinality.ctl, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /home/mcc/execution/CTLCardinality.pnml.gal -t CGAL -ctl /home/mcc/execution/CTLCardinality.ctl --gen-order FOLLOW
No direction supplied, using forward translation only.
Parsed 9 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7424,0.049534,5588,2,432,5,6831,6,0,129,6570,0


Converting to forward existential form...Done !
original formula: (!(EX(TRUE)) * AF(((((((((((gu0.Client_Sending_0+gu0.Client_Sending_1)+gu0.Client_Sending_2)+gu0.Client_Sending_3)+gu0.RequestBufferSlots_0)+gu1.Client_Waiting_0)+gu1.Client_Waiting_1)+gu1.Client_Waiting_2)+gu1.Client_Waiting_3)>4)||(((((gu0.Client_Sending_0+gu0.Client_Sending_1)+gu0.Client_Sending_2)+gu0.Client_Sending_3)+gu0.RequestBufferSlots_0)>28))))
=> equivalent forward existential formula: ([(EY(Init) * TRUE)] = FALSE * [FwdG(Init,!(((((((((((gu0.Client_Sending_0+gu0.Client_Sending_1)+gu0.Client_Sending_2)+gu0.Client_Sending_3)+gu0.RequestBufferSlots_0)+gu1.Client_Waiting_0)+gu1.Client_Waiting_1)+gu1.Client_Waiting_2)+gu1.Client_Waiting_3)>4)||(((((gu0.Client_Sending_0+gu0.Client_Sending_1)+gu0.Client_Sending_2)+gu0.Client_Sending_3)+gu0.RequestBufferSlots_0)>28))))] = FALSE)
(forward)formula 0,0,0.094452,6496,1,0,9,11481,19,3,647,7606,6
FORMULA CSRepetitions-COL-02-CTLCardinality-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

original formula: AF(EX(TRUE))
=> equivalent forward existential formula: [FwdG(Init,!(EX(TRUE)))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions gu2.Lose_Requestc0, gu2.Lose_Requestc1, gu2.Lose_Requestc2, gu2.Lose_Requestc3, Prepare_Requestc0, Prepare_Requestc1, Prepare_Requestc2, Prepare_Requestc3, Send_Answers0c0, Send_Answers0c2, Send_Answers1c1, Send_Answers1c3, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/5/12/17
(forward)formula 1,1,0.121581,7288,1,0,60,17149,62,25,776,16319,44
FORMULA CSRepetitions-COL-02-CTLCardinality-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

original formula: EG(EF(!(EG(TRUE))))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U !(EG(TRUE))))] != FALSE
(forward)formula 2,0,0.186317,10984,1,0,117,39983,71,63,786,40005,130
FORMULA CSRepetitions-COL-02-CTLCardinality-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

original formula: EG(AX(FALSE))
=> equivalent forward existential formula: [FwdG(Init,!(EX(!(FALSE))))] != FALSE
(forward)formula 3,0,0.186382,10984,1,0,117,39983,71,63,786,40005,130
FORMULA CSRepetitions-COL-02-CTLCardinality-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

original formula: AX(FALSE)
=> equivalent forward existential formula: [(EY(Init) * !(FALSE))] = FALSE
(forward)formula 4,0,0.186408,10984,1,0,117,39983,71,63,786,40005,130
FORMULA CSRepetitions-COL-02-CTLCardinality-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

original formula: AG((AF((((((gu1.Client_Waiting_0+gu1.Client_Waiting_1)+gu1.Client_Waiting_2)+gu1.Client_Waiting_3)>=50)||((((((((((gu0.Client_Sending_0+gu0.Client_Sending_1)+gu0.Client_Sending_2)+gu0.Client_Sending_3)+gu1.Client_Waiting_0)+gu1.Client_Waiting_1)+gu1.Client_Waiting_2)+gu1.Client_Waiting_3)+gu2.Server_Waiting_0)+gu2.Server_Waiting_1)<=((((((((((((((((((((gu0.Client_Sending_0+gu0.Client_Sending_1)+gu0.Client_Sending_2)+gu0.Client_Sending_3)+gu1.Client_Waiting_0)+gu1.Client_Waiting_1)+gu1.Client_Waiting_2)+gu1.Client_Waiting_3)+gu2.Server_Anwering_0)+gu2.Server_Anwering_1)+gu2.Server_Anwering_2)+gu2.Server_Anwering_3)+gu2.Server_Anwering_4)+gu2.Server_Anwering_5)+gu2.Server_Anwering_6)+gu2.Server_Anwering_7)+gu2.RequestBuffer_0)+gu2.RequestBuffer_1)+gu2.RequestBuffer_2)+gu2.RequestBuffer_3)+gu0.RequestBufferSlots_0)))) + (((((((((((((((((((gu2.Server_Waiting_0+gu2.Server_Waiting_1)+gu1.Client_Waiting_0)+gu1.Client_Waiting_1)+gu1.Client_Waiting_2)+gu1.Client_Waiting_3)+gu2.Server_Anwering_0)+gu2.Server_Anwering_1)+gu2.Server_Anwering_2)+gu2.Server_Anwering_3)+gu2.Server_Anwering_4)+gu2.Server_Anwering_5)+gu2.Server_Anwering_6)+gu2.Server_Anwering_7)+gu2.RequestBuffer_0)+gu2.RequestBuffer_1)+gu2.RequestBuffer_2)+gu2.RequestBuffer_3)<47)&&((((((((((((gu1.Client_Waiting_0+gu1.Client_Waiting_1)+gu1.Client_Waiting_2)+gu1.Client_Waiting_3)+gu2.Server_Anwering_0)+gu2.Server_Anwering_1)+gu2.Server_Anwering_2)+gu2.Server_Anwering_3)+gu2.Server_Anwering_4)+gu2.Server_Anwering_5)+gu2.Server_Anwering_6)+gu2.Server_Anwering_7)>(((gu0.Client_Sending_0+gu0.Client_Sending_1)+gu0.Client_Sending_2)+gu0.Client_Sending_3)))))
=> equivalent forward existential formula: [FwdG((FwdU(Init,TRUE) * !((((((((((((((((((((gu2.Server_Waiting_0+gu2.Server_Waiting_1)+gu1.Client_Waiting_0)+gu1.Client_Waiting_1)+gu1.Client_Waiting_2)+gu1.Client_Waiting_3)+gu2.Server_Anwering_0)+gu2.Server_Anwering_1)+gu2.Server_Anwering_2)+gu2.Server_Anwering_3)+gu2.Server_Anwering_4)+gu2.Server_Anwering_5)+gu2.Server_Anwering_6)+gu2.Server_Anwering_7)+gu2.RequestBuffer_0)+gu2.RequestBuffer_1)+gu2.RequestBuffer_2)+gu2.RequestBuffer_3)<47)&&((((((((((((gu1.Client_Waiting_0+gu1.Client_Waiting_1)+gu1.Client_Waiting_2)+gu1.Client_Waiting_3)+gu2.Server_Anwering_0)+gu2.Server_Anwering_1)+gu2.Server_Anwering_2)+gu2.Server_Anwering_3)+gu2.Server_Anwering_4)+gu2.Server_Anwering_5)+gu2.Server_Anwering_6)+gu2.Server_Anwering_7)>(((gu0.Client_Sending_0+gu0.Client_Sending_1)+gu0.Client_Sending_2)+gu0.Client_Sending_3))))),!((((((gu1.Client_Waiting_0+gu1.Client_Waiting_1)+gu1.Client_Waiting_2)+gu1.Client_Waiting_3)>=50)||((((((((((gu0.Client_Sending_0+gu0.Client_Sending_1)+gu0.Client_Sending_2)+gu0.Client_Sending_3)+gu1.Client_Waiting_0)+gu1.Client_Waiting_1)+gu1.Client_Waiting_2)+gu1.Client_Waiting_3)+gu2.Server_Waiting_0)+gu2.Server_Waiting_1)<=((((((((((((((((((((gu0.Client_Sending_0+gu0.Client_Sending_1)+gu0.Client_Sending_2)+gu0.Client_Sending_3)+gu1.Client_Waiting_0)+gu1.Client_Waiting_1)+gu1.Client_Waiting_2)+gu1.Client_Waiting_3)+gu2.Server_Anwering_0)+gu2.Server_Anwering_1)+gu2.Server_Anwering_2)+gu2.Server_Anwering_3)+gu2.Server_Anwering_4)+gu2.Server_Anwering_5)+gu2.Server_Anwering_6)+gu2.Server_Anwering_7)+gu2.RequestBuffer_0)+gu2.RequestBuffer_1)+gu2.RequestBuffer_2)+gu2.RequestBuffer_3)+gu0.RequestBufferSlots_0)))))] = FALSE
Hit Full ! (commute/partial/dont) 0/9/17
(forward)formula 5,0,0.241865,12536,1,0,121,42183,81,67,2491,42800,135
FORMULA CSRepetitions-COL-02-CTLCardinality-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

original formula: AG((AG(EX(TRUE)) + !(E(((((((((((((((gu2.Server_Anwering_0+gu2.Server_Anwering_1)+gu2.Server_Anwering_2)+gu2.Server_Anwering_3)+gu2.Server_Anwering_4)+gu2.Server_Anwering_5)+gu2.Server_Anwering_6)+gu2.Server_Anwering_7)+gu0.RequestBufferSlots_0)+gu0.Client_Sending_0)+gu0.Client_Sending_1)+gu0.Client_Sending_2)+gu0.Client_Sending_3)<=((((((((((((((((((gu2.RequestBuffer_0+gu2.RequestBuffer_1)+gu2.RequestBuffer_2)+gu2.RequestBuffer_3)+gu0.RequestBufferSlots_0)+gu2.Server_Anwering_0)+gu2.Server_Anwering_1)+gu2.Server_Anwering_2)+gu2.Server_Anwering_3)+gu2.Server_Anwering_4)+gu2.Server_Anwering_5)+gu2.Server_Anwering_6)+gu2.Server_Anwering_7)+gu0.Client_Sending_0)+gu0.Client_Sending_1)+gu0.Client_Sending_2)+gu0.Client_Sending_3)+gu2.Server_Waiting_0)+gu2.Server_Waiting_1))&&(((((((((((((((((((gu2.Server_Waiting_0+gu2.Server_Waiting_1)+gu2.Server_Anwering_0)+gu2.Server_Anwering_1)+gu2.Server_Anwering_2)+gu2.Server_Anwering_3)+gu2.Server_Anwering_4)+gu2.Server_Anwering_5)+gu2.Server_Anwering_6)+gu2.Server_Anwering_7)+gu0.Client_Sending_0)+gu0.Client_Sending_1)+gu0.Client_Sending_2)+gu0.Client_Sending_3)+gu2.RequestBuffer_0)+gu2.RequestBuffer_1)+gu2.RequestBuffer_2)+gu2.RequestBuffer_3)+gu0.RequestBufferSlots_0)<=((((((((((gu0.RequestBufferSlots_0+gu2.RequestBuffer_0)+gu2.RequestBuffer_1)+gu2.RequestBuffer_2)+gu2.RequestBuffer_3)+gu1.Client_Waiting_0)+gu1.Client_Waiting_1)+gu1.Client_Waiting_2)+gu1.Client_Waiting_3)+gu2.Server_Waiting_0)+gu2.Server_Waiting_1))) U AG((((((((((((((((((((gu2.Server_Waiting_0+gu2.Server_Waiting_1)+gu0.RequestBufferSlots_0)+gu1.Client_Waiting_0)+gu1.Client_Waiting_1)+gu1.Client_Waiting_2)+gu1.Client_Waiting_3)+gu2.Server_Anwering_0)+gu2.Server_Anwering_1)+gu2.Server_Anwering_2)+gu2.Server_Anwering_3)+gu2.Server_Anwering_4)+gu2.Server_Anwering_5)+gu2.Server_Anwering_6)+gu2.Server_Anwering_7)+gu2.RequestBuffer_0)+gu2.RequestBuffer_1)+gu2.RequestBuffer_2)+gu2.RequestBuffer_3)<=((((((((((((((gu0.RequestBufferSlots_0+gu2.RequestBuffer_0)+gu2.RequestBuffer_1)+gu2.RequestBuffer_2)+gu2.RequestBuffer_3)+gu2.Server_Waiting_0)+gu2.Server_Waiting_1)+gu2.Server_Anwering_0)+gu2.Server_Anwering_1)+gu2.Server_Anwering_2)+gu2.Server_Anwering_3)+gu2.Server_Anwering_4)+gu2.Server_Anwering_5)+gu2.Server_Anwering_6)+gu2.Server_Anwering_7)))))))
=> equivalent forward existential formula: [(FwdU((FwdU(Init,TRUE) * !(!(E(TRUE U !(EX(TRUE)))))),((((((((((((((gu2.Server_Anwering_0+gu2.Server_Anwering_1)+gu2.Server_Anwering_2)+gu2.Server_Anwering_3)+gu2.Server_Anwering_4)+gu2.Server_Anwering_5)+gu2.Server_Anwering_6)+gu2.Server_Anwering_7)+gu0.RequestBufferSlots_0)+gu0.Client_Sending_0)+gu0.Client_Sending_1)+gu0.Client_Sending_2)+gu0.Client_Sending_3)<=((((((((((((((((((gu2.RequestBuffer_0+gu2.RequestBuffer_1)+gu2.RequestBuffer_2)+gu2.RequestBuffer_3)+gu0.RequestBufferSlots_0)+gu2.Server_Anwering_0)+gu2.Server_Anwering_1)+gu2.Server_Anwering_2)+gu2.Server_Anwering_3)+gu2.Server_Anwering_4)+gu2.Server_Anwering_5)+gu2.Server_Anwering_6)+gu2.Server_Anwering_7)+gu0.Client_Sending_0)+gu0.Client_Sending_1)+gu0.Client_Sending_2)+gu0.Client_Sending_3)+gu2.Server_Waiting_0)+gu2.Server_Waiting_1))&&(((((((((((((((((((gu2.Server_Waiting_0+gu2.Server_Waiting_1)+gu2.Server_Anwering_0)+gu2.Server_Anwering_1)+gu2.Server_Anwering_2)+gu2.Server_Anwering_3)+gu2.Server_Anwering_4)+gu2.Server_Anwering_5)+gu2.Server_Anwering_6)+gu2.Server_Anwering_7)+gu0.Client_Sending_0)+gu0.Client_Sending_1)+gu0.Client_Sending_2)+gu0.Client_Sending_3)+gu2.RequestBuffer_0)+gu2.RequestBuffer_1)+gu2.RequestBuffer_2)+gu2.RequestBuffer_3)+gu0.RequestBufferSlots_0)<=((((((((((gu0.RequestBufferSlots_0+gu2.RequestBuffer_0)+gu2.RequestBuffer_1)+gu2.RequestBuffer_2)+gu2.RequestBuffer_3)+gu1.Client_Waiting_0)+gu1.Client_Waiting_1)+gu1.Client_Waiting_2)+gu1.Client_Waiting_3)+gu2.Server_Waiting_0)+gu2.Server_Waiting_1)))) * !(E(TRUE U !((((((((((((((((((((gu2.Server_Waiting_0+gu2.Server_Waiting_1)+gu0.RequestBufferSlots_0)+gu1.Client_Waiting_0)+gu1.Client_Waiting_1)+gu1.Client_Waiting_2)+gu1.Client_Waiting_3)+gu2.Server_Anwering_0)+gu2.Server_Anwering_1)+gu2.Server_Anwering_2)+gu2.Server_Anwering_3)+gu2.Server_Anwering_4)+gu2.Server_Anwering_5)+gu2.Server_Anwering_6)+gu2.Server_Anwering_7)+gu2.RequestBuffer_0)+gu2.RequestBuffer_1)+gu2.RequestBuffer_2)+gu2.RequestBuffer_3)<=((((((((((((((gu0.RequestBufferSlots_0+gu2.RequestBuffer_0)+gu2.RequestBuffer_1)+gu2.RequestBuffer_2)+gu2.RequestBuffer_3)+gu2.Server_Waiting_0)+gu2.Server_Waiting_1)+gu2.Server_Anwering_0)+gu2.Server_Anwering_1)+gu2.Server_Anwering_2)+gu2.Server_Anwering_3)+gu2.Server_Anwering_4)+gu2.Server_Anwering_5)+gu2.Server_Anwering_6)+gu2.Server_Anwering_7))))))] = FALSE
Hit Full ! (commute/partial/dont) 0/0/17
(forward)formula 6,0,0.351586,15676,1,0,126,48453,90,70,4759,51223,148
FORMULA CSRepetitions-COL-02-CTLCardinality-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

original formula: EF(AG(AX(FALSE)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(!(EX(!(FALSE)))))))] != FALSE
(forward)formula 7,1,0.35171,15676,1,0,126,48453,90,70,4759,51223,149
FORMULA CSRepetitions-COL-02-CTLCardinality-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

original formula: AX(EX(AX(FALSE)))
=> equivalent forward existential formula: [(EY(Init) * !(EX(!(EX(!(FALSE))))))] = FALSE
(forward)formula 8,0,0.351913,15676,1,0,127,48473,90,72,4759,51315,151
FORMULA CSRepetitions-COL-02-CTLCardinality-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************


BK_STOP 1620908133746

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution CTLCardinality -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination CTLCardinality -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CSRepetitions-COL-02"
export BK_EXAMINATION="CTLCardinality"
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 CSRepetitions-COL-02, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r035-tajo-162038167800121"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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