Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2021-input.r056-oct2-162038334600129.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2021-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2020
Input is ClientsAndServers-PT-N5000P0, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r056-oct2-162038334600129
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 408K
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 121K May 10 09:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 103K 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.6K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Mar 28 15:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 28 15:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 15:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 28 15:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 23 03:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 23 03:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Mar 22 12:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 22 12:34 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 8 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 9.2K 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 ClientsAndServers-PT-N5000P0-00
FORMULA_NAME ClientsAndServers-PT-N5000P0-01
FORMULA_NAME ClientsAndServers-PT-N5000P0-02
FORMULA_NAME ClientsAndServers-PT-N5000P0-03
FORMULA_NAME ClientsAndServers-PT-N5000P0-04
FORMULA_NAME ClientsAndServers-PT-N5000P0-05
FORMULA_NAME ClientsAndServers-PT-N5000P0-06
FORMULA_NAME ClientsAndServers-PT-N5000P0-07
FORMULA_NAME ClientsAndServers-PT-N5000P0-08
FORMULA_NAME ClientsAndServers-PT-N5000P0-09
FORMULA_NAME ClientsAndServers-PT-N5000P0-10
FORMULA_NAME ClientsAndServers-PT-N5000P0-11
FORMULA_NAME ClientsAndServers-PT-N5000P0-12
FORMULA_NAME ClientsAndServers-PT-N5000P0-13
FORMULA_NAME ClientsAndServers-PT-N5000P0-14
FORMULA_NAME ClientsAndServers-PT-N5000P0-15

=== Now, execution of the tool begins

BK_START 1620899173377

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-13 09:46:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2021-05-13 09:46:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 09:46:15] [INFO ] Load time of PNML (sax parser for PT used): 20 ms
[2021-05-13 09:46:15] [INFO ] Transformed 25 places.
[2021-05-13 09:46:15] [INFO ] Transformed 18 transitions.
[2021-05-13 09:46:15] [INFO ] Parsed PT model containing 25 places and 18 transitions in 50 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100007 steps, including 0 resets, run finished after 46 ms. (steps per millisecond=2174 ) properties seen :[0, 1, 1, 0, 1, 0, 0, 0, 0, 1, 0, 0, 1, 0, 1, 1, 1, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 18 rows 25 cols
[2021-05-13 09:46:15] [INFO ] Computed 8 place invariants in 2 ms
[2021-05-13 09:46:15] [INFO ] [Real]Absence check using 5 positive place invariants in 15 ms returned sat
[2021-05-13 09:46:15] [INFO ] [Real]Absence check using 5 positive and 3 generalized place invariants in 2 ms returned sat
[2021-05-13 09:46:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 09:46:15] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2021-05-13 09:46:15] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 09:46:15] [INFO ] [Nat]Absence check using 5 positive place invariants in 11 ms returned sat
[2021-05-13 09:46:15] [INFO ] [Nat]Absence check using 5 positive and 3 generalized place invariants in 2 ms returned sat
[2021-05-13 09:46:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 09:46:15] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2021-05-13 09:46:15] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints in 4 ms.
[2021-05-13 09:46:15] [INFO ] Added : 9 causal constraints over 2 iterations in 22 ms. Result :sat
[2021-05-13 09:46:15] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned unsat
[2021-05-13 09:46:15] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2021-05-13 09:46:15] [INFO ] [Real]Absence check using 5 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-13 09:46:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 09:46:15] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2021-05-13 09:46:15] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints in 1 ms.
[2021-05-13 09:46:15] [INFO ] Added : 14 causal constraints over 3 iterations in 22 ms. Result :sat
[2021-05-13 09:46:15] [INFO ] [Real]Absence check using 5 positive place invariants in 6 ms returned unsat
[2021-05-13 09:46:15] [INFO ] [Real]Absence check using 5 positive place invariants in 6 ms returned sat
[2021-05-13 09:46:15] [INFO ] [Real]Absence check using 5 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-13 09:46:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 09:46:15] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2021-05-13 09:46:15] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 09:46:15] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2021-05-13 09:46:15] [INFO ] [Nat]Absence check using 5 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-13 09:46:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 09:46:15] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2021-05-13 09:46:15] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints in 1 ms.
[2021-05-13 09:46:15] [INFO ] Added : 9 causal constraints over 2 iterations in 11 ms. Result :sat
[2021-05-13 09:46:15] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2021-05-13 09:46:15] [INFO ] [Real]Absence check using 5 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-13 09:46:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 09:46:15] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2021-05-13 09:46:15] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 09:46:15] [INFO ] [Nat]Absence check using 5 positive place invariants in 5 ms returned sat
[2021-05-13 09:46:15] [INFO ] [Nat]Absence check using 5 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-13 09:46:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 09:46:15] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2021-05-13 09:46:15] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints in 1 ms.
[2021-05-13 09:46:15] [INFO ] Added : 9 causal constraints over 2 iterations in 8 ms. Result :sat
[2021-05-13 09:46:15] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned unsat
[2021-05-13 09:46:15] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2021-05-13 09:46:15] [INFO ] [Real]Absence check using 5 positive and 3 generalized place invariants in 1 ms returned unsat
[2021-05-13 09:46:15] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2021-05-13 09:46:15] [INFO ] [Real]Absence check using 5 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-13 09:46:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 09:46:15] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2021-05-13 09:46:15] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 09:46:15] [INFO ] [Nat]Absence check using 5 positive place invariants in 6 ms returned sat
[2021-05-13 09:46:15] [INFO ] [Nat]Absence check using 5 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-13 09:46:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 09:46:15] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2021-05-13 09:46:15] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints in 1 ms.
[2021-05-13 09:46:15] [INFO ] Added : 14 causal constraints over 3 iterations in 8 ms. Result :sat
[2021-05-13 09:46:15] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2021-05-13 09:46:15] [INFO ] [Real]Absence check using 5 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-13 09:46:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 09:46:15] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2021-05-13 09:46:15] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 09:46:15] [INFO ] [Nat]Absence check using 5 positive place invariants in 5 ms returned sat
[2021-05-13 09:46:15] [INFO ] [Nat]Absence check using 5 positive and 3 generalized place invariants in 5 ms returned sat
[2021-05-13 09:46:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 09:46:15] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2021-05-13 09:46:15] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints in 2 ms.
[2021-05-13 09:46:15] [INFO ] Added : 14 causal constraints over 3 iterations in 13 ms. Result :sat
[2021-05-13 09:46:15] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2021-05-13 09:46:15] [INFO ] [Real]Absence check using 5 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-13 09:46:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 09:46:15] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2021-05-13 09:46:15] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 09:46:15] [INFO ] [Nat]Absence check using 5 positive place invariants in 5 ms returned sat
[2021-05-13 09:46:15] [INFO ] [Nat]Absence check using 5 positive and 3 generalized place invariants in 2 ms returned sat
[2021-05-13 09:46:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 09:46:15] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2021-05-13 09:46:15] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints in 3 ms.
[2021-05-13 09:46:15] [INFO ] Added : 16 causal constraints over 4 iterations in 12 ms. Result :sat
[2021-05-13 09:46:15] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2021-05-13 09:46:15] [INFO ] [Real]Absence check using 5 positive and 3 generalized place invariants in 4 ms returned sat
[2021-05-13 09:46:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 09:46:15] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2021-05-13 09:46:15] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 09:46:15] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2021-05-13 09:46:15] [INFO ] [Nat]Absence check using 5 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-13 09:46:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 09:46:15] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2021-05-13 09:46:15] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints in 1 ms.
[2021-05-13 09:46:15] [INFO ] Added : 8 causal constraints over 2 iterations in 5 ms. Result :sat
[2021-05-13 09:46:15] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2021-05-13 09:46:15] [INFO ] [Real]Absence check using 5 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-13 09:46:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 09:46:15] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2021-05-13 09:46:15] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 09:46:15] [INFO ] [Nat]Absence check using 5 positive place invariants in 6 ms returned sat
[2021-05-13 09:46:15] [INFO ] [Nat]Absence check using 5 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-13 09:46:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 09:46:15] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2021-05-13 09:46:15] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints in 2 ms.
[2021-05-13 09:46:15] [INFO ] Added : 8 causal constraints over 2 iterations in 7 ms. Result :sat
[2021-05-13 09:46:15] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2021-05-13 09:46:15] [INFO ] [Real]Absence check using 5 positive and 3 generalized place invariants in 2 ms returned sat
[2021-05-13 09:46:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 09:46:15] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2021-05-13 09:46:15] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints in 1 ms.
[2021-05-13 09:46:15] [INFO ] Added : 7 causal constraints over 2 iterations in 8 ms. Result :sat
[2021-05-13 09:46:15] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2021-05-13 09:46:15] [INFO ] [Real]Absence check using 5 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-13 09:46:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 09:46:15] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2021-05-13 09:46:15] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 09:46:15] [INFO ] [Nat]Absence check using 5 positive place invariants in 5 ms returned sat
[2021-05-13 09:46:15] [INFO ] [Nat]Absence check using 5 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-13 09:46:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 09:46:15] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2021-05-13 09:46:15] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints in 1 ms.
[2021-05-13 09:46:15] [INFO ] Added : 8 causal constraints over 2 iterations in 5 ms. Result :sat
[2021-05-13 09:46:15] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2021-05-13 09:46:15] [INFO ] [Real]Absence check using 5 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-13 09:46:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 09:46:15] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2021-05-13 09:46:15] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints in 1 ms.
[2021-05-13 09:46:15] [INFO ] Added : 11 causal constraints over 3 iterations in 13 ms. Result :sat
[2021-05-13 09:46:15] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2021-05-13 09:46:15] [INFO ] [Real]Absence check using 5 positive and 3 generalized place invariants in 0 ms returned sat
[2021-05-13 09:46:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 09:46:15] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2021-05-13 09:46:15] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints in 1 ms.
[2021-05-13 09:46:15] [INFO ] Added : 9 causal constraints over 2 iterations in 6 ms. Result :sat
[2021-05-13 09:46:15] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2021-05-13 09:46:15] [INFO ] [Real]Absence check using 5 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-13 09:46:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 09:46:15] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2021-05-13 09:46:15] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints in 2 ms.
[2021-05-13 09:46:15] [INFO ] Added : 14 causal constraints over 3 iterations in 16 ms. Result :sat
[2021-05-13 09:46:16] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2021-05-13 09:46:16] [INFO ] [Real]Absence check using 5 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-13 09:46:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 09:46:16] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2021-05-13 09:46:16] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints in 1 ms.
[2021-05-13 09:46:16] [INFO ] Added : 8 causal constraints over 2 iterations in 7 ms. Result :sat
[2021-05-13 09:46:16] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2021-05-13 09:46:16] [INFO ] [Real]Absence check using 5 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-13 09:46:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 09:46:16] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2021-05-13 09:46:16] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 09:46:16] [INFO ] [Nat]Absence check using 5 positive place invariants in 5 ms returned sat
[2021-05-13 09:46:16] [INFO ] [Nat]Absence check using 5 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-13 09:46:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 09:46:16] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2021-05-13 09:46:16] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints in 1 ms.
[2021-05-13 09:46:16] [INFO ] Added : 12 causal constraints over 3 iterations in 7 ms. Result :sat
[2021-05-13 09:46:16] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2021-05-13 09:46:16] [INFO ] [Real]Absence check using 5 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-13 09:46:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 09:46:16] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2021-05-13 09:46:16] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints in 1 ms.
[2021-05-13 09:46:16] [INFO ] Added : 16 causal constraints over 4 iterations in 17 ms. Result :sat
[2021-05-13 09:46:16] [INFO ] [Real]Absence check using 5 positive place invariants in 10 ms returned sat
[2021-05-13 09:46:16] [INFO ] [Real]Absence check using 5 positive and 3 generalized place invariants in 2 ms returned sat
[2021-05-13 09:46:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 09:46:16] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2021-05-13 09:46:16] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints in 1 ms.
[2021-05-13 09:46:16] [INFO ] Added : 12 causal constraints over 3 iterations in 13 ms. Result :sat
[2021-05-13 09:46:16] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2021-05-13 09:46:16] [INFO ] [Real]Absence check using 5 positive and 3 generalized place invariants in 1 ms returned unsat
[2021-05-13 09:46:16] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2021-05-13 09:46:16] [INFO ] [Real]Absence check using 5 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-13 09:46:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 09:46:16] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2021-05-13 09:46:16] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 09:46:16] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2021-05-13 09:46:16] [INFO ] [Nat]Absence check using 5 positive and 3 generalized place invariants in 2 ms returned sat
[2021-05-13 09:46:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 09:46:16] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2021-05-13 09:46:16] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints in 1 ms.
[2021-05-13 09:46:16] [INFO ] Added : 16 causal constraints over 4 iterations in 17 ms. Result :sat
[2021-05-13 09:46:16] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned unsat
[2021-05-13 09:46:16] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned unsat
[2021-05-13 09:46:16] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2021-05-13 09:46:16] [INFO ] [Real]Absence check using 5 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-13 09:46:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 09:46:16] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2021-05-13 09:46:16] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints in 1 ms.
[2021-05-13 09:46:16] [INFO ] Added : 16 causal constraints over 4 iterations in 17 ms. Result :sat
[2021-05-13 09:46:16] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2021-05-13 09:46:16] [INFO ] [Real]Absence check using 5 positive and 3 generalized place invariants in 2 ms returned sat
[2021-05-13 09:46:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 09:46:16] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2021-05-13 09:46:16] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints in 1 ms.
[2021-05-13 09:46:16] [INFO ] Added : 16 causal constraints over 4 iterations in 9 ms. Result :sat
Successfully simplified 7 atomic propositions for a total of 12 simplifications.
[2021-05-13 09:46:16] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2021-05-13 09:46:16] [INFO ] Flatten gal took : 19 ms
FORMULA ClientsAndServers-PT-N5000P0-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N5000P0-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N5000P0-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N5000P0-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-13 09:46:16] [INFO ] Flatten gal took : 4 ms
[2021-05-13 09:46:16] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2021-05-13 09:46:16] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 1 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ ClientsAndServers-PT-N5000P0 @ 3570 seconds

FORMULA ClientsAndServers-PT-N5000P0-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ClientsAndServers-PT-N5000P0-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ClientsAndServers-PT-N5000P0-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ClientsAndServers-PT-N5000P0-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ClientsAndServers-PT-N5000P0-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ClientsAndServers-PT-N5000P0-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ClientsAndServers-PT-N5000P0-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ClientsAndServers-PT-N5000P0-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ClientsAndServers-PT-N5000P0-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ClientsAndServers-PT-N5000P0-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ClientsAndServers-PT-N5000P0-07 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ClientsAndServers-PT-N5000P0-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2968
rslt: Output for LTLCardinality @ ClientsAndServers-PT-N5000P0

{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2020",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=LTLCardinality.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Thu May 13 09:46:16 2021
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 1,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X (((p8 <= p7) U (F ((1 <= p19)) OR G ((p8 <= p7)))))",
"processed_size": 53,
"rewrites": 80
},
"result":
{
"edges": 250001,
"markings": 250001,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(p3 <= p0)",
"processed_size": 10,
"rewrites": 82
},
"result":
{
"edges": 160017,
"markings": 160017,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 4
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G ((p0 + 1 <= p3))",
"processed_size": 18,
"rewrites": 80
},
"result":
{
"edges": 40020,
"markings": 40020,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (F ((p0 + 1 <= p3)))",
"processed_size": 22,
"rewrites": 80
},
"result":
{
"edges": 280025,
"markings": 280025,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 1,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 364
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 364
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "F (G ((p4 <= p18)))",
"processed_size": 19,
"rewrites": 80
},
"result":
{
"edges": 40025,
"markings": 40024,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 3,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 410
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (X (G ((p15 + 1 <= p11))))",
"processed_size": 28,
"rewrites": 80
},
"result":
{
"edges": 250001,
"markings": 250001,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 469
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 469
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X ((p21 + 1 <= p22))",
"processed_size": 20,
"rewrites": 80
},
"result":
{
"edges": 250001,
"markings": 250001,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 5,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 547
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 2,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "F (G ((X (G ((p4 <= 0))) R F (((p2 + 1 <= p7) OR (p4 <= 0))))))",
"processed_size": 64,
"rewrites": 80
},
"result":
{
"edges": 250112,
"markings": 250091,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 656
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "F (G ((p13 <= p20)))",
"processed_size": 20,
"rewrites": 80
},
"result":
{
"edges": 150023,
"markings": 150021,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 820
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "F (G (((p12 <= p11) AND (1 <= p8))))",
"processed_size": 36,
"rewrites": 80
},
"result":
{
"edges": 250040,
"markings": 250034,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1094
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "G (((p5 <= p18) OR (1 <= p3)))",
"processed_size": 31,
"rewrites": 80
},
"result":
{
"edges": 250002,
"markings": 250002,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1641
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 4,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "F ((F (G ((p22 + 1 <= p10))) OR ((3 <= p4) R (F ((p10 <= 2)) AND (p24 + 1 <= p8)))))",
"processed_size": 84,
"rewrites": 80
},
"result":
{
"edges": 1350033,
"markings": 885029,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3282
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3282
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(p2 + 1 <= p23)",
"processed_size": 15,
"rewrites": 80
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 11,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "((p6 + 1 <= p22) R (p4 + 1 <= p0))",
"processed_size": 34,
"rewrites": 80
},
"result":
{
"edges": 639992,
"markings": 639992,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 11,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(p2 + 1 <= p23)",
"processed_size": 15,
"rewrites": 80
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 13,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G ((p22 <= p5))",
"processed_size": 15,
"rewrites": 80
},
"result":
{
"edges": 40027,
"markings": 40027,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "((p6 + 1 <= p22) R (p4 + 1 <= p0))",
"processed_size": 34,
"rewrites": 80
},
"result":
{
"edges": 639992,
"markings": 639992,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 13,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 3780,
"runtime": 602.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "G(**) : F(G(**)) : X((** U (F(**) OR G(**)))) : (G(*) OR (F(*) OR X(F(**)))) : F(G(((X(F(*)) OR G(*)) AND *))) : (F(G(**)) AND G(((G(*) AND **) OR X(G(**))))) : X(X(G(**))) : (G(**) OR ((* R *) OR (F(*) AND **))) : (X(*) AND G(F((X(*) OR *)))) : F(G(**)) : F((F(G(*)) OR (* R (F(*) AND *)))) : F(G((X(G(*)) R F(*))))"
},
"net":
{
"arcs": 54,
"conflict_clusters": 16,
"places": 25,
"places_significant": 17,
"singleton_clusters": 0,
"transitions": 18
},
"result":
{
"preliminary_value": "no no no no unknown no no no no no no no ",
"value": "no no no no unknown no no no no no no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 43/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 800
lola: finding significant places
lola: 25 places, 18 transitions, 17 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from LTLCardinality.xml
lola: G (((p5 <= p18) OR (1 <= p3))) : F ((G (((p12 <= p11) AND (1 <= p8))) AND F ((X (X ((p12 <= p11))) U (0 <= 0))))) : X (((p8 <= p7) U (F ((1 <= p19)) OR G ((p8 <= p7))))) : ((NOT(F ((p3 <= p0))) OR NOT(G ((p3 <= p0)))) OR X (F ((p0 + 1 <= p3)))) : F (G (X (NOT(F (((X (G ((p23 <= p9))) AND F ((2 <= p24))) OR (3 <= p12))))))) : G (((NOT(F (((p8 + 1 <= p19) AND (p23 + 1 <= p15)))) AND (p4 <= p18)) U NOT(F (NOT(X ((p4 <= p18))))))) : X (X (G ((p15 + 1 <= p11)))) : ((G ((p22 <= p5)) OR NOT(((p22 <= p6) U (p0 <= p4)))) OR (NOT(G ((p0 <= p4))) AND (p2 + 1 <= p23))) : (NOT(X ((p22 <= p21))) AND NOT(F (G ((X ((2 <= p2)) AND (p0 <= p10)))))) : F ((G (NOT(X (NOT(((2 <= p19) U (1 <= p22)))))) U F (G ((p13 <= p20))))) : F ((NOT(X (G (F ((p10 <= p22))))) OR NOT(((p4 <= 2) U (G ((3 <= p10)) OR (p8 <= p24)))))) : F (G (X (G (NOT((X (F ((1 <= p4))) U G (((p7 <= p2) AND (1 <= p4)))))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:166
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:115
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:341
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((p8 <= p7) U (F ((1 <= p19)) OR G ((p8 <= p7)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((p8 <= p7) U (F ((1 <= p19)) OR G ((p8 <= p7)))))
lola: processed formula length: 53
lola: 80 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 250001 markings, 250001 edges
lola: ========================================
lola: subprocess 1 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G ((p0 + 1 <= p3)) OR (F ((p0 + 1 <= p3)) OR X (F ((p0 + 1 <= p3)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((p0 + 1 <= p3))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: (p3 <= p0)
lola: processed formula length: 10
lola: 82 rewrites
lola: closed formula file LTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 160017 markings, 160017 edges
lola: ========================================
lola: subprocess 2 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((p0 + 1 <= p3))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((p0 + 1 <= p3))
lola: processed formula length: 18
lola: 80 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 40020 markings, 40020 edges
lola: ========================================
lola: subprocess 3 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((p0 + 1 <= p3)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((p0 + 1 <= p3)))
lola: processed formula length: 22
lola: 80 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 280025 markings, 280025 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((X (F ((p9 + 1 <= p23))) OR G ((p24 <= 1))) AND (p12 <= 2))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G (((X (F ((p9 + 1 <= p23))) OR G ((p24 <= 1))) AND (p12 <= 2))))
lola: processed formula length: 68
lola: 80 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 4468402 markings, 8534919 edges, 893680 markings/sec, 0 secs
lola: 8182902 markings, 16606668 edges, 742900 markings/sec, 5 secs
lola: 11914263 markings, 24776664 edges, 746272 markings/sec, 10 secs
lola: 15619956 markings, 33066392 edges, 741139 markings/sec, 15 secs
lola: 18134072 markings, 40552190 edges, 502823 markings/sec, 20 secs
lola: 21014336 markings, 48586385 edges, 576053 markings/sec, 25 secs
lola: 23859128 markings, 56135408 edges, 568958 markings/sec, 30 secs
lola: 26454038 markings, 63628182 edges, 518982 markings/sec, 35 secs
lola: 29039583 markings, 71278794 edges, 517109 markings/sec, 40 secs
lola: 31726333 markings, 79766629 edges, 537350 markings/sec, 45 secs
lola: 34379267 markings, 87528206 edges, 530587 markings/sec, 50 secs
lola: 37023547 markings, 94814293 edges, 528856 markings/sec, 55 secs
lola: 39810534 markings, 102755730 edges, 557397 markings/sec, 60 secs
lola: 43286426 markings, 111631930 edges, 695178 markings/sec, 65 secs
lola: 46616411 markings, 119523082 edges, 665997 markings/sec, 70 secs
lola: 50125773 markings, 128565186 edges, 701872 markings/sec, 75 secs
lola: 53682361 markings, 137275514 edges, 711318 markings/sec, 80 secs
lola: 55956827 markings, 143857068 edges, 454893 markings/sec, 85 secs
lola: 58534343 markings, 150856883 edges, 515503 markings/sec, 90 secs
lola: 61164192 markings, 157993136 edges, 525970 markings/sec, 95 secs
lola: 64126603 markings, 165606240 edges, 592482 markings/sec, 100 secs
lola: 66706637 markings, 173960217 edges, 516007 markings/sec, 105 secs
lola: 69507281 markings, 182164287 edges, 560129 markings/sec, 110 secs
lola: 71966653 markings, 189382584 edges, 491874 markings/sec, 115 secs
lola: 74602962 markings, 196578550 edges, 527262 markings/sec, 120 secs
lola: 77009448 markings, 203857744 edges, 481297 markings/sec, 125 secs
lola: 79791658 markings, 211390688 edges, 556442 markings/sec, 130 secs
lola: 82644086 markings, 219093430 edges, 570486 markings/sec, 135 secs
lola: 85066660 markings, 226622526 edges, 484515 markings/sec, 140 secs
lola: 87874495 markings, 233543022 edges, 561567 markings/sec, 145 secs
lola: 89930968 markings, 240062837 edges, 411295 markings/sec, 150 secs
lola: 92208140 markings, 247233494 edges, 455434 markings/sec, 155 secs
lola: 94686271 markings, 254290340 edges, 495626 markings/sec, 160 secs
lola: 97618636 markings, 261482623 edges, 586473 markings/sec, 165 secs
lola: 99858637 markings, 269765886 edges, 448000 markings/sec, 170 secs
lola: 102269442 markings, 277647948 edges, 482161 markings/sec, 175 secs
lola: 104731819 markings, 285420634 edges, 492475 markings/sec, 180 secs
lola: 107268410 markings, 293283825 edges, 507318 markings/sec, 185 secs
lola: 110062677 markings, 301973417 edges, 558853 markings/sec, 190 secs
lola: 112359805 markings, 307344674 edges, 459426 markings/sec, 195 secs
lola: 114161369 markings, 312132724 edges, 360313 markings/sec, 200 secs
lola: 115580282 markings, 316665348 edges, 283783 markings/sec, 205 secs
lola: 117047485 markings, 320573267 edges, 293441 markings/sec, 210 secs
lola: 119020036 markings, 326157649 edges, 394510 markings/sec, 215 secs
lola: 120392733 markings, 330228438 edges, 274539 markings/sec, 220 secs
lola: 121156183 markings, 333605792 edges, 152690 markings/sec, 225 secs
lola: 123384161 markings, 340238623 edges, 445596 markings/sec, 230 secs
lola: 125047681 markings, 345912213 edges, 332704 markings/sec, 235 secs
lola: 126646660 markings, 351223971 edges, 319796 markings/sec, 240 secs
lola: 128142463 markings, 356997318 edges, 299161 markings/sec, 245 secs
lola: 130321969 markings, 364554539 edges, 435901 markings/sec, 250 secs
lola: 131681762 markings, 368832715 edges, 271959 markings/sec, 255 secs
lola: 133513013 markings, 375433765 edges, 366250 markings/sec, 260 secs
lola: 135323514 markings, 381627940 edges, 362100 markings/sec, 265 secs
lola: 135715323 markings, 382519825 edges, 78362 markings/sec, 270 secs
lola: 136502492 markings, 384485655 edges, 157434 markings/sec, 275 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 3 will run for 364 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (G ((p4 <= p18))) AND G (((G (((p19 <= p8) OR (p15 <= p23))) AND (p4 <= p18)) OR X (G ((p4 <= p18))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 364 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((p4 <= p18)))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((p4 <= p18)))
lola: processed formula length: 19
lola: 80 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 40024 markings, 40025 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 4 will run for 410 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (G ((p15 + 1 <= p11))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (G ((p15 + 1 <= p11))))
lola: processed formula length: 28
lola: 80 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 250001 markings, 250001 edges
lola: ========================================
lola: subprocess 5 will run for 469 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X ((p21 + 1 <= p22)) AND G (F ((X ((p2 <= 1)) OR (p10 + 1 <= p0)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 469 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((p21 + 1 <= p22))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((p21 + 1 <= p22))
lola: processed formula length: 20
lola: 80 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 250001 markings, 250001 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 6 will run for 547 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((X (G ((p4 <= 0))) R F (((p2 + 1 <= p7) OR (p4 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((X (G ((p4 <= 0))) R F (((p2 + 1 <= p7) OR (p4 <= 0))))))
lola: processed formula length: 64
lola: 80 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 250091 markings, 250112 edges
lola: ========================================
lola: subprocess 7 will run for 656 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((p13 <= p20)))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((p13 <= p20)))
lola: processed formula length: 20
lola: 80 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 150021 markings, 150023 edges
lola: ========================================
lola: subprocess 8 will run for 820 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((p12 <= p11) AND (1 <= p8))))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G (((p12 <= p11) AND (1 <= p8))))
lola: processed formula length: 36
lola: 80 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 250034 markings, 250040 edges
lola: subprocess 9 will run for 1094 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ========================================
lola: ...considering subproblem: G (((p5 <= p18) OR (1 <= p3)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((p5 <= p18) OR (1 <= p3)))
lola: processed formula length: 31
lola: 80 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 250002 markings, 250002 edges
lola: ========================================
lola: subprocess 10 will run for 1641 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((F (G ((p22 + 1 <= p10))) OR ((3 <= p4) R (F ((p10 <= 2)) AND (p24 + 1 <= p8)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((F (G ((p22 + 1 <= p10))) OR ((3 <= p4) R (F ((p10 <= 2)) AND (p24 + 1 <= p8)))))
lola: processed formula length: 84
lola: 80 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 885029 markings, 1350033 edges
lola: ========================================
lola: subprocess 11 will run for 3282 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G ((p22 <= p5)) OR (((p6 + 1 <= p22) R (p4 + 1 <= p0)) OR (F ((p4 + 1 <= p0)) AND (p2 + 1 <= p23))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 3282 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p2 + 1 <= p23)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p2 + 1 <= p23)
lola: processed formula length: 15
lola: 80 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 13 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p6 + 1 <= p22) R (p4 + 1 <= p0))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((p6 + 1 <= p22) R (p4 + 1 <= p0))
lola: processed formula length: 34
lola: 80 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 639992 markings, 639992 edges
lola: ========================================
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: F (G (((X (F ((p9 + 1 <= p23))) OR G ((p24 <= 1))) AND (p12 <= 2))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G (((X (F ((p9 + 1 <= p23))) OR G ((p24 <= 1))) AND (p12 <= 2))))
lola: processed formula length: 68
lola: 80 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 4618520 markings, 8820142 edges, 923704 markings/sec, 0 secs
lola: 8506349 markings, 17361374 edges, 777566 markings/sec, 5 secs
lola: 12685372 markings, 25999556 edges, 835805 markings/sec, 10 secs
lola: 16114658 markings, 34538768 edges, 685857 markings/sec, 15 secs
lola: 18835186 markings, 42562070 edges, 544106 markings/sec, 20 secs
lola: 21860669 markings, 51058189 edges, 605097 markings/sec, 25 secs
lola: 24926004 markings, 58868353 edges, 613067 markings/sec, 30 secs
lola: 27444733 markings, 66677556 edges, 503746 markings/sec, 35 secs
lola: 30448430 markings, 75249927 edges, 600739 markings/sec, 40 secs
lola: 33025365 markings, 83521593 edges, 515387 markings/sec, 45 secs
lola: 35799875 markings, 91121861 edges, 554902 markings/sec, 50 secs
lola: 38205627 markings, 98436895 edges, 481150 markings/sec, 55 secs
lola: 40984433 markings, 106414184 edges, 555761 markings/sec, 60 secs
lola: 44704859 markings, 115008431 edges, 744085 markings/sec, 65 secs
lola: 47912301 markings, 123030936 edges, 641488 markings/sec, 70 secs
lola: 51474458 markings, 131747802 edges, 712431 markings/sec, 75 secs
lola: 54458970 markings, 139467620 edges, 596902 markings/sec, 80 secs
lola: 56334181 markings, 144883560 edges, 375042 markings/sec, 85 secs
lola: 58586376 markings, 151033777 edges, 450439 markings/sec, 90 secs
lola: 60970726 markings, 157471541 edges, 476870 markings/sec, 95 secs
lola: 63634322 markings, 164435760 edges, 532719 markings/sec, 100 secs
lola: 66163676 markings, 172095095 edges, 505871 markings/sec, 105 secs
lola: 68490175 markings, 179522996 edges, 465300 markings/sec, 110 secs
lola: 71119250 markings, 186379172 edges, 525815 markings/sec, 115 secs
lola: 73384824 markings, 193336250 edges, 453115 markings/sec, 120 secs
lola: 75628363 markings, 199421899 edges, 448708 markings/sec, 125 secs
lola: 77859571 markings, 206218767 edges, 446242 markings/sec, 130 secs
lola: 80636704 markings, 213008541 edges, 555427 markings/sec, 135 secs
lola: 82955550 markings, 219930731 edges, 463769 markings/sec, 140 secs
lola: 85246504 markings, 227121052 edges, 458191 markings/sec, 145 secs
lola: 87777894 markings, 233303109 edges, 506278 markings/sec, 150 secs
lola: 89817716 markings, 239748908 edges, 407964 markings/sec, 155 secs
lola: 92136871 markings, 246957171 edges, 463831 markings/sec, 160 secs
lola: 94526148 markings, 253759559 edges, 477855 markings/sec, 165 secs
lola: 97445019 markings, 260752854 edges, 583774 markings/sec, 170 secs
lola: 99495486 markings, 268752578 edges, 410093 markings/sec, 175 secs
lola: 101887621 markings, 276411017 edges, 478427 markings/sec, 180 secs
lola: 104299045 markings, 283820043 edges, 482285 markings/sec, 185 secs
lola: 106691628 markings, 291053605 edges, 478517 markings/sec, 190 secs
lola: 109053223 markings, 298759497 edges, 472319 markings/sec, 195 secs
lola: 112066259 markings, 306696376 edges, 602607 markings/sec, 200 secs
lola: 113753033 markings, 310890775 edges, 337355 markings/sec, 205 secs
lola: 115320008 markings, 316058045 edges, 313395 markings/sec, 210 secs
lola: 116334262 markings, 318284817 edges, 202851 markings/sec, 215 secs
lola: 118131421 markings, 323468129 edges, 359432 markings/sec, 220 secs
lola: 119820512 markings, 328260157 edges, 337818 markings/sec, 225 secs
lola: 121106500 markings, 333366001 edges, 257198 markings/sec, 230 secs
lola: 123337135 markings, 340085963 edges, 446127 markings/sec, 235 secs
lola: 124831095 markings, 345311853 edges, 298792 markings/sec, 240 secs
lola: 126556312 markings, 350854218 edges, 345043 markings/sec, 245 secs
lola: 127576541 markings, 354881955 edges, 204046 markings/sec, 250 secs
lola: 129679483 markings, 362112512 edges, 420588 markings/sec, 255 secs
lola: 131137918 markings, 366972165 edges, 291687 markings/sec, 260 secs
lola: 132596131 markings, 372262317 edges, 291643 markings/sec, 265 secs
lola: 134169310 markings, 378331956 edges, 314636 markings/sec, 270 secs
lola: 135511995 markings, 382073633 edges, 268537 markings/sec, 275 secs
lola: 135890141 markings, 382903453 edges, 75629 markings/sec, 280 secs
lola: 137260605 markings, 386511410 edges, 274093 markings/sec, 285 secs
lola: 137702619 markings, 387724157 edges, 88403 markings/sec, 290 secs
lola: 138475225 markings, 390404378 edges, 154521 markings/sec, 295 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: (G ((p22 <= p5)) OR (((p6 + 1 <= p22) R (p4 + 1 <= p0)) OR (F ((p4 + 1 <= p0)) AND (p2 + 1 <= p23))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: (p2 + 1 <= p23)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p2 + 1 <= p23)
lola: processed formula length: 15
lola: 80 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: ...considering subproblem: G ((p22 <= p5))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((p22 <= p5))
lola: processed formula length: 15
lola: 80 rewrites
lola: closed formula file LTLCardinality.xml
lola: ========================================
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 40027 markings, 40027 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: ((p6 + 1 <= p22) R (p4 + 1 <= p0))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((p6 + 1 <= p22) R (p4 + 1 <= p0))
lola: processed formula length: 34
lola: 80 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 639992 markings, 639992 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no unknown no no no no no no no
lola:
preliminary result: no no no no unknown no no no no no no no
lola: memory consumption: 3780 KB
lola: time consumption: 602 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.json
rslt: finished

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ClientsAndServers-PT-N5000P0"
export BK_EXAMINATION="LTLCardinality"
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 ClientsAndServers-PT-N5000P0, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r056-oct2-162038334600129"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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