Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2020-input.r170-smll-158987815400108.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is FMS-PT-50000, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r170-smll-158987815400108
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 192K
-rw-r--r-- 1 mcc users 2.6K Apr 1 20:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 15K Apr 1 20:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Apr 1 13:49 CTLFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 1 13:49 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 8 14:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Apr 8 14:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Apr 1 10:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Apr 1 10:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 1 06:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 1 06:34 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Apr 1 13:18 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 1 13:18 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 16K Mar 24 05:37 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 FMS-PT-50000-CTLFireability-00
FORMULA_NAME FMS-PT-50000-CTLFireability-01
FORMULA_NAME FMS-PT-50000-CTLFireability-02
FORMULA_NAME FMS-PT-50000-CTLFireability-03
FORMULA_NAME FMS-PT-50000-CTLFireability-04
FORMULA_NAME FMS-PT-50000-CTLFireability-05
FORMULA_NAME FMS-PT-50000-CTLFireability-06
FORMULA_NAME FMS-PT-50000-CTLFireability-07
FORMULA_NAME FMS-PT-50000-CTLFireability-08
FORMULA_NAME FMS-PT-50000-CTLFireability-09
FORMULA_NAME FMS-PT-50000-CTLFireability-10
FORMULA_NAME FMS-PT-50000-CTLFireability-11
FORMULA_NAME FMS-PT-50000-CTLFireability-12
FORMULA_NAME FMS-PT-50000-CTLFireability-13
FORMULA_NAME FMS-PT-50000-CTLFireability-14
FORMULA_NAME FMS-PT-50000-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1591165392116

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

FORMULA FMS-PT-50000-CTLFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FMS-PT-50000-CTLFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FMS-PT-50000-CTLFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FMS-PT-50000-CTLFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FMS-PT-50000-CTLFireability-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FMS-PT-50000-CTLFireability-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FMS-PT-50000-CTLFireability-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FMS-PT-50000-CTLFireability-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FMS-PT-50000-CTLFireability-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FMS-PT-50000-CTLFireability-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FMS-PT-50000-CTLFireability-04 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FMS-PT-50000-CTLFireability-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FMS-PT-50000-CTLFireability-03 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FMS-PT-50000-CTLFireability-09 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 826
rslt: Output for CTLFireability @ FMS-PT-50000

{
"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=CTLFireability.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--quickchecks",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ctl",
"--json=CTLFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Wed Jun 3 06:23:19 2020
",
"timelimit": 3570
},
"child":
[

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 255
},
"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": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(1 <= p0)",
"processed_size": 9,
"rewrites": 23
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 1,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 277
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 3,
"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": "((1 <= p14) AND (1 <= p2) AND (1 <= p18))",
"processed_size": 41,
"rewrites": 25
},
"result":
{
"edges": 19,
"markings": 20,
"produced_by": "state space /EXEF",
"value": true
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3,
"problems": 3
},
"type": "reachability_from_a_successor",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 1,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 277
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"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": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "A (G ((p12 <= 0)))",
"processed_size": 18,
"rewrites": 25
},
"result":
{
"edges": 11,
"markings": 12,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 302
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 2,
"aneg": 1,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "E (F (((1 <= p8) AND (1 <= p10) AND (1 <= p13) AND (1 <= p15) AND ((1 <= p6) OR ((1 <= p2) AND (1 <= p18))))))",
"processed_size": 111,
"rewrites": 24
},
"result":
{
"edges": 13,
"markings": 14,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 11,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 332
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"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": "((1 <= p2) AND (1 <= p18))",
"processed_size": 26,
"rewrites": 26
},
"result":
{
"edges": 250006,
"markings": 250006,
"produced_by": "state space /EFEG",
"value": true
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 1
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "reachability_of_possible_preservation",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 368
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 2,
"E": 1,
"F": 0,
"G": 1,
"U": 2,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "A(E(((1 <= p5) AND (1 <= p7)) U (1 <= p11)) U (AG((1 <= p20)) AND (1 <= p9)))",
"processed_size": 77,
"rewrites": 26
},
"net":
{
"conflict_clusters": 17,
"singleton_clusters": 0
},
"result":
{
"edges": 350000,
"markings": 300000,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 430
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 3,
"E": 1,
"F": 1,
"G": 1,
"U": 2,
"X": 0,
"aconj": 2,
"adisj": 2,
"aneg": 0,
"comp": 10,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 9,
"visible_transitions": 0
},
"processed": "(E(AG((1 <= p20)) U ((1 <= p2) AND (1 <= p18))) AND (A((p11 <= 0) U ((1 <= p20) OR (1 <= p12))) OR AF(((1 <= p19) AND (1 <= p16) AND ((p8 <= 0) OR (p10 <= 0))))))",
"processed_size": 164,
"rewrites": 27
},
"net":
{
"conflict_clusters": 17,
"singleton_clusters": 0
},
"result":
{
"edges": 349999,
"markings": 300000,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 516
},
"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": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(1 <= p20)",
"processed_size": 10,
"rewrites": 23
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 9,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 645
},
"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": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(p1 <= 0)",
"processed_size": 9,
"rewrites": 23
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 10,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 860
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"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": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "A (G ((1 <= p9)))",
"processed_size": 17,
"rewrites": 25
},
"result":
{
"edges": 50000,
"markings": 50001,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 9,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 645
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "((1 <= p6) OR (1 <= p11))",
"processed_size": 25,
"rewrites": 24
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 10,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 860
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 1,
"comp": 3,
"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": "E (F ((((p9 <= 0) OR (p20 <= 0)) AND (p1 <= 0))))",
"processed_size": 50,
"rewrites": 24
},
"result":
{
"edges": 50000,
"markings": 50001,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 10,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 860
},
"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": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(1 <= p20)",
"processed_size": 10,
"rewrites": 23
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 11,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1290
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 4,
"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": "((p5 <= 0) OR (p7 <= 0) OR ((1 <= p21) AND (1 <= p11)))",
"processed_size": 57,
"rewrites": 23
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 12,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2581
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 1,
"comp": 4,
"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": "A (G (((p13 <= 0) OR (p15 <= 0) OR ((p19 <= 0) AND (p16 <= 0)))))",
"processed_size": 67,
"rewrites": 25
},
"result":
{
"edges": 12,
"markings": 13,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 6,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 11,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1290
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 2,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 4,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 0,
"tdisj": 3,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "G ((G (((p0 <= 0) OR (p2 <= 0) OR (p18 <= 0))) OR ((p10 <= 0) OR ((p17 <= 0) OR ((1 <= p12) AND (1 <= p21))))))",
"processed_size": 113,
"rewrites": 37
},
"result":
{
"edges": 1650018,
"markings": 1350018,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "existential single path",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2579
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 4,
"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": "E (F ((((1 <= p1) OR (1 <= p6)) AND (p0 <= 0) AND (1 <= p12))))",
"processed_size": 64,
"rewrites": 24
},
"result":
{
"edges": 13,
"markings": 14,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 6,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 13,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 4,
"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": "E (F ((((1 <= p1) OR (1 <= p6)) AND (p0 <= 0) AND (1 <= p12))))",
"processed_size": 64,
"rewrites": 24
},
"result":
{
"edges": 13,
"markings": 14,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 17,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 6,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 17,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 3540,
"runtime": 2744.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(** AND (A(G(*)) AND **)) : (** AND (A(G(*)) AND **)) : E((** U A(G(**)))) : E((E(X(**)) U (E(F(**)) AND E(G(**))))) : A((E((** U **)) U (A(G(**)) AND **))) : (E(F(*)) OR (** OR **)) : (E((A(G(**)) U **)) AND (A((** U **)) OR A(F(**)))) : E(F((E(F(**)) AND (** AND (** AND **))))) : (E(F(**)) AND E(G((A(F(**)) OR (** OR **))))) : A(G(*)) : E((** U A(F(**)))) : (E(X(E(F(**)))) OR **) : E(F(E(G(**)))) : E(F(*))"
},
"net":
{
"arcs": 50,
"conflict_clusters": 17,
"places": 22,
"places_significant": 16,
"singleton_clusters": 0,
"transitions": 20
},
"result":
{
"preliminary_value": "no no unknown unknown no yes no yes unknown no unknown yes yes yes ",
"value": "no no unknown unknown no yes no yes unknown no unknown yes yes yes "
},
"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: 42/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 704
lola: finding significant places
lola: 22 places, 20 transitions, 16 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 CTLFireability.xml
lola: (((1 <= p20) AND NOT(E (F (((1 <= p13) AND (1 <= p15) AND ((1 <= p19) OR (1 <= p16))))))) AND ((p5 <= 0) OR (p7 <= 0) OR ((1 <= p21) AND (1 <= p11)))) : (((p1 <= 0) AND NOT(E (F ((p9 <= 0))))) AND (1 <= p20)) : E ((((p13 <= 0) OR (p15 <= 0) OR ((1 <= p20) AND (1 <= p0) AND ((p2 <= 0) OR (p18 <= 0)))) U A (G ((1 <= p11))))) : E ((E (X ((1 <= p3))) U (E (F ((1 <= p12))) AND E (G ((1 <= p6)))))) : A ((E ((((1 <= p5) AND (1 <= p7)) U (1 <= p11))) U (A (G ((1 <= p20))) AND (1 <= p9)))) : ((NOT(A (G ((((1 <= p9) AND (1 <= p20)) OR (1 <= p1))))) OR (1 <= p6)) OR (1 <= p11)) : (E ((A (G ((1 <= p20))) U ((1 <= p2) AND (1 <= p18)))) AND (A (((p11 <= 0) U ((1 <= p20) OR (1 <= p12)))) OR A (F (((1 <= p19) AND (1 <= p16) AND ((p8 <= 0) OR (p10 <= 0))))))) : E (F ((((E (F (((1 <= p0) AND (1 <= p2) AND (1 <= p18)))) AND (1 <= p10)) AND (1 <= p17)) AND ((p12 <= 0) OR (p21 <= 0))))) : (E (F ((((1 <= p1) OR (1 <= p6)) AND (p0 <= 0) AND (1 <= p12)))) AND E (G (((A (F ((1 <= p11))) OR (p19 <= 0)) OR (p16 <= 0))))) : NOT(E (F (E ((((1 <= p8) AND (1 <= p10)) U (1 <= p12)))))) : E ((((1 <= p21) OR (p19 <= 0) OR (1 <= p14) OR ((1 <= p13) AND (1 <= p15))) U A (F (((1 <= p11) AND (1 <= p13) AND (1 <= p15)))))) : (E (X (E (F (((1 <= p14) AND (1 <= p2) AND (1 <= p18)))))) OR (1 <= p0)) : E (F (E (G (((1 <= p2) AND (1 <= p18)))))) : NOT(A (G (((p8 <= 0) OR (p10 <= 0) OR (p13 <= 0) OR (p15 <= 0) OR ((p6 <= 0) AND ((p2 <= 0) OR (p18 <= 0)))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:323
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:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:446
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((E (X ((1 <= p3))) U (E (F ((1 <= p12))) AND E (G ((1 <= p6))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: processed formula: E(EX((1 <= p3)) U (EF((1 <= p12)) AND EG((1 <= p6))))
lola: processed formula length: 53
lola: 27 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 4231601 markings, 5581630 edges, 846320 markings/sec, 0 secs
lola: 8263415 markings, 10963472 edges, 806363 markings/sec, 5 secs
lola: 12314768 markings, 16364852 edges, 810271 markings/sec, 10 secs
lola: 16312526 markings, 21693629 edges, 799552 markings/sec, 15 secs
lola: 20285005 markings, 26985144 edges, 794496 markings/sec, 20 secs
lola: 24238624 markings, 32257696 edges, 790724 markings/sec, 25 secs
lola: 28139326 markings, 37458711 edges, 780140 markings/sec, 30 secs
lola: 32028885 markings, 42643010 edges, 777912 markings/sec, 35 secs
lola: 35867545 markings, 47767788 edges, 767732 markings/sec, 40 secs
lola: 39699401 markings, 52873708 edges, 766371 markings/sec, 45 secs
lola: 43560962 markings, 58016009 edges, 772312 markings/sec, 50 secs
lola: 47361457 markings, 63091717 edges, 760099 markings/sec, 55 secs
lola: 51145084 markings, 68142118 edges, 756725 markings/sec, 60 secs
lola: 54841948 markings, 73062379 edges, 739373 markings/sec, 65 secs
lola: 58583498 markings, 78049664 edges, 748310 markings/sec, 70 secs
lola: 62304782 markings, 83006554 edges, 744257 markings/sec, 75 secs
lola: 66031087 markings, 87981531 edges, 745261 markings/sec, 80 secs
lola: 69735950 markings, 92928233 edges, 740973 markings/sec, 85 secs
lola: 73444149 markings, 97865492 edges, 741640 markings/sec, 90 secs
lola: 77074293 markings, 102710673 edges, 726029 markings/sec, 95 secs
lola: 80842659 markings, 107738185 edges, 753673 markings/sec, 100 secs
lola: 84519240 markings, 112628019 edges, 735316 markings/sec, 105 secs
lola: 88194168 markings, 117540375 edges, 734986 markings/sec, 110 secs
lola: 91882719 markings, 122448164 edges, 737710 markings/sec, 115 secs
lola: 95526701 markings, 127314099 edges, 728796 markings/sec, 120 secs
lola: 99203023 markings, 132203686 edges, 735264 markings/sec, 125 secs
lola: 102849308 markings, 137072937 edges, 729257 markings/sec, 130 secs
lola: 106120690 markings, 141429977 edges, 654276 markings/sec, 135 secs
lola: 109706250 markings, 146208283 edges, 717112 markings/sec, 140 secs
lola: 113248402 markings, 150946476 edges, 708430 markings/sec, 145 secs
lola: 116904467 markings, 155805534 edges, 731213 markings/sec, 150 secs
lola: 120117341 markings, 160100283 edges, 642575 markings/sec, 155 secs
lola: 121585646 markings, 162052500 edges, 293661 markings/sec, 160 secs
lola: 124584744 markings, 166052044 edges, 599820 markings/sec, 165 secs
lola: 125108645 markings, 166759480 edges, 104780 markings/sec, 170 secs
lola: 127978753 markings, 170579606 edges, 574022 markings/sec, 175 secs
lola: 129869050 markings, 173102280 edges, 378059 markings/sec, 180 secs
lola: 131653872 markings, 175479493 edges, 356964 markings/sec, 185 secs
lola: 133676351 markings, 178177243 edges, 404496 markings/sec, 190 secs
lola: 136371744 markings, 181772653 edges, 539079 markings/sec, 195 secs
lola: 138368487 markings, 184426350 edges, 399349 markings/sec, 200 secs
lola: 140453121 markings, 187204057 edges, 416927 markings/sec, 205 secs
lola: 141820477 markings, 189029300 edges, 273471 markings/sec, 210 secs
lola: 144000416 markings, 191949188 edges, 435988 markings/sec, 215 secs
lola: 145819068 markings, 194370040 edges, 363730 markings/sec, 220 secs
lola: 147490006 markings, 196590990 edges, 334188 markings/sec, 225 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 1 will run for 255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (X (E (F (((1 <= p14) AND (1 <= p2) AND (1 <= p18)))))) OR (1 <= p0))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= p0)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p0)
lola: processed formula length: 9
lola: 23 rewrites
lola: closed formula file CTLFireability.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: subprocess 2 will run for 277 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (E (F (((1 <= p14) AND (1 <= p2) AND (1 <= p18))))))
lola: ========================================
lola: SUBTASK
lola: checking reachability from a successor
lola: rewrite Frontend/Parser/formula_rewrite.k:623
lola: rewrite Frontend/Parser/formula_rewrite.k:714
lola: processed formula: ((1 <= p14) AND (1 <= p2) AND (1 <= p18))
lola: processed formula length: 41
lola: 25 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EXEF)
lola: state space: using reachability graph (EXef version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p14) AND (1 <= p2) AND (1 <= p18))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EXEF
lola: The predicate is reachable from some successor.
lola: 20 markings, 19 edges
lola: state equation: write sara problem file to CTLFireability-2-0.sara
lola: state equation: calling and running sara
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 2 will run for 277 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p12 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: A (G ((p12 <= 0)))
lola: processed formula length: 18
lola: 25 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (1 <= p12)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 12 markings, 11 edges
lola: state equation: write sara problem file to CTLFireability-2-0.sara
sara: try reading problem file CTLFireability-2-0.sara.
lola: state equation: calling and running sara
lola: ========================================
lola: subprocess 3 will run for 302 seconds at most (--localtimelimit=0)
lola: ========================================
sara: try reading problem file CTLFireability-2-0.sara.


lola: ...considering subproblem: E (F (((1 <= p8) AND (1 <= p10) AND (1 <= p13) AND (1 <= p15) AND ((1 <= p6) OR ((1 <= p2) AND (1 <= p18))))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((1 <= p8) AND (1 <= p10) AND (1 <= p13) AND (1 <= p15) AND ((1 <= p6) OR ((1 <= p2) AND (1 <= p18))))))
lola: processed formula length: 111
lola: 24 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 14 markings, 13 edges
lola: formula 0: ((1 <= p8) AND (1 <= p10) AND (1 <= p13) AND (1 <= p15) AND ((1 <= p6) OR ((1 <= p2) AND (1 <= p18))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 11 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-3-0.sara
lola: state equation: calling and running sara
lola: ========================================
lola: subprocess 4 will run for 332 seconds at most (--localtimelimit=0)
lola: ========================================
sara: try reading problem file CTLFireability-3-0.sara.
lola: ...considering subproblem: E (F (E (G (((1 <= p2) AND (1 <= p18))))))
lola: ========================================
lola: SUBTASK
lola: checking reachability of possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:598
lola: rewrite Frontend/Parser/formula_rewrite.k:633
lola: rewrite Frontend/Parser/formula_rewrite.k:730
lola: processed formula: ((1 <= p2) AND (1 <= p18))
lola: processed formula length: 26
lola: 26 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EFEG)
lola: state space: using reachability graph (EFEG version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p2 <= 0) OR (p18 <= 0))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas

lola: state equation: write sara problem file to CTLFireability-4-0.sara
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: ((1 <= p2) AND (1 <= p18))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-4-1.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-4-1.sara.

lola: state equation 1: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EFEG
lola: The predicate is possibly preserved from a reachable marking.
lola: 250006 markings, 250006 edges
lola: ========================================
lola: subprocess 5 will run for 369 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((((1 <= p21) OR (p19 <= 0) OR (1 <= p14) OR ((1 <= p13) AND (1 <= p15))) U A (F (((1 <= p11) AND (1 <= p13) AND (1 <= p15))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: processed formula: E(((1 <= p21) OR (p19 <= 0) OR (1 <= p14) OR ((1 <= p13) AND (1 <= p15))) U AF(((1 <= p11) AND (1 <= p13) AND (1 <= p15))))
lola: processed formula length: 126
lola: 25 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 3906003 markings, 4016886 edges, 781201 markings/sec, 0 secs
lola: 7273944 markings, 7388983 edges, 673588 markings/sec, 5 secs
lola: 9798710 markings, 9916229 edges, 504953 markings/sec, 10 secs
lola: 11852106 markings, 11971409 edges, 410679 markings/sec, 15 secs
lola: 13751331 markings, 13872150 edges, 379845 markings/sec, 20 secs
lola: 15586872 markings, 15709055 edges, 367108 markings/sec, 25 secs
lola: 17401063 markings, 17524518 edges, 362838 markings/sec, 30 secs
lola: 19166182 markings, 19290813 edges, 353024 markings/sec, 35 secs
lola: 21012632 markings, 21138435 edges, 369290 markings/sec, 40 secs
lola: 22868187 markings, 22995114 edges, 371111 markings/sec, 45 secs
lola: 24714591 markings, 24842594 edges, 369281 markings/sec, 50 secs
lola: 26556458 markings, 26685493 edges, 368373 markings/sec, 55 secs
lola: 28389009 markings, 28519040 edges, 366510 markings/sec, 60 secs
lola: 30252910 markings, 30383917 edges, 372780 markings/sec, 65 secs
lola: 32067022 markings, 32198949 edges, 362822 markings/sec, 70 secs
lola: 33869767 markings, 34002586 edges, 360549 markings/sec, 75 secs
lola: 35692337 markings, 35826032 edges, 364514 markings/sec, 80 secs
lola: 37494137 markings, 37628676 edges, 360360 markings/sec, 85 secs
lola: 39309822 markings, 39445193 edges, 363137 markings/sec, 90 secs
lola: 41061001 markings, 41197156 edges, 350236 markings/sec, 95 secs
lola: 42870319 markings, 43007266 edges, 361864 markings/sec, 100 secs
lola: 44671639 markings, 44809358 edges, 360264 markings/sec, 105 secs
lola: 46479795 markings, 46618274 edges, 361631 markings/sec, 110 secs
lola: 48277032 markings, 48416251 edges, 359447 markings/sec, 115 secs
lola: 50056857 markings, 50196796 edges, 355965 markings/sec, 120 secs
lola: 51805305 markings, 51945936 edges, 349690 markings/sec, 125 secs
lola: 53589931 markings, 53731258 edges, 356925 markings/sec, 130 secs
lola: 55378919 markings, 55520934 edges, 357798 markings/sec, 135 secs
lola: 57127687 markings, 57270362 edges, 349754 markings/sec, 140 secs
lola: 58858836 markings, 59002155 edges, 346230 markings/sec, 145 secs
lola: 60507773 markings, 60651700 edges, 329787 markings/sec, 150 secs
lola: 62235809 markings, 62380360 edges, 345607 markings/sec, 155 secs
lola: 64005116 markings, 64150295 edges, 353861 markings/sec, 160 secs
lola: 65791331 markings, 65937138 edges, 357243 markings/sec, 165 secs
lola: 67574375 markings, 67720802 edges, 356609 markings/sec, 170 secs
lola: 69358820 markings, 69505859 edges, 356889 markings/sec, 175 secs
lola: 71141810 markings, 71289449 edges, 356598 markings/sec, 180 secs
lola: 72925198 markings, 73073433 edges, 356678 markings/sec, 185 secs
lola: 74699321 markings, 74848140 edges, 354825 markings/sec, 190 secs
lola: 76464783 markings, 76614178 edges, 353092 markings/sec, 195 secs
lola: 78228336 markings, 78378299 edges, 352711 markings/sec, 200 secs
lola: 79994051 markings, 80144578 edges, 353143 markings/sec, 205 secs
lola: 81740496 markings, 81891571 edges, 349289 markings/sec, 210 secs
lola: 83488679 markings, 83640298 edges, 349637 markings/sec, 215 secs
lola: 85238797 markings, 85390956 edges, 350024 markings/sec, 220 secs
lola: 86983417 markings, 87136108 edges, 348924 markings/sec, 225 secs
lola: 88729724 markings, 88882943 edges, 349261 markings/sec, 230 secs
lola: 90467107 markings, 90620846 edges, 347477 markings/sec, 235 secs
lola: 92217010 markings, 92371269 edges, 349981 markings/sec, 240 secs
lola: 93956717 markings, 94111488 edges, 347941 markings/sec, 245 secs
lola: 95700511 markings, 95855786 edges, 348759 markings/sec, 250 secs
lola: 97438630 markings, 97594409 edges, 347624 markings/sec, 255 secs
lola: 99176433 markings, 99332708 edges, 347561 markings/sec, 260 secs
lola: 100910178 markings, 101066941 edges, 346749 markings/sec, 265 secs
lola: 102644325 markings, 102801576 edges, 346829 markings/sec, 270 secs
lola: 104369335 markings, 104527066 edges, 345002 markings/sec, 275 secs
lola: 106091069 markings, 106249276 edges, 344347 markings/sec, 280 secs
lola: 107807309 markings, 107965984 edges, 343248 markings/sec, 285 secs
lola: 109522733 markings, 109681876 edges, 343085 markings/sec, 290 secs
lola: 111238790 markings, 111398393 edges, 343211 markings/sec, 295 secs
lola: 112948505 markings, 113108568 edges, 341943 markings/sec, 300 secs
lola: 114658286 markings, 114818801 edges, 341956 markings/sec, 305 secs
lola: 116368728 markings, 116529695 edges, 342088 markings/sec, 310 secs
lola: 118078776 markings, 118240187 edges, 342010 markings/sec, 315 secs
lola: 119783821 markings, 119945676 edges, 341009 markings/sec, 320 secs
lola: 121488804 markings, 121651099 edges, 340997 markings/sec, 325 secs
lola: 123194206 markings, 123356937 edges, 341080 markings/sec, 330 secs
lola: 124896492 markings, 125059655 edges, 340457 markings/sec, 335 secs
lola: 126569956 markings, 126733543 edges, 334693 markings/sec, 340 secs
lola: 128102558 markings, 128266529 edges, 306520 markings/sec, 345 secs
lola: 129685168 markings, 129849535 edges, 316522 markings/sec, 350 secs
lola: 131221850 markings, 131386597 edges, 307336 markings/sec, 355 secs
lola: 132748593 markings, 132913716 edges, 305349 markings/sec, 360 secs
lola: local time limit reached - aborting
lola:
preliminary result: unknown unknown unknown unknown unknown unknown unknown unknown unknown no unknown yes yes yes
lola: memory consumption: 10733032 KB
lola: time consumption: 614 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLFireability.json
lola: closed JSON file CTLFireability.json
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 6 will run for 369 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((((p13 <= 0) OR (p15 <= 0) OR ((1 <= p20) AND (1 <= p0) AND ((p2 <= 0) OR (p18 <= 0)))) U A (G ((1 <= p11)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: processed formula: E(((p13 <= 0) OR (p15 <= 0) OR ((1 <= p20) AND (1 <= p0) AND ((p2 <= 0) OR (p18 <= 0)))) U AG((1 <= p11)))
lola: processed formula length: 109
lola: 25 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 2620154 markings, 6100381 edges, 524031 markings/sec, 0 secs
lola: 5273485 markings, 12297040 edges, 530666 markings/sec, 5 secs
lola: 7729672 markings, 18024155 edges, 491237 markings/sec, 10 secs
lola: 10275834 markings, 23964551 edges, 509232 markings/sec, 15 secs
lola: 12822379 markings, 29905906 edges, 509309 markings/sec, 20 secs
lola: 15366758 markings, 35841845 edges, 508876 markings/sec, 25 secs
lola: 17887881 markings, 41725999 edges, 504225 markings/sec, 30 secs
lola: 20184782 markings, 47086888 edges, 459380 markings/sec, 35 secs
lola: 22650151 markings, 52850302 edges, 493074 markings/sec, 40 secs
lola: 25127051 markings, 58617545 edges, 495380 markings/sec, 45 secs
lola: 27540721 markings, 64251711 edges, 482734 markings/sec, 50 secs
lola: 29984779 markings, 69961849 edges, 488812 markings/sec, 55 secs
lola: 32298670 markings, 75347769 edges, 462778 markings/sec, 60 secs
lola: 34723357 markings, 81008276 edges, 484937 markings/sec, 65 secs
lola: 37145706 markings, 86664141 edges, 484470 markings/sec, 70 secs
lola: 39557796 markings, 92294359 edges, 482418 markings/sec, 75 secs
lola: 41969481 markings, 97923564 edges, 482337 markings/sec, 80 secs
lola: 44332054 markings, 103429989 edges, 472515 markings/sec, 85 secs
lola: 46564365 markings, 108635757 edges, 446462 markings/sec, 90 secs
lola: 48876058 markings, 114039985 edges, 462339 markings/sec, 95 secs
lola: 51151655 markings, 119353968 edges, 455119 markings/sec, 100 secs
lola: 53518725 markings, 124871635 edges, 473414 markings/sec, 105 secs
lola: 55884283 markings, 130385521 edges, 473112 markings/sec, 110 secs
lola: 58259279 markings, 135923004 edges, 474999 markings/sec, 115 secs
lola: 60542770 markings, 141256725 edges, 456698 markings/sec, 120 secs
lola: 62920625 markings, 146801353 edges, 475571 markings/sec, 125 secs
lola: 65256753 markings, 152264375 edges, 467226 markings/sec, 130 secs
lola: 67607541 markings, 157743628 edges, 470158 markings/sec, 135 secs
lola: 69970177 markings, 163250210 edges, 472527 markings/sec, 140 secs
lola: 72293249 markings, 168682883 edges, 464614 markings/sec, 145 secs
lola: 74610640 markings, 174076353 edges, 463478 markings/sec, 150 secs
lola: 76880381 markings, 179375697 edges, 453948 markings/sec, 155 secs
lola: 79280545 markings, 184976100 edges, 480033 markings/sec, 160 secs
lola: 81588972 markings, 190372159 edges, 461685 markings/sec, 165 secs
lola: 83938340 markings, 195845571 edges, 469874 markings/sec, 170 secs
lola: 86244538 markings, 201236059 edges, 461240 markings/sec, 175 secs
lola: 88605460 markings, 206738356 edges, 472184 markings/sec, 180 secs
lola: 90889165 markings, 212072611 edges, 456741 markings/sec, 185 secs
lola: 93229044 markings, 217522301 edges, 467976 markings/sec, 190 secs
lola: 95529238 markings, 222897777 edges, 460039 markings/sec, 195 secs
lola: 97888852 markings, 228396805 edges, 471923 markings/sec, 200 secs
lola: 100175416 markings, 233738206 edges, 457313 markings/sec, 205 secs
lola: 102473872 markings, 239099109 edges, 459691 markings/sec, 210 secs
lola: 104766831 markings, 244441730 edges, 458592 markings/sec, 215 secs
lola: 106931457 markings, 249503286 edges, 432925 markings/sec, 220 secs
lola: 109217345 markings, 254836145 edges, 457178 markings/sec, 225 secs
lola: 111482652 markings, 260116789 edges, 453061 markings/sec, 230 secs
lola: 113679943 markings, 265249480 edges, 439458 markings/sec, 235 secs
lola: 115925559 markings, 270488513 edges, 449123 markings/sec, 240 secs
lola: 118051276 markings, 275452797 edges, 425143 markings/sec, 245 secs
lola: 120254182 markings, 280586049 edges, 440581 markings/sec, 250 secs
lola: 121426702 markings, 283316352 edges, 234504 markings/sec, 255 secs
lola: 123033961 markings, 287070676 edges, 321452 markings/sec, 260 secs
lola: 124891265 markings, 291402746 edges, 371461 markings/sec, 265 secs
lola: 126439141 markings, 295022431 edges, 309575 markings/sec, 270 secs
lola: 128005275 markings, 298662762 edges, 313227 markings/sec, 275 secs
lola: 129477493 markings, 302106711 edges, 294444 markings/sec, 280 secs
lola: 131101545 markings, 305903427 edges, 324810 markings/sec, 285 secs
lola: 133011749 markings, 310353931 edges, 382041 markings/sec, 290 secs
lola: 134986131 markings, 314964879 edges, 394876 markings/sec, 295 secs
lola: 136399172 markings, 318250160 edges, 282608 markings/sec, 300 secs
lola: 137969757 markings, 321923933 edges, 314117 markings/sec, 305 secs
lola: 139411740 markings, 325278885 edges, 288397 markings/sec, 310 secs
lola: 140681593 markings, 328253515 edges, 253971 markings/sec, 315 secs
lola: 142104065 markings, 331560023 edges, 284494 markings/sec, 320 secs
lola: 144116627 markings, 336266089 edges, 402512 markings/sec, 325 secs
lola: 145613825 markings, 339759077 edges, 299440 markings/sec, 330 secs
lola: 147006835 markings, 343015628 edges, 278602 markings/sec, 335 secs
lola: 147955741 markings, 345213859 edges, 189781 markings/sec, 340 secs
lola: 147955809 markings, 345214030 edges, 14 markings/sec, 345 secs
lola: 147955869 markings, 345214178 edges, 12 markings/sec, 350 secs
lola: 147955911 markings, 345214286 edges, 8 markings/sec, 355 secs
lola: local time limit reached - aborting
lola: 147955931 markings, 345214334 edges, 4 markings/sec, 360 secs
lola:
preliminary result: unknown unknown unknown unknown unknown unknown unknown unknown unknown no unknown yes yes yes
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 7 will run for 368 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((E ((((1 <= p5) AND (1 <= p7)) U (1 <= p11))) U (A (G ((1 <= p20))) AND (1 <= p9))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: processed formula: A(E(((1 <= p5) AND (1 <= p7)) U (1 <= p11)) U (AG((1 <= p20)) AND (1 <= p9)))
lola: processed formula length: 77
lola: 26 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 300000 markings, 350000 edges
lola: ========================================
lola: subprocess 8 will run for 430 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E ((A (G ((1 <= p20))) U ((1 <= p2) AND (1 <= p18)))) AND (A (((p11 <= 0) U ((1 <= p20) OR (1 <= p12)))) OR A (F (((1 <= p19) AND (1 <= p16) AND ((p8 <= 0) OR (p10 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: (E(AG((1 <= p20)) U ((1 <= p2) AND (1 <= p18))) AND (A((p11 <= 0) U ((1 <= p20) OR (1 <= p12))) OR AF(((1 <= p19) AND (1 <= p16) AND ((p8 <= 0) OR (p10 <= 0))))))
lola: processed formula length: 164
lola: 27 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 4 significant temporal operators and needs 17 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 300000 markings, 349999 edges
lola: ========================================
lola: subprocess 9 will run for 516 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p1 <= 0) AND (A (G ((1 <= p9))) AND (1 <= p20)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 516 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= p20)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p20)
lola: processed formula length: 10
lola: 23 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 10 will run for 645 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p1 <= 0)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p1 <= 0)
lola: processed formula length: 9
lola: 23 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 11 will run for 860 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((1 <= p9)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: A (G ((1 <= p9)))
lola: processed formula length: 17
lola: 25 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p9 <= 0)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-11-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-11-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 50001 markings, 50000 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 10 will run for 645 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F ((((p9 <= 0) OR (p20 <= 0)) AND (p1 <= 0)))) OR ((1 <= p6) OR (1 <= p11)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 645 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p6) OR (1 <= p11))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: processed formula: ((1 <= p6) OR (1 <= p11))
lola: processed formula length: 25
lola: 24 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 2 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: subprocess 11 will run for 860 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((p9 <= 0) OR (p20 <= 0)) AND (p1 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((((p9 <= 0) OR (p20 <= 0)) AND (p1 <= 0))))
lola: processed formula length: 50
lola: 24 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((p9 <= 0) OR (p20 <= 0)) AND (p1 <= 0))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-11-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-11-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 50001 markings, 50000 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 11 will run for 860 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p20) AND (A (G (((p13 <= 0) OR (p15 <= 0) OR ((p19 <= 0) AND (p16 <= 0))))) AND ((p5 <= 0) OR (p7 <= 0) OR ((1 <= p21) AND (1 <= p11)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 860 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= p20)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p20)
lola: processed formula length: 10
lola: 23 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 12 will run for 1290 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p5 <= 0) OR (p7 <= 0) OR ((1 <= p21) AND (1 <= p11)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p5 <= 0) OR (p7 <= 0) OR ((1 <= p21) AND (1 <= p11)))
lola: processed formula length: 57
lola: 23 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 4 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 13 will run for 2581 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p13 <= 0) OR (p15 <= 0) OR ((p19 <= 0) AND (p16 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: A (G (((p13 <= 0) OR (p15 <= 0) OR ((p19 <= 0) AND (p16 <= 0)))))
lola: processed formula length: 67
lola: 25 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 13 markings, 12 edges
lola: formula 0: ((1 <= p13) AND (1 <= p15) AND ((1 <= p19) OR (1 <= p16)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 12 will run for 1290 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((E (F (((1 <= p0) AND (1 <= p2) AND (1 <= p18)))) AND ((1 <= p10) AND ((1 <= p17) AND ((p12 <= 0) OR (p21 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking an existential CTL formula with single witness path (use LTL...)
lola: rewrite Frontend/Parser/formula_rewrite.k:658
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:661
lola: rewrite Frontend/Parser/formula_rewrite.k:666
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:661
lola: rewrite Frontend/Parser/formula_rewrite.k:668
lola: rewrite Frontend/Parser/formula_rewrite.k:666
lola: rewrite Frontend/Parser/formula_rewrite.k:668
lola: rewrite Frontend/Parser/formula_rewrite.k:666
lola: rewrite Frontend/Parser/formula_rewrite.k:668
lola: rewrite Frontend/Parser/formula_rewrite.k:668
lola: rewrite Frontend/Parser/formula_rewrite.k:679
lola: rewrite Frontend/Parser/formula_rewrite.k:679
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((G (((p0 <= 0) OR (p2 <= 0) OR (p18 <= 0))) OR ((p10 <= 0) OR ((p17 <= 0) OR ((1 <= p12) AND (1 <= p21))))))
lola: processed formula length: 113
lola: 37 rewrites
lola: closed formula file CTLFireability.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: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The existential single path CTL formula holds.
lola: 1350018 markings, 1650018 edges
lola: ========================================
lola: subprocess 13 will run for 2579 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F ((((1 <= p1) OR (1 <= p6)) AND (p0 <= 0) AND (1 <= p12)))) AND E (G ((A (F ((1 <= p11))) OR ((p19 <= 0) OR (p16 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 2579 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((1 <= p1) OR (1 <= p6)) AND (p0 <= 0) AND (1 <= p12))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((((1 <= p1) OR (1 <= p6)) AND (p0 <= 0) AND (1 <= p12))))
lola: processed formula length: 64
lola: 24 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= p1) OR (1 <= p6)) AND (p0 <= 0) AND (1 <= p12))
lola: state equation task get result unparse finished id 0
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: The predicate is reachable.
lola: 14 markings, 13 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E ((E (X ((1 <= p3))) U (E (F ((1 <= p12))) AND E (G ((1 <= p6))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: processed formula: E(EX((1 <= p3)) U (EF((1 <= p12)) AND EG((1 <= p6))))
lola: processed formula length: 53
lola: 27 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 4295541 markings, 5668272 edges, 859108 markings/sec, 0 secs
lola: 8337010 markings, 11055437 edges, 808294 markings/sec, 5 secs
lola: 12315302 markings, 16365387 edges, 795658 markings/sec, 10 secs
lola: 16308592 markings, 21687730 edges, 798658 markings/sec, 15 secs
lola: 20258184 markings, 26958323 edges, 789918 markings/sec, 20 secs
lola: 24207559 markings, 32211101 edges, 789875 markings/sec, 25 secs
lola: 28082421 markings, 37382611 edges, 774972 markings/sec, 30 secs
lola: 31955302 markings, 42555519 edges, 774576 markings/sec, 35 secs
lola: 35799347 markings, 47673669 edges, 768809 markings/sec, 40 secs
lola: 39614358 markings, 52764625 edges, 763002 markings/sec, 45 secs
lola: 43442914 markings, 57863941 edges, 765711 markings/sec, 50 secs
lola: 47236638 markings, 62929489 edges, 758745 markings/sec, 55 secs
lola: 51010546 markings, 67960890 edges, 754782 markings/sec, 60 secs
lola: 54739550 markings, 72933782 edges, 745801 markings/sec, 65 secs
lola: 58409712 markings, 77813988 edges, 734032 markings/sec, 70 secs
lola: 62085326 markings, 82727373 edges, 735123 markings/sec, 75 secs
lola: 65725338 markings, 87575779 edges, 728002 markings/sec, 80 secs
lola: 69343556 markings, 92394021 edges, 723644 markings/sec, 85 secs
lola: 72922422 markings, 97172911 edges, 715773 markings/sec, 90 secs
lola: 76486767 markings, 101929390 edges, 712869 markings/sec, 95 secs
lola: 80250979 markings, 106950670 edges, 752842 markings/sec, 100 secs
lola: 83965145 markings, 111896882 edges, 742833 markings/sec, 105 secs
lola: 87689098 markings, 116857775 edges, 744791 markings/sec, 110 secs
lola: 91349222 markings, 121747924 edges, 732025 markings/sec, 115 secs
lola: 95057012 markings, 126684572 edges, 741558 markings/sec, 120 secs
lola: 98712313 markings, 131562974 edges, 731060 markings/sec, 125 secs
lola: 102328342 markings, 136379027 edges, 723206 markings/sec, 130 secs
lola: 105924134 markings, 141174843 edges, 719158 markings/sec, 135 secs
lola: 109551659 markings, 146002393 edges, 725505 markings/sec, 140 secs
lola: 113111634 markings, 150762391 edges, 711995 markings/sec, 145 secs
lola: 116740707 markings, 155591487 edges, 725815 markings/sec, 150 secs
lola: 120389215 markings, 160458661 edges, 729702 markings/sec, 155 secs
lola: 122720273 markings, 163571564 edges, 466212 markings/sec, 160 secs
lola: 124513665 markings, 165964495 edges, 358678 markings/sec, 165 secs
lola: 126915353 markings, 169166200 edges, 480338 markings/sec, 170 secs
lola: 129229871 markings, 172243517 edges, 462904 markings/sec, 175 secs
lola: 130760016 markings, 174288720 edges, 306029 markings/sec, 180 secs
lola: 133095553 markings, 177396440 edges, 467107 markings/sec, 185 secs
lola: 134997850 markings, 179945429 edges, 380459 markings/sec, 190 secs
lola: 137196583 markings, 182868507 edges, 439747 markings/sec, 195 secs
lola: 139047912 markings, 185345483 edges, 370266 markings/sec, 200 secs
lola: 140983569 markings, 187923947 edges, 387131 markings/sec, 205 secs
lola: 142720796 markings, 190229772 edges, 347445 markings/sec, 210 secs
lola: 144705433 markings, 192881708 edges, 396927 markings/sec, 215 secs
lola: 146390850 markings, 195134816 edges, 337083 markings/sec, 220 secs
lola: 147712805 markings, 196892732 edges, 264391 markings/sec, 225 secs
lola: 147881938 markings, 197121432 edges, 33827 markings/sec, 230 secs
lola: 147888242 markings, 197130888 edges, 1261 markings/sec, 235 secs
lola: 147888272 markings, 197130933 edges, 6 markings/sec, 240 secs
lola: 147888636 markings, 197131478 edges, 73 markings/sec, 245 secs
lola: 147891501 markings, 197135775 edges, 573 markings/sec, 250 secs
lola: 147891537 markings, 197135829 edges, 7 markings/sec, 255 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: E ((((1 <= p21) OR (p19 <= 0) OR (1 <= p14) OR ((1 <= p13) AND (1 <= p15))) U A (F (((1 <= p11) AND (1 <= p13) AND (1 <= p15))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: processed formula: E(((1 <= p21) OR (p19 <= 0) OR (1 <= p14) OR ((1 <= p13) AND (1 <= p15))) U AF(((1 <= p11) AND (1 <= p13) AND (1 <= p15))))
lola: processed formula length: 126
lola: 25 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 3685035 markings, 3795590 edges, 737007 markings/sec, 0 secs
lola: 6848971 markings, 6963555 edges, 632787 markings/sec, 5 secs
lola: 9484419 markings, 9601651 edges, 527090 markings/sec, 10 secs
lola: 11875131 markings, 11994455 edges, 478142 markings/sec, 15 secs
lola: 14114892 markings, 14235988 edges, 447952 markings/sec, 20 secs
lola: 16223100 markings, 16345740 edges, 421642 markings/sec, 25 secs
lola: 18365278 markings, 18489382 edges, 428436 markings/sec, 30 secs
lola: 20457304 markings, 20582760 edges, 418405 markings/sec, 35 secs
lola: 22519319 markings, 22646039 edges, 412403 markings/sec, 40 secs
lola: 24562915 markings, 24690831 edges, 408719 markings/sec, 45 secs
lola: 26519528 markings, 26648543 edges, 391323 markings/sec, 50 secs
lola: 28515665 markings, 28645761 edges, 399227 markings/sec, 55 secs
lola: 30506295 markings, 30637431 edges, 398126 markings/sec, 60 secs
lola: 32480561 markings, 32612697 edges, 394853 markings/sec, 65 secs
lola: 34443705 markings, 34576804 edges, 392629 markings/sec, 70 secs
lola: 36399074 markings, 36533105 edges, 391074 markings/sec, 75 secs
lola: 38350186 markings, 38485121 edges, 390222 markings/sec, 80 secs
lola: 40295916 markings, 40431732 edges, 389146 markings/sec, 85 secs
lola: 42238493 markings, 42375165 edges, 388515 markings/sec, 90 secs
lola: 44173348 markings, 44310856 edges, 386971 markings/sec, 95 secs
lola: 46101710 markings, 46240030 edges, 385672 markings/sec, 100 secs
lola: 48027915 markings, 48167031 edges, 385241 markings/sec, 105 secs
lola: 49946431 markings, 50086328 edges, 383703 markings/sec, 110 secs
lola: 51856187 markings, 51996839 edges, 381951 markings/sec, 115 secs
lola: 53751812 markings, 53893203 edges, 379125 markings/sec, 120 secs
lola: 55611446 markings, 55753549 edges, 371927 markings/sec, 125 secs
lola: 57469493 markings, 57612297 edges, 371609 markings/sec, 130 secs
lola: 59251278 markings, 59394741 edges, 356357 markings/sec, 135 secs
lola: 61018118 markings, 61162230 edges, 353368 markings/sec, 140 secs
lola: 62718768 markings, 62863492 edges, 340130 markings/sec, 145 secs
lola: 64426669 markings, 64572001 edges, 341580 markings/sec, 150 secs
lola: 66118654 markings, 66264578 edges, 338397 markings/sec, 155 secs
lola: 67908500 markings, 68055044 edges, 357969 markings/sec, 160 secs
lola: 69679770 markings, 69826918 edges, 354254 markings/sec, 165 secs
lola: 71352339 markings, 71500051 edges, 334514 markings/sec, 170 secs
lola: 73009798 markings, 73158062 edges, 331492 markings/sec, 175 secs
lola: 74649150 markings, 74797954 edges, 327870 markings/sec, 180 secs
lola: 76273977 markings, 76423313 edges, 324965 markings/sec, 185 secs
lola: 77892895 markings, 78042750 edges, 323784 markings/sec, 190 secs
lola: 79502127 markings, 79652498 edges, 321846 markings/sec, 195 secs
lola: 81108338 markings, 81259218 edges, 321242 markings/sec, 200 secs
lola: 82709327 markings, 82860707 edges, 320198 markings/sec, 205 secs
lola: 84295701 markings, 84447573 edges, 317275 markings/sec, 210 secs
lola: 85880595 markings, 86032950 edges, 316979 markings/sec, 215 secs
lola: 87464241 markings, 87617081 edges, 316729 markings/sec, 220 secs
lola: 89040371 markings, 89193686 edges, 315226 markings/sec, 225 secs
lola: 90616648 markings, 90770432 edges, 315255 markings/sec, 230 secs
lola: 92191242 markings, 92345494 edges, 314919 markings/sec, 235 secs
lola: 93760275 markings, 93914987 edges, 313807 markings/sec, 240 secs
lola: 95346415 markings, 95501590 edges, 317228 markings/sec, 245 secs
lola: 96922643 markings, 97078271 edges, 315246 markings/sec, 250 secs
lola: 98492252 markings, 98648331 edges, 313922 markings/sec, 255 secs
lola: 100052825 markings, 100209348 edges, 312115 markings/sec, 260 secs
lola: 101625945 markings, 101782913 edges, 314624 markings/sec, 265 secs
lola: 103186805 markings, 103344208 edges, 312172 markings/sec, 270 secs
lola: 104723828 markings, 104881656 edges, 307405 markings/sec, 275 secs
lola: 106295508 markings, 106453772 edges, 314336 markings/sec, 280 secs
lola: 107879789 markings, 108038485 edges, 316856 markings/sec, 285 secs
lola: 109490720 markings, 109649851 edges, 322186 markings/sec, 290 secs
lola: 111093917 markings, 111253485 edges, 320639 markings/sec, 295 secs
lola: 112739776 markings, 112899784 edges, 329172 markings/sec, 300 secs
lola: 114324488 markings, 114484915 edges, 316942 markings/sec, 305 secs
lola: 115966158 markings, 116127017 edges, 328334 markings/sec, 310 secs
lola: 117623432 markings, 117784727 edges, 331455 markings/sec, 315 secs
lola: 119284670 markings, 119446397 edges, 332248 markings/sec, 320 secs
lola: 120946854 markings, 121109010 edges, 332437 markings/sec, 325 secs
lola: 122607394 markings, 122769978 edges, 332108 markings/sec, 330 secs
lola: 124268636 markings, 124431640 edges, 332248 markings/sec, 335 secs
lola: 125923390 markings, 126086814 edges, 330951 markings/sec, 340 secs
lola: 127579239 markings, 127743078 edges, 331170 markings/sec, 345 secs
lola: 129237853 markings, 129402109 edges, 331723 markings/sec, 350 secs
lola: 130898537 markings, 131063205 edges, 332137 markings/sec, 355 secs
lola: 132536860 markings, 132701931 edges, 327665 markings/sec, 360 secs
lola: 134078134 markings, 134243582 edges, 308255 markings/sec, 365 secs
lola: 135660339 markings, 135826175 edges, 316441 markings/sec, 370 secs
lola: 137296732 markings, 137462963 edges, 327279 markings/sec, 375 secs
lola: 138925580 markings, 139092204 edges, 325770 markings/sec, 380 secs
lola: 140566088 markings, 140733104 edges, 328102 markings/sec, 385 secs
lola: 142214800 markings, 142382207 edges, 329742 markings/sec, 390 secs
lola: 143864979 markings, 144032778 edges, 330036 markings/sec, 395 secs
lola: 145511668 markings, 145679855 edges, 329338 markings/sec, 400 secs
lola: 147149064 markings, 147317632 edges, 327479 markings/sec, 405 secs
lola: 148794777 markings, 148963729 edges, 329143 markings/sec, 410 secs
lola: 150386636 markings, 150555956 edges, 318372 markings/sec, 415 secs
lola: 152007001 markings, 152176697 edges, 324073 markings/sec, 420 secs
lola: 153633301 markings, 153803369 edges, 325260 markings/sec, 425 secs
lola: 155282466 markings, 155452905 edges, 329833 markings/sec, 430 secs
lola: 156927241 markings, 157098057 edges, 328955 markings/sec, 435 secs
lola: 158560141 markings, 158731325 edges, 326580 markings/sec, 440 secs
lola: 160195537 markings, 160367085 edges, 327079 markings/sec, 445 secs
lola: 161836890 markings, 162008806 edges, 328271 markings/sec, 450 secs
lola: 163473382 markings, 163645662 edges, 327298 markings/sec, 455 secs
lola: 165110117 markings, 165282757 edges, 327347 markings/sec, 460 secs
lola: 166746408 markings, 166919407 edges, 327258 markings/sec, 465 secs
lola: 168382950 markings, 168556305 edges, 327308 markings/sec, 470 secs
lola: 170023396 markings, 170197112 edges, 328089 markings/sec, 475 secs
lola: 171665979 markings, 171840047 edges, 328517 markings/sec, 480 secs
lola: 173297387 markings, 173471807 edges, 326282 markings/sec, 485 secs
lola: 174928851 markings, 175103623 edges, 326293 markings/sec, 490 secs
lola: 176550064 markings, 176725180 edges, 324243 markings/sec, 495 secs
lola: 178182348 markings, 178357812 edges, 326457 markings/sec, 500 secs
lola: 179815987 markings, 179991795 edges, 326728 markings/sec, 505 secs
lola: 181447459 markings, 181623611 edges, 326294 markings/sec, 510 secs
lola: 183074808 markings, 183251304 edges, 325470 markings/sec, 515 secs
lola: 184427515 markings, 184604290 edges, 270541 markings/sec, 520 secs
lola: 185832626 markings, 186009694 edges, 281022 markings/sec, 525 secs
lola: 187468170 markings, 187645578 edges, 327109 markings/sec, 530 secs
lola: 189093860 markings, 189271603 edges, 325138 markings/sec, 535 secs
lola: 190724569 markings, 190902645 edges, 326142 markings/sec, 540 secs
lola: 192351426 markings, 192529838 edges, 325371 markings/sec, 545 secs
lola: 193974335 markings, 194153074 edges, 324582 markings/sec, 550 secs
lola: 195616981 markings, 195796057 edges, 328529 markings/sec, 555 secs
lola: 197247773 markings, 197427176 edges, 326158 markings/sec, 560 secs
lola: 198879148 markings, 199058880 edges, 326275 markings/sec, 565 secs
lola: 200511700 markings, 200691759 edges, 326510 markings/sec, 570 secs
lola: 202046792 markings, 202227355 edges, 307018 markings/sec, 575 secs
lola: 203567531 markings, 203748531 edges, 304148 markings/sec, 580 secs
lola: 205037344 markings, 205218299 edges, 293963 markings/sec, 585 secs
lola: 206544574 markings, 206725829 edges, 301446 markings/sec, 590 secs
lola: 207949226 markings, 208130757 edges, 280930 markings/sec, 595 secs
lola: 209087702 markings, 209269457 edges, 227695 markings/sec, 600 secs
lola: 210370837 markings, 210552840 edges, 256627 markings/sec, 605 secs
lola: 211643350 markings, 211825601 edges, 254503 markings/sec, 610 secs
lola: 212903900 markings, 213086395 edges, 252110 markings/sec, 615 secs
lola: 214205440 markings, 214388187 edges, 260308 markings/sec, 620 secs
lola: 215516693 markings, 215699696 edges, 262251 markings/sec, 625 secs
lola: 216983302 markings, 217166585 edges, 293322 markings/sec, 630 secs
lola: 218536758 markings, 218720341 edges, 310691 markings/sec, 635 secs
lola: 220013720 markings, 220197583 edges, 295392 markings/sec, 640 secs
lola: 221563555 markings, 221747714 edges, 309967 markings/sec, 645 secs
lola: 223109569 markings, 223294020 edges, 309203 markings/sec, 650 secs
lola: 224689893 markings, 224874644 edges, 316065 markings/sec, 655 secs
lola: 226097016 markings, 226282031 edges, 281425 markings/sec, 660 secs
lola: 227527370 markings, 227712657 edges, 286071 markings/sec, 665 secs
lola: 229034999 markings, 229220566 edges, 301526 markings/sec, 670 secs
lola: 230529105 markings, 230714952 edges, 298821 markings/sec, 675 secs
lola: 231977786 markings, 232163901 edges, 289736 markings/sec, 680 secs
lola: 233422676 markings, 233609058 edges, 288978 markings/sec, 685 secs
lola: 234881814 markings, 235068468 edges, 291828 markings/sec, 690 secs
lola: 236282150 markings, 236469060 edges, 280067 markings/sec, 695 secs
lola: 237672284 markings, 237859451 edges, 278027 markings/sec, 700 secs
lola: 238906934 markings, 239094329 edges, 246930 markings/sec, 705 secs
lola: 240318525 markings, 240506176 edges, 282318 markings/sec, 710 secs
lola: 241725798 markings, 241913705 edges, 281455 markings/sec, 715 secs
lola: 243136289 markings, 243324456 edges, 282098 markings/sec, 720 secs
lola: 244484935 markings, 244673346 edges, 269729 markings/sec, 725 secs
lola: 245841673 markings, 246030328 edges, 271348 markings/sec, 730 secs
lola: 247257848 markings, 247446758 edges, 283235 markings/sec, 735 secs
lola: 248612266 markings, 248801420 edges, 270884 markings/sec, 740 secs
lola: 249946380 markings, 250135771 edges, 266823 markings/sec, 745 secs
lola: 251289625 markings, 251479256 edges, 268649 markings/sec, 750 secs
lola: 252250366 markings, 252440169 edges, 192148 markings/sec, 755 secs
lola: 252627999 markings, 252817891 edges, 75527 markings/sec, 760 secs
lola: 252739255 markings, 252929146 edges, 22251 markings/sec, 765 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: E ((((p13 <= 0) OR (p15 <= 0) OR ((1 <= p20) AND (1 <= p0) AND ((p2 <= 0) OR (p18 <= 0)))) U A (G ((1 <= p11)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: processed formula: E(((p13 <= 0) OR (p15 <= 0) OR ((1 <= p20) AND (1 <= p0) AND ((p2 <= 0) OR (p18 <= 0)))) U AG((1 <= p11)))
lola: processed formula length: 109
lola: 25 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 2654508 markings, 6186262 edges, 530902 markings/sec, 0 secs
lola: 5286909 markings, 12323890 edges, 526480 markings/sec, 5 secs
lola: 7756767 markings, 18091894 edges, 493972 markings/sec, 10 secs
lola: 10293893 markings, 24009701 edges, 507425 markings/sec, 15 secs
lola: 12852265 markings, 29980622 edges, 511674 markings/sec, 20 secs
lola: 15374034 markings, 35860038 edges, 504354 markings/sec, 25 secs
lola: 17768249 markings, 41445565 edges, 478843 markings/sec, 30 secs
lola: 20268200 markings, 47286669 edges, 499990 markings/sec, 35 secs
lola: 22785188 markings, 53162895 edges, 503398 markings/sec, 40 secs
lola: 25265515 markings, 58938704 edges, 496065 markings/sec, 45 secs
lola: 27707595 markings, 64643897 edges, 488416 markings/sec, 50 secs
lola: 30174589 markings, 70399579 edges, 493399 markings/sec, 55 secs
lola: 32622220 markings, 76105442 edges, 489526 markings/sec, 60 secs
lola: 35059716 markings, 81799174 edges, 487499 markings/sec, 65 secs
lola: 37445781 markings, 87364329 edges, 477213 markings/sec, 70 secs
lola: 39856188 markings, 92990338 edges, 482081 markings/sec, 75 secs
lola: 42262651 markings, 98606487 edges, 481293 markings/sec, 80 secs
lola: 44649626 markings, 104173916 edges, 477395 markings/sec, 85 secs
lola: 47034097 markings, 109735087 edges, 476894 markings/sec, 90 secs
lola: 49433838 markings, 115334429 edges, 479948 markings/sec, 95 secs
lola: 51783408 markings, 120817504 edges, 469914 markings/sec, 100 secs
lola: 54142361 markings, 126330723 edges, 471791 markings/sec, 105 secs
lola: 56462612 markings, 131731343 edges, 464050 markings/sec, 110 secs
lola: 58770570 markings, 137126229 edges, 461592 markings/sec, 115 secs
lola: 61093812 markings, 142538437 edges, 464648 markings/sec, 120 secs
lola: 63414044 markings, 147959899 edges, 464046 markings/sec, 125 secs
lola: 65705010 markings, 153310895 edges, 458193 markings/sec, 130 secs
lola: 68006417 markings, 158665816 edges, 460281 markings/sec, 135 secs
lola: 70288987 markings, 163997233 edges, 456514 markings/sec, 140 secs
lola: 72558674 markings, 169296443 edges, 453937 markings/sec, 145 secs
lola: 74811496 markings, 174553490 edges, 450564 markings/sec, 150 secs
lola: 77066291 markings, 179815470 edges, 450959 markings/sec, 155 secs
lola: 79455103 markings, 185387494 edges, 477762 markings/sec, 160 secs
lola: 81788436 markings, 190827961 edges, 466667 markings/sec, 165 secs
lola: 84127796 markings, 196294210 edges, 467872 markings/sec, 170 secs
lola: 86460276 markings, 201725402 edges, 466496 markings/sec, 175 secs
lola: 88802363 markings, 207205611 edges, 468417 markings/sec, 180 secs
lola: 91091866 markings, 212534944 edges, 457901 markings/sec, 185 secs
lola: 93432504 markings, 218005950 edges, 468128 markings/sec, 190 secs
lola: 95751068 markings, 223403411 edges, 463713 markings/sec, 195 secs
lola: 98087820 markings, 228869224 edges, 467350 markings/sec, 200 secs
lola: 100374706 markings, 234200748 edges, 457377 markings/sec, 205 secs
lola: 102682241 markings, 239580260 edges, 461507 markings/sec, 210 secs
lola: 104958667 markings, 244896319 edges, 455285 markings/sec, 215 secs
lola: 107264105 markings, 250279638 edges, 461088 markings/sec, 220 secs
lola: 109557238 markings, 255617730 edges, 458627 markings/sec, 225 secs
lola: 111830900 markings, 260926879 edges, 454732 markings/sec, 230 secs
lola: 114064705 markings, 266136382 edges, 446761 markings/sec, 235 secs
lola: 116353546 markings, 271483477 edges, 457768 markings/sec, 240 secs
lola: 118663302 markings, 276878184 edges, 461951 markings/sec, 245 secs
lola: 120127385 markings, 280293606 edges, 292817 markings/sec, 250 secs
lola: 121888671 markings, 284396270 edges, 352257 markings/sec, 255 secs
lola: 123465944 markings, 288083532 edges, 315455 markings/sec, 260 secs
lola: 124971611 markings, 291594885 edges, 301133 markings/sec, 265 secs
lola: 126375595 markings, 294863565 edges, 280797 markings/sec, 270 secs
lola: 128159169 markings, 299022497 edges, 356715 markings/sec, 275 secs
lola: 129270015 markings, 301624607 edges, 222169 markings/sec, 280 secs
lola: 131235498 markings, 306213308 edges, 393097 markings/sec, 285 secs
lola: 131960436 markings, 307900652 edges, 144988 markings/sec, 290 secs
lola: 133766376 markings, 312115494 edges, 361188 markings/sec, 295 secs
lola: 135281198 markings, 315652544 edges, 302964 markings/sec, 300 secs
lola: 136869403 markings, 319348052 edges, 317641 markings/sec, 305 secs
lola: 138320873 markings, 322743589 edges, 290294 markings/sec, 310 secs
lola: 139424346 markings, 325310400 edges, 220695 markings/sec, 315 secs
lola: 140794648 markings, 328511150 edges, 274060 markings/sec, 320 secs
lola: 141856144 markings, 330989887 edges, 212299 markings/sec, 325 secs
lola: 143308033 markings, 334369605 edges, 290378 markings/sec, 330 secs
lola: 144176943 markings, 336405805 edges, 173782 markings/sec, 335 secs
lola: 146141547 markings, 340985041 edges, 392921 markings/sec, 340 secs
lola: 146393294 markings, 341582748 edges, 50349 markings/sec, 345 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: (E (F ((((1 <= p1) OR (1 <= p6)) AND (p0 <= 0) AND (1 <= p12)))) AND E (G ((A (F ((1 <= p11))) OR ((p19 <= 0) OR (p16 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: E (F ((((1 <= p1) OR (1 <= p6)) AND (p0 <= 0) AND (1 <= p12))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((((1 <= p1) OR (1 <= p6)) AND (p0 <= 0) AND (1 <= p12))))
lola: processed formula length: 64
lola: 24 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= p1) OR (1 <= p6)) AND (p0 <= 0) AND (1 <= p12))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 14 markings, 13 edges
lola: state equation: write sara problem file to CTLFireability-17-0.sara
lola: state equation: calling and running sara
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (G ((A (F ((1 <= p11))) OR ((p19 <= 0) OR (p16 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: processed formula: EG((AF((1 <= p11)) OR ((p19 <= 0) OR (p16 <= 0))))
lola: processed formula length: 50
lola: 25 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
sara: try reading problem file CTLFireability-17-0.sara.

lola: 5317668 markings, 5426841 edges, 1063534 markings/sec, 0 secs
lola: 10720575 markings, 10833636 edges, 1080581 markings/sec, 5 secs
lola: 15907640 markings, 16023561 edges, 1037413 markings/sec, 10 secs
lola: 20887506 markings, 21005759 edges, 995973 markings/sec, 15 secs
lola: 25912496 markings, 26032833 edges, 1004998 markings/sec, 20 secs
lola: 30302554 markings, 30424547 edges, 878012 markings/sec, 25 secs
lola: 35165566 markings, 35289263 edges, 972602 markings/sec, 30 secs
lola: 39792305 markings, 39917513 edges, 925348 markings/sec, 35 secs
lola: 44260205 markings, 44386793 edges, 893580 markings/sec, 40 secs
lola: 48512480 markings, 48640317 edges, 850455 markings/sec, 45 secs
lola: 52977510 markings, 53106603 edges, 893006 markings/sec, 50 secs
lola: 57359164 markings, 57489437 edges, 876331 markings/sec, 55 secs
lola: 61672096 markings, 61803489 edges, 862586 markings/sec, 60 secs
lola: 66087586 markings, 66220083 edges, 883098 markings/sec, 65 secs
lola: 70579699 markings, 70713284 edges, 898423 markings/sec, 70 secs
lola: 74967915 markings, 75102532 edges, 877643 markings/sec, 75 secs
lola: 79220553 markings, 79356138 edges, 850528 markings/sec, 80 secs
lola: 83518793 markings, 83655330 edges, 859648 markings/sec, 85 secs
lola: 88039195 markings, 88176708 edges, 904080 markings/sec, 90 secs
lola: 92530946 markings, 92669407 edges, 898350 markings/sec, 95 secs
lola: 96976327 markings, 97115700 edges, 889076 markings/sec, 100 secs
lola: 101314194 markings, 101454439 edges, 867573 markings/sec, 105 secs
lola: 105766547 markings, 105907667 edges, 890471 markings/sec, 110 secs
lola: 110027150 markings, 110169091 edges, 852121 markings/sec, 115 secs
lola: 114277630 markings, 114420375 edges, 850096 markings/sec, 120 secs
lola: 118522338 markings, 118665867 edges, 848942 markings/sec, 125 secs
lola: 122627358 markings, 122771635 edges, 821004 markings/sec, 130 secs
lola: 127119362 markings, 127264447 edges, 898401 markings/sec, 135 secs
lola: 131553554 markings, 131699415 edges, 886838 markings/sec, 140 secs
lola: 135914249 markings, 136060865 edges, 872139 markings/sec, 145 secs
lola: 140192878 markings, 140340223 edges, 855726 markings/sec, 150 secs
lola: 144352576 markings, 144500621 edges, 831940 markings/sec, 155 secs
lola: 148437900 markings, 148586617 edges, 817065 markings/sec, 160 secs
lola: 152678177 markings, 152827586 edges, 848055 markings/sec, 165 secs
lola: 156755758 markings, 156905823 edges, 815516 markings/sec, 170 secs
lola: 160963790 markings, 161114523 edges, 841606 markings/sec, 175 secs
lola: 165175204 markings, 165326597 edges, 842283 markings/sec, 180 secs
lola: 169317548 markings, 169469581 edges, 828469 markings/sec, 185 secs
lola: 173463553 markings, 173616221 edges, 829201 markings/sec, 190 secs
lola: 177960637 markings, 178113981 edges, 899417 markings/sec, 195 secs
lola: 182357874 markings, 182511875 edges, 879447 markings/sec, 200 secs
lola: 186630107 markings, 186784736 edges, 854447 markings/sec, 205 secs
lola: 190983694 markings, 191138959 edges, 870717 markings/sec, 210 secs
lola: 195236388 markings, 195392265 edges, 850539 markings/sec, 215 secs
lola: 199383986 markings, 199540455 edges, 829520 markings/sec, 220 secs
lola: 203593569 markings, 203750630 edges, 841917 markings/sec, 225 secs
lola: 207789756 markings, 207947401 edges, 839237 markings/sec, 230 secs
lola: 211970804 markings, 212129025 edges, 836210 markings/sec, 235 secs
lola: 216084261 markings, 216243045 edges, 822691 markings/sec, 240 secs
lola: 219755641 markings, 219915195 edges, 734276 markings/sec, 245 secs
lola: 223493428 markings, 223653836 edges, 747557 markings/sec, 250 secs
lola: 226444554 markings, 226604731 edges, 590225 markings/sec, 255 secs
lola: 229139642 markings, 229300179 edges, 539018 markings/sec, 260 secs
lola: 231980361 markings, 232141269 edges, 568144 markings/sec, 265 secs
lola: 234797585 markings, 234958862 edges, 563445 markings/sec, 270 secs
lola: 237851262 markings, 238012939 edges, 610735 markings/sec, 275 secs
lola: 240703617 markings, 240865662 edges, 570471 markings/sec, 280 secs
lola: 243543458 markings, 243705867 edges, 567968 markings/sec, 285 secs
lola: 246210408 markings, 246373157 edges, 533390 markings/sec, 290 secs
lola: 249063567 markings, 249226679 edges, 570632 markings/sec, 295 secs
lola: 252034387 markings, 252197875 edges, 594164 markings/sec, 300 secs
lola: 255351569 markings, 255515474 edges, 663436 markings/sec, 305 secs
lola: 258537978 markings, 258702283 edges, 637282 markings/sec, 310 secs
lola: 261719224 markings, 261883921 edges, 636249 markings/sec, 315 secs
lola: 265101244 markings, 265266356 edges, 676404 markings/sec, 320 secs
lola: 268330013 markings, 268495522 edges, 645754 markings/sec, 325 secs
lola: 271497819 markings, 271663716 edges, 633561 markings/sec, 330 secs
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no unknown unknown no yes no yes unknown no unknown yes yes yes
lola:
preliminary result: no no unknown unknown no yes no yes unknown no unknown yes yes yes
lola: memory consumption: 3540 KB
lola: time consumption: 2744 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLFireability.json
lola: closed JSON file CTLFireability.json
rslt: finished
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16427332 kB
MemFree: 16316256 kB
After kill :
MemTotal: 16427332 kB
MemFree: 16315500 kB

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FMS-PT-50000"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="itslola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itslola"
echo " Input is FMS-PT-50000, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r170-smll-158987815400108"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FMS-PT-50000.tgz
mv FMS-PT-50000 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;