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-158987928600475.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-5000, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r184-oct2-158987928600475
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 29M
-rw-r--r-- 1 mcc users 3.8K Apr 8 12:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Apr 8 12:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Apr 7 16:11 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 7 16:11 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.6K Apr 14 12:41 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:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 14K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Apr 6 19:12 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Apr 6 19:12 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Apr 6 02:31 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Apr 6 02:31 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 29M 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-5000-CTLCardinality-00
FORMULA_NAME JoinFreeModules-PT-5000-CTLCardinality-01
FORMULA_NAME JoinFreeModules-PT-5000-CTLCardinality-02
FORMULA_NAME JoinFreeModules-PT-5000-CTLCardinality-03
FORMULA_NAME JoinFreeModules-PT-5000-CTLCardinality-04
FORMULA_NAME JoinFreeModules-PT-5000-CTLCardinality-05
FORMULA_NAME JoinFreeModules-PT-5000-CTLCardinality-06
FORMULA_NAME JoinFreeModules-PT-5000-CTLCardinality-07
FORMULA_NAME JoinFreeModules-PT-5000-CTLCardinality-08
FORMULA_NAME JoinFreeModules-PT-5000-CTLCardinality-09
FORMULA_NAME JoinFreeModules-PT-5000-CTLCardinality-10
FORMULA_NAME JoinFreeModules-PT-5000-CTLCardinality-11
FORMULA_NAME JoinFreeModules-PT-5000-CTLCardinality-12
FORMULA_NAME JoinFreeModules-PT-5000-CTLCardinality-13
FORMULA_NAME JoinFreeModules-PT-5000-CTLCardinality-14
FORMULA_NAME JoinFreeModules-PT-5000-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1591210599434

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 18:56:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-03 18:56:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 18:56:42] [INFO ] Load time of PNML (sax parser for PT used): 959 ms
[2020-06-03 18:56:42] [INFO ] Transformed 25001 places.
[2020-06-03 18:56:42] [INFO ] Transformed 40001 transitions.
[2020-06-03 18:56:42] [INFO ] Parsed PT model containing 25001 places and 40001 transitions in 1123 ms.
Reduce places removed 1 places and 0 transitions.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 183 ms.
Incomplete random walk after 100027 steps, including 0 resets, run finished after 15047 ms. (steps per millisecond=6 ) properties seen :[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, 0, 0]
// Phase 1: matrix 40001 rows 25000 cols
[2020-06-03 18:56:59] [INFO ] Computed 5000 place invariants in 1582 ms
[2020-06-03 18:57:19] [INFO ] [Real]Absence check using 5000 positive place invariants in 18711 ms returned (error "Solver has unexpectedly terminated")
[2020-06-03 18:57:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:57:19] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed") while checking expression at index 0
[2020-06-03 18:57:39] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 18:57:39] [INFO ] [Real]Absence check using 5000 positive place invariants in 18854 ms returned (error "Failed to check-sat")
[2020-06-03 18:57:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:57:39] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed") while checking expression at index 1
[2020-06-03 18:57:59] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 18:57:59] [INFO ] [Real]Absence check using 5000 positive place invariants in 18745 ms returned (error "Failed to check-sat")
[2020-06-03 18:57:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:57:59] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed") while checking expression at index 2
[2020-06-03 18:58:19] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 18:58:19] [INFO ] [Real]Absence check using 5000 positive place invariants in 18830 ms returned (error "Failed to check-sat")
[2020-06-03 18:58:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:58:19] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed") while checking expression at index 3
[2020-06-03 18:58:39] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 18:58:39] [INFO ] [Real]Absence check using 5000 positive place invariants in 18828 ms returned unknown
[2020-06-03 18:58:59] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 18:58:59] [INFO ] [Real]Absence check using 5000 positive place invariants in 18849 ms returned (error "Failed to check-sat")
[2020-06-03 18:58:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:58:59] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed") while checking expression at index 5
[2020-06-03 18:59:19] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 18:59:19] [INFO ] [Real]Absence check using 5000 positive place invariants in 18880 ms returned (error "Failed to check-sat")
[2020-06-03 18:59:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:59:19] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed") while checking expression at index 6
[2020-06-03 18:59:39] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 18:59:39] [INFO ] [Real]Absence check using 5000 positive place invariants in 18834 ms returned (error "Failed to check-sat")
[2020-06-03 18:59:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:59:39] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed") while checking expression at index 7
[2020-06-03 18:59:59] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 18:59:59] [INFO ] [Real]Absence check using 5000 positive place invariants in 18798 ms returned (error "Failed to check-sat")
[2020-06-03 18:59:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:59:59] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed") while checking expression at index 8
[2020-06-03 19:00:19] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 19:00:19] [INFO ] [Real]Absence check using 5000 positive place invariants in 18844 ms returned unknown
[2020-06-03 19:00:39] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 19:00:39] [INFO ] [Real]Absence check using 5000 positive place invariants in 18843 ms returned (error "Failed to check-sat")
[2020-06-03 19:00:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 19:00:39] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed") while checking expression at index 10
[2020-06-03 19:00:59] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 19:00:59] [INFO ] [Real]Absence check using 5000 positive place invariants in 18837 ms returned (error "Failed to check-sat")
[2020-06-03 19:00:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 19:00:59] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed") while checking expression at index 11
[2020-06-03 19:01:19] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 19:01:19] [INFO ] [Real]Absence check using 5000 positive place invariants in 18853 ms returned unknown
[2020-06-03 19:01:39] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 19:01:39] [INFO ] [Real]Absence check using 5000 positive place invariants in 18798 ms returned unknown
[2020-06-03 19:01:59] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 19:02:00] [INFO ] [Real]Absence check using 5000 positive place invariants in 18810 ms returned (error "Failed to check-sat")
[2020-06-03 19:02:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 19:02:00] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed") while checking expression at index 14
[2020-06-03 19:02:20] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 19:02:20] [INFO ] [Real]Absence check using 5000 positive place invariants in 18813 ms returned (error "Failed to check-sat")
[2020-06-03 19:02:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 19:02:20] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed") while checking expression at index 15
[2020-06-03 19:02:40] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 19:02:40] [INFO ] [Real]Absence check using 5000 positive place invariants in 18869 ms returned (error "Failed to check-sat")
[2020-06-03 19:02:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 19:02:40] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed") while checking expression at index 16
[2020-06-03 19:03:00] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 19:03:00] [INFO ] [Real]Absence check using 5000 positive place invariants in 18786 ms returned (error "Failed to check-sat")
[2020-06-03 19:03:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 19:03:00] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed") while checking expression at index 17
[2020-06-03 19:03:20] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 19:03:20] [INFO ] [Real]Absence check using 5000 positive place invariants in 18873 ms returned (error "Failed to check-sat")
[2020-06-03 19:03:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 19:03:20] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed") while checking expression at index 18
[2020-06-03 19:03:40] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 19:03:40] [INFO ] [Real]Absence check using 5000 positive place invariants in 18776 ms returned (error "Failed to check-sat")
[2020-06-03 19:03:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 19:03:40] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed") while checking expression at index 19
[2020-06-03 19:04:00] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 19:04:00] [INFO ] [Real]Absence check using 5000 positive place invariants in 18774 ms returned unknown
[2020-06-03 19:04:20] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 19:04:20] [INFO ] [Real]Absence check using 5000 positive place invariants in 18802 ms returned unknown
[2020-06-03 19:04:40] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 19:04:40] [INFO ] [Real]Absence check using 5000 positive place invariants in 18786 ms returned (error "Failed to check-sat")
[2020-06-03 19:04:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 19:04:40] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed") while checking expression at index 22
[2020-06-03 19:05:00] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 19:05:00] [INFO ] [Real]Absence check using 5000 positive place invariants in 18824 ms returned (error "Failed to check-sat")
[2020-06-03 19:05:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 19:05:00] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed") while checking expression at index 23
[2020-06-03 19:05:20] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 19:05:20] [INFO ] [Real]Absence check using 5000 positive place invariants in 18829 ms returned (error "Failed to check-sat")
[2020-06-03 19:05:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 19:05:20] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed") while checking expression at index 24
[2020-06-03 19:05:40] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 19:05:40] [INFO ] [Real]Absence check using 5000 positive place invariants in 18821 ms returned (error "Failed to check-sat")
[2020-06-03 19:05:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 19:05:40] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed") while checking expression at index 25
[2020-06-03 19:06:00] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 19:06:00] [INFO ] [Real]Absence check using 5000 positive place invariants in 18800 ms returned (error "Failed to check-sat")
[2020-06-03 19:06:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 19:06:00] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed") while checking expression at index 26
[2020-06-03 19:06:20] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 19:06:20] [INFO ] [Real]Absence check using 5000 positive place invariants in 18865 ms returned unknown
[2020-06-03 19:06:40] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 19:06:40] [INFO ] [Real]Absence check using 5000 positive place invariants in 18832 ms returned (error "Failed to check-sat")
[2020-06-03 19:06:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 19:06:40] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed") while checking expression at index 28
[2020-06-03 19:07:00] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 19:07:00] [INFO ] [Real]Absence check using 5000 positive place invariants in 18839 ms returned unknown
[2020-06-03 19:07:20] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 19:07:20] [INFO ] [Real]Absence check using 5000 positive place invariants in 18754 ms returned (error "Failed to check-sat")
[2020-06-03 19:07:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 19:07:20] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed") while checking expression at index 30
[2020-06-03 19:07:40] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 19:07:40] [INFO ] [Real]Absence check using 5000 positive place invariants in 18808 ms returned (error "Failed to check-sat")
[2020-06-03 19:07:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 19:07:40] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed") while checking expression at index 31
[2020-06-03 19:08:00] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 19:08:00] [INFO ] [Real]Absence check using 5000 positive place invariants in 18818 ms returned (error "Failed to check-sat")
[2020-06-03 19:08:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 19:08:00] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed") while checking expression at index 32
[2020-06-03 19:08:20] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 19:08:20] [INFO ] [Real]Absence check using 5000 positive place invariants in 18820 ms returned unknown
[2020-06-03 19:08:22] [INFO ] Flatten gal took : 1255 ms
[2020-06-03 19:08:23] [INFO ] Flatten gal took : 844 ms
[2020-06-03 19:08:23] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2020-06-03 19:08:23] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 129 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLCardinality @ JoinFreeModules-PT-5000 @ 3570 seconds

FORMULA JoinFreeModules-PT-5000-CTLCardinality-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-5000-CTLCardinality-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-5000-CTLCardinality-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-5000-CTLCardinality-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-5000-CTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-5000-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-5000-CTLCardinality-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-5000-CTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-5000-CTLCardinality-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-5000-CTLCardinality-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-5000-CTLCardinality-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-5000-CTLCardinality-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-5000-CTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-5000-CTLCardinality-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-5000-CTLCardinality-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-5000-CTLCardinality-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2254
rslt: Output for CTLCardinality @ JoinFreeModules-PT-5000

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 168
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 2,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "AF(AX(((p19881 <= p6912) OR (p19145 <= p3520))))",
"processed_size": 49,
"rewrites": 32
},
"net":
{
"conflict_clusters": 20001,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 179
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 3,
"aneg": 0,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 13,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 13,
"visible_transitions": 0
},
"processed": "((((p14305 <= p11635) AND (1 <= p13299) AND ((p14979 <= p19433) OR (3 <= p15173))) OR ((p23899 <= p23783) AND (p17227 + 1 <= p13684))) AND ((p10417 <= 1) OR (p23239 + 1 <= p12105)))",
"processed_size": 184,
"rewrites": 30
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 1,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 192
},
"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": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "AX((p4450 <= p24402))",
"processed_size": 21,
"rewrites": 31
},
"net":
{
"conflict_clusters": 20001,
"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"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 224
},
"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": "(p16413 <= 2)",
"processed_size": 13,
"rewrites": 33
},
"result":
{
"edges": 214,
"markings": 214,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 4
},
"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": 192
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 192
},
"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": "(p22619 <= 0)",
"processed_size": 13,
"rewrites": 33
},
"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"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 206
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(p18612 <= p10081)",
"processed_size": 18,
"rewrites": 32
},
"result":
{
"edges": 4999,
"markings": 5000,
"produced_by": "state space /EXEF",
"value": true
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability_from_a_successor",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 2,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 206
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "((p118 <= 1) OR ((p16379 + 1 <= p16549) AND (p21197 <= 2)))",
"processed_size": 60,
"rewrites": 30
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 3,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 224
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "E (((p5167 + 1 <= p3458) R (p17721 + 1 <= p21570)))",
"processed_size": 51,
"rewrites": 33
},
"result":
{
"edges": 214,
"markings": 214,
"produced_by": "state space /ER",
"value": true
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl",
"visible": 10
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "existential_release",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 3,
"type": "boolean"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 244
},
"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": "(p3403 <= 2)",
"processed_size": 12,
"rewrites": 30
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 5,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 4,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 256
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 2,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "AX((EX((p3387 <= p11130)) OR AF((p18464 <= p2361))))",
"processed_size": 52,
"rewrites": 33
},
"net":
{
"conflict_clusters": 20001,
"singleton_clusters": 0
},
"result":
{
"edges": 10000,
"markings": 10001,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 264
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 4,
"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": "AX(((p21384 <= p8053) OR (p365 <= p6597) OR (2 <= p8844) OR (1 <= p7213)))",
"processed_size": 77,
"rewrites": 31
},
"net":
{
"conflict_clusters": 20001,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"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": "(p6560 <= 0)",
"processed_size": 12,
"rewrites": 33
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space /EXEG",
"value": true
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "invisibility based",
"visible": 4
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "invariance_from_all_successors",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 7,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"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": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "E (F ((p2493 + 1 <= p18319)))",
"processed_size": 29,
"rewrites": 31
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 8,
"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": 339
},
"exit":
{
"localtimelimitreached": false
},
"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": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (G ((p9379 <= p20770)))",
"processed_size": 25,
"rewrites": 32
},
"result":
{
"edges": 3,
"markings": 4,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "E (F (((p9723 <= p7725) AND (2 <= p283))))",
"processed_size": 42,
"rewrites": 31
},
"result":
{
"edges": 2,
"markings": 3,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 475
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "((p19447 <= p13207) AND (p9136 <= p3539))",
"processed_size": 41,
"rewrites": 33
},
"result":
{
"edges": 21,
"markings": 21,
"produced_by": "state space /EFEG",
"value": true
},
"task":
{
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 9
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "reachability_of_possible_preservation",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "EG(AF((p13888 <= 1)))",
"processed_size": 21,
"rewrites": 32
},
"net":
{
"conflict_clusters": 20001,
"singleton_clusters": 0
},
"result":
{
"edges": 30004,
"markings": 15002,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 791
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "((2 <= p20727) AND (p24021 <= p15657) AND (1 <= p6641))",
"processed_size": 55,
"rewrites": 33
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 13,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1186
},
"exit":
{
"localtimelimitreached": false
},
"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": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (G ((p516 <= p4045)))",
"processed_size": 23,
"rewrites": 32
},
"result":
{
"edges": 2,
"markings": 3,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 13,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1186
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "(((p21387 <= 0) AND (3 <= p21903)) OR ((p12409 + 1 <= p15424) AND (2 <= p8402)))",
"processed_size": 80,
"rewrites": 31
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 14,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2372
},
"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": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "E (G ((p7099 + 1 <= p17407)))",
"processed_size": 29,
"rewrites": 31
},
"result":
{
"edges": 214,
"markings": 214,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 8
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "possible_preservation",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 14,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2371
},
"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": "(p9149 <= 0)",
"processed_size": 12,
"rewrites": 33
},
"result":
{
"edges": 214,
"markings": 214,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 15,
"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": null
},
"task":
{
"compoundnumber": 15,
"type": "boolean"
}
},

{
"child":
[

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

{
"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": "(p3403 <= 2)",
"processed_size": 12,
"rewrites": 30
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 17,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 16,
"type": "boolean"
}
},

{
"child":
[

{
"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": "(p9149 <= 0)",
"processed_size": 12,
"rewrites": 33
},
"result":
{
"edges": 214,
"markings": 214,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 18,
"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"
}
},

{
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (G (((p22398 <= 1) OR (p20286 <= 1))))",
"processed_size": 41,
"rewrites": 32
},
"result":
{
"edges": 3,
"markings": 4,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 19,
"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"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 18,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 3069872,
"runtime": 1316.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A(F(A(X(**)))) : (** OR (A(X(**)) AND (A(F(**)) OR **))) : (A(F(**)) OR A(G(**))) : E(F(*)) : E(F(*)) : (E(X(E(F(**)))) OR A(F(**))) : E(F(E(G(**)))) : E(G(A(F(**)))) : (A(G(**)) AND (** AND (** AND **))) : (E((* R *)) OR (A(X(*)) AND **)) : (E(F(A(G(**)))) AND (** OR (E(X(**)) OR **))) : A(X(E(F(*)))) : A(X((E(X(**)) OR A(F(**))))) : (A(X(A(F(**)))) AND A(X(**))) : (E(G(*)) OR (** OR **)) : A(G(**))"
},
"net":
{
"arcs": 115000,
"conflict_clusters": 20001,
"places": 25000,
"places_significant": 20000,
"singleton_clusters": 0,
"transitions": 40001
},
"result":
{
"preliminary_value": "yes no no yes yes yes yes yes no yes unknown unknown yes yes yes no ",
"value": "yes no no yes yes yes yes yes no yes unknown unknown yes yes yes no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 65001/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 800000
lola: finding significant places
lola: 25000 places, 40001 transitions, 20000 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 CTLCardinality.xml
lola: A (F (A (X (((p19881 <= p6912) OR (p19145 <= p3520)))))) : (((((p14305 <= p11635) AND (1 <= p13299) AND ((p14979 <= p19433) OR (3 <= p15173))) OR ((p23899 <= p23783) AND (p17227 + 1 <= p13684))) AND ((p10417 <= 1) OR (p23239 + 1 <= p12105))) OR (A (X ((p4450 <= p24402))) AND (A (F ((3 <= p16413))) OR (3 <= p8726)))) : (A (F (A (F ((1 <= p9149))))) OR A (G (((p22398 <= 1) OR (p20286 <= 1))))) : A (F (NOT(A (G ((p18319 <= p2493)))))) : NOT(A (G (((p7725 + 1 <= p9723) OR (p283 <= 1))))) : (E (F (E (X ((p18612 <= p10081))))) OR A (F ((1 <= p22619)))) : E (F (E (G (((p19447 <= p13207) AND (p9136 <= p3539)))))) : E (G (A (F ((p13888 <= 1))))) : (((A (G ((p516 <= p4045))) AND (2 <= p20727)) AND (p24021 <= p15657)) AND (1 <= p6641)) : (NOT(A (((p3458 <= p5167) U (p21570 <= p17721)))) OR (NOT(E (X ((3 <= p10547)))) AND ((p118 <= 1) OR ((p16379 + 1 <= p16549) AND (p21197 <= 2))))) : (E (F (A (G ((3 <= p12837))))) AND (((p3403 <= 2) OR E (X ((3 <= p4694)))) OR (p8311 <= p9289))) : NOT(E (X (A (G ((p10313 <= p22283)))))) : A (X ((E (X ((p3387 <= p11130))) OR A (F ((p18464 <= p2361)))))) : A (X ((A (F ((1 <= p6560))) AND ((p21384 <= p8053) OR (p365 <= p6597) OR (2 <= p8844) OR (1 <= p7213))))) : ((NOT(A (F ((p17407 <= p7099)))) OR ((p21387 <= 0) AND (3 <= p21903))) OR ((p12409 + 1 <= p15424) AND (2 <= p8402))) : A (G ((p9379 <= p20770)))
lola: rewrite Frontend/Parser/formula_rewrite.k:392
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:449
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:395
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:323
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:326
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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:551
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:254
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 168 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (A (X (((p19881 <= p6912) OR (p19145 <= p3520))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF(AX(((p19881 <= p6912) OR (p19145 <= p3520))))
lola: processed formula length: 49
lola: 32 rewrites
lola: closed formula file CTLCardinality.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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 179 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((((p14305 <= p11635) AND (1 <= p13299) AND ((p14979 <= p19433) OR (3 <= p15173))) OR ((p23899 <= p23783) AND (p17227 + 1 <= p13684))) AND ((p10417 <= 1) OR (p23239 + 1 <= p12105))) OR (A (X ((p4450 <= p24402))) AND (A (F ((3 <= p16413))) OR (3 <= p8726))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 179 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((((p14305 <= p11635) AND (1 <= p13299) AND ((p14979 <= p19433) OR (3 <= p15173))) OR ((p23899 <= p23783) AND (p17227 + 1 <= p13684))) AND ((p10417 <= 1) OR (p23239 + 1 <= p12105)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((((p14305 <= p11635) AND (1 <= p13299) AND ((p14979 <= p19433) OR (3 <= p15173))) OR ((p23899 <= p23783) AND (p17227 + 1 <= p13684))) AND ((p10417 <= 1) OR (p23239 + 1 <= p12105)))
lola: processed formula length: 184
lola: 30 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 8 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 192 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((p4450 <= p24402)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX((p4450 <= p24402))
lola: processed formula length: 21
lola: 31 rewrites
lola: closed formula file CTLCardinality.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 3 will run for 207 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (3 <= p8726)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= p8726)
lola: processed formula length: 12
lola: 30 rewrites
lola: closed formula file CTLCardinality.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 4 will run for 224 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((3 <= p16413)))
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: (p16413 <= 2)
lola: processed formula length: 13
lola: 33 rewrites
lola: closed formula file CTLCardinality.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 <= p16413)
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 CTLCardinality-4-0.sara
lola: state equation: calling and running sara
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 192 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (X (E (F ((p18612 <= p10081))))) OR A (F ((1 <= p22619))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 192 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((1 <= p22619)))
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: (p22619 <= 0)
lola: processed formula length: 13
lola: 33 rewrites
lola: closed formula file CTLCardinality.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: (1 <= p22619)
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: subprocess 3 will run for 206 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (E (F ((p18612 <= p10081)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability from a successor
lola: rewrite Frontend/Parser/formula_rewrite.k:623
lola: rewrite Frontend/Parser/formula_rewrite.k:714
lola: processed formula: (p18612 <= p10081)
lola: processed formula length: 18
lola: 32 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EXEF)
lola: state space: using reachability graph (EXef version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p18612 <= p10081)
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 CTLCardinality-3-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EXEF
lola: The predicate is reachable from some successor.
lola: 5000 markings, 4999 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 3 will run for 206 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (((p5167 + 1 <= p3458) R (p17721 + 1 <= p21570))) OR (A (X ((p10547 <= 2))) AND ((p118 <= 1) OR ((p16379 + 1 <= p16549) AND (p21197 <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 206 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p118 <= 1) OR ((p16379 + 1 <= p16549) AND (p21197 <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p118 <= 1) OR ((p16379 + 1 <= p16549) AND (p21197 <= 2)))
lola: processed formula length: 60
lola: 30 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 3 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 4 will run for 224 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (((p5167 + 1 <= p3458) R (p17721 + 1 <= p21570)))
lola: ========================================
lola: SUBTASK
lola: checking existential release
lola: rewrite Frontend/Parser/formula_rewrite.k:576
lola: rewrite Frontend/Parser/formula_rewrite.k:736
lola: rewrite Frontend/Parser/formula_rewrite.k:696
lola: processed formula: E (((p5167 + 1 <= p3458) R (p17721 + 1 <= p21570)))
lola: processed formula length: 51
lola: 33 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /ER)
lola: state space: using reachability graph (ER version) (--search=depth)
lola: state space: using ltl 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: (p21570 <= p17721)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: 1
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /ER
lola: There is a path where Predicate Phi releases Predicate Psi.
lola: 214 markings, 214 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 4 will run for 224 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F (A (G ((3 <= p12837))))) AND ((p3403 <= 2) OR (E (X ((3 <= p4694))) OR (p8311 <= p9289))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 224 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p8311 <= p9289)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p8311 <= p9289)
lola: processed formula length: 16
lola: 30 rewrites
lola: closed formula file CTLCardinality.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 5 will run for 244 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p3403 <= 2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p3403 <= 2)
lola: processed formula length: 12
lola: 30 rewrites
lola: closed formula file CTLCardinality.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 6 will run for 268 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (G ((3 <= p12837)))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: rewrite Frontend/Parser/formula_rewrite.k:604
lola: rewrite Frontend/Parser/formula_rewrite.k:614
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (p12837 <= 2)
lola: processed formula length: 13
lola: 34 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using tscc preserving stubborn set method (--stubborn)
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: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: (p12837 <= 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: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 <= p12837)
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 CTLCardinality-6-1.sara
lola: state equation: write sara problem file to CTLCardinality-6-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-6-1.sara.
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-6-0.sara.
lola: sara is running 0 secs || sara is running 0 secs || 22433 markings, 24258 edges, 4487 markings/sec, 0 secs
lola: sara is running 5 secs || sara is running 5 secs || 39272 markings, 53727 edges, 3368 markings/sec, 5 secs
lola: sara is running 10 secs || sara is running 10 secs || 60865 markings, 80266 edges, 4319 markings/sec, 10 secs
lola: sara is running 15 secs || sara is running 15 secs || 78552 markings, 108529 edges, 3537 markings/sec, 15 secs
lola: sara is running 20 secs || sara is running 20 secs || 98923 markings, 135622 edges, 4074 markings/sec, 20 secs
lola: sara is running 25 secs || sara is running 25 secs || 118139 markings, 163104 edges, 3843 markings/sec, 25 secs
lola: sara is running 30 secs || sara is running 30 secs || 136947 markings, 190921 edges, 3762 markings/sec, 30 secs
lola: sara is running 35 secs || sara is running 35 secs || 150488 markings, 210439 edges, 2708 markings/sec, 35 secs
lola: sara is running 40 secs || sara is running 40 secs || 157850 markings, 217801 edges, 1472 markings/sec, 40 secs
lola: sara is running 45 secs || sara is running 45 secs || 170590 markings, 238542 edges, 2548 markings/sec, 45 secs
lola: sara is running 50 secs || sara is running 50 secs || 184542 markings, 259486 edges, 2790 markings/sec, 50 secs
lola: sara is running 55 secs || sara is running 55 secs || 201173 markings, 280822 edges, 3326 markings/sec, 55 secs
lola: sara is running 60 secs || sara is running 60 secs || 210874 markings, 297796 edges, 1940 markings/sec, 60 secs
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: subprocess 5 will run for 238 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (E (F ((p22283 + 1 <= p10313)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX(EF((p22283 + 1 <= p10313)))
lola: processed formula length: 30
lola: 32 rewrites
lola: closed formula file CTLCardinality.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: 16464 markings, 17560 edges, 3293 markings/sec, 0 secs
lola: 32529 markings, 45676 edges, 3213 markings/sec, 5 secs
lola: 52841 markings, 69973 edges, 4062 markings/sec, 10 secs
lola: 68929 markings, 98128 edges, 3218 markings/sec, 15 secs
lola: 89679 markings, 123196 edges, 4150 markings/sec, 20 secs
lola: 106585 markings, 151550 edges, 3381 markings/sec, 25 secs
lola: 127110 markings, 177458 edges, 4105 markings/sec, 30 secs
lola: 145350 markings, 205302 edges, 3648 markings/sec, 35 secs
lola: 164725 markings, 232029 edges, 3875 markings/sec, 40 secs
lola: 183731 markings, 258675 edges, 3801 markings/sec, 45 secs
lola: 201988 markings, 285997 edges, 3651 markings/sec, 50 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 6 will run for 256 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((E (X ((p3387 <= p11130))) OR A (F ((p18464 <= p2361))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX((EX((p3387 <= p11130)) OR AF((p18464 <= p2361))))
lola: processed formula length: 52
lola: 33 rewrites
lola: closed formula file CTLCardinality.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: 345 markings, 344 edges, 69 markings/sec, 0 secs
lola: 680 markings, 679 edges, 67 markings/sec, 5 secs
lola: 1013 markings, 1012 edges, 67 markings/sec, 10 secs
lola: 1287 markings, 1286 edges, 55 markings/sec, 15 secs
lola: 1589 markings, 1588 edges, 60 markings/sec, 20 secs
lola: 1921 markings, 1920 edges, 66 markings/sec, 25 secs
lola: 2202 markings, 2202 edges, 56 markings/sec, 30 secs
lola: 2515 markings, 2514 edges, 63 markings/sec, 35 secs
lola: 2820 markings, 2819 edges, 61 markings/sec, 40 secs
lola: 3093 markings, 3092 edges, 55 markings/sec, 45 secs
lola: 3361 markings, 3360 edges, 54 markings/sec, 50 secs
lola: 3619 markings, 3618 edges, 52 markings/sec, 55 secs
lola: 3847 markings, 3846 edges, 46 markings/sec, 60 secs
lola: 4069 markings, 4068 edges, 44 markings/sec, 65 secs
lola: 4288 markings, 4287 edges, 44 markings/sec, 70 secs
lola: 4506 markings, 4505 edges, 44 markings/sec, 75 secs
lola: 4734 markings, 4733 edges, 46 markings/sec, 80 secs
lola: 4968 markings, 4967 edges, 47 markings/sec, 85 secs
lola: 5207 markings, 5206 edges, 48 markings/sec, 90 secs
lola: 5479 markings, 5478 edges, 54 markings/sec, 95 secs
lola: 5711 markings, 5710 edges, 46 markings/sec, 100 secs
lola: 5963 markings, 5962 edges, 50 markings/sec, 105 secs
lola: 6199 markings, 6199 edges, 47 markings/sec, 110 secs
lola: 6440 markings, 6439 edges, 48 markings/sec, 115 secs
lola: 6685 markings, 6684 edges, 49 markings/sec, 120 secs
lola: 6942 markings, 6941 edges, 51 markings/sec, 125 secs
lola: 7228 markings, 7227 edges, 57 markings/sec, 130 secs
lola: 7492 markings, 7491 edges, 53 markings/sec, 135 secs
lola: 7759 markings, 7758 edges, 53 markings/sec, 140 secs
lola: 8060 markings, 8059 edges, 60 markings/sec, 145 secs
lola: 8350 markings, 8349 edges, 58 markings/sec, 150 secs
lola: 8630 markings, 8629 edges, 56 markings/sec, 155 secs
lola: 8965 markings, 8964 edges, 67 markings/sec, 160 secs
lola: 9334 markings, 9333 edges, 74 markings/sec, 165 secs
lola: 9653 markings, 9652 edges, 64 markings/sec, 170 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 10001 markings, 10000 edges
lola: ========================================
lola: subprocess 7 will run for 264 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (X (A (F ((1 <= p6560))))) AND A (X (((p21384 <= p8053) OR (p365 <= p6597) OR (2 <= p8844) OR (1 <= p7213)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 264 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (((p21384 <= p8053) OR (p365 <= p6597) OR (2 <= p8844) OR (1 <= p7213))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX(((p21384 <= p8053) OR (p365 <= p6597) OR (2 <= p8844) OR (1 <= p7213)))
lola: processed formula length: 77
lola: 31 rewrites
lola: closed formula file CTLCardinality.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 8 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (A (F ((1 <= p6560)))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence from all successors
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:754
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (p6560 <= 0)
lola: processed formula length: 12
lola: 33 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EXEG)
lola: state space: using reachability graph (EXEG version) (--search=depth)
lola: state space: using invisibility based 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:753
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: (1 <= p6560)
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 /EXEG
lola: The predicate eventually occurs from all successors.
lola: 0 markings, 0 edges
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: subprocess 8 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((p2493 + 1 <= p18319)))
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 ((p2493 + 1 <= p18319)))
lola: processed formula length: 29
lola: 31 rewrites
lola: closed formula file CTLCardinality.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: (p2493 + 1 <= p18319)
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: 2 markings, 1 edges
lola: ========================================
lola: subprocess 9 will run for 339 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p9379 <= p20770)))
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 ((p9379 <= p20770)))
lola: processed formula length: 25
lola: 32 rewrites
lola: closed formula file CTLCardinality.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: (p20770 + 1 <= p9379)
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: 4 markings, 3 edges
lola: ========================================
lola: subprocess 10 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((p9723 <= p7725) AND (2 <= p283))))
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 (((p9723 <= p7725) AND (2 <= p283))))
lola: processed formula length: 42
lola: 31 rewrites
lola: closed formula file CTLCardinality.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: ((p9723 <= p7725) AND (2 <= p283))
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: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 3 markings, 2 edges
lola: ========================================
lola: subprocess 11 will run for 475 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (E (G (((p19447 <= p13207) AND (p9136 <= p3539))))))
lola: ========================================
lola: SUBTASK
lola: checking reachability of possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:598
lola: rewrite Frontend/Parser/formula_rewrite.k:633
lola: rewrite Frontend/Parser/formula_rewrite.k:730
lola: processed formula: ((p19447 <= p13207) AND (p9136 <= p3539))
lola: processed formula length: 41
lola: 33 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EFEG)
lola: state space: using reachability graph (EFEG version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p13207 + 1 <= p19447) OR (p3539 + 1 <= p9136))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: state equation 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: ((p19447 <= p13207) AND (p9136 <= p3539))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EFEG
lola: The predicate is possibly preserved from a reachable marking.
lola: 21 markings, 21 edges
lola: ========================================
lola: subprocess 12 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (A (F ((p13888 <= 1)))))
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((p13888 <= 1)))
lola: processed formula length: 21
lola: 32 rewrites
lola: closed formula file CTLCardinality.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: 14374 markings, 28748 edges, 2875 markings/sec, 0 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 15002 markings, 30004 edges
lola: ========================================
lola: subprocess 13 will run for 791 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G ((p516 <= p4045))) AND ((2 <= p20727) AND ((p24021 <= p15657) AND (1 <= p6641))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 791 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((2 <= p20727) AND ((p24021 <= p15657) AND (1 <= p6641)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: rewrite Frontend/Parser/formula_rewrite.k:794
lola: processed formula: ((2 <= p20727) AND (p24021 <= p15657) AND (1 <= p6641))
lola: processed formula length: 55
lola: 33 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 3 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 14 will run for 1186 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p516 <= p4045)))
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 ((p516 <= p4045)))
lola: processed formula length: 23
lola: 32 rewrites
lola: closed formula file CTLCardinality.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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 3 markings, 2 edges
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: (p4045 + 1 <= p516)
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: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 14 will run for 1186 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (G ((p7099 + 1 <= p17407))) OR (((p21387 <= 0) AND (3 <= p21903)) OR ((p12409 + 1 <= p15424) AND (2 <= p8402))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1186 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p21387 <= 0) AND (3 <= p21903)) OR ((p12409 + 1 <= p15424) AND (2 <= p8402)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: processed formula: (((p21387 <= 0) AND (3 <= p21903)) OR ((p12409 + 1 <= p15424) AND (2 <= p8402)))
lola: processed formula length: 80
lola: 31 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 4 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 15 will run for 2372 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((p7099 + 1 <= p17407)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G ((p7099 + 1 <= p17407)))
lola: processed formula length: 29
lola: 31 rewrites
lola: closed formula file CTLCardinality.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: (p17407 <= p7099)
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 / EG
lola: The predicate is possibly preserved.
lola: 214 markings, 214 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 15 will run for 2371 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F ((1 <= p9149))) OR A (G (((p22398 <= 1) OR (p20286 <= 1)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 2371 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((1 <= p9149)))
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: (p9149 <= 0)
lola: processed formula length: 12
lola: 33 rewrites
lola: closed formula file CTLCardinality.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: (1 <= p9149)
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 CTLCardinality-15-0.sara
lola: state equation: calling and running sara
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: 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 (A (G ((3 <= p12837))))) AND ((p3403 <= 2) OR (E (X ((3 <= p4694))) OR (p8311 <= p9289))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: (p8311 <= p9289)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p8311 <= p9289)
lola: processed formula length: 16
lola: 30 rewrites
lola: closed formula file CTLCardinality.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: ========================================
lola: ...considering subproblem: (p3403 <= 2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p3403 <= 2)
lola: processed formula length: 12
lola: 30 rewrites
lola: closed formula file CTLCardinality.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: ========================================
lola: ...considering subproblem: E (F (A (G ((3 <= p12837)))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: rewrite Frontend/Parser/formula_rewrite.k:604
lola: rewrite Frontend/Parser/formula_rewrite.k:614
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (p12837 <= 2)
lola: processed formula length: 13
lola: 34 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using tscc preserving stubborn set method (--stubborn)
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: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: (p12837 <= 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: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 <= p12837)
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 CTLCardinality-18-1.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-18-1.sara.
lola: state equation: write sara problem file to CTLCardinality-18-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-18-0.sara.
lola: sara is running 0 secs || sara is running 0 secs || 23571 markings, 26247 edges, 4714 markings/sec, 0 secs
lola: sara is running 5 secs || sara is running 5 secs || 40464 markings, 55453 edges, 3379 markings/sec, 5 secs
lola: sara is running 10 secs || sara is running 10 secs || 61516 markings, 81408 edges, 4210 markings/sec, 10 secs
lola: sara is running 15 secs || sara is running 15 secs || 79461 markings, 109439 edges, 3589 markings/sec, 15 secs
lola: sara is running 20 secs || sara is running 20 secs || 99541 markings, 136704 edges, 4016 markings/sec, 20 secs
lola: sara is running 25 secs || sara is running 25 secs || 119244 markings, 164210 edges, 3941 markings/sec, 25 secs
lola: sara is running 30 secs || sara is running 30 secs || 137939 markings, 192658 edges, 3739 markings/sec, 30 secs
lola: sara is running 35 secs || sara is running 35 secs || 158976 markings, 218927 edges, 4207 markings/sec, 35 secs
lola: sara is running 40 secs || sara is running 40 secs || 175888 markings, 247814 edges, 3382 markings/sec, 40 secs
lola: sara is running 45 secs || sara is running 45 secs || 197345 markings, 274120 edges, 4291 markings/sec, 45 secs
lola: sara is running 50 secs || sara is running 50 secs || 209815 markings, 295944 edges, 2494 markings/sec, 50 secs
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (X (E (F ((p22283 + 1 <= p10313)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX(EF((p22283 + 1 <= p10313)))
lola: processed formula length: 30
lola: 32 rewrites
lola: closed formula file CTLCardinality.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: 20401 markings, 24450 edges, 4080 markings/sec, 0 secs
lola: 37252 markings, 52241 edges, 3370 markings/sec, 5 secs
lola: 57091 markings, 77411 edges, 3968 markings/sec, 10 secs
lola: 74790 markings, 104767 edges, 3540 markings/sec, 15 secs
lola: 94309 markings, 131296 edges, 3904 markings/sec, 20 secs
lola: 113483 markings, 158448 edges, 3835 markings/sec, 25 secs
lola: 132260 markings, 186469 edges, 3755 markings/sec, 30 secs
lola: 152994 markings, 212946 edges, 4147 markings/sec, 35 secs
lola: 170241 markings, 241684 edges, 3449 markings/sec, 40 secs
lola: 191533 markings, 267700 edges, 4258 markings/sec, 45 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: (A (F ((1 <= p9149))) OR A (G (((p22398 <= 1) OR (p20286 <= 1)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: A (F ((1 <= p9149)))
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: (p9149 <= 0)
lola: processed formula length: 12
lola: 33 rewrites
lola: closed formula file CTLCardinality.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: (1 <= p9149)
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 CTLCardinality-18-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 214 markings, 214 edges
lola: state equation: calling and running sara
lola: ========================================
sara: try reading problem file CTLCardinality-18-0.sara.
lola: ========================================
lola: ...considering subproblem: A (G (((p22398 <= 1) OR (p20286 <= 1))))
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 (((p22398 <= 1) OR (p20286 <= 1))))
lola: processed formula length: 41
lola: 32 rewrites
lola: closed formula file CTLCardinality.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: ((2 <= p22398) AND (2 <= p20286))
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: 4 markings, 3 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no no yes yes yes yes yes no yes unknown unknown yes yes yes no
lola:
preliminary result: yes no no yes yes yes yes yes no yes unknown unknown yes yes yes no
lola: memory consumption: 3069872 KB
lola: time consumption: 1316 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLCardinality.json
lola: closed JSON file CTLCardinality.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-5000"
export BK_EXAMINATION="CTLCardinality"
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-5000, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r184-oct2-158987928600475"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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