Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r132-tall-162075428400233.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2020
Input is JoinFreeModules-PT-2000, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r132-tall-162075428400233
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 12M
-rw-r--r-- 1 mcc users 19K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 167K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Mar 28 16:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 28 16:17 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 28 16:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 28 16:17 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 26 14:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 26 14:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Mar 24 17:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 24 17:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 5 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 12M May 5 16:51 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME JoinFreeModules-PT-2000-00
FORMULA_NAME JoinFreeModules-PT-2000-01
FORMULA_NAME JoinFreeModules-PT-2000-02
FORMULA_NAME JoinFreeModules-PT-2000-03
FORMULA_NAME JoinFreeModules-PT-2000-04
FORMULA_NAME JoinFreeModules-PT-2000-05
FORMULA_NAME JoinFreeModules-PT-2000-06
FORMULA_NAME JoinFreeModules-PT-2000-07
FORMULA_NAME JoinFreeModules-PT-2000-08
FORMULA_NAME JoinFreeModules-PT-2000-09
FORMULA_NAME JoinFreeModules-PT-2000-10
FORMULA_NAME JoinFreeModules-PT-2000-11
FORMULA_NAME JoinFreeModules-PT-2000-12
FORMULA_NAME JoinFreeModules-PT-2000-13
FORMULA_NAME JoinFreeModules-PT-2000-14
FORMULA_NAME JoinFreeModules-PT-2000-15

=== Now, execution of the tool begins

BK_START 1620922584100

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-13 16:16:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2021-05-13 16:16:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 16:16:26] [INFO ] Load time of PNML (sax parser for PT used): 525 ms
[2021-05-13 16:16:26] [INFO ] Transformed 10001 places.
[2021-05-13 16:16:26] [INFO ] Transformed 16001 transitions.
[2021-05-13 16:16:26] [INFO ] Parsed PT model containing 10001 places and 16001 transitions in 638 ms.
Reduce places removed 1 places and 0 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 116 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100269 steps, including 0 resets, run finished after 8028 ms. (steps per millisecond=12 ) 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, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0]
// Phase 1: matrix 16001 rows 10000 cols
[2021-05-13 16:16:35] [INFO ] Computed 2000 place invariants in 340 ms
[2021-05-13 16:16:44] [INFO ] [Real]Absence check using 2000 positive place invariants in 8260 ms returned sat
[2021-05-13 16:16:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 16:16:55] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 16:16:55] [INFO ] [Real]Absence check using state equation in 10640 ms returned (error "Failed to check-sat")
[2021-05-13 16:17:04] [INFO ] [Real]Absence check using 2000 positive place invariants in 8611 ms returned sat
[2021-05-13 16:17:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 16:17:15] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 16:17:15] [INFO ] [Real]Absence check using state equation in 10565 ms returned (error "Failed to check-sat")
[2021-05-13 16:17:24] [INFO ] [Real]Absence check using 2000 positive place invariants in 8276 ms returned sat
[2021-05-13 16:17:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 16:17:35] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 16:17:35] [INFO ] [Real]Absence check using state equation in 10724 ms returned (error "Failed to check-sat")
[2021-05-13 16:17:43] [INFO ] [Real]Absence check using 2000 positive place invariants in 8118 ms returned sat
[2021-05-13 16:17:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 16:17:55] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 16:17:55] [INFO ] [Real]Absence check using state equation in 11083 ms returned (error "Failed to check-sat")
[2021-05-13 16:18:05] [INFO ] [Real]Absence check using 2000 positive place invariants in 9388 ms returned sat
[2021-05-13 16:18:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 16:18:15] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 16:18:15] [INFO ] [Real]Absence check using state equation in 9616 ms returned (error "Failed to check-sat")
[2021-05-13 16:18:24] [INFO ] [Real]Absence check using 2000 positive place invariants in 8767 ms returned sat
[2021-05-13 16:18:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 16:18:35] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 16:18:35] [INFO ] [Real]Absence check using state equation in 10400 ms returned (error "Failed to check-sat")
[2021-05-13 16:18:44] [INFO ] [Real]Absence check using 2000 positive place invariants in 8552 ms returned sat
[2021-05-13 16:18:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 16:18:55] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 16:18:55] [INFO ] [Real]Absence check using state equation in 10648 ms returned (error "Failed to check-sat")
[2021-05-13 16:19:04] [INFO ] [Real]Absence check using 2000 positive place invariants in 8139 ms returned sat
[2021-05-13 16:19:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 16:19:15] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 16:19:15] [INFO ] [Real]Absence check using state equation in 11054 ms returned (error "Failed to check-sat")
[2021-05-13 16:19:16] [INFO ] [Real]Absence check using 2000 positive place invariants in 48 ms returned unsat
[2021-05-13 16:19:26] [INFO ] [Real]Absence check using 2000 positive place invariants in 8991 ms returned sat
[2021-05-13 16:19:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 16:19:36] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 16:19:36] [INFO ] [Real]Absence check using state equation in 10045 ms returned (error "Failed to check-sat")
[2021-05-13 16:19:45] [INFO ] [Real]Absence check using 2000 positive place invariants in 8407 ms returned sat
[2021-05-13 16:19:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 16:19:56] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 16:19:56] [INFO ] [Real]Absence check using state equation in 10826 ms returned (error "Failed to check-sat")
[2021-05-13 16:20:06] [INFO ] [Real]Absence check using 2000 positive place invariants in 9158 ms returned sat
[2021-05-13 16:20:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 16:20:16] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 16:20:16] [INFO ] [Real]Absence check using state equation in 10043 ms returned (error "Failed to check-sat")
[2021-05-13 16:20:25] [INFO ] [Real]Absence check using 2000 positive place invariants in 8467 ms returned sat
[2021-05-13 16:20:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 16:20:36] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 16:20:36] [INFO ] [Real]Absence check using state equation in 10704 ms returned (error "Failed to check-sat")
[2021-05-13 16:20:46] [INFO ] [Real]Absence check using 2000 positive place invariants in 9157 ms returned sat
[2021-05-13 16:20:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 16:20:56] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 16:20:56] [INFO ] [Real]Absence check using state equation in 10021 ms returned (error "Failed to check-sat")
[2021-05-13 16:21:05] [INFO ] [Real]Absence check using 2000 positive place invariants in 8903 ms returned sat
[2021-05-13 16:21:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 16:21:16] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 16:21:16] [INFO ] [Real]Absence check using state equation in 10309 ms returned unknown
[2021-05-13 16:21:25] [INFO ] [Real]Absence check using 2000 positive place invariants in 8431 ms returned sat
[2021-05-13 16:21:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 16:21:36] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 16:21:36] [INFO ] [Real]Absence check using state equation in 10685 ms returned (error "Failed to check-sat")
[2021-05-13 16:21:46] [INFO ] [Real]Absence check using 2000 positive place invariants in 9457 ms returned sat
[2021-05-13 16:21:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 16:21:56] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 16:21:56] [INFO ] [Real]Absence check using state equation in 9778 ms returned (error "Failed to check-sat")
[2021-05-13 16:22:06] [INFO ] [Real]Absence check using 2000 positive place invariants in 9629 ms returned sat
[2021-05-13 16:22:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 16:22:16] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 16:22:16] [INFO ] [Real]Absence check using state equation in 9555 ms returned (error "Failed to check-sat")
[2021-05-13 16:22:26] [INFO ] [Real]Absence check using 2000 positive place invariants in 9686 ms returned sat
[2021-05-13 16:22:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 16:22:36] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 16:22:36] [INFO ] [Real]Absence check using state equation in 9548 ms returned unknown
[2021-05-13 16:22:46] [INFO ] [Real]Absence check using 2000 positive place invariants in 9624 ms returned sat
[2021-05-13 16:22:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 16:22:56] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 16:22:56] [INFO ] [Real]Absence check using state equation in 9608 ms returned (error "Failed to check-sat")
[2021-05-13 16:23:06] [INFO ] [Real]Absence check using 2000 positive place invariants in 9255 ms returned sat
[2021-05-13 16:23:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 16:23:16] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 16:23:16] [INFO ] [Real]Absence check using state equation in 9971 ms returned (error "Failed to check-sat")
[2021-05-13 16:23:26] [INFO ] [Real]Absence check using 2000 positive place invariants in 9070 ms returned sat
[2021-05-13 16:23:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 16:23:36] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 16:23:36] [INFO ] [Real]Absence check using state equation in 10156 ms returned unknown
[2021-05-13 16:23:46] [INFO ] [Real]Absence check using 2000 positive place invariants in 9310 ms returned sat
[2021-05-13 16:23:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 16:23:56] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 16:23:56] [INFO ] [Real]Absence check using state equation in 9862 ms returned unknown
[2021-05-13 16:24:05] [INFO ] [Real]Absence check using 2000 positive place invariants in 8897 ms returned sat
[2021-05-13 16:24:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 16:24:16] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 16:24:16] [INFO ] [Real]Absence check using state equation in 10324 ms returned (error "Failed to check-sat")
[2021-05-13 16:24:26] [INFO ] [Real]Absence check using 2000 positive place invariants in 9623 ms returned sat
[2021-05-13 16:24:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 16:24:36] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 16:24:36] [INFO ] [Real]Absence check using state equation in 9426 ms returned unknown
[2021-05-13 16:24:46] [INFO ] [Real]Absence check using 2000 positive place invariants in 9838 ms returned sat
[2021-05-13 16:24:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 16:24:56] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 16:24:56] [INFO ] [Real]Absence check using state equation in 9395 ms returned (error "Failed to check-sat")
[2021-05-13 16:24:57] [INFO ] [Real]Absence check using 2000 positive place invariants in 48 ms returned unsat
[2021-05-13 16:25:07] [INFO ] [Real]Absence check using 2000 positive place invariants in 9706 ms returned sat
[2021-05-13 16:25:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 16:25:17] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 16:25:17] [INFO ] [Real]Absence check using state equation in 9497 ms returned unknown
[2021-05-13 16:25:18] [INFO ] [Real]Absence check using 2000 positive place invariants in 58 ms returned unsat
[2021-05-13 16:25:28] [INFO ] [Real]Absence check using 2000 positive place invariants in 9456 ms returned sat
[2021-05-13 16:25:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 16:25:38] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 16:25:38] [INFO ] [Real]Absence check using state equation in 9720 ms returned (error "Failed to check-sat")
[2021-05-13 16:25:47] [INFO ] [Real]Absence check using 2000 positive place invariants in 8802 ms returned sat
[2021-05-13 16:25:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 16:25:58] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 16:25:58] [INFO ] [Real]Absence check using state equation in 10396 ms returned (error "Failed to check-sat")
[2021-05-13 16:26:08] [INFO ] [Real]Absence check using 2000 positive place invariants in 9137 ms returned sat
[2021-05-13 16:26:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 16:26:18] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 16:26:18] [INFO ] [Real]Absence check using state equation in 9934 ms returned (error "Failed to check-sat")
[2021-05-13 16:26:18] [INFO ] [Real]Absence check using 2000 positive place invariants in 49 ms returned unsat
[2021-05-13 16:26:28] [INFO ] [Real]Absence check using 2000 positive place invariants in 9089 ms returned sat
[2021-05-13 16:26:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 16:26:38] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 16:26:38] [INFO ] [Real]Absence check using state equation in 10117 ms returned unknown
[2021-05-13 16:26:47] [INFO ] [Real]Absence check using 2000 positive place invariants in 7910 ms returned sat
[2021-05-13 16:26:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 16:26:58] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 16:26:58] [INFO ] [Real]Absence check using state equation in 11275 ms returned (error "Failed to check-sat")
[2021-05-13 16:27:08] [INFO ] [Real]Absence check using 2000 positive place invariants in 8262 ms returned sat
[2021-05-13 16:27:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 16:27:18] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 16:27:18] [INFO ] [Real]Absence check using state equation in 10921 ms returned (error "Failed to check-sat")
[2021-05-13 16:27:28] [INFO ] [Real]Absence check using 2000 positive place invariants in 8925 ms returned sat
[2021-05-13 16:27:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 16:27:38] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe (= s460 (- (+ 2 t739 (* 3 t741) (* 2 t743)) (+ (* 3 t737) (* 3 t742))))") while checking expression at index 36
[2021-05-13 16:27:48] [INFO ] [Real]Absence check using 2000 positive place invariants in 8723 ms returned sat
[2021-05-13 16:27:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 16:27:58] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 16:27:58] [INFO ] [Real]Absence check using state equation in 10264 ms returned (error "Failed to check-sat")
[2021-05-13 16:28:08] [INFO ] [Real]Absence check using 2000 positive place invariants in 8622 ms returned sat
[2021-05-13 16:28:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 16:28:18] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 16:28:18] [INFO ] [Real]Absence check using state equation in 10555 ms returned (error "Failed to check-sat")
[2021-05-13 16:28:28] [INFO ] [Real]Absence check using 2000 positive place invariants in 8494 ms returned sat
[2021-05-13 16:28:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 16:28:38] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 16:28:38] [INFO ] [Real]Absence check using state equation in 10687 ms returned (error "Failed to check-sat")
[2021-05-13 16:28:47] [INFO ] [Real]Absence check using 2000 positive place invariants in 8168 ms returned sat
[2021-05-13 16:28:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 16:28:58] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 16:28:58] [INFO ] [Real]Absence check using state equation in 10999 ms returned (error "Failed to check-sat")
[2021-05-13 16:29:09] [INFO ] [Real]Absence check using 2000 positive place invariants in 9426 ms returned sat
[2021-05-13 16:29:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 16:29:18] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 16:29:18] [INFO ] [Real]Absence check using state equation in 9791 ms returned unknown
[2021-05-13 16:29:28] [INFO ] [Real]Absence check using 2000 positive place invariants in 8310 ms returned sat
[2021-05-13 16:29:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 16:29:38] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 16:29:38] [INFO ] [Real]Absence check using state equation in 10685 ms returned unknown
[2021-05-13 16:29:48] [INFO ] [Real]Absence check using 2000 positive place invariants in 8625 ms returned sat
[2021-05-13 16:29:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 16:29:58] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 16:29:58] [INFO ] [Real]Absence check using state equation in 10563 ms returned unknown
[2021-05-13 16:30:08] [INFO ] [Real]Absence check using 2000 positive place invariants in 8701 ms returned sat
[2021-05-13 16:30:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 16:30:19] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 16:30:19] [INFO ] [Real]Absence check using state equation in 10466 ms returned unknown
[2021-05-13 16:30:28] [INFO ] [Real]Absence check using 2000 positive place invariants in 8661 ms returned sat
[2021-05-13 16:30:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 16:30:39] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 16:30:39] [INFO ] [Real]Absence check using state equation in 10550 ms returned unknown
Successfully simplified 4 atomic propositions for a total of 4 simplifications.
[2021-05-13 16:30:39] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2021-05-13 16:30:40] [INFO ] Flatten gal took : 705 ms
FORMULA JoinFreeModules-PT-2000-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-2000-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-2000-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-2000-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-13 16:30:40] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2021-05-13 16:30:40] [INFO ] Flatten gal took : 485 ms
[2021-05-13 16:30:40] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA JoinFreeModules-PT-2000-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-13 16:30:40] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2021-05-13 16:30:40] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 85 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ JoinFreeModules-PT-2000 @ 3570 seconds

FORMULA JoinFreeModules-PT-2000-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

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

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

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

FORMULA JoinFreeModules-PT-2000-04 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-2000-05 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA JoinFreeModules-PT-2000-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-2000-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-2000-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 1271
rslt: Output for LTLCardinality @ JoinFreeModules-PT-2000

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

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

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

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

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 399
},
"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": "((p2062 <= p1205) AND (p4715 <= p6121))",
"processed_size": 39,
"rewrites": 72
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 4,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 465
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 2,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"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": "G ((G ((p4715 <= p6121)) OR (p2062 <= p1205)))",
"processed_size": 46,
"rewrites": 72
},
"result":
{
"edges": 14,
"markings": 14,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 661
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 1,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 1,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "((p2803 + 1 <= p1620) U ((X ((F ((p5562 + 1 <= p6844)) OR (p6844 <= p5562))) OR (p6844 <= p5562)) AND (1 <= p133)))",
"processed_size": 115,
"rewrites": 72
},
"result":
{
"edges": 6002,
"markings": 6002,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 6,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2202
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "F ((G ((p3909 + 1 <= p1570)) AND F ((p6147 <= 2))))",
"processed_size": 51,
"rewrites": 72
},
"result":
{
"edges": 223,
"markings": 223,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"error": null,
"memory": 3872,
"runtime": 2298.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(X(X(G(**))) U (X((** U G(**))) U **)) : (G(F((G(*) OR (* AND *)))) OR X(*)) : X((F(**) AND G(*))) : G(F((X(X(G(**))) AND **))) : F((G(*) AND F(*))) : (G((G(**) OR *)) OR (X(**) OR **)) : F(G(((X(X(F(**))) OR *) R X(*)))) : ((** U ((X((F(*) OR **)) OR **) AND **)) OR **) : X(G(**)) : X((F(G((G(**) OR **))) OR X(F(**)))) : G((X(X(F(**))) OR **))"
},
"net":
{
"arcs": 46000,
"conflict_clusters": 8001,
"places": 10000,
"places_significant": 8000,
"singleton_clusters": 0,
"transitions": 16001
},
"result":
{
"preliminary_value": "no no unknown unknown no yes unknown no unknown unknown unknown ",
"value": "no no unknown unknown no yes unknown no unknown unknown unknown "
},
"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: 26001/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 320000
lola: finding significant places
lola: 10000 places, 16001 transitions, 8000 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from LTLCardinality.xml
lola: (G (X (G (X ((1 <= p9718))))) U (X (((3 <= p261) U G ((3 <= p261)))) U (1 <= p9718))) : (NOT(F (NOT(F (G (F (NOT(((p7787 <= 1) U (2 <= p4770))))))))) OR NOT(X ((p7156 <= p9075)))) : (X (F (((p318 + 1 <= p6617) AND (p550 <= p5547)))) AND G (X (NOT(((1 <= p8681) U F ((p6617 <= p318))))))) : G (F ((F ((p8213 <= p75)) U (G (X (X ((p2059 <= p7005)))) AND (3 <= p5618))))) : F ((NOT(F ((p1570 <= p3909))) AND (X ((p1570 <= p3909)) U F (NOT(G ((3 <= p6147))))))) : ((NOT(F ((NOT(G ((p4715 <= p6121))) AND (p1205 + 1 <= p2062)))) OR X ((p9938 <= 2))) OR ((p2062 <= p1205) AND (p4715 <= p6121))) : X (F (G (X (NOT(((NOT(F (X (X ((p6914 <= p7570))))) AND (2 <= p4362)) U X ((p2332 <= p95)))))))) : (((p2803 + 1 <= p1620) U ((X ((NOT(G ((p6844 <= p5562))) OR (p6844 <= p5562))) OR (p6844 <= p5562)) AND (1 <= p133))) OR (1 <= p7568)) : G (X (((p3169 + 1 <= p4863) OR (p9284 + 1 <= p3190)))) : X ((F (G ((G ((3 <= p493)) OR (p7301 <= p6512)))) OR F (X ((p1336 <= p4513))))) : G ((X (X (F ((2 <= p2909)))) OR (p3835 <= p4715)))
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
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:371
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:341
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:525
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 285 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (X (G ((1 <= p9718)))) U (X (((3 <= p261) U G ((3 <= p261)))) U (1 <= p9718)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (X (X (G ((1 <= p9718)))) U (X (((3 <= p261) U G ((3 <= p261)))) U (1 <= p9718)))
lola: processed formula length: 81
lola: 72 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 20 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 6002 markings, 6002 edges
lola: ========================================
lola: subprocess 1 will run for 313 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G (F ((G ((p4770 <= 1)) OR ((2 <= p7787) AND (p4770 <= 1))))) OR X ((p9075 + 1 <= p7156)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 313 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((G ((p4770 <= 1)) OR ((2 <= p7787) AND (p4770 <= 1)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((G ((p4770 <= 1)) OR ((2 <= p7787) AND (p4770 <= 1)))))
lola: processed formula length: 61
lola: 72 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 223 markings, 223 edges
lola: ========================================
lola: subprocess 2 will run for 348 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((p9075 + 1 <= p7156))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((p9075 + 1 <= p7156))
lola: processed formula length: 24
lola: 72 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 6002 markings, 6002 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 348 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((F (((p318 + 1 <= p6617) AND (p550 <= p5547))) AND G ((p318 + 1 <= p6617))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((F (((p318 + 1 <= p6617) AND (p550 <= p5547))) AND G ((p318 + 1 <= p6617))))
lola: processed formula length: 79
lola: 72 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 36862 markings, 51015 edges, 7372 markings/sec, 0 secs
lola: 72971 markings, 102915 edges, 7222 markings/sec, 5 secs
lola: 108990 markings, 154762 edges, 7204 markings/sec, 10 secs
lola: 146138 markings, 206277 edges, 7430 markings/sec, 15 secs
lola: 181698 markings, 259510 edges, 7112 markings/sec, 20 secs
lola: 219240 markings, 311726 edges, 7508 markings/sec, 25 secs
lola: 256326 markings, 364119 edges, 7417 markings/sec, 30 secs
lola: 292271 markings, 417037 edges, 7189 markings/sec, 35 secs
lola: 329823 markings, 469271 edges, 7510 markings/sec, 40 secs
lola: 366257 markings, 521954 edges, 7287 markings/sec, 45 secs
lola: 402940 markings, 574732 edges, 7337 markings/sec, 50 secs
lola: 440610 markings, 627173 edges, 7534 markings/sec, 55 secs
lola: 476606 markings, 680208 edges, 7199 markings/sec, 60 secs
lola: 513776 markings, 732721 edges, 7434 markings/sec, 65 secs
lola: 551387 markings, 785058 edges, 7522 markings/sec, 70 secs
lola: 586870 markings, 838153 edges, 7097 markings/sec, 75 secs
lola: 624438 markings, 890404 edges, 7514 markings/sec, 80 secs
lola: 650153 markings, 926480 edges, 5143 markings/sec, 85 secs
lola: 667993 markings, 953172 edges, 3568 markings/sec, 90 secs
lola: 687350 markings, 980780 edges, 3871 markings/sec, 95 secs
lola: 708100 markings, 1009833 edges, 4150 markings/sec, 100 secs
lola: 726390 markings, 1037350 edges, 3658 markings/sec, 105 secs
lola: 751969 markings, 1073114 edges, 5116 markings/sec, 110 secs
lola: 773554 markings, 1102908 edges, 4317 markings/sec, 115 secs
lola: 798544 markings, 1139874 edges, 4998 markings/sec, 120 secs
lola: 808289 markings, 1153687 edges, 1949 markings/sec, 125 secs
lola: 811730 markings, 1159049 edges, 688 markings/sec, 130 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 3 will run for 372 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((X (X (G ((p2059 <= p7005)))) AND (3 <= p5618))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((X (X (G ((p2059 <= p7005)))) AND (3 <= p5618))))
lola: processed formula length: 55
lola: 72 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 7 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 22872 markings, 36458 edges, 4574 markings/sec, 0 secs
lola: 53367 markings, 90072 edges, 6099 markings/sec, 5 secs
lola: 84262 markings, 144219 edges, 6179 markings/sec, 10 secs
lola: 117381 markings, 197322 edges, 6624 markings/sec, 15 secs
lola: 148321 markings, 251218 edges, 6188 markings/sec, 20 secs
lola: 177943 markings, 302865 edges, 5924 markings/sec, 25 secs
lola: 207892 markings, 355254 edges, 5990 markings/sec, 30 secs
lola: 238696 markings, 408568 edges, 6161 markings/sec, 35 secs
lola: 269618 markings, 459475 edges, 6184 markings/sec, 40 secs
lola: 301006 markings, 512256 edges, 6278 markings/sec, 45 secs
lola: 331382 markings, 565602 edges, 6075 markings/sec, 50 secs
lola: 361486 markings, 618335 edges, 6021 markings/sec, 55 secs
lola: 392195 markings, 671980 edges, 6142 markings/sec, 60 secs
lola: 425283 markings, 725053 edges, 6618 markings/sec, 65 secs
lola: 456236 markings, 779020 edges, 6191 markings/sec, 70 secs
lola: 487088 markings, 833437 edges, 6170 markings/sec, 75 secs
lola: 517548 markings, 886972 edges, 6092 markings/sec, 80 secs
lola: 549941 markings, 939644 edges, 6479 markings/sec, 85 secs
lola: 580898 markings, 992010 edges, 6191 markings/sec, 90 secs
lola: 611252 markings, 1045305 edges, 6071 markings/sec, 95 secs
lola: 641716 markings, 1098848 edges, 6093 markings/sec, 100 secs
lola: 672820 markings, 1152452 edges, 6221 markings/sec, 105 secs
lola: 704762 markings, 1204379 edges, 6388 markings/sec, 110 secs
lola: 735528 markings, 1257426 edges, 6153 markings/sec, 115 secs
lola: 766071 markings, 1311145 edges, 6109 markings/sec, 120 secs
lola: 796645 markings, 1364939 edges, 6115 markings/sec, 125 secs
lola: 827713 markings, 1417269 edges, 6214 markings/sec, 130 secs
lola: 844237 markings, 1443787 edges, 3305 markings/sec, 135 secs
lola: 866870 markings, 1485451 edges, 4527 markings/sec, 140 secs
lola: 884818 markings, 1514334 edges, 3590 markings/sec, 145 secs
lola: 892927 markings, 1529070 edges, 1622 markings/sec, 150 secs
lola: 915833 markings, 1565605 edges, 4581 markings/sec, 155 secs
lola: 915833 markings, 1565605 edges, 0 markings/sec, 160 secs
lola: 920738 markings, 1576644 edges, 981 markings/sec, 165 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 399 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G ((G ((p4715 <= p6121)) OR (p2062 <= p1205))) OR (X ((p9938 <= 2)) OR ((p2062 <= p1205) AND (p4715 <= p6121))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 399 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p2062 <= p1205) AND (p4715 <= p6121))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p2062 <= p1205) AND (p4715 <= p6121))
lola: processed formula length: 39
lola: 72 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 5 will run for 465 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((G ((p4715 <= p6121)) OR (p2062 <= p1205)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((G ((p4715 <= p6121)) OR (p2062 <= p1205)))
lola: processed formula length: 46
lola: 72 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 14 markings, 14 edges
lola: ========================================
lola: subprocess 6 will run for 559 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((p9938 <= 2))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((p9938 <= 2))
lola: processed formula length: 16
lola: 72 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 4002 markings, 4001 edges
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: subprocess 5 will run for 465 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((X (X (F ((p6914 <= p7570)))) OR (p4362 <= 1)) R X ((p95 + 1 <= p2332)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G (((X (X (F ((p6914 <= p7570)))) OR (p4362 <= 1)) R X ((p95 + 1 <= p2332)))))
lola: processed formula length: 81
lola: 72 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 28756 markings, 35937 edges, 5751 markings/sec, 0 secs
lola: 67671 markings, 86394 edges, 7783 markings/sec, 5 secs
lola: 102075 markings, 132018 edges, 6881 markings/sec, 10 secs
lola: 140997 markings, 182918 edges, 7784 markings/sec, 15 secs
lola: 179912 markings, 233811 edges, 7783 markings/sec, 20 secs
lola: 219169 markings, 284833 edges, 7851 markings/sec, 25 secs
lola: 258342 markings, 335653 edges, 7835 markings/sec, 30 secs
lola: 297542 markings, 386516 edges, 7840 markings/sec, 35 secs
lola: 336768 markings, 437411 edges, 7845 markings/sec, 40 secs
lola: 373962 markings, 485409 edges, 7439 markings/sec, 45 secs
lola: 413001 markings, 536038 edges, 7808 markings/sec, 50 secs
lola: 452225 markings, 586935 edges, 7845 markings/sec, 55 secs
lola: 474314 markings, 615922 edges, 4418 markings/sec, 60 secs
lola: 513331 markings, 666519 edges, 7803 markings/sec, 65 secs
lola: 552506 markings, 717348 edges, 7835 markings/sec, 70 secs
lola: 591593 markings, 768041 edges, 7817 markings/sec, 75 secs
lola: 631018 markings, 819229 edges, 7885 markings/sec, 80 secs
lola: 670385 markings, 870324 edges, 7873 markings/sec, 85 secs
lola: 709620 markings, 921240 edges, 7847 markings/sec, 90 secs
lola: 749009 markings, 972365 edges, 7878 markings/sec, 95 secs
lola: 788022 markings, 1022974 edges, 7803 markings/sec, 100 secs
lola: 809234 markings, 1050830 edges, 4242 markings/sec, 105 secs
lola: 827736 markings, 1074567 edges, 3700 markings/sec, 110 secs
lola: 850614 markings, 1104667 edges, 4576 markings/sec, 115 secs
lola: 864620 markings, 1122115 edges, 2801 markings/sec, 120 secs
lola: 886492 markings, 1150781 edges, 4374 markings/sec, 125 secs
lola: 886492 markings, 1150781 edges, 0 markings/sec, 130 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 6 will run for 529 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p2803 + 1 <= p1620) U ((X ((F ((p5562 + 1 <= p6844)) OR (p6844 <= p5562))) OR (p6844 <= p5562)) AND (1 <= p133))) OR (1 <= p7568))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 529 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= p7568)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p7568)
lola: processed formula length: 12
lola: 72 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 7 will run for 661 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p2803 + 1 <= p1620) U ((X ((F ((p5562 + 1 <= p6844)) OR (p6844 <= p5562))) OR (p6844 <= p5562)) AND (1 <= p133)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((p2803 + 1 <= p1620) U ((X ((F ((p5562 + 1 <= p6844)) OR (p6844 <= p5562))) OR (p6844 <= p5562)) AND (1 <= p133)))
lola: processed formula length: 115
lola: 72 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 2128 markings, 2127 edges, 426 markings/sec, 0 secs
lola: 2128 markings, 2127 edges, 0 markings/sec, 5 secs
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 6002 markings, 6002 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 7 will run for 658 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G (((p3169 + 1 <= p4863) OR (p9284 + 1 <= p3190))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G (((p3169 + 1 <= p4863) OR (p9284 + 1 <= p3190))))
lola: processed formula length: 55
lola: 72 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 33212 markings, 45189 edges, 6642 markings/sec, 0 secs
lola: 62373 markings, 86662 edges, 5832 markings/sec, 5 secs
lola: 91648 markings, 128904 edges, 5855 markings/sec, 10 secs
lola: 121849 markings, 172759 edges, 6040 markings/sec, 15 secs
lola: 158681 markings, 224557 edges, 7366 markings/sec, 20 secs
lola: 194172 markings, 276844 edges, 7098 markings/sec, 25 secs
lola: 231344 markings, 328403 edges, 7434 markings/sec, 30 secs
lola: 267120 markings, 380901 edges, 7155 markings/sec, 35 secs
lola: 303923 markings, 432933 edges, 7361 markings/sec, 40 secs
lola: 340986 markings, 484704 edges, 7413 markings/sec, 45 secs
lola: 374098 markings, 533253 edges, 6622 markings/sec, 50 secs
lola: 400874 markings, 571115 edges, 5355 markings/sec, 55 secs
lola: 429371 markings, 611996 edges, 5699 markings/sec, 60 secs
lola: 465992 markings, 663605 edges, 7324 markings/sec, 65 secs
lola: 490149 markings, 699740 edges, 4831 markings/sec, 70 secs
lola: 527076 markings, 751501 edges, 7385 markings/sec, 75 secs
lola: 563950 markings, 803479 edges, 7375 markings/sec, 80 secs
lola: 599154 markings, 855153 edges, 7041 markings/sec, 85 secs
lola: 636040 markings, 906214 edges, 7377 markings/sec, 90 secs
lola: 670793 markings, 958043 edges, 6951 markings/sec, 95 secs
lola: 706952 markings, 1007826 edges, 7232 markings/sec, 100 secs
lola: 732843 markings, 1044237 edges, 5178 markings/sec, 105 secs
lola: 750003 markings, 1069696 edges, 3432 markings/sec, 110 secs
lola: 781507 markings, 1115819 edges, 6301 markings/sec, 115 secs
lola: 782791 markings, 1118064 edges, 257 markings/sec, 120 secs
lola: 808054 markings, 1153277 edges, 5053 markings/sec, 125 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 8 will run for 830 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((F (G ((G ((3 <= p493)) OR (p7301 <= p6512)))) OR X (F ((p1336 <= p4513)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((F (G ((G ((3 <= p493)) OR (p7301 <= p6512)))) OR X (F ((p1336 <= p4513)))))
lola: processed formula length: 79
lola: 72 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 26150 markings, 36764 edges, 5230 markings/sec, 0 secs
lola: 53365 markings, 75402 edges, 5443 markings/sec, 5 secs
lola: 78501 markings, 110392 edges, 5027 markings/sec, 10 secs
lola: 101688 markings, 143609 edges, 4637 markings/sec, 15 secs
lola: 137372 markings, 195430 edges, 7137 markings/sec, 20 secs
lola: 174258 markings, 246489 edges, 7377 markings/sec, 25 secs
lola: 209297 markings, 298817 edges, 7008 markings/sec, 30 secs
lola: 246495 markings, 350422 edges, 7440 markings/sec, 35 secs
lola: 281985 markings, 401751 edges, 7098 markings/sec, 40 secs
lola: 318203 markings, 453427 edges, 7244 markings/sec, 45 secs
lola: 354770 markings, 504477 edges, 7313 markings/sec, 50 secs
lola: 385326 markings, 548412 edges, 6111 markings/sec, 55 secs
lola: 419448 markings, 599097 edges, 6824 markings/sec, 60 secs
lola: 445013 markings, 634878 edges, 5113 markings/sec, 65 secs
lola: 481218 markings, 684819 edges, 7241 markings/sec, 70 secs
lola: 502715 markings, 717869 edges, 4299 markings/sec, 75 secs
lola: 539387 markings, 768548 edges, 7334 markings/sec, 80 secs
lola: 575097 markings, 820616 edges, 7142 markings/sec, 85 secs
lola: 610903 markings, 871222 edges, 7161 markings/sec, 90 secs
lola: 646905 markings, 922366 edges, 7200 markings/sec, 95 secs
lola: 682345 markings, 973755 edges, 7088 markings/sec, 100 secs
lola: 717813 markings, 1023222 edges, 7094 markings/sec, 105 secs
lola: 749704 markings, 1069160 edges, 6378 markings/sec, 110 secs
lola: 751013 markings, 1071441 edges, 262 markings/sec, 115 secs
lola: 778528 markings, 1110608 edges, 5503 markings/sec, 120 secs
lola: 784009 markings, 1119349 edges, 1096 markings/sec, 125 secs
lola: 804832 markings, 1147638 edges, 4165 markings/sec, 130 secs
lola: 818012 markings, 1166205 edges, 2636 markings/sec, 135 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 9 will run for 1172 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((X (X (F ((2 <= p2909)))) OR (p3835 <= p4715)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((X (X (F ((2 <= p2909)))) OR (p3835 <= p4715)))
lola: processed formula length: 50
lola: 72 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 26532 markings, 37434 edges, 5306 markings/sec, 0 secs
lola: 63698 markings, 88981 edges, 7433 markings/sec, 5 secs
lola: 99328 markings, 141249 edges, 7126 markings/sec, 10 secs
lola: 135979 markings, 192993 edges, 7330 markings/sec, 15 secs
lola: 172526 markings, 244388 edges, 7309 markings/sec, 20 secs
lola: 207857 markings, 296297 edges, 7066 markings/sec, 25 secs
lola: 244884 markings, 347602 edges, 7405 markings/sec, 30 secs
lola: 279954 markings, 399720 edges, 7014 markings/sec, 35 secs
lola: 295897 markings, 421652 edges, 3189 markings/sec, 40 secs
lola: 331381 markings, 471996 edges, 7097 markings/sec, 45 secs
lola: 354670 markings, 504378 edges, 4658 markings/sec, 50 secs
lola: 389711 markings, 556085 edges, 7008 markings/sec, 55 secs
lola: 426268 markings, 606567 edges, 7311 markings/sec, 60 secs
lola: 461025 markings, 658394 edges, 6951 markings/sec, 65 secs
lola: 498072 markings, 709743 edges, 7409 markings/sec, 70 secs
lola: 533082 markings, 760637 edges, 7002 markings/sec, 75 secs
lola: 569268 markings, 811847 edges, 7237 markings/sec, 80 secs
lola: 605028 markings, 862524 edges, 7152 markings/sec, 85 secs
lola: 641070 markings, 915013 edges, 7208 markings/sec, 90 secs
lola: 678235 markings, 966563 edges, 7433 markings/sec, 95 secs
lola: 713707 markings, 1019115 edges, 7094 markings/sec, 100 secs
lola: 744821 markings, 1062204 edges, 6223 markings/sec, 105 secs
lola: 745218 markings, 1062594 edges, 79 markings/sec, 110 secs
lola: 772862 markings, 1102224 edges, 5529 markings/sec, 115 secs
lola: 782986 markings, 1118326 edges, 2025 markings/sec, 120 secs
lola: 795580 markings, 1135943 edges, 2519 markings/sec, 125 secs
lola: 817913 markings, 1166032 edges, 4467 markings/sec, 130 secs
lola: 820139 markings, 1169929 edges, 445 markings/sec, 135 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 10 will run for 2202 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((G ((p3909 + 1 <= p1570)) AND F ((p6147 <= 2))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((G ((p3909 + 1 <= p1570)) AND F ((p6147 <= 2))))
lola: processed formula length: 51
lola: 72 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 223 markings, 223 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: X ((F (((p318 + 1 <= p6617) AND (p550 <= p5547))) AND G ((p318 + 1 <= p6617))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((F (((p318 + 1 <= p6617) AND (p550 <= p5547))) AND G ((p318 + 1 <= p6617))))
lola: processed formula length: 79
lola: 72 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 22077 markings, 29636 edges, 4415 markings/sec, 0 secs
lola: 57366 markings, 81318 edges, 7058 markings/sec, 5 secs
lola: 93948 markings, 132930 edges, 7316 markings/sec, 10 secs
lola: 130865 markings, 184764 edges, 7383 markings/sec, 15 secs
lola: 166311 markings, 237086 edges, 7089 markings/sec, 20 secs
lola: 203471 markings, 288622 edges, 7432 markings/sec, 25 secs
lola: 239442 markings, 341246 edges, 7194 markings/sec, 30 secs
lola: 275822 markings, 392756 edges, 7276 markings/sec, 35 secs
lola: 312019 markings, 443764 edges, 7239 markings/sec, 40 secs
lola: 347720 markings, 496085 edges, 7140 markings/sec, 45 secs
lola: 383983 markings, 546062 edges, 7253 markings/sec, 50 secs
lola: 418989 markings, 598322 edges, 7001 markings/sec, 55 secs
lola: 456092 markings, 649760 edges, 7421 markings/sec, 60 secs
lola: 492133 markings, 701723 edges, 7208 markings/sec, 65 secs
lola: 527958 markings, 753045 edges, 7165 markings/sec, 70 secs
lola: 564880 markings, 804409 edges, 7384 markings/sec, 75 secs
lola: 599548 markings, 855843 edges, 6934 markings/sec, 80 secs
lola: 636054 markings, 906236 edges, 7301 markings/sec, 85 secs
lola: 670876 markings, 958188 edges, 6964 markings/sec, 90 secs
lola: 707756 markings, 1009233 edges, 7376 markings/sec, 95 secs
lola: 734029 markings, 1046218 edges, 5255 markings/sec, 100 secs
lola: 752080 markings, 1073367 edges, 3610 markings/sec, 105 secs
lola: 782873 markings, 1118210 edges, 6159 markings/sec, 110 secs
lola: 817568 markings, 1165536 edges, 6939 markings/sec, 115 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: G (F ((X (X (G ((p2059 <= p7005)))) AND (3 <= p5618))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((X (X (G ((p2059 <= p7005)))) AND (3 <= p5618))))
lola: processed formula length: 55
lola: 72 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 7 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 22421 markings, 35445 edges, 4484 markings/sec, 0 secs
lola: 53109 markings, 89489 edges, 6138 markings/sec, 5 secs
lola: 83882 markings, 143731 edges, 6155 markings/sec, 10 secs
lola: 116878 markings, 196819 edges, 6599 markings/sec, 15 secs
lola: 147969 markings, 250426 edges, 6218 markings/sec, 20 secs
lola: 178603 markings, 304353 edges, 6127 markings/sec, 25 secs
lola: 209294 markings, 358407 edges, 6138 markings/sec, 30 secs
lola: 241805 markings, 411678 edges, 6502 markings/sec, 35 secs
lola: 273247 markings, 464800 edges, 6288 markings/sec, 40 secs
lola: 303590 markings, 518070 edges, 6069 markings/sec, 45 secs
lola: 333817 markings, 571079 edges, 6045 markings/sec, 50 secs
lola: 365170 markings, 624970 edges, 6271 markings/sec, 55 secs
lola: 397553 markings, 677338 edges, 6477 markings/sec, 60 secs
lola: 428040 markings, 730579 edges, 6097 markings/sec, 65 secs
lola: 458477 markings, 784062 edges, 6087 markings/sec, 70 secs
lola: 489037 markings, 837821 edges, 6112 markings/sec, 75 secs
lola: 521111 markings, 890828 edges, 6415 markings/sec, 80 secs
lola: 552906 markings, 944029 edges, 6359 markings/sec, 85 secs
lola: 583613 markings, 998119 edges, 6141 markings/sec, 90 secs
lola: 614304 markings, 1052172 edges, 6138 markings/sec, 95 secs
lola: 646221 markings, 1105870 edges, 6383 markings/sec, 100 secs
lola: 678506 markings, 1159125 edges, 6457 markings/sec, 105 secs
lola: 709459 markings, 1213769 edges, 6191 markings/sec, 110 secs
lola: 740437 markings, 1268470 edges, 6196 markings/sec, 115 secs
lola: 756821 markings, 1296408 edges, 3277 markings/sec, 120 secs
lola: 790227 markings, 1350499 edges, 6681 markings/sec, 125 secs
lola: 820617 markings, 1403882 edges, 6078 markings/sec, 130 secs
lola: 847026 markings, 1448297 edges, 5282 markings/sec, 135 secs
lola: 853641 markings, 1463173 edges, 1323 markings/sec, 140 secs
lola: 856545 markings, 1466078 edges, 581 markings/sec, 145 secs
lola: 885653 markings, 1515174 edges, 5822 markings/sec, 150 secs
lola: 886575 markings, 1516091 edges, 184 markings/sec, 155 secs
lola: 886575 markings, 1516091 edges, 0 markings/sec, 160 secs
lola: 907020 markings, 1553279 edges, 4089 markings/sec, 165 secs
lola: 917538 markings, 1569441 edges, 2104 markings/sec, 170 secs
lola: 917538 markings, 1569441 edges, 0 markings/sec, 175 secs
lola: 941741 markings, 1611226 edges, 4841 markings/sec, 180 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: F (G (((X (X (F ((p6914 <= p7570)))) OR (p4362 <= 1)) R X ((p95 + 1 <= p2332)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G (((X (X (F ((p6914 <= p7570)))) OR (p4362 <= 1)) R X ((p95 + 1 <= p2332)))))
lola: processed formula length: 81
lola: 72 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 28254 markings, 35222 edges, 5651 markings/sec, 0 secs
lola: 67318 markings, 85891 edges, 7813 markings/sec, 5 secs
lola: 106304 markings, 136443 edges, 7797 markings/sec, 10 secs
lola: 145076 markings, 186997 edges, 7754 markings/sec, 15 secs
lola: 183451 markings, 237349 edges, 7675 markings/sec, 20 secs
lola: 222296 markings, 288172 edges, 7769 markings/sec, 25 secs
lola: 261061 markings, 338912 edges, 7753 markings/sec, 30 secs
lola: 299636 markings, 389465 edges, 7715 markings/sec, 35 secs
lola: 335822 markings, 436061 edges, 7237 markings/sec, 40 secs
lola: 367922 markings, 476780 edges, 6420 markings/sec, 45 secs
lola: 401849 markings, 521615 edges, 6785 markings/sec, 50 secs
lola: 433952 markings, 563399 edges, 6421 markings/sec, 55 secs
lola: 472879 markings, 613872 edges, 7785 markings/sec, 60 secs
lola: 511868 markings, 664427 edges, 7798 markings/sec, 65 secs
lola: 540125 markings, 701809 edges, 5651 markings/sec, 70 secs
lola: 574097 markings, 745617 edges, 6794 markings/sec, 75 secs
lola: 611451 markings, 793843 edges, 7471 markings/sec, 80 secs
lola: 644279 markings, 835903 edges, 6566 markings/sec, 85 secs
lola: 672447 markings, 873271 edges, 5634 markings/sec, 90 secs
lola: 711006 markings, 923218 edges, 7712 markings/sec, 95 secs
lola: 737929 markings, 959107 edges, 5385 markings/sec, 100 secs
lola: 776568 markings, 1009167 edges, 7728 markings/sec, 105 secs
lola: 794633 markings, 1032408 edges, 3613 markings/sec, 110 secs
lola: 811560 markings, 1054035 edges, 3385 markings/sec, 115 secs
lola: 846526 markings, 1098836 edges, 6993 markings/sec, 120 secs
lola: 848015 markings, 1100956 edges, 298 markings/sec, 125 secs
lola: 848015 markings, 1100956 edges, 0 markings/sec, 130 secs
lola: 871670 markings, 1132181 edges, 4731 markings/sec, 135 secs
lola: 890790 markings, 1156921 edges, 3824 markings/sec, 140 secs
lola: 890790 markings, 1156921 edges, 0 markings/sec, 145 secs
lola: 891290 markings, 1157637 edges, 100 markings/sec, 150 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: X (G (((p3169 + 1 <= p4863) OR (p9284 + 1 <= p3190))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G (((p3169 + 1 <= p4863) OR (p9284 + 1 <= p3190))))
lola: processed formula length: 55
lola: 72 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 5681 markings, 5680 edges, 1136 markings/sec, 0 secs
lola: 39992 markings, 56493 edges, 6862 markings/sec, 5 secs
lola: 77165 markings, 108055 edges, 7435 markings/sec, 10 secs
lola: 112463 markings, 160370 edges, 7060 markings/sec, 15 secs
lola: 149299 markings, 211808 edges, 7367 markings/sec, 20 secs
lola: 185387 markings, 263238 edges, 7218 markings/sec, 25 secs
lola: 221316 markings, 315358 edges, 7186 markings/sec, 30 secs
lola: 257991 markings, 366042 edges, 7335 markings/sec, 35 secs
lola: 292554 markings, 417531 edges, 6913 markings/sec, 40 secs
lola: 329276 markings, 468312 edges, 7344 markings/sec, 45 secs
lola: 364677 markings, 520374 edges, 7080 markings/sec, 50 secs
lola: 401224 markings, 571728 edges, 7309 markings/sec, 55 secs
lola: 437365 markings, 623003 edges, 7228 markings/sec, 60 secs
lola: 472944 markings, 674758 edges, 7116 markings/sec, 65 secs
lola: 509719 markings, 725621 edges, 7355 markings/sec, 70 secs
lola: 544314 markings, 777169 edges, 6919 markings/sec, 75 secs
lola: 581269 markings, 828350 edges, 7391 markings/sec, 80 secs
lola: 616241 markings, 879723 edges, 6994 markings/sec, 85 secs
lola: 652132 markings, 929878 edges, 7178 markings/sec, 90 secs
lola: 687859 markings, 981283 edges, 7145 markings/sec, 95 secs
lola: 721502 markings, 1028798 edges, 6729 markings/sec, 100 secs
lola: 746444 markings, 1063840 edges, 4988 markings/sec, 105 secs
lola: 778458 markings, 1110484 edges, 6403 markings/sec, 110 secs
lola: 810917 markings, 1158236 edges, 6492 markings/sec, 115 secs
lola: 812160 markings, 1159478 edges, 249 markings/sec, 120 secs
lola: 812160 markings, 1159478 edges, 0 markings/sec, 125 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: X ((F (G ((G ((3 <= p493)) OR (p7301 <= p6512)))) OR X (F ((p1336 <= p4513)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((F (G ((G ((3 <= p493)) OR (p7301 <= p6512)))) OR X (F ((p1336 <= p4513)))))
lola: processed formula length: 79
lola: 72 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 383 markings, 382 edges, 77 markings/sec, 0 secs
lola: 10120 markings, 13207 edges, 1947 markings/sec, 5 secs
lola: 37387 markings, 51934 edges, 5453 markings/sec, 10 secs
lola: 72147 markings, 102091 edges, 6952 markings/sec, 15 secs
lola: 108663 markings, 154189 edges, 7303 markings/sec, 20 secs
lola: 145602 markings, 205490 edges, 7388 markings/sec, 25 secs
lola: 180718 markings, 257795 edges, 7023 markings/sec, 30 secs
lola: 218097 markings, 309724 edges, 7476 markings/sec, 35 secs
lola: 253602 markings, 361395 edges, 7101 markings/sec, 40 secs
lola: 290095 markings, 413228 edges, 7299 markings/sec, 45 secs
lola: 327308 markings, 465041 edges, 7443 markings/sec, 50 secs
lola: 362526 markings, 517500 edges, 7044 markings/sec, 55 secs
lola: 399817 markings, 569266 edges, 7458 markings/sec, 60 secs
lola: 435687 markings, 621325 edges, 7174 markings/sec, 65 secs
lola: 472062 markings, 673213 edges, 7275 markings/sec, 70 secs
lola: 509331 markings, 724942 edges, 7454 markings/sec, 75 secs
lola: 544460 markings, 777426 edges, 7026 markings/sec, 80 secs
lola: 581723 markings, 829145 edges, 7453 markings/sec, 85 secs
lola: 617619 markings, 881100 edges, 7179 markings/sec, 90 secs
lola: 654298 markings, 933670 edges, 7336 markings/sec, 95 secs
lola: 691836 markings, 985869 edges, 7508 markings/sec, 100 secs
lola: 723866 markings, 1032951 edges, 6406 markings/sec, 105 secs
lola: 751655 markings, 1072680 edges, 5558 markings/sec, 110 secs
lola: 784255 markings, 1119602 edges, 6520 markings/sec, 115 secs
lola: 785732 markings, 1121072 edges, 295 markings/sec, 120 secs
lola: 812059 markings, 1159382 edges, 5265 markings/sec, 125 secs
lola: 817996 markings, 1166180 edges, 1187 markings/sec, 130 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: G ((X (X (F ((2 <= p2909)))) OR (p3835 <= p4715)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((X (X (F ((2 <= p2909)))) OR (p3835 <= p4715)))
lola: processed formula length: 50
lola: 72 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 25355 markings, 35372 edges, 5071 markings/sec, 0 secs
lola: 62514 markings, 86908 edges, 7432 markings/sec, 5 secs
lola: 97633 markings, 139378 edges, 7024 markings/sec, 10 secs
lola: 134763 markings, 190865 edges, 7426 markings/sec, 15 secs
lola: 170761 markings, 242622 edges, 7200 markings/sec, 20 secs
lola: 206463 markings, 293857 edges, 7140 markings/sec, 25 secs
lola: 243545 markings, 345349 edges, 7416 markings/sec, 30 secs
lola: 278416 markings, 397295 edges, 6974 markings/sec, 35 secs
lola: 314942 markings, 447720 edges, 7305 markings/sec, 40 secs
lola: 350014 markings, 499722 edges, 7014 markings/sec, 45 secs
lola: 386842 markings, 551065 edges, 7366 markings/sec, 50 secs
lola: 423013 markings, 602663 edges, 7234 markings/sec, 55 secs
lola: 458584 markings, 654122 edges, 7114 markings/sec, 60 secs
lola: 495335 markings, 704953 edges, 7350 markings/sec, 65 secs
lola: 530258 markings, 757068 edges, 6985 markings/sec, 70 secs
lola: 567114 markings, 808076 edges, 7371 markings/sec, 75 secs
lola: 603059 markings, 860554 edges, 7189 markings/sec, 80 secs
lola: 639835 markings, 912853 edges, 7355 markings/sec, 85 secs
lola: 677410 markings, 965119 edges, 7515 markings/sec, 90 secs
lola: 696549 markings, 994115 edges, 3828 markings/sec, 95 secs
lola: 729831 markings, 1041225 edges, 6656 markings/sec, 100 secs
lola: 739001 markings, 1054916 edges, 1834 markings/sec, 105 secs
lola: 755007 markings, 1078383 edges, 3201 markings/sec, 110 secs
lola: 765168 markings, 1091717 edges, 2032 markings/sec, 115 secs
lola: 777796 markings, 1109325 edges, 2526 markings/sec, 120 secs
lola: 792408 markings, 1130390 edges, 2922 markings/sec, 125 secs
lola: 816888 markings, 1164240 edges, 4896 markings/sec, 130 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: no no unknown unknown no yes unknown no unknown unknown unknown
lola:
preliminary result: no no unknown unknown no yes unknown no unknown unknown unknown
lola: memory consumption: 3872 KB
lola: time consumption: 2298 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.json
rslt: finished

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="JoinFreeModules-PT-2000"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="gold2020"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool gold2020"
echo " Input is JoinFreeModules-PT-2000, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r132-tall-162075428400233"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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