About the Execution of 2020-gold for CSRepetitions-COL-03
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
885.012 | 43203.00 | 53524.00 | 94.70 | FFTTFFTFTTTFTFFF | 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/mcc2021-input.r035-tajo-162038167800123.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-03, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r035-tajo-162038167800123
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 336K
-rw-r--r-- 1 mcc users 15K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K May 10 09:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.0K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K 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.5K Mar 28 15:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 28 15:49 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 28 15:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 28 15:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Mar 23 03:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 23 03:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.3K Mar 22 12:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K 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 14K 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-03-CTLCardinality-00
FORMULA_NAME CSRepetitions-COL-03-CTLCardinality-01
FORMULA_NAME CSRepetitions-COL-03-CTLCardinality-02
FORMULA_NAME CSRepetitions-COL-03-CTLCardinality-03
FORMULA_NAME CSRepetitions-COL-03-CTLCardinality-04
FORMULA_NAME CSRepetitions-COL-03-CTLCardinality-05
FORMULA_NAME CSRepetitions-COL-03-CTLCardinality-06
FORMULA_NAME CSRepetitions-COL-03-CTLCardinality-07
FORMULA_NAME CSRepetitions-COL-03-CTLCardinality-08
FORMULA_NAME CSRepetitions-COL-03-CTLCardinality-09
FORMULA_NAME CSRepetitions-COL-03-CTLCardinality-10
FORMULA_NAME CSRepetitions-COL-03-CTLCardinality-11
FORMULA_NAME CSRepetitions-COL-03-CTLCardinality-12
FORMULA_NAME CSRepetitions-COL-03-CTLCardinality-13
FORMULA_NAME CSRepetitions-COL-03-CTLCardinality-14
FORMULA_NAME CSRepetitions-COL-03-CTLCardinality-15
=== Now, execution of the tool begins
BK_START 1620908169608
[2021-05-13 12:16:11] [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:16:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 12:16:11] [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:16:11] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 463 ms
[2021-05-13 12:16:12] [INFO ] sort/places :
Server->Server_Waiting,
Computation->Server_Anwering,
Dot->RequestBufferSlots,
Client->Client_Sending,RequestBuffer,Client_Waiting,
[2021-05-13 12:16:12] [INFO ] Imported 6 HL places and 5 HL transitions for a total of 58 PT places and 81.0 transition bindings in 12 ms.
[2021-05-13 12:16:12] [INFO ] Computed order based on color domains.
[2021-05-13 12:16:12] [INFO ] Unfolded HLPN to a Petri net with 58 places and 81 transitions in 7 ms.
[2021-05-13 12:16:12] [INFO ] Unfolded HLPN properties in 2 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 39 ms.
Incomplete random walk after 100000 steps, including 3327 resets, run finished after 3836 ms. (steps per millisecond=26 ) properties seen :[0, 1, 1, 0, 0, 0, 0, 1, 0, 1, 1, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 1, 1, 0, 1, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0]
// Phase 1: matrix 81 rows 58 cols
[2021-05-13 12:16:15] [INFO ] Computed 12 place invariants in 4 ms
[2021-05-13 12:16:16] [INFO ] [Real]Absence check using 12 positive place invariants in 23 ms returned sat
[2021-05-13 12:16:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 12:16:16] [INFO ] [Real]Absence check using state equation in 27 ms returned unsat
[2021-05-13 12:16:16] [INFO ] [Real]Absence check using 12 positive place invariants in 4 ms returned unsat
[2021-05-13 12:16:16] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned unsat
[2021-05-13 12:16:16] [INFO ] [Real]Absence check using 12 positive place invariants in 7 ms returned sat
[2021-05-13 12:16:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 12:16:16] [INFO ] [Real]Absence check using state equation in 27 ms returned unsat
[2021-05-13 12:16:16] [INFO ] [Real]Absence check using 12 positive place invariants in 5 ms returned unsat
[2021-05-13 12:16:16] [INFO ] [Real]Absence check using 12 positive place invariants in 4 ms returned sat
[2021-05-13 12:16:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 12:16:16] [INFO ] [Real]Absence check using state equation in 13 ms returned unsat
[2021-05-13 12:16:16] [INFO ] [Real]Absence check using 12 positive place invariants in 5 ms returned unsat
[2021-05-13 12:16:16] [INFO ] [Real]Absence check using 12 positive place invariants in 6 ms returned sat
[2021-05-13 12:16:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 12:16:16] [INFO ] [Real]Absence check using state equation in 17 ms returned unsat
[2021-05-13 12:16:16] [INFO ] [Real]Absence check using 12 positive place invariants in 4 ms returned unsat
[2021-05-13 12:16:16] [INFO ] [Real]Absence check using 12 positive place invariants in 4 ms returned sat
[2021-05-13 12:16:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 12:16:16] [INFO ] [Real]Absence check using state equation in 14 ms returned unsat
[2021-05-13 12:16:16] [INFO ] [Real]Absence check using 12 positive place invariants in 5 ms returned sat
[2021-05-13 12:16:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 12:16:16] [INFO ] [Real]Absence check using state equation in 16 ms returned unsat
[2021-05-13 12:16:16] [INFO ] [Real]Absence check using 12 positive place invariants in 4 ms returned sat
[2021-05-13 12:16:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 12:16:16] [INFO ] [Real]Absence check using state equation in 15 ms returned unsat
[2021-05-13 12:16:16] [INFO ] [Real]Absence check using 12 positive place invariants in 4 ms returned sat
[2021-05-13 12:16:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 12:16:16] [INFO ] [Real]Absence check using state equation in 15 ms returned unsat
[2021-05-13 12:16:16] [INFO ] [Real]Absence check using 12 positive place invariants in 4 ms returned unsat
[2021-05-13 12:16:16] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned unsat
[2021-05-13 12:16:16] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned unsat
[2021-05-13 12:16:16] [INFO ] [Real]Absence check using 12 positive place invariants in 6 ms returned sat
[2021-05-13 12:16:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 12:16:16] [INFO ] [Real]Absence check using state equation in 15 ms returned unsat
[2021-05-13 12:16:16] [INFO ] [Real]Absence check using 12 positive place invariants in 5 ms returned unsat
[2021-05-13 12:16:16] [INFO ] [Real]Absence check using 12 positive place invariants in 5 ms returned sat
[2021-05-13 12:16:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 12:16:16] [INFO ] [Real]Absence check using state equation in 15 ms returned unsat
[2021-05-13 12:16:16] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned sat
[2021-05-13 12:16:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 12:16:16] [INFO ] [Real]Absence check using state equation in 11 ms returned unsat
[2021-05-13 12:16:16] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned unsat
[2021-05-13 12:16:16] [INFO ] [Real]Absence check using 12 positive place invariants in 12 ms returned sat
[2021-05-13 12:16:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 12:16:16] [INFO ] [Real]Absence check using state equation in 17 ms returned unsat
[2021-05-13 12:16:16] [INFO ] [Real]Absence check using 12 positive place invariants in 5 ms returned sat
[2021-05-13 12:16:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 12:16:16] [INFO ] [Real]Absence check using state equation in 15 ms returned unsat
[2021-05-13 12:16:16] [INFO ] [Real]Absence check using 12 positive place invariants in 5 ms returned sat
[2021-05-13 12:16:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 12:16:16] [INFO ] [Real]Absence check using state equation in 14 ms returned unsat
[2021-05-13 12:16:16] [INFO ] [Real]Absence check using 12 positive place invariants in 6 ms returned sat
[2021-05-13 12:16:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 12:16:16] [INFO ] [Real]Absence check using state equation in 16 ms returned unsat
[2021-05-13 12:16:16] [INFO ] [Real]Absence check using 12 positive place invariants in 4 ms returned unsat
[2021-05-13 12:16:16] [INFO ] [Real]Absence check using 12 positive place invariants in 5 ms returned sat
[2021-05-13 12:16:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 12:16:16] [INFO ] [Real]Absence check using state equation in 11 ms returned unsat
[2021-05-13 12:16:16] [INFO ] [Real]Absence check using 12 positive place invariants in 8 ms returned unsat
[2021-05-13 12:16:16] [INFO ] [Real]Absence check using 12 positive place invariants in 6 ms returned unsat
[2021-05-13 12:16:16] [INFO ] [Real]Absence check using 12 positive place invariants in 5 ms returned sat
[2021-05-13 12:16:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 12:16:16] [INFO ] [Real]Absence check using state equation in 14 ms returned unsat
[2021-05-13 12:16:16] [INFO ] [Real]Absence check using 12 positive place invariants in 5 ms returned unsat
[2021-05-13 12:16:16] [INFO ] [Real]Absence check using 12 positive place invariants in 4 ms returned unsat
[2021-05-13 12:16:16] [INFO ] [Real]Absence check using 12 positive place invariants in 6 ms returned unsat
[2021-05-13 12:16:16] [INFO ] [Real]Absence check using 12 positive place invariants in 6 ms returned unsat
[2021-05-13 12:16:16] [INFO ] [Real]Absence check using 12 positive place invariants in 4 ms returned unsat
[2021-05-13 12:16:16] [INFO ] [Real]Absence check using 12 positive place invariants in 4 ms returned unsat
[2021-05-13 12:16:16] [INFO ] [Real]Absence check using 12 positive place invariants in 5 ms returned unsat
[2021-05-13 12:16:17] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned unsat
[2021-05-13 12:16:17] [INFO ] [Real]Absence check using 12 positive place invariants in 10 ms returned sat
[2021-05-13 12:16:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 12:16:17] [INFO ] [Real]Absence check using state equation in 16 ms returned unsat
[2021-05-13 12:16:17] [INFO ] [Real]Absence check using 12 positive place invariants in 4 ms returned unsat
[2021-05-13 12:16:17] [INFO ] [Real]Absence check using 12 positive place invariants in 4 ms returned sat
[2021-05-13 12:16:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 12:16:17] [INFO ] [Real]Absence check using state equation in 11 ms returned unsat
[2021-05-13 12:16:17] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned unsat
[2021-05-13 12:16:17] [INFO ] [Real]Absence check using 12 positive place invariants in 68 ms returned unsat
[2021-05-13 12:16:17] [INFO ] [Real]Absence check using 12 positive place invariants in 4 ms returned sat
[2021-05-13 12:16:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 12:16:17] [INFO ] [Real]Absence check using state equation in 17 ms returned unsat
[2021-05-13 12:16:17] [INFO ] [Real]Absence check using 12 positive place invariants in 8 ms returned sat
[2021-05-13 12:16:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 12:16:17] [INFO ] [Real]Absence check using state equation in 24 ms returned unsat
[2021-05-13 12:16:17] [INFO ] [Real]Absence check using 12 positive place invariants in 14 ms returned sat
[2021-05-13 12:16:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 12:16:17] [INFO ] [Real]Absence check using state equation in 15 ms returned unsat
[2021-05-13 12:16:17] [INFO ] [Real]Absence check using 12 positive place invariants in 6 ms returned sat
[2021-05-13 12:16:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 12:16:17] [INFO ] [Real]Absence check using state equation in 34 ms returned unsat
[2021-05-13 12:16:17] [INFO ] [Real]Absence check using 12 positive place invariants in 6 ms returned sat
[2021-05-13 12:16:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 12:16:17] [INFO ] [Real]Absence check using state equation in 16 ms returned unsat
[2021-05-13 12:16:17] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned unsat
[2021-05-13 12:16:17] [INFO ] [Real]Absence check using 12 positive place invariants in 4 ms returned sat
[2021-05-13 12:16:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 12:16:17] [INFO ] [Real]Absence check using state equation in 12 ms returned unsat
[2021-05-13 12:16:17] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned sat
[2021-05-13 12:16:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 12:16:17] [INFO ] [Real]Absence check using state equation in 14 ms returned unsat
[2021-05-13 12:16:17] [INFO ] [Real]Absence check using 12 positive place invariants in 4 ms returned sat
[2021-05-13 12:16:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 12:16:17] [INFO ] [Real]Absence check using state equation in 219 ms returned unsat
[2021-05-13 12:16:17] [INFO ] [Real]Absence check using 12 positive place invariants in 67 ms returned sat
[2021-05-13 12:16:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 12:16:18] [INFO ] [Real]Absence check using state equation in 220 ms returned unsat
[2021-05-13 12:16:18] [INFO ] [Real]Absence check using 12 positive place invariants in 5 ms returned sat
[2021-05-13 12:16:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 12:16:18] [INFO ] [Real]Absence check using state equation in 21 ms returned unsat
[2021-05-13 12:16:18] [INFO ] [Real]Absence check using 12 positive place invariants in 20 ms returned unsat
[2021-05-13 12:16:18] [INFO ] [Real]Absence check using 12 positive place invariants in 5 ms returned sat
[2021-05-13 12:16:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 12:16:18] [INFO ] [Real]Absence check using state equation in 47 ms returned unsat
[2021-05-13 12:16:18] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned unsat
[2021-05-13 12:16:18] [INFO ] [Real]Absence check using 12 positive place invariants in 4 ms returned sat
[2021-05-13 12:16:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 12:16:18] [INFO ] [Real]Absence check using state equation in 17 ms returned unsat
[2021-05-13 12:16:18] [INFO ] [Real]Absence check using 12 positive place invariants in 13 ms returned sat
[2021-05-13 12:16:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 12:16:18] [INFO ] [Real]Absence check using state equation in 15 ms returned unsat
[2021-05-13 12:16:18] [INFO ] [Real]Absence check using 12 positive place invariants in 12 ms returned unsat
[2021-05-13 12:16:18] [INFO ] [Real]Absence check using 12 positive place invariants in 10 ms returned unsat
[2021-05-13 12:16:18] [INFO ] [Real]Absence check using 12 positive place invariants in 4 ms returned sat
[2021-05-13 12:16:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 12:16:18] [INFO ] [Real]Absence check using state equation in 13 ms returned unsat
Successfully simplified 62 atomic propositions for a total of 62 simplifications.
[2021-05-13 12:16:18] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2021-05-13 12:16:18] [INFO ] Flatten gal took : 40 ms
[2021-05-13 12:16:18] [INFO ] Initial state reduction rules for CTL removed 8 formulas.
[2021-05-13 12:16:18] [INFO ] Flatten gal took : 26 ms
FORMULA CSRepetitions-COL-03-CTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-COL-03-CTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-COL-03-CTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-COL-03-CTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-COL-03-CTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-COL-03-CTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-COL-03-CTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-COL-03-CTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-13 12:16:18] [INFO ] Applying decomposition
[2021-05-13 12:16:18] [INFO ] Flatten gal took : 10 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/graph16958912182134727202.txt, -o, /tmp/graph16958912182134727202.bin, -w, /tmp/graph16958912182134727202.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/graph16958912182134727202.bin, -l, -1, -v, -w, /tmp/graph16958912182134727202.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-13 12:16:18] [INFO ] Decomposing Gal with order
[2021-05-13 12:16:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-13 12:16:18] [INFO ] Removed a total of 86 redundant transitions.
[2021-05-13 12:16:18] [INFO ] Flatten gal took : 66 ms
[2021-05-13 12:16:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2021-05-13 12:16:18] [INFO ] Time to serialize gal into /home/mcc/execution/CTLCardinality.pnml.gal : 3 ms
[2021-05-13 12:16:18] [INFO ] Time to serialize properties into /home/mcc/execution/CTLCardinality.ctl : 3 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 8 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,1.34075e+08,0.537833,21892,2,4954,5,73225,6,0,307,103571,0
Converting to forward existential form...Done !
original formula: (EG(EF(AG(EF(((((((((((((((((((((((((((((((((((((((((((((((((((((((((((gu3.Server_Anwering_0+gu3.Server_Anwering_1)+gu3.Server_Anwering_2)+gu3.Server_Anwering_3)+gu3.Server_Anwering_4)+gu3.Server_Anwering_5)+gu3.Server_Anwering_6)+gu3.Server_Anwering_7)+gu3.Server_Anwering_8)+gu3.Server_Anwering_9)+gu3.Server_Anwering_10)+gu3.Server_Anwering_11)+gu3.Server_Anwering_12)+gu3.Server_Anwering_13)+gu3.Server_Anwering_14)+gu3.Server_Anwering_15)+gu3.Server_Anwering_16)+gu3.Server_Anwering_17)+gu3.Server_Anwering_18)+gu3.Server_Anwering_19)+gu3.Server_Anwering_20)+gu3.Server_Anwering_21)+gu3.Server_Anwering_22)+gu3.Server_Anwering_23)+gu3.Server_Anwering_24)+gu3.Server_Anwering_25)+gu3.Server_Anwering_26)+gi0.gu0.Client_Sending_0)+gi0.gu0.Client_Sending_1)+gi0.gu0.Client_Sending_2)+gi0.gu0.Client_Sending_3)+gi0.gu0.Client_Sending_4)+gi0.gu0.Client_Sending_5)+gi0.gu0.Client_Sending_6)+gi0.gu0.Client_Sending_7)+gi0.gu0.Client_Sending_8)+gi0.gu0.RequestBufferSlots_0)+gu2.Client_Waiting_0)+gu2.Client_Waiting_1)+gu2.Client_Waiting_2)+gu2.Client_Waiting_3)+gu2.Client_Waiting_4)+gu2.Client_Waiting_5)+gu2.Client_Waiting_6)+gu2.Client_Waiting_7)+gu2.Client_Waiting_8)+gi0.gu1.RequestBuffer_0)+gi0.gu1.RequestBuffer_1)+gi0.gu1.RequestBuffer_2)+gi0.gu1.RequestBuffer_3)+gi0.gu1.RequestBuffer_4)+gi0.gu1.RequestBuffer_5)+gi0.gu1.RequestBuffer_6)+gi0.gu1.RequestBuffer_7)+gi0.gu1.RequestBuffer_8)+gu2.Server_Waiting_0)+gu2.Server_Waiting_1)+gu2.Server_Waiting_2)<=13))))) * AG((((((((((((((((((((((((((((((((((((((gu3.Server_Anwering_0+gu3.Server_Anwering_1)+gu3.Server_Anwering_2)+gu3.Server_Anwering_3)+gu3.Server_Anwering_4)+gu3.Server_Anwering_5)+gu3.Server_Anwering_6)+gu3.Server_Anwering_7)+gu3.Server_Anwering_8)+gu3.Server_Anwering_9)+gu3.Server_Anwering_10)+gu3.Server_Anwering_11)+gu3.Server_Anwering_12)+gu3.Server_Anwering_13)+gu3.Server_Anwering_14)+gu3.Server_Anwering_15)+gu3.Server_Anwering_16)+gu3.Server_Anwering_17)+gu3.Server_Anwering_18)+gu3.Server_Anwering_19)+gu3.Server_Anwering_20)+gu3.Server_Anwering_21)+gu3.Server_Anwering_22)+gu3.Server_Anwering_23)+gu3.Server_Anwering_24)+gu3.Server_Anwering_25)+gu3.Server_Anwering_26)+gi0.gu0.Client_Sending_0)+gi0.gu0.Client_Sending_1)+gi0.gu0.Client_Sending_2)+gi0.gu0.Client_Sending_3)+gi0.gu0.Client_Sending_4)+gi0.gu0.Client_Sending_5)+gi0.gu0.Client_Sending_6)+gi0.gu0.Client_Sending_7)+gi0.gu0.Client_Sending_8)+gi0.gu0.RequestBufferSlots_0)<12)))
=> equivalent forward existential formula: ([(Init * !(EG(E(TRUE U !(E(TRUE U !(E(TRUE U ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((gu3.Server_Anwering_0+gu3.Server_Anwering_1)+gu3.Server_Anwering_2)+gu3.Server_Anwering_3)+gu3.Server_Anwering_4)+gu3.Server_Anwering_5)+gu3.Server_Anwering_6)+gu3.Server_Anwering_7)+gu3.Server_Anwering_8)+gu3.Server_Anwering_9)+gu3.Server_Anwering_10)+gu3.Server_Anwering_11)+gu3.Server_Anwering_12)+gu3.Server_Anwering_13)+gu3.Server_Anwering_14)+gu3.Server_Anwering_15)+gu3.Server_Anwering_16)+gu3.Server_Anwering_17)+gu3.Server_Anwering_18)+gu3.Server_Anwering_19)+gu3.Server_Anwering_20)+gu3.Server_Anwering_21)+gu3.Server_Anwering_22)+gu3.Server_Anwering_23)+gu3.Server_Anwering_24)+gu3.Server_Anwering_25)+gu3.Server_Anwering_26)+gi0.gu0.Client_Sending_0)+gi0.gu0.Client_Sending_1)+gi0.gu0.Client_Sending_2)+gi0.gu0.Client_Sending_3)+gi0.gu0.Client_Sending_4)+gi0.gu0.Client_Sending_5)+gi0.gu0.Client_Sending_6)+gi0.gu0.Client_Sending_7)+gi0.gu0.Client_Sending_8)+gi0.gu0.RequestBufferSlots_0)+gu2.Client_Waiting_0)+gu2.Client_Waiting_1)+gu2.Client_Waiting_2)+gu2.Client_Waiting_3)+gu2.Client_Waiting_4)+gu2.Client_Waiting_5)+gu2.Client_Waiting_6)+gu2.Client_Waiting_7)+gu2.Client_Waiting_8)+gi0.gu1.RequestBuffer_0)+gi0.gu1.RequestBuffer_1)+gi0.gu1.RequestBuffer_2)+gi0.gu1.RequestBuffer_3)+gi0.gu1.RequestBuffer_4)+gi0.gu1.RequestBuffer_5)+gi0.gu1.RequestBuffer_6)+gi0.gu1.RequestBuffer_7)+gi0.gu1.RequestBuffer_8)+gu2.Server_Waiting_0)+gu2.Server_Waiting_1)+gu2.Server_Waiting_2)<=13)))))))))] = FALSE * [(FwdU(Init,TRUE) * !((((((((((((((((((((((((((((((((((((((gu3.Server_Anwering_0+gu3.Server_Anwering_1)+gu3.Server_Anwering_2)+gu3.Server_Anwering_3)+gu3.Server_Anwering_4)+gu3.Server_Anwering_5)+gu3.Server_Anwering_6)+gu3.Server_Anwering_7)+gu3.Server_Anwering_8)+gu3.Server_Anwering_9)+gu3.Server_Anwering_10)+gu3.Server_Anwering_11)+gu3.Server_Anwering_12)+gu3.Server_Anwering_13)+gu3.Server_Anwering_14)+gu3.Server_Anwering_15)+gu3.Server_Anwering_16)+gu3.Server_Anwering_17)+gu3.Server_Anwering_18)+gu3.Server_Anwering_19)+gu3.Server_Anwering_20)+gu3.Server_Anwering_21)+gu3.Server_Anwering_22)+gu3.Server_Anwering_23)+gu3.Server_Anwering_24)+gu3.Server_Anwering_25)+gu3.Server_Anwering_26)+gi0.gu0.Client_Sending_0)+gi0.gu0.Client_Sending_1)+gi0.gu0.Client_Sending_2)+gi0.gu0.Client_Sending_3)+gi0.gu0.Client_Sending_4)+gi0.gu0.Client_Sending_5)+gi0.gu0.Client_Sending_6)+gi0.gu0.Client_Sending_7)+gi0.gu0.Client_Sending_8)+gi0.gu0.RequestBufferSlots_0)<12)))] = FALSE)
(forward)formula 0,0,0.69119,22272,1,0,8,73225,9,2,2602,103571,1
FORMULA CSRepetitions-COL-03-CTLCardinality-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
original formula: EF(AG((EF(((((((((((gi0.gu0.Client_Sending_0+gi0.gu0.Client_Sending_1)+gi0.gu0.Client_Sending_2)+gi0.gu0.Client_Sending_3)+gi0.gu0.Client_Sending_4)+gi0.gu0.Client_Sending_5)+gi0.gu0.Client_Sending_6)+gi0.gu0.Client_Sending_7)+gi0.gu0.Client_Sending_8)<=((((((((((((((((((((((((((gu3.Server_Anwering_0+gu3.Server_Anwering_1)+gu3.Server_Anwering_2)+gu3.Server_Anwering_3)+gu3.Server_Anwering_4)+gu3.Server_Anwering_5)+gu3.Server_Anwering_6)+gu3.Server_Anwering_7)+gu3.Server_Anwering_8)+gu3.Server_Anwering_9)+gu3.Server_Anwering_10)+gu3.Server_Anwering_11)+gu3.Server_Anwering_12)+gu3.Server_Anwering_13)+gu3.Server_Anwering_14)+gu3.Server_Anwering_15)+gu3.Server_Anwering_16)+gu3.Server_Anwering_17)+gu3.Server_Anwering_18)+gu3.Server_Anwering_19)+gu3.Server_Anwering_20)+gu3.Server_Anwering_21)+gu3.Server_Anwering_22)+gu3.Server_Anwering_23)+gu3.Server_Anwering_24)+gu3.Server_Anwering_25)+gu3.Server_Anwering_26))&&(((((((((((((((((((gi0.gu0.Client_Sending_0+gi0.gu0.Client_Sending_1)+gi0.gu0.Client_Sending_2)+gi0.gu0.Client_Sending_3)+gi0.gu0.Client_Sending_4)+gi0.gu0.Client_Sending_5)+gi0.gu0.Client_Sending_6)+gi0.gu0.Client_Sending_7)+gi0.gu0.Client_Sending_8)+gi0.gu1.RequestBuffer_0)+gi0.gu1.RequestBuffer_1)+gi0.gu1.RequestBuffer_2)+gi0.gu1.RequestBuffer_3)+gi0.gu1.RequestBuffer_4)+gi0.gu1.RequestBuffer_5)+gi0.gu1.RequestBuffer_6)+gi0.gu1.RequestBuffer_7)+gi0.gu1.RequestBuffer_8)+gi0.gu0.RequestBufferSlots_0)<=33))) * ((((((((((((((((((((gi0.gu0.Client_Sending_0+gi0.gu0.Client_Sending_1)+gi0.gu0.Client_Sending_2)+gi0.gu0.Client_Sending_3)+gi0.gu0.Client_Sending_4)+gi0.gu0.Client_Sending_5)+gi0.gu0.Client_Sending_6)+gi0.gu0.Client_Sending_7)+gi0.gu0.Client_Sending_8)+gi0.gu0.RequestBufferSlots_0)+gi0.gu1.RequestBuffer_0)+gi0.gu1.RequestBuffer_1)+gi0.gu1.RequestBuffer_2)+gi0.gu1.RequestBuffer_3)+gi0.gu1.RequestBuffer_4)+gi0.gu1.RequestBuffer_5)+gi0.gu1.RequestBuffer_6)+gi0.gu1.RequestBuffer_7)+gi0.gu1.RequestBuffer_8)<=6)&&(((((((((((((((((((((((((((((((((((((((gi0.gu1.RequestBuffer_0+gi0.gu1.RequestBuffer_1)+gi0.gu1.RequestBuffer_2)+gi0.gu1.RequestBuffer_3)+gi0.gu1.RequestBuffer_4)+gi0.gu1.RequestBuffer_5)+gi0.gu1.RequestBuffer_6)+gi0.gu1.RequestBuffer_7)+gi0.gu1.RequestBuffer_8)+gu2.Server_Waiting_0)+gu2.Server_Waiting_1)+gu2.Server_Waiting_2)+gu3.Server_Anwering_0)+gu3.Server_Anwering_1)+gu3.Server_Anwering_2)+gu3.Server_Anwering_3)+gu3.Server_Anwering_4)+gu3.Server_Anwering_5)+gu3.Server_Anwering_6)+gu3.Server_Anwering_7)+gu3.Server_Anwering_8)+gu3.Server_Anwering_9)+gu3.Server_Anwering_10)+gu3.Server_Anwering_11)+gu3.Server_Anwering_12)+gu3.Server_Anwering_13)+gu3.Server_Anwering_14)+gu3.Server_Anwering_15)+gu3.Server_Anwering_16)+gu3.Server_Anwering_17)+gu3.Server_Anwering_18)+gu3.Server_Anwering_19)+gu3.Server_Anwering_20)+gu3.Server_Anwering_21)+gu3.Server_Anwering_22)+gu3.Server_Anwering_23)+gu3.Server_Anwering_24)+gu3.Server_Anwering_25)+gu3.Server_Anwering_26)>=3)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !((E(TRUE U ((((((((((gi0.gu0.Client_Sending_0+gi0.gu0.Client_Sending_1)+gi0.gu0.Client_Sending_2)+gi0.gu0.Client_Sending_3)+gi0.gu0.Client_Sending_4)+gi0.gu0.Client_Sending_5)+gi0.gu0.Client_Sending_6)+gi0.gu0.Client_Sending_7)+gi0.gu0.Client_Sending_8)<=((((((((((((((((((((((((((gu3.Server_Anwering_0+gu3.Server_Anwering_1)+gu3.Server_Anwering_2)+gu3.Server_Anwering_3)+gu3.Server_Anwering_4)+gu3.Server_Anwering_5)+gu3.Server_Anwering_6)+gu3.Server_Anwering_7)+gu3.Server_Anwering_8)+gu3.Server_Anwering_9)+gu3.Server_Anwering_10)+gu3.Server_Anwering_11)+gu3.Server_Anwering_12)+gu3.Server_Anwering_13)+gu3.Server_Anwering_14)+gu3.Server_Anwering_15)+gu3.Server_Anwering_16)+gu3.Server_Anwering_17)+gu3.Server_Anwering_18)+gu3.Server_Anwering_19)+gu3.Server_Anwering_20)+gu3.Server_Anwering_21)+gu3.Server_Anwering_22)+gu3.Server_Anwering_23)+gu3.Server_Anwering_24)+gu3.Server_Anwering_25)+gu3.Server_Anwering_26))&&(((((((((((((((((((gi0.gu0.Client_Sending_0+gi0.gu0.Client_Sending_1)+gi0.gu0.Client_Sending_2)+gi0.gu0.Client_Sending_3)+gi0.gu0.Client_Sending_4)+gi0.gu0.Client_Sending_5)+gi0.gu0.Client_Sending_6)+gi0.gu0.Client_Sending_7)+gi0.gu0.Client_Sending_8)+gi0.gu1.RequestBuffer_0)+gi0.gu1.RequestBuffer_1)+gi0.gu1.RequestBuffer_2)+gi0.gu1.RequestBuffer_3)+gi0.gu1.RequestBuffer_4)+gi0.gu1.RequestBuffer_5)+gi0.gu1.RequestBuffer_6)+gi0.gu1.RequestBuffer_7)+gi0.gu1.RequestBuffer_8)+gi0.gu0.RequestBufferSlots_0)<=33))) * ((((((((((((((((((((gi0.gu0.Client_Sending_0+gi0.gu0.Client_Sending_1)+gi0.gu0.Client_Sending_2)+gi0.gu0.Client_Sending_3)+gi0.gu0.Client_Sending_4)+gi0.gu0.Client_Sending_5)+gi0.gu0.Client_Sending_6)+gi0.gu0.Client_Sending_7)+gi0.gu0.Client_Sending_8)+gi0.gu0.RequestBufferSlots_0)+gi0.gu1.RequestBuffer_0)+gi0.gu1.RequestBuffer_1)+gi0.gu1.RequestBuffer_2)+gi0.gu1.RequestBuffer_3)+gi0.gu1.RequestBuffer_4)+gi0.gu1.RequestBuffer_5)+gi0.gu1.RequestBuffer_6)+gi0.gu1.RequestBuffer_7)+gi0.gu1.RequestBuffer_8)<=6)&&(((((((((((((((((((((((((((((((((((((((gi0.gu1.RequestBuffer_0+gi0.gu1.RequestBuffer_1)+gi0.gu1.RequestBuffer_2)+gi0.gu1.RequestBuffer_3)+gi0.gu1.RequestBuffer_4)+gi0.gu1.RequestBuffer_5)+gi0.gu1.RequestBuffer_6)+gi0.gu1.RequestBuffer_7)+gi0.gu1.RequestBuffer_8)+gu2.Server_Waiting_0)+gu2.Server_Waiting_1)+gu2.Server_Waiting_2)+gu3.Server_Anwering_0)+gu3.Server_Anwering_1)+gu3.Server_Anwering_2)+gu3.Server_Anwering_3)+gu3.Server_Anwering_4)+gu3.Server_Anwering_5)+gu3.Server_Anwering_6)+gu3.Server_Anwering_7)+gu3.Server_Anwering_8)+gu3.Server_Anwering_9)+gu3.Server_Anwering_10)+gu3.Server_Anwering_11)+gu3.Server_Anwering_12)+gu3.Server_Anwering_13)+gu3.Server_Anwering_14)+gu3.Server_Anwering_15)+gu3.Server_Anwering_16)+gu3.Server_Anwering_17)+gu3.Server_Anwering_18)+gu3.Server_Anwering_19)+gu3.Server_Anwering_20)+gu3.Server_Anwering_21)+gu3.Server_Anwering_22)+gu3.Server_Anwering_23)+gu3.Server_Anwering_24)+gu3.Server_Anwering_25)+gu3.Server_Anwering_26)>=3)))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions gi0.gu1.Lose_Requestc0, gi0.gu1.Lose_Requestc1, gi0.gu1.Lose_Requestc2, gi0.gu1.Lose_Requestc3, gi0.gu1.Lose_Requestc4, gi0.gu1.Lose_Requestc5, gi0.gu1.Lose_Requestc6, gi0.gu1.Lose_Requestc7, gi0.gu1.Lose_Requestc8, Prepare_Requestc0, Prepare_Requestc1, Prepare_Requestc2, Prepare_Requestc3, Prepare_Requestc4, Prepare_Requestc5, Prepare_Requestc6, Prepare_Requestc7, Prepare_Requestc8, Send_Answers0c0, Send_Answers0c1, Send_Answers0c2, Send_Answers0c3, Send_Answers0c4, Send_Answers0c5, Send_Answers0c6, Send_Answers0c7, Send_Answers0c8, Send_Answers1c0, Send_Answers1c1, Send_Answers1c2, Send_Answers1c3, Send_Answers1c4, Send_Answers1c5, Send_Answers1c6, Send_Answers1c7, Send_Answers1c8, Send_Answers2c0, Send_Answers2c1, Send_Answers2c2, Send_Answers2c3, Send_Answers2c4, Send_Answers2c5, Send_Answers2c6, Send_Answers2c7, Send_Answers2c8, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/36/45/81
(forward)formula 1,0,20.3925,450828,1,0,277,2.33993e+06,186,116,8385,2.7356e+06,247
FORMULA CSRepetitions-COL-03-CTLCardinality-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
original formula: EF(((((((((((((((((((((((((((((((((((((((((((((((gi0.gu0.RequestBufferSlots_0+gi0.gu1.RequestBuffer_0)+gi0.gu1.RequestBuffer_1)+gi0.gu1.RequestBuffer_2)+gi0.gu1.RequestBuffer_3)+gi0.gu1.RequestBuffer_4)+gi0.gu1.RequestBuffer_5)+gi0.gu1.RequestBuffer_6)+gi0.gu1.RequestBuffer_7)+gi0.gu1.RequestBuffer_8)+gu3.Server_Anwering_0)+gu3.Server_Anwering_1)+gu3.Server_Anwering_2)+gu3.Server_Anwering_3)+gu3.Server_Anwering_4)+gu3.Server_Anwering_5)+gu3.Server_Anwering_6)+gu3.Server_Anwering_7)+gu3.Server_Anwering_8)+gu3.Server_Anwering_9)+gu3.Server_Anwering_10)+gu3.Server_Anwering_11)+gu3.Server_Anwering_12)+gu3.Server_Anwering_13)+gu3.Server_Anwering_14)+gu3.Server_Anwering_15)+gu3.Server_Anwering_16)+gu3.Server_Anwering_17)+gu3.Server_Anwering_18)+gu3.Server_Anwering_19)+gu3.Server_Anwering_20)+gu3.Server_Anwering_21)+gu3.Server_Anwering_22)+gu3.Server_Anwering_23)+gu3.Server_Anwering_24)+gu3.Server_Anwering_25)+gu3.Server_Anwering_26)+gi0.gu0.Client_Sending_0)+gi0.gu0.Client_Sending_1)+gi0.gu0.Client_Sending_2)+gi0.gu0.Client_Sending_3)+gi0.gu0.Client_Sending_4)+gi0.gu0.Client_Sending_5)+gi0.gu0.Client_Sending_6)+gi0.gu0.Client_Sending_7)+gi0.gu0.Client_Sending_8)>=11))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * ((((((((((((((((((((((((((((((((((((((((((((((gi0.gu0.RequestBufferSlots_0+gi0.gu1.RequestBuffer_0)+gi0.gu1.RequestBuffer_1)+gi0.gu1.RequestBuffer_2)+gi0.gu1.RequestBuffer_3)+gi0.gu1.RequestBuffer_4)+gi0.gu1.RequestBuffer_5)+gi0.gu1.RequestBuffer_6)+gi0.gu1.RequestBuffer_7)+gi0.gu1.RequestBuffer_8)+gu3.Server_Anwering_0)+gu3.Server_Anwering_1)+gu3.Server_Anwering_2)+gu3.Server_Anwering_3)+gu3.Server_Anwering_4)+gu3.Server_Anwering_5)+gu3.Server_Anwering_6)+gu3.Server_Anwering_7)+gu3.Server_Anwering_8)+gu3.Server_Anwering_9)+gu3.Server_Anwering_10)+gu3.Server_Anwering_11)+gu3.Server_Anwering_12)+gu3.Server_Anwering_13)+gu3.Server_Anwering_14)+gu3.Server_Anwering_15)+gu3.Server_Anwering_16)+gu3.Server_Anwering_17)+gu3.Server_Anwering_18)+gu3.Server_Anwering_19)+gu3.Server_Anwering_20)+gu3.Server_Anwering_21)+gu3.Server_Anwering_22)+gu3.Server_Anwering_23)+gu3.Server_Anwering_24)+gu3.Server_Anwering_25)+gu3.Server_Anwering_26)+gi0.gu0.Client_Sending_0)+gi0.gu0.Client_Sending_1)+gi0.gu0.Client_Sending_2)+gi0.gu0.Client_Sending_3)+gi0.gu0.Client_Sending_4)+gi0.gu0.Client_Sending_5)+gi0.gu0.Client_Sending_6)+gi0.gu0.Client_Sending_7)+gi0.gu0.Client_Sending_8)>=11))] != FALSE
(forward)formula 2,1,21.3811,461868,1,0,279,2.35359e+06,187,117,18417,2.7497e+06,248
FORMULA CSRepetitions-COL-03-CTLCardinality-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
original formula: !(EG(TRUE))
=> equivalent forward existential formula: [FwdG(Init,TRUE)] = FALSE
(forward)formula 3,0,22.002,476124,1,0,280,2.40254e+06,191,121,18533,2.85376e+06,253
FORMULA CSRepetitions-COL-03-CTLCardinality-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
original formula: A(AF(((EG(TRUE) * EX(TRUE)) * EF((((((((((((((gu2.Client_Waiting_0+gu2.Client_Waiting_1)+gu2.Client_Waiting_2)+gu2.Client_Waiting_3)+gu2.Client_Waiting_4)+gu2.Client_Waiting_5)+gu2.Client_Waiting_6)+gu2.Client_Waiting_7)+gu2.Client_Waiting_8)+gu2.Server_Waiting_0)+gu2.Server_Waiting_1)+gu2.Server_Waiting_2)>=1)&&(((((((((((((((((((((((((((((((((((((gu3.Server_Anwering_0+gu3.Server_Anwering_1)+gu3.Server_Anwering_2)+gu3.Server_Anwering_3)+gu3.Server_Anwering_4)+gu3.Server_Anwering_5)+gu3.Server_Anwering_6)+gu3.Server_Anwering_7)+gu3.Server_Anwering_8)+gu3.Server_Anwering_9)+gu3.Server_Anwering_10)+gu3.Server_Anwering_11)+gu3.Server_Anwering_12)+gu3.Server_Anwering_13)+gu3.Server_Anwering_14)+gu3.Server_Anwering_15)+gu3.Server_Anwering_16)+gu3.Server_Anwering_17)+gu3.Server_Anwering_18)+gu3.Server_Anwering_19)+gu3.Server_Anwering_20)+gu3.Server_Anwering_21)+gu3.Server_Anwering_22)+gu3.Server_Anwering_23)+gu3.Server_Anwering_24)+gu3.Server_Anwering_25)+gu3.Server_Anwering_26)+gi0.gu0.RequestBufferSlots_0)+gu2.Client_Waiting_0)+gu2.Client_Waiting_1)+gu2.Client_Waiting_2)+gu2.Client_Waiting_3)+gu2.Client_Waiting_4)+gu2.Client_Waiting_5)+gu2.Client_Waiting_6)+gu2.Client_Waiting_7)+gu2.Client_Waiting_8)>=1))))) U EF(AX(FALSE)))
=> equivalent forward existential formula: [((Init * !(EG(!(E(TRUE U !(EX(!(FALSE)))))))) * !(E(!(E(TRUE U !(EX(!(FALSE))))) U (!(!(EG(!(((EG(TRUE) * EX(TRUE)) * E(TRUE U (((((((((((((gu2.Client_Waiting_0+gu2.Client_Waiting_1)+gu2.Client_Waiting_2)+gu2.Client_Waiting_3)+gu2.Client_Waiting_4)+gu2.Client_Waiting_5)+gu2.Client_Waiting_6)+gu2.Client_Waiting_7)+gu2.Client_Waiting_8)+gu2.Server_Waiting_0)+gu2.Server_Waiting_1)+gu2.Server_Waiting_2)>=1)&&(((((((((((((((((((((((((((((((((((((gu3.Server_Anwering_0+gu3.Server_Anwering_1)+gu3.Server_Anwering_2)+gu3.Server_Anwering_3)+gu3.Server_Anwering_4)+gu3.Server_Anwering_5)+gu3.Server_Anwering_6)+gu3.Server_Anwering_7)+gu3.Server_Anwering_8)+gu3.Server_Anwering_9)+gu3.Server_Anwering_10)+gu3.Server_Anwering_11)+gu3.Server_Anwering_12)+gu3.Server_Anwering_13)+gu3.Server_Anwering_14)+gu3.Server_Anwering_15)+gu3.Server_Anwering_16)+gu3.Server_Anwering_17)+gu3.Server_Anwering_18)+gu3.Server_Anwering_19)+gu3.Server_Anwering_20)+gu3.Server_Anwering_21)+gu3.Server_Anwering_22)+gu3.Server_Anwering_23)+gu3.Server_Anwering_24)+gu3.Server_Anwering_25)+gu3.Server_Anwering_26)+gi0.gu0.RequestBufferSlots_0)+gu2.Client_Waiting_0)+gu2.Client_Waiting_1)+gu2.Client_Waiting_2)+gu2.Client_Waiting_3)+gu2.Client_Waiting_4)+gu2.Client_Waiting_5)+gu2.Client_Waiting_6)+gu2.Client_Waiting_7)+gu2.Client_Waiting_8)>=1)))))))) * !(E(TRUE U !(EX(!(FALSE)))))))))] != FALSE
(forward)formula 4,1,24.4245,525688,1,0,347,2.67622e+06,196,159,18555,3.19145e+06,345
FORMULA CSRepetitions-COL-03-CTLCardinality-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
original formula: (!(AG(EX((((((((((((((((((((((((((((((((((((((((((gi0.gu0.RequestBufferSlots_0+gu2.Server_Waiting_0)+gu2.Server_Waiting_1)+gu2.Server_Waiting_2)+gu3.Server_Anwering_0)+gu3.Server_Anwering_1)+gu3.Server_Anwering_2)+gu3.Server_Anwering_3)+gu3.Server_Anwering_4)+gu3.Server_Anwering_5)+gu3.Server_Anwering_6)+gu3.Server_Anwering_7)+gu3.Server_Anwering_8)+gu3.Server_Anwering_9)+gu3.Server_Anwering_10)+gu3.Server_Anwering_11)+gu3.Server_Anwering_12)+gu3.Server_Anwering_13)+gu3.Server_Anwering_14)+gu3.Server_Anwering_15)+gu3.Server_Anwering_16)+gu3.Server_Anwering_17)+gu3.Server_Anwering_18)+gu3.Server_Anwering_19)+gu3.Server_Anwering_20)+gu3.Server_Anwering_21)+gu3.Server_Anwering_22)+gu3.Server_Anwering_23)+gu3.Server_Anwering_24)+gu3.Server_Anwering_25)+gu3.Server_Anwering_26)+gi0.gu0.Client_Sending_0)+gi0.gu0.Client_Sending_1)+gi0.gu0.Client_Sending_2)+gi0.gu0.Client_Sending_3)+gi0.gu0.Client_Sending_4)+gi0.gu0.Client_Sending_5)+gi0.gu0.Client_Sending_6)+gi0.gu0.Client_Sending_7)+gi0.gu0.Client_Sending_8)<=38)&&((((((((((((((((((((((((((((((((((((((((gu2.Server_Waiting_0+gu2.Server_Waiting_1)+gu2.Server_Waiting_2)+gi0.gu0.RequestBufferSlots_0)+gi0.gu0.Client_Sending_0)+gi0.gu0.Client_Sending_1)+gi0.gu0.Client_Sending_2)+gi0.gu0.Client_Sending_3)+gi0.gu0.Client_Sending_4)+gi0.gu0.Client_Sending_5)+gi0.gu0.Client_Sending_6)+gi0.gu0.Client_Sending_7)+gi0.gu0.Client_Sending_8)+gu3.Server_Anwering_0)+gu3.Server_Anwering_1)+gu3.Server_Anwering_2)+gu3.Server_Anwering_3)+gu3.Server_Anwering_4)+gu3.Server_Anwering_5)+gu3.Server_Anwering_6)+gu3.Server_Anwering_7)+gu3.Server_Anwering_8)+gu3.Server_Anwering_9)+gu3.Server_Anwering_10)+gu3.Server_Anwering_11)+gu3.Server_Anwering_12)+gu3.Server_Anwering_13)+gu3.Server_Anwering_14)+gu3.Server_Anwering_15)+gu3.Server_Anwering_16)+gu3.Server_Anwering_17)+gu3.Server_Anwering_18)+gu3.Server_Anwering_19)+gu3.Server_Anwering_20)+gu3.Server_Anwering_21)+gu3.Server_Anwering_22)+gu3.Server_Anwering_23)+gu3.Server_Anwering_24)+gu3.Server_Anwering_25)+gu3.Server_Anwering_26)<=(((((((((((((((((((((((((((((((((((((((gi0.gu0.RequestBufferSlots_0+gu3.Server_Anwering_0)+gu3.Server_Anwering_1)+gu3.Server_Anwering_2)+gu3.Server_Anwering_3)+gu3.Server_Anwering_4)+gu3.Server_Anwering_5)+gu3.Server_Anwering_6)+gu3.Server_Anwering_7)+gu3.Server_Anwering_8)+gu3.Server_Anwering_9)+gu3.Server_Anwering_10)+gu3.Server_Anwering_11)+gu3.Server_Anwering_12)+gu3.Server_Anwering_13)+gu3.Server_Anwering_14)+gu3.Server_Anwering_15)+gu3.Server_Anwering_16)+gu3.Server_Anwering_17)+gu3.Server_Anwering_18)+gu3.Server_Anwering_19)+gu3.Server_Anwering_20)+gu3.Server_Anwering_21)+gu3.Server_Anwering_22)+gu3.Server_Anwering_23)+gu3.Server_Anwering_24)+gu3.Server_Anwering_25)+gu3.Server_Anwering_26)+gu2.Client_Waiting_0)+gu2.Client_Waiting_1)+gu2.Client_Waiting_2)+gu2.Client_Waiting_3)+gu2.Client_Waiting_4)+gu2.Client_Waiting_5)+gu2.Client_Waiting_6)+gu2.Client_Waiting_7)+gu2.Client_Waiting_8)+gu2.Server_Waiting_0)+gu2.Server_Waiting_1)+gu2.Server_Waiting_2)))))) * !(EG(AG(EX(TRUE)))))
=> equivalent forward existential formula: ([(Init * !(E(TRUE U !(EX((((((((((((((((((((((((((((((((((((((((((gi0.gu0.RequestBufferSlots_0+gu2.Server_Waiting_0)+gu2.Server_Waiting_1)+gu2.Server_Waiting_2)+gu3.Server_Anwering_0)+gu3.Server_Anwering_1)+gu3.Server_Anwering_2)+gu3.Server_Anwering_3)+gu3.Server_Anwering_4)+gu3.Server_Anwering_5)+gu3.Server_Anwering_6)+gu3.Server_Anwering_7)+gu3.Server_Anwering_8)+gu3.Server_Anwering_9)+gu3.Server_Anwering_10)+gu3.Server_Anwering_11)+gu3.Server_Anwering_12)+gu3.Server_Anwering_13)+gu3.Server_Anwering_14)+gu3.Server_Anwering_15)+gu3.Server_Anwering_16)+gu3.Server_Anwering_17)+gu3.Server_Anwering_18)+gu3.Server_Anwering_19)+gu3.Server_Anwering_20)+gu3.Server_Anwering_21)+gu3.Server_Anwering_22)+gu3.Server_Anwering_23)+gu3.Server_Anwering_24)+gu3.Server_Anwering_25)+gu3.Server_Anwering_26)+gi0.gu0.Client_Sending_0)+gi0.gu0.Client_Sending_1)+gi0.gu0.Client_Sending_2)+gi0.gu0.Client_Sending_3)+gi0.gu0.Client_Sending_4)+gi0.gu0.Client_Sending_5)+gi0.gu0.Client_Sending_6)+gi0.gu0.Client_Sending_7)+gi0.gu0.Client_Sending_8)<=38)&&((((((((((((((((((((((((((((((((((((((((gu2.Server_Waiting_0+gu2.Server_Waiting_1)+gu2.Server_Waiting_2)+gi0.gu0.RequestBufferSlots_0)+gi0.gu0.Client_Sending_0)+gi0.gu0.Client_Sending_1)+gi0.gu0.Client_Sending_2)+gi0.gu0.Client_Sending_3)+gi0.gu0.Client_Sending_4)+gi0.gu0.Client_Sending_5)+gi0.gu0.Client_Sending_6)+gi0.gu0.Client_Sending_7)+gi0.gu0.Client_Sending_8)+gu3.Server_Anwering_0)+gu3.Server_Anwering_1)+gu3.Server_Anwering_2)+gu3.Server_Anwering_3)+gu3.Server_Anwering_4)+gu3.Server_Anwering_5)+gu3.Server_Anwering_6)+gu3.Server_Anwering_7)+gu3.Server_Anwering_8)+gu3.Server_Anwering_9)+gu3.Server_Anwering_10)+gu3.Server_Anwering_11)+gu3.Server_Anwering_12)+gu3.Server_Anwering_13)+gu3.Server_Anwering_14)+gu3.Server_Anwering_15)+gu3.Server_Anwering_16)+gu3.Server_Anwering_17)+gu3.Server_Anwering_18)+gu3.Server_Anwering_19)+gu3.Server_Anwering_20)+gu3.Server_Anwering_21)+gu3.Server_Anwering_22)+gu3.Server_Anwering_23)+gu3.Server_Anwering_24)+gu3.Server_Anwering_25)+gu3.Server_Anwering_26)<=(((((((((((((((((((((((((((((((((((((((gi0.gu0.RequestBufferSlots_0+gu3.Server_Anwering_0)+gu3.Server_Anwering_1)+gu3.Server_Anwering_2)+gu3.Server_Anwering_3)+gu3.Server_Anwering_4)+gu3.Server_Anwering_5)+gu3.Server_Anwering_6)+gu3.Server_Anwering_7)+gu3.Server_Anwering_8)+gu3.Server_Anwering_9)+gu3.Server_Anwering_10)+gu3.Server_Anwering_11)+gu3.Server_Anwering_12)+gu3.Server_Anwering_13)+gu3.Server_Anwering_14)+gu3.Server_Anwering_15)+gu3.Server_Anwering_16)+gu3.Server_Anwering_17)+gu3.Server_Anwering_18)+gu3.Server_Anwering_19)+gu3.Server_Anwering_20)+gu3.Server_Anwering_21)+gu3.Server_Anwering_22)+gu3.Server_Anwering_23)+gu3.Server_Anwering_24)+gu3.Server_Anwering_25)+gu3.Server_Anwering_26)+gu2.Client_Waiting_0)+gu2.Client_Waiting_1)+gu2.Client_Waiting_2)+gu2.Client_Waiting_3)+gu2.Client_Waiting_4)+gu2.Client_Waiting_5)+gu2.Client_Waiting_6)+gu2.Client_Waiting_7)+gu2.Client_Waiting_8)+gu2.Server_Waiting_0)+gu2.Server_Waiting_1)+gu2.Server_Waiting_2))))))))] = FALSE * [FwdG(Init,!(E(TRUE U !(EX(TRUE)))))] = FALSE)
(forward)formula 5,1,31.9663,634916,1,0,370,3.17432e+06,200,172,31257,3.85862e+06,375
FORMULA CSRepetitions-COL-03-CTLCardinality-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
original formula: AG(EF(AX(E((((((((((gi0.gu1.RequestBuffer_0+gi0.gu1.RequestBuffer_1)+gi0.gu1.RequestBuffer_2)+gi0.gu1.RequestBuffer_3)+gi0.gu1.RequestBuffer_4)+gi0.gu1.RequestBuffer_5)+gi0.gu1.RequestBuffer_6)+gi0.gu1.RequestBuffer_7)+gi0.gu1.RequestBuffer_8)<=1) U (((((((((((((((((((((((((((((((((((((((gu3.Server_Anwering_0+gu3.Server_Anwering_1)+gu3.Server_Anwering_2)+gu3.Server_Anwering_3)+gu3.Server_Anwering_4)+gu3.Server_Anwering_5)+gu3.Server_Anwering_6)+gu3.Server_Anwering_7)+gu3.Server_Anwering_8)+gu3.Server_Anwering_9)+gu3.Server_Anwering_10)+gu3.Server_Anwering_11)+gu3.Server_Anwering_12)+gu3.Server_Anwering_13)+gu3.Server_Anwering_14)+gu3.Server_Anwering_15)+gu3.Server_Anwering_16)+gu3.Server_Anwering_17)+gu3.Server_Anwering_18)+gu3.Server_Anwering_19)+gu3.Server_Anwering_20)+gu3.Server_Anwering_21)+gu3.Server_Anwering_22)+gu3.Server_Anwering_23)+gu3.Server_Anwering_24)+gu3.Server_Anwering_25)+gu3.Server_Anwering_26)+gu2.Server_Waiting_0)+gu2.Server_Waiting_1)+gu2.Server_Waiting_2)+gu2.Client_Waiting_0)+gu2.Client_Waiting_1)+gu2.Client_Waiting_2)+gu2.Client_Waiting_3)+gu2.Client_Waiting_4)+gu2.Client_Waiting_5)+gu2.Client_Waiting_6)+gu2.Client_Waiting_7)+gu2.Client_Waiting_8)<=11)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(EX(!(E((((((((((gi0.gu1.RequestBuffer_0+gi0.gu1.RequestBuffer_1)+gi0.gu1.RequestBuffer_2)+gi0.gu1.RequestBuffer_3)+gi0.gu1.RequestBuffer_4)+gi0.gu1.RequestBuffer_5)+gi0.gu1.RequestBuffer_6)+gi0.gu1.RequestBuffer_7)+gi0.gu1.RequestBuffer_8)<=1) U (((((((((((((((((((((((((((((((((((((((gu3.Server_Anwering_0+gu3.Server_Anwering_1)+gu3.Server_Anwering_2)+gu3.Server_Anwering_3)+gu3.Server_Anwering_4)+gu3.Server_Anwering_5)+gu3.Server_Anwering_6)+gu3.Server_Anwering_7)+gu3.Server_Anwering_8)+gu3.Server_Anwering_9)+gu3.Server_Anwering_10)+gu3.Server_Anwering_11)+gu3.Server_Anwering_12)+gu3.Server_Anwering_13)+gu3.Server_Anwering_14)+gu3.Server_Anwering_15)+gu3.Server_Anwering_16)+gu3.Server_Anwering_17)+gu3.Server_Anwering_18)+gu3.Server_Anwering_19)+gu3.Server_Anwering_20)+gu3.Server_Anwering_21)+gu3.Server_Anwering_22)+gu3.Server_Anwering_23)+gu3.Server_Anwering_24)+gu3.Server_Anwering_25)+gu3.Server_Anwering_26)+gu2.Server_Waiting_0)+gu2.Server_Waiting_1)+gu2.Server_Waiting_2)+gu2.Client_Waiting_0)+gu2.Client_Waiting_1)+gu2.Client_Waiting_2)+gu2.Client_Waiting_3)+gu2.Client_Waiting_4)+gu2.Client_Waiting_5)+gu2.Client_Waiting_6)+gu2.Client_Waiting_7)+gu2.Client_Waiting_8)<=11))))))))] = FALSE
(forward)formula 6,1,33.0494,660936,1,0,385,3.31418e+06,205,184,32362,4.02426e+06,398
FORMULA CSRepetitions-COL-03-CTLCardinality-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
original formula: AG(EF(AX(FALSE)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(EX(!(FALSE))))))] = FALSE
(forward)formula 7,1,33.0495,660936,1,0,385,3.31418e+06,205,184,32362,4.02426e+06,398
FORMULA CSRepetitions-COL-03-CTLCardinality-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
BK_STOP 1620908212811
--------------------
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-03"
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-03, 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-162038167800123"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/CSRepetitions-COL-03.tgz
mv CSRepetitions-COL-03 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 '
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 ;