Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.9M
-rw-r--r-- 1 mcc users 3.9K Apr 7 22:17 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 7 22:17 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 7 01:49 CTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 7 01:49 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.7K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 14 12:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 14 12:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 6 07:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Apr 6 07:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Apr 5 14:12 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 5 14:12 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 6 20:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 6 20:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 5.7M 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 JoinFreeModules-PT-1000-CTLFireability-00
FORMULA_NAME JoinFreeModules-PT-1000-CTLFireability-01
FORMULA_NAME JoinFreeModules-PT-1000-CTLFireability-02
FORMULA_NAME JoinFreeModules-PT-1000-CTLFireability-03
FORMULA_NAME JoinFreeModules-PT-1000-CTLFireability-04
FORMULA_NAME JoinFreeModules-PT-1000-CTLFireability-05
FORMULA_NAME JoinFreeModules-PT-1000-CTLFireability-06
FORMULA_NAME JoinFreeModules-PT-1000-CTLFireability-07
FORMULA_NAME JoinFreeModules-PT-1000-CTLFireability-08
FORMULA_NAME JoinFreeModules-PT-1000-CTLFireability-09
FORMULA_NAME JoinFreeModules-PT-1000-CTLFireability-10
FORMULA_NAME JoinFreeModules-PT-1000-CTLFireability-11
FORMULA_NAME JoinFreeModules-PT-1000-CTLFireability-12
FORMULA_NAME JoinFreeModules-PT-1000-CTLFireability-13
FORMULA_NAME JoinFreeModules-PT-1000-CTLFireability-14
FORMULA_NAME JoinFreeModules-PT-1000-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1591208872559

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 18:27:54] [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 18:27:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 18:27:54] [INFO ] Load time of PNML (sax parser for PT used): 380 ms
[2020-06-03 18:27:54] [INFO ] Transformed 5001 places.
[2020-06-03 18:27:54] [INFO ] Transformed 8001 transitions.
[2020-06-03 18:27:54] [INFO ] Parsed PT model containing 5001 places and 8001 transitions in 455 ms.
Reduce places removed 1 places and 0 transitions.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 59 ms.
Incomplete random walk after 100592 steps, including 0 resets, run finished after 2844 ms. (steps per millisecond=35 ) properties seen :[0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0]
// Phase 1: matrix 8001 rows 5000 cols
[2020-06-03 18:27:57] [INFO ] Computed 1000 place invariants in 72 ms
[2020-06-03 18:28:00] [INFO ] [Real]Absence check using 1000 positive place invariants in 1712 ms returned sat
[2020-06-03 18:28:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:28:17] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 18:28:17] [INFO ] [Real]Absence check using state equation in 17862 ms returned (error "Failed to check-sat")
[2020-06-03 18:28:19] [INFO ] [Real]Absence check using 1000 positive place invariants in 1720 ms returned sat
[2020-06-03 18:28:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:28:37] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 18:28:37] [INFO ] [Real]Absence check using state equation in 18025 ms returned (error "Failed to check-sat")
[2020-06-03 18:28:39] [INFO ] [Real]Absence check using 1000 positive place invariants in 1679 ms returned sat
[2020-06-03 18:28:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:28:57] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 18:28:57] [INFO ] [Real]Absence check using state equation in 17991 ms returned (error "Failed to check-sat")
[2020-06-03 18:29:00] [INFO ] [Real]Absence check using 1000 positive place invariants in 1790 ms returned sat
[2020-06-03 18:29:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:29:17] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 18:29:17] [INFO ] [Real]Absence check using state equation in 17619 ms returned (error "Failed to check-sat")
[2020-06-03 18:29:20] [INFO ] [Real]Absence check using 1000 positive place invariants in 2650 ms returned sat
[2020-06-03 18:29:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:29:37] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 18:29:37] [INFO ] [Real]Absence check using state equation in 17104 ms returned (error "Failed to check-sat")
[2020-06-03 18:29:40] [INFO ] [Real]Absence check using 1000 positive place invariants in 1845 ms returned sat
[2020-06-03 18:29:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:29:57] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 18:29:57] [INFO ] [Real]Absence check using state equation in 17556 ms returned unknown
[2020-06-03 18:30:00] [INFO ] [Real]Absence check using 1000 positive place invariants in 2012 ms returned sat
[2020-06-03 18:30:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:30:17] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 18:30:17] [INFO ] [Real]Absence check using state equation in 17217 ms returned (error "Failed to check-sat")
[2020-06-03 18:30:19] [INFO ] [Real]Absence check using 1000 positive place invariants in 1630 ms returned sat
[2020-06-03 18:30:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:30:37] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 18:30:38] [INFO ] [Real]Absence check using state equation in 18141 ms returned (error "Failed to check-sat")
[2020-06-03 18:30:39] [INFO ] [Real]Absence check using 1000 positive place invariants in 1621 ms returned sat
[2020-06-03 18:30:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:30:58] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 18:30:58] [INFO ] [Real]Absence check using state equation in 18097 ms returned (error "Failed to check-sat")
[2020-06-03 18:31:01] [INFO ] [Real]Absence check using 1000 positive place invariants in 3623 ms returned sat
[2020-06-03 18:31:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:31:18] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 18:31:18] [INFO ] [Real]Absence check using state equation in 16068 ms returned (error "Failed to check-sat")
[2020-06-03 18:31:20] [INFO ] [Real]Absence check using 1000 positive place invariants in 1869 ms returned sat
[2020-06-03 18:31:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:31:38] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 18:31:38] [INFO ] [Real]Absence check using state equation in 17646 ms returned (error "Failed to check-sat")
[2020-06-03 18:31:39] [INFO ] [Real]Absence check using 1000 positive place invariants in 1592 ms returned sat
[2020-06-03 18:31:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:31:58] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 18:31:58] [INFO ] [Real]Absence check using state equation in 18101 ms returned (error "Failed to check-sat")
[2020-06-03 18:32:00] [INFO ] [Real]Absence check using 1000 positive place invariants in 1855 ms returned sat
[2020-06-03 18:32:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:32:18] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 18:32:18] [INFO ] [Real]Absence check using state equation in 17949 ms returned (error "Failed to check-sat")
[2020-06-03 18:32:21] [INFO ] [Real]Absence check using 1000 positive place invariants in 2447 ms returned sat
[2020-06-03 18:32:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:32:38] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 18:32:38] [INFO ] [Real]Absence check using state equation in 16888 ms returned (error "Failed to check-sat")
[2020-06-03 18:32:40] [INFO ] [Real]Absence check using 1000 positive place invariants in 1719 ms returned sat
[2020-06-03 18:32:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:32:58] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 18:32:58] [INFO ] [Real]Absence check using state equation in 18010 ms returned unknown
[2020-06-03 18:33:00] [INFO ] [Real]Absence check using 1000 positive place invariants in 1701 ms returned sat
[2020-06-03 18:33:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:33:18] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 18:33:18] [INFO ] [Real]Absence check using state equation in 18047 ms returned (error "Failed to check-sat")
[2020-06-03 18:33:20] [INFO ] [Real]Absence check using 1000 positive place invariants in 1658 ms returned sat
[2020-06-03 18:33:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:33:38] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 18:33:38] [INFO ] [Real]Absence check using state equation in 18051 ms returned unknown
[2020-06-03 18:33:40] [INFO ] [Real]Absence check using 1000 positive place invariants in 1636 ms returned sat
[2020-06-03 18:33:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:33:58] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 18:33:58] [INFO ] [Real]Absence check using state equation in 18079 ms returned unknown
[2020-06-03 18:34:00] [INFO ] [Real]Absence check using 1000 positive place invariants in 1905 ms returned sat
[2020-06-03 18:34:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:34:18] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 18:34:18] [INFO ] [Real]Absence check using state equation in 17863 ms returned (error "Failed to check-sat")
[2020-06-03 18:34:21] [INFO ] [Real]Absence check using 1000 positive place invariants in 2304 ms returned sat
[2020-06-03 18:34:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:34:38] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 18:34:38] [INFO ] [Real]Absence check using state equation in 17231 ms returned (error "Failed to check-sat")
[2020-06-03 18:34:40] [INFO ] [Real]Absence check using 1000 positive place invariants in 1788 ms returned sat
[2020-06-03 18:34:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:34:58] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 18:34:58] [INFO ] [Real]Absence check using state equation in 17536 ms returned (error "Failed to check-sat")
[2020-06-03 18:35:00] [INFO ] [Real]Absence check using 1000 positive place invariants in 1713 ms returned sat
[2020-06-03 18:35:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:35:18] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 18:35:18] [INFO ] [Real]Absence check using state equation in 17976 ms returned (error "Failed to check-sat")
[2020-06-03 18:35:20] [INFO ] [Real]Absence check using 1000 positive place invariants in 1593 ms returned sat
[2020-06-03 18:35:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:35:38] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 18:35:38] [INFO ] [Real]Absence check using state equation in 18160 ms returned unknown
[2020-06-03 18:35:40] [INFO ] [Real]Absence check using 1000 positive place invariants in 2318 ms returned sat
[2020-06-03 18:35:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:35:58] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 18:35:58] [INFO ] [Real]Absence check using state equation in 17396 ms returned unknown
[2020-06-03 18:36:00] [INFO ] [Real]Absence check using 1000 positive place invariants in 1713 ms returned sat
[2020-06-03 18:36:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:36:18] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 18:36:18] [INFO ] [Real]Absence check using state equation in 17990 ms returned (error "Failed to check-sat")
[2020-06-03 18:36:21] [INFO ] [Real]Absence check using 1000 positive place invariants in 2773 ms returned sat
[2020-06-03 18:36:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:36:38] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 18:36:38] [INFO ] [Real]Absence check using state equation in 16575 ms returned (error "Failed to check-sat")
[2020-06-03 18:36:40] [INFO ] [Real]Absence check using 1000 positive place invariants in 1607 ms returned sat
[2020-06-03 18:36:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:36:58] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 18:36:58] [INFO ] [Real]Absence check using state equation in 18132 ms returned (error "Failed to check-sat")
[2020-06-03 18:37:00] [INFO ] [Real]Absence check using 1000 positive place invariants in 1761 ms returned sat
[2020-06-03 18:37:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:37:18] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 18:37:18] [INFO ] [Real]Absence check using state equation in 17549 ms returned (error "Failed to check-sat")
[2020-06-03 18:37:20] [INFO ] [Real]Absence check using 1000 positive place invariants in 1632 ms returned sat
[2020-06-03 18:37:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:37:38] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 18:37:38] [INFO ] [Real]Absence check using state equation in 18062 ms returned unknown
[2020-06-03 18:37:40] [INFO ] [Real]Absence check using 1000 positive place invariants in 1590 ms returned sat
[2020-06-03 18:37:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:37:58] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 18:37:58] [INFO ] [Real]Absence check using state equation in 18047 ms returned (error "Failed to check-sat")
[2020-06-03 18:38:00] [INFO ] [Real]Absence check using 1000 positive place invariants in 1584 ms returned sat
[2020-06-03 18:38:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:38:18] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 18:38:18] [INFO ] [Real]Absence check using state equation in 18178 ms returned unknown
[2020-06-03 18:38:20] [INFO ] [Real]Absence check using 1000 positive place invariants in 1526 ms returned sat
[2020-06-03 18:38:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:38:38] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 18:38:38] [INFO ] [Real]Absence check using state equation in 18243 ms returned unknown
[2020-06-03 18:38:40] [INFO ] [Real]Absence check using 1000 positive place invariants in 1825 ms returned sat
[2020-06-03 18:38:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:38:58] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 18:38:58] [INFO ] [Real]Absence check using state equation in 17889 ms returned unknown
[2020-06-03 18:39:00] [INFO ] [Real]Absence check using 1000 positive place invariants in 1546 ms returned sat
[2020-06-03 18:39:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:39:18] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 18:39:18] [INFO ] [Real]Absence check using state equation in 18224 ms returned unknown
[2020-06-03 18:39:20] [INFO ] [Real]Absence check using 1000 positive place invariants in 1572 ms returned sat
[2020-06-03 18:39:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:39:38] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 18:39:38] [INFO ] [Real]Absence check using state equation in 18240 ms returned (error "Failed to check-sat")
[2020-06-03 18:39:40] [INFO ] [Real]Absence check using 1000 positive place invariants in 1714 ms returned sat
[2020-06-03 18:39:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:39:58] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 18:39:58] [INFO ] [Real]Absence check using state equation in 18037 ms returned (error "Failed to check-sat")
[2020-06-03 18:39:59] [INFO ] Flatten gal took : 475 ms
[2020-06-03 18:39:59] [INFO ] Flatten gal took : 216 ms
[2020-06-03 18:39:59] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2020-06-03 18:39:59] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 43 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLFireability @ JoinFreeModules-PT-1000 @ 3570 seconds
check_solution: Constraint R1 = 0 is above its equality of -2
check_solution: Constraint R2 = 2.12199579146e-314 is above its equality of -1
check_solution: Constraint R3 = 0 is above its equality of -1000
check_solution: Constraint R6 = 2.12199579146e-314 is above its equality of -2
check_solution: Constraint R7 = 0 is above its equality of -1
check_solution: Constraint R8 = 2.12199579146e-314 is above its equality of -1000
check_solution: Constraint R10 = 2.12199579146e-314 is above its equality of -1000
check_solution: Constraint R11 = 0 is above its equality of -2
check_solution: Constraint R12 = 2.12199579146e-314 is above its equality of -1
check_solution: Constraint R13 = 0 is above its equality of -1000

Seriously low accuracy found ||*|| = 1000 (rel. error 1)

FORMULA JoinFreeModules-PT-1000-CTLFireability-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-1000-CTLFireability-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-1000-CTLFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-1000-CTLFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-1000-CTLFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-1000-CTLFireability-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-1000-CTLFireability-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-1000-CTLFireability-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-1000-CTLFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-1000-CTLFireability-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-1000-CTLFireability-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-1000-CTLFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-1000-CTLFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-1000-CTLFireability-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-1000-CTLFireability-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-1000-CTLFireability-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2743
rslt: Output for CTLFireability @ JoinFreeModules-PT-1000

{
"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 18:39:59 2020
",
"timelimit": 3570
},
"child":
[

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 171
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 2,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "(((1 <= p862) OR (2 <= p757) OR (3 <= p4485) OR (3 <= p1070)) AND ((p4242 <= 1) OR (p3108 <= 2)))",
"processed_size": 101,
"rewrites": 25
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 0,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 183
},
"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 <= p4187)",
"processed_size": 12,
"rewrites": 25
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 1,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 196
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"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": "AX((1 <= p4887))",
"processed_size": 16,
"rewrites": 26
},
"net":
{
"conflict_clusters": 4001,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 0,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 183
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"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": "A (G (((1 <= p1937) AND (1 <= p2562) AND (4 <= p3848))))",
"processed_size": 56,
"rewrites": 27
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3,
"problems": 3
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 196
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"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": "(p1939 <= 4)",
"processed_size": 12,
"rewrites": 28
},
"result":
{
"edges": 214,
"markings": 214,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 3
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 1,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 196
},
"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": "(2 <= p1266)",
"processed_size": 12,
"rewrites": 25
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 2,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 211
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (((p1731 <= 1) R (p2101 <= 1)))",
"processed_size": 33,
"rewrites": 30
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space /EU",
"value": true
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "eu preserving",
"visible": 1
},
"threads": 1,
"type": "dfs"
},
"type": "universal_release",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 228
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"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": "AX(((p490 <= 2) AND (p2568 <= 3)))",
"processed_size": 34,
"rewrites": 26
},
"net":
{
"conflict_clusters": 4001,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 249
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 1,
"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": "EX((((2 <= p3926) AND (3 <= p735)) OR (p3352 <= 0)))",
"processed_size": 53,
"rewrites": 26
},
"net":
{
"conflict_clusters": 4001,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 2,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 211
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 2,
"aneg": 0,
"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": "((p3360 <= 4) AND ((5 <= p990) OR (5 <= p3155) OR ((1 <= p4517) AND (2 <= p3482))) AND ((3 <= p738) OR (2 <= p4586)))",
"processed_size": 120,
"rewrites": 25
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 3,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 228
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 2,
"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 (G ((((1 <= p4967) OR (4 <= p1643)) AND ((2 <= p1487) OR (5 <= p3594)))))",
"processed_size": 77,
"rewrites": 26
},
"result":
{
"edges": 214,
"markings": 214,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 16
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 2
},
"type": "possible_preservation",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 249
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 2,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"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": "EG(EX(((2 <= p3411) AND (5 <= p70))))",
"processed_size": 37,
"rewrites": 27
},
"net":
{
"conflict_clusters": 4001,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 3,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 228
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 2,
"aneg": 0,
"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": "AX((((p2195 <= 4) OR (p1832 <= 0) OR ((p1001 <= 1) AND (p188 <= 3))) AND ((p1217 <= 1) OR (p4820 <= 4) OR (2 <= p3351))))",
"processed_size": 125,
"rewrites": 26
},
"net":
{
"conflict_clusters": 4001,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 249
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"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": "E (F ((5 <= p420)))",
"processed_size": 19,
"rewrites": 26
},
"result":
{
"edges": 8,
"markings": 9,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"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": "E (F ((3 <= p3248)))",
"processed_size": 20,
"rewrites": 26
},
"result":
{
"edges": 3,
"markings": 4,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 305
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"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": "((p1528 <= 2) OR (p4301 <= 1))",
"processed_size": 31,
"rewrites": 28
},
"result":
{
"edges": 214,
"markings": 214,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 8
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 343
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"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": "E (G (((p3799 <= 4) OR ((1 <= p1572) AND (2 <= p3857)))))",
"processed_size": 58,
"rewrites": 26
},
"result":
{
"edges": 214,
"markings": 214,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 12
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 2
},
"type": "possible_preservation",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 392
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"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 (G (((3 <= p4398) OR ((p3538 <= 2) AND (2 <= p1692) AND (p666 <= 1)))))",
"processed_size": 74,
"rewrites": 26
},
"result":
{
"edges": 214,
"markings": 214,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 17
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 6,
"problems": 3
},
"type": "possible_preservation",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 457
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"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 (G (((p3795 <= 2) OR (p1817 <= 0) OR (p3522 <= 1) OR (p4168 <= 2))))",
"processed_size": 73,
"rewrites": 26
},
"result":
{
"edges": 214,
"markings": 214,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 18
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 4
},
"type": "possible_preservation",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 549
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 1,
"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": "EG(AF(((p662 <= 1) AND (p1173 <= 2))))",
"processed_size": 38,
"rewrites": 27
},
"net":
{
"conflict_clusters": 4001,
"singleton_clusters": 0
},
"result":
{
"edges": 3003,
"markings": 3002,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 686
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"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": "E (G ((p4717 <= 0)))",
"processed_size": 20,
"rewrites": 26
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 5
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "possible_preservation",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 914
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"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": "A (G (((2 <= p1847) OR (5 <= p1935))))",
"processed_size": 39,
"rewrites": 27
},
"result":
{
"edges": 999,
"markings": 1000,
"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": 2,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 12,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 914
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 1,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "((((2 <= p612) OR (3 <= p4030)) OR (G ((3 <= p2768)) OR ((1 <= p3197) AND (3 <= p2228)))) U (5 <= p3244))",
"processed_size": 106,
"rewrites": 27
},
"result":
{
"edges": 214,
"markings": 214,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "universal single path",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1372
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"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": "E (F ((4 <= p2023)))",
"processed_size": 20,
"rewrites": 26
},
"result":
{
"edges": 4,
"markings": 5,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2744
},
"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": "(p1728 <= 2)",
"processed_size": 12,
"rewrites": 28
},
"result":
{
"edges": 3002,
"markings": 3002,
"produced_by": "state space /EGEF",
"value": true
},
"task":
{
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving",
"visible": 2
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "possible_preservation_of_reachability",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 14,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2743
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"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": "E (F ((p932 <= 1)))",
"processed_size": 19,
"rewrites": 26
},
"result":
{
"edges": 999,
"markings": 1000,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 15,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"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": "E (F ((p932 <= 1)))",
"processed_size": 19,
"rewrites": 26
},
"result":
{
"edges": 999,
"markings": 1000,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 16,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "A (G ((p1858 <= 3)))",
"processed_size": 20,
"rewrites": 27
},
"result":
{
"edges": 4,
"markings": 5,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 17,
"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"
}
}
],
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 16,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 1108620,
"runtime": 827.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(E(F(*)) OR (A(G(**)) AND E(F(*)))) : (** AND (A(X(**)) AND (A((** U **)) OR **))) : (E(F(**)) AND E(G(E(F(**))))) : E(G(**)) : A(F(**)) : E(F(**)) : A(((** OR (A(G(**)) OR **)) U **)) : (A(F(**)) AND (A(G(**)) OR E(X(E(X(**)))))) : E(F(**)) : E(G(**)) : E(G(**)) : (E(X(**)) AND (A((* R *)) AND (A(X(**)) OR (** AND (A(G(**)) AND **))))) : E(G(A(F(*)))) : (E(G(*)) OR A(G(*))) : (E(G(E(X(**)))) AND (E(X(**)) OR (E(G(**)) OR **))) : A(X(**))"
},
"net":
{
"arcs": 23000,
"conflict_clusters": 4001,
"places": 5000,
"places_significant": 4000,
"singleton_clusters": 0,
"transitions": 8001
},
"result":
{
"preliminary_value": "yes yes yes yes no yes no no yes yes yes no no no no yes ",
"value": "yes yes yes yes no yes no no yes yes yes no no no no 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: 13001/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 160000
lola: finding significant places
lola: 5000 places, 8001 transitions, 4000 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: A ((A (G ((p1858 <= 3))) U NOT(A (G ((2 <= p932)))))) : (((1 <= p4187) AND A (X ((1 <= p4887)))) AND (A (((3 <= p1733) U (5 <= p3925))) OR (((1 <= p862) OR (2 <= p757) OR (3 <= p4485) OR (3 <= p1070)) AND ((p4242 <= 1) OR (p3108 <= 2))))) : (E (F ((4 <= p2023))) AND E (G (E (F ((p1728 <= 2)))))) : E (G (((3 <= p4398) OR ((p3538 <= 2) AND (2 <= p1692) AND (p666 <= 1))))) : A (((3 <= p3040) U A (F (((3 <= p1528) AND (2 <= p4301)))))) : E (F ((3 <= p3248))) : A ((((((2 <= p612) OR (3 <= p4030)) OR A (G ((3 <= p2768)))) OR ((1 <= p3197) AND (3 <= p2228))) U (5 <= p3244))) : (A (F ((5 <= p1939))) AND (A (G (((1 <= p1937) AND (1 <= p2562) AND (4 <= p3848)))) OR E (X (E (X ((4 <= p1253))))))) : E (F ((5 <= p420))) : E (G (((p3795 <= 2) OR (p1817 <= 0) OR (p3522 <= 1) OR (p4168 <= 2)))) : E (G (E (G (((p3799 <= 4) OR ((1 <= p1572) AND (2 <= p3857))))))) : ((E (X ((((2 <= p3926) AND (3 <= p735)) OR (p3352 <= 0)))) AND NOT(E (((2 <= p1731) U (2 <= p2101))))) AND (A (X (((p490 <= 2) AND (p2568 <= 3)))) OR (((2 <= p1266) AND A (G (((1 <= p27) AND (1 <= p4452))))) AND ((2 <= p4551) OR (2 <= p4362))))) : E (G (NOT(E (G (((2 <= p662) OR (3 <= p1173))))))) : (NOT(A (F ((1 <= p4717)))) OR NOT(E (F (((p1847 <= 1) AND (p1935 <= 4)))))) : (E (G (E (X (((2 <= p3411) AND (5 <= p70)))))) AND ((E (X (((5 <= p3779) OR (3 <= p2283)))) OR E (G ((((1 <= p4967) OR (4 <= p1643)) AND ((2 <= p1487) OR (5 <= p3594)))))) OR ((p3360 <= 4) AND ((5 <= p990) OR (5 <= p3155) OR ((1 <= p4517) AND (2 <= p3482))) AND ((3 <= p738) OR (2 <= p4586))))) : A (X ((((p2195 <= 4) OR (p1832 <= 0) OR ((p1001 <= 1) AND (p188 <= 3))) AND ((p1217 <= 1) OR (p4820 <= 4) OR (2 <= p3351)))))
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:479
lola: rewrite Frontend/Parser/formula_rewrite.k:449
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:470
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:461
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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:254
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 171 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p4187) AND (A (X ((1 <= p4887))) AND (A (((3 <= p1733) U (5 <= p3925))) OR (((1 <= p862) OR (2 <= p757) OR (3 <= p4485) OR (3 <= p1070)) AND ((p4242 <= 1) OR (p3108 <= 2))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 171 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p862) OR (2 <= p757) OR (3 <= p4485) OR (3 <= p1070)) AND ((p4242 <= 1) OR (p3108 <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((1 <= p862) OR (2 <= p757) OR (3 <= p4485) OR (3 <= p1070)) AND ((p4242 <= 1) OR (p3108 <= 2)))
lola: processed formula length: 101
lola: 25 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 6 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 1 will run for 183 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= p4187)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p4187)
lola: processed formula length: 12
lola: 25 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 2 will run for 196 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((1 <= p4887)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX((1 <= p4887))
lola: processed formula length: 16
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 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 1 will run for 183 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F ((5 <= p1939))) AND (A (G (((1 <= p1937) AND (1 <= p2562) AND (4 <= p3848)))) OR E (X (E (X ((4 <= p1253)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 183 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((1 <= p1937) AND (1 <= p2562) AND (4 <= p3848))))
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:787
lola: processed formula: A (G (((1 <= p1937) AND (1 <= p2562) AND (4 <= p3848))))
lola: processed formula length: 56
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: 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:787
lola: state equation task get result rewrite finished id 0
lola: SUBRESULT
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p1937 <= 0) OR (p2562 <= 0) OR (p3848 <= 3))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 3 conjunctive subformulas
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 196 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((5 <= p1939)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (p1939 <= 4)
lola: processed formula length: 12
lola: 28 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 / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--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:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (5 <= p1939)
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 / EG
lola: The predicate does not eventually occur.
lola: 214 markings, 214 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 196 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (X ((((2 <= p3926) AND (3 <= p735)) OR (p3352 <= 0)))) AND (A (((p1731 <= 1) R (p2101 <= 1))) AND (A (X (((p490 <= 2) AND (p2568 <= 3)))) OR ((2 <= p1266) AND (A (G (((1 <= p27) AND (1 <= p4452)))) AND ((2 <= p4551) OR (2 <= p4362)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 196 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (2 <= p1266)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= p1266)
lola: processed formula length: 12
lola: 25 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 3 will run for 211 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((p1731 <= 1) R (p2101 <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking universal release
lola: rewrite Frontend/Parser/formula_rewrite.k:619
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:693
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: A (((p1731 <= 1) R (p2101 <= 1)))
lola: processed formula length: 33
lola: 30 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 /EU)
lola: state space: using reachability graph (EU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EU
lola: state equation task get result started, id 0
lola: Predicate Phi releases Predicate Psi on all paths.
lola: 0 markings, 0 edges
lola: rewrite Frontend/Parser/formula_rewrite.k:711
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: (2 <= p2101)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: ========================================
lola: subprocess 4 will run for 228 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (((p490 <= 2) AND (p2568 <= 3))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX(((p490 <= 2) AND (p2568 <= 3)))
lola: processed formula length: 34
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 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 5 will run for 249 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X ((((2 <= p3926) AND (3 <= p735)) OR (p3352 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: processed formula: EX((((2 <= p3926) AND (3 <= p735)) OR (p3352 <= 0)))
lola: processed formula length: 53
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 0 significant temporal operators and needs 0 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: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 3 will run for 211 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (G (E (X (((2 <= p3411) AND (5 <= p70)))))) AND (E (X (((5 <= p3779) OR (3 <= p2283)))) OR (E (G ((((1 <= p4967) OR (4 <= p1643)) AND ((2 <= p1487) OR (5 <= p3594))))) OR ((p3360 <= 4) AND ((5 <= p990) OR (5 <= p3155) OR ((1 <= p4517) AND (2 <= p3482))) AND ((3 <= p738) OR (2 <= p4586))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 211 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p3360 <= 4) AND ((5 <= p990) OR (5 <= p3155) OR ((1 <= p4517) AND (2 <= p3482))) AND ((3 <= p738) OR (2 <= p4586)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p3360 <= 4) AND ((5 <= p990) OR (5 <= p3155) OR ((1 <= p4517) AND (2 <= p3482))) AND ((3 <= p738) OR (2 <= p4586)))
lola: processed formula length: 120
lola: 25 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 7 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 4 will run for 228 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((((1 <= p4967) OR (4 <= p1643)) AND ((2 <= p1487) OR (5 <= p3594)))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G ((((1 <= p4967) OR (4 <= p1643)) AND ((2 <= p1487) OR (5 <= p3594)))))
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: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: 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: (((p4967 <= 0) AND (p1643 <= 3)) OR ((p1487 <= 1) AND (p3594 <= 4)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 214 markings, 214 edges
lola: subprocess 5 will run for 249 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (G (E (X (((2 <= p3411) AND (5 <= p70))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: processed formula: EG(EX(((2 <= p3411) AND (5 <= p70))))
lola: processed formula length: 37
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 1 significant temporal operators and needs 5 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: 1 markings, 0 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 4 will run for 228 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((((p2195 <= 4) OR (p1832 <= 0) OR ((p1001 <= 1) AND (p188 <= 3))) AND ((p1217 <= 1) OR (p4820 <= 4) OR (2 <= p3351)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX((((p2195 <= 4) OR (p1832 <= 0) OR ((p1001 <= 1) AND (p188 <= 3))) AND ((p1217 <= 1) OR (p4820 <= 4) OR (2 <= p3351))))
lola: processed formula length: 125
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 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 5 will run for 249 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((5 <= p420)))
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 ((5 <= p420)))
lola: processed formula length: 19
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)
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: (5 <= p420)
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: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 9 markings, 8 edges
lola: state equation: write sara problem file to CTLFireability-5-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-5-0.sara.
lola: ========================================
lola: subprocess 6 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= p3248)))
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 ((3 <= p3248)))
lola: processed formula length: 20
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)
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: (3 <= p3248)
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: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 4 markings, 3 edges
lola: ========================================
lola: subprocess 7 will run for 305 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((3 <= p1528) AND (2 <= p4301))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((p1528 <= 2) OR (p4301 <= 1))
lola: processed formula length: 31
lola: 28 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 / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--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:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((3 <= p1528) AND (2 <= p4301))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 214 markings, 214 edges
lola: ========================================
lola: subprocess 8 will run for 343 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (((p3799 <= 4) OR ((1 <= p1572) AND (2 <= p3857)))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G (((p3799 <= 4) OR ((1 <= p1572) AND (2 <= p3857)))))
lola: processed formula length: 58
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 / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--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: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: ((5 <= p3799) AND ((p1572 <= 0) OR (p3857 <= 1)))
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-8-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-8-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 214 markings, 214 edges
lola: ========================================
lola: subprocess 9 will run for 392 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (((3 <= p4398) OR ((p3538 <= 2) AND (2 <= p1692) AND (p666 <= 1)))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G (((3 <= p4398) OR ((p3538 <= 2) AND (2 <= p1692) AND (p666 <= 1)))))
lola: processed formula length: 74
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 / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--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: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: ((p4398 <= 2) AND ((3 <= p3538) OR (p1692 <= 1) OR (2 <= p666)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 6 literals and 3 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 214 markings, 214 edges
lola: ========================================
lola: subprocess 10 will run for 457 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (((p3795 <= 2) OR (p1817 <= 0) OR (p3522 <= 1) OR (p4168 <= 2))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G (((p3795 <= 2) OR (p1817 <= 0) OR (p3522 <= 1) OR (p4168 <= 2))))
lola: processed formula length: 73
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 / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--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: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: ((3 <= p3795) AND (1 <= p1817) AND (2 <= p3522) AND (3 <= p4168))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-10-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 214 markings, 214 edges
lola: ========================================
lola: subprocess 11 will run for 549 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (A (F (((p662 <= 1) AND (p1173 <= 2))))))
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(((p662 <= 1) AND (p1173 <= 2))))
lola: processed formula length: 38
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 2 significant temporal operators and needs 9 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: 3002 markings, 3003 edges
lola: ========================================
lola: subprocess 12 will run for 686 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (G ((p4717 <= 0))) OR A (G (((2 <= p1847) OR (5 <= p1935)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 686 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((p4717 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G ((p4717 <= 0)))
lola: processed formula length: 20
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 / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--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: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 <= p4717)
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-12-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-12-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate is not possibly preserved.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 13 will run for 914 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((2 <= p1847) OR (5 <= p1935))))
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 (((2 <= p1847) OR (5 <= p1935))))
lola: processed formula length: 39
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: 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: ((p1847 <= 1) AND (p1935 <= 4))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 1000 markings, 999 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 13 will run for 914 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((((2 <= p612) OR (3 <= p4030)) OR (A (G ((3 <= p2768))) OR ((1 <= p3197) AND (3 <= p2228)))) U (5 <= p3244)))
lola: ========================================
lola: SUBTASK
lola: checking a universal CTL formula with single counterexample path (use LTL...)
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: ((((2 <= p612) OR (3 <= p4030)) OR (G ((3 <= p2768)) OR ((1 <= p3197) AND (3 <= p2228)))) U (5 <= p3244))
lola: processed formula length: 106
lola: 27 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: no
lola: produced by: LTL model checker
lola: The universal single path CTL formula does not hold.
lola: 214 markings, 214 edges
lola: ========================================
lola: subprocess 14 will run for 1372 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F ((4 <= p2023))) AND E (G (E (F ((p1728 <= 2))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1372 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((4 <= p2023)))
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 ((4 <= p2023)))
lola: processed formula length: 20
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)
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: (4 <= p2023)
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: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 5 markings, 4 edges
lola: ========================================
lola: subprocess 15 will run for 2744 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (E (F ((p1728 <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation of reachability
lola: rewrite Frontend/Parser/formula_rewrite.k:593
lola: rewrite Frontend/Parser/formula_rewrite.k:628
lola: rewrite Frontend/Parser/formula_rewrite.k:731
lola: processed formula: (p1728 <= 2)
lola: processed formula length: 12
lola: 28 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 /EGEF)
lola: state space: using reachability graph (EGEF version) (--search=depth)
lola: state space: using ctl preserving stubborn set method (--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 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: (p1728 <= 2)
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
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: (3 <= p1728)
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-15-1.sara
lola: state equation: write sara problem file to CTLFireability-15-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-15-1.sara.
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-15-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EGEF
lola: Reachability of the predicate is possibly preserved.
lola: 3002 markings, 3002 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 15 will run for 2743 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F ((p932 <= 1))) OR (A (G ((p1858 <= 3))) AND E (F ((p932 <= 1)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 2743 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((p932 <= 1)))
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 ((p932 <= 1)))
lola: processed formula length: 19
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)
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: (p932 <= 1)
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: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 1000 markings, 999 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 (F ((p932 <= 1))) OR (A (G ((p1858 <= 3))) AND E (F ((p932 <= 1)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: E (F ((p932 <= 1)))
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 ((p932 <= 1)))
lola: processed formula length: 19
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)
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: (p932 <= 1)
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: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 1000 markings, 999 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (G ((p1858 <= 3)))
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:787
lola: processed formula: A (G ((p1858 <= 3)))
lola: processed formula length: 20
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: 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:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (4 <= p1858)
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: 5 markings, 4 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes yes yes yes no yes no no yes yes yes no no no no yes
lola:
preliminary result: yes yes yes yes no yes no no yes yes yes no no no no yes
lola: memory consumption: 1108620 KB
lola: time consumption: 827 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLFireability.json
lola: closed JSON file CTLFireability.json
rslt: finished

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="JoinFreeModules-PT-1000"
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 JoinFreeModules-PT-1000, 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 r184-oct2-158987928600460"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/JoinFreeModules-PT-1000.tgz
mv JoinFreeModules-PT-1000 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 ;