About the Execution of ITS-LoLa for Diffusion2D-PT-D30N150
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
15743.610 | 3600000.00 | 692114.00 | 165.90 | FTFFFFFFFFFTFFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2020-input.r178-tajo-158987882500513.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is Diffusion2D-PT-D30N150, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-tajo-158987882500513
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.2M
-rw-r--r-- 1 mcc users 4.6K Mar 31 06:34 CTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 31 06:34 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Mar 29 22:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 29 22:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.8K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.2K Apr 8 14:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 8 14:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.4K Mar 28 14:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 28 14:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.6K Mar 27 07:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 27 07:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 28 14:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Mar 28 14:50 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 8 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 3.0M 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 Diffusion2D-PT-D30N150-00
FORMULA_NAME Diffusion2D-PT-D30N150-01
FORMULA_NAME Diffusion2D-PT-D30N150-02
FORMULA_NAME Diffusion2D-PT-D30N150-03
FORMULA_NAME Diffusion2D-PT-D30N150-04
FORMULA_NAME Diffusion2D-PT-D30N150-05
FORMULA_NAME Diffusion2D-PT-D30N150-06
FORMULA_NAME Diffusion2D-PT-D30N150-07
FORMULA_NAME Diffusion2D-PT-D30N150-08
FORMULA_NAME Diffusion2D-PT-D30N150-09
FORMULA_NAME Diffusion2D-PT-D30N150-10
FORMULA_NAME Diffusion2D-PT-D30N150-11
FORMULA_NAME Diffusion2D-PT-D30N150-12
FORMULA_NAME Diffusion2D-PT-D30N150-13
FORMULA_NAME Diffusion2D-PT-D30N150-14
FORMULA_NAME Diffusion2D-PT-D30N150-15
=== Now, execution of the tool begins
BK_START 1591225087964
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 22:58:09] [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]
[2020-06-03 22:58:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 22:58:09] [INFO ] Load time of PNML (sax parser for PT used): 220 ms
[2020-06-03 22:58:09] [INFO ] Transformed 900 places.
[2020-06-03 22:58:09] [INFO ] Transformed 6844 transitions.
[2020-06-03 22:58:09] [INFO ] Parsed PT model containing 900 places and 6844 transitions in 295 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 55 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100029 steps, including 0 resets, run finished after 64 ms. (steps per millisecond=1562 ) properties seen :[0, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 0, 1, 0, 1, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 1, 1]
// Phase 1: matrix 6844 rows 900 cols
[2020-06-03 22:58:10] [INFO ] Computed 1 place invariants in 58 ms
[2020-06-03 22:58:10] [INFO ] [Real]Absence check using 1 positive place invariants in 22 ms returned sat
[2020-06-03 22:58:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 22:58:16] [INFO ] [Real]Absence check using state equation in 6268 ms returned sat
[2020-06-03 22:58:16] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 22:58:17] [INFO ] [Nat]Absence check using 1 positive place invariants in 62 ms returned sat
[2020-06-03 22:58:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 22:58:23] [INFO ] [Nat]Absence check using state equation in 6250 ms returned sat
[2020-06-03 22:58:24] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints in 667 ms.
[2020-06-03 22:58:36] [INFO ] Added : 180 causal constraints over 36 iterations in 13306 ms. Result :(error "Failed to check-sat")
[2020-06-03 22:58:37] [INFO ] [Real]Absence check using 1 positive place invariants in 18 ms returned sat
[2020-06-03 22:58:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 22:58:45] [INFO ] [Real]Absence check using state equation in 8842 ms returned sat
[2020-06-03 22:58:46] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 22:58:46] [INFO ] [Nat]Absence check using 1 positive place invariants in 49 ms returned sat
[2020-06-03 22:58:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 22:58:52] [INFO ] [Nat]Absence check using state equation in 6750 ms returned sat
[2020-06-03 22:58:53] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints in 372 ms.
[2020-06-03 22:59:06] [INFO ] Added : 185 causal constraints over 37 iterations in 13042 ms. Result :unknown
[2020-06-03 22:59:06] [INFO ] [Real]Absence check using 1 positive place invariants in 16 ms returned sat
[2020-06-03 22:59:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 22:59:12] [INFO ] [Real]Absence check using state equation in 6664 ms returned sat
[2020-06-03 22:59:12] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 22:59:13] [INFO ] [Nat]Absence check using 1 positive place invariants in 81 ms returned sat
[2020-06-03 22:59:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 22:59:19] [INFO ] [Nat]Absence check using state equation in 6485 ms returned sat
[2020-06-03 22:59:20] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints in 370 ms.
[2020-06-03 22:59:32] [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: Stream closed (=> (> t105 0) (or (and (> t94 0) (< o94 o105)) (and (> t109 0) (< o109 o105)) (and (> t329 0) (< o329 o105)) (and (> t336 0) (< o336 o105)) (and (> t343 0) (< o343 o105)) (and (> t6705 0) (< o6705 o105)) (and (> t6712 0) (< o6712 o105)) (and (> t6719 0) (< o6719 o105))))") while checking expression at index 2
[2020-06-03 22:59:33] [INFO ] [Real]Absence check using 1 positive place invariants in 16 ms returned sat
[2020-06-03 22:59:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 22:59:39] [INFO ] [Real]Absence check using state equation in 6598 ms returned sat
[2020-06-03 22:59:39] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 22:59:39] [INFO ] [Nat]Absence check using 1 positive place invariants in 59 ms returned sat
[2020-06-03 22:59:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 22:59:46] [INFO ] [Nat]Absence check using state equation in 6525 ms returned sat
[2020-06-03 22:59:46] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints in 338 ms.
[2020-06-03 22:59:59] [INFO ] Added : 190 causal constraints over 38 iterations in 13335 ms. Result :(error "Failed to check-sat")
[2020-06-03 23:00:00] [INFO ] [Real]Absence check using 1 positive place invariants in 16 ms returned sat
[2020-06-03 23:00:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:00:06] [INFO ] [Real]Absence check using state equation in 6570 ms returned sat
[2020-06-03 23:00:06] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:00:06] [INFO ] [Nat]Absence check using 1 positive place invariants in 49 ms returned sat
[2020-06-03 23:00:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:00:13] [INFO ] [Nat]Absence check using state equation in 6295 ms returned sat
[2020-06-03 23:00:13] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints in 340 ms.
[2020-06-03 23:00:26] [INFO ] Added : 195 causal constraints over 39 iterations in 13415 ms. Result :(error "Solver has unexpectedly terminated")
[2020-06-03 23:00:26] [INFO ] [Real]Absence check using 1 positive place invariants in 7 ms returned unsat
[2020-06-03 23:00:26] [INFO ] [Real]Absence check using 1 positive place invariants in 18 ms returned sat
[2020-06-03 23:00:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:00:33] [INFO ] [Real]Absence check using state equation in 6714 ms returned sat
[2020-06-03 23:00:33] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:00:33] [INFO ] [Nat]Absence check using 1 positive place invariants in 56 ms returned sat
[2020-06-03 23:00:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:00:40] [INFO ] [Nat]Absence check using state equation in 6904 ms returned sat
[2020-06-03 23:00:41] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints in 446 ms.
[2020-06-03 23:00:53] [INFO ] Added : 190 causal constraints over 38 iterations in 12888 ms. Result :(error "Failed to check-sat")
[2020-06-03 23:00:53] [INFO ] [Real]Absence check using 1 positive place invariants in 8 ms returned unsat
[2020-06-03 23:00:54] [INFO ] [Real]Absence check using 1 positive place invariants in 17 ms returned sat
[2020-06-03 23:00:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:01:01] [INFO ] [Real]Absence check using state equation in 6975 ms returned sat
[2020-06-03 23:01:01] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints in 424 ms.
[2020-06-03 23:01:03] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:01:03] [INFO ] [Nat]Absence check using 1 positive place invariants in 42 ms returned sat
[2020-06-03 23:01:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:01:09] [INFO ] [Nat]Absence check using state equation in 6261 ms returned sat
[2020-06-03 23:01:10] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints in 371 ms.
[2020-06-03 23:01:23] [INFO ] Added : 205 causal constraints over 41 iterations in 13494 ms. Result :unknown
[2020-06-03 23:01:23] [INFO ] [Real]Absence check using 1 positive place invariants in 16 ms returned sat
[2020-06-03 23:01:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:01:30] [INFO ] [Real]Absence check using state equation in 6955 ms returned sat
[2020-06-03 23:01:30] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints in 396 ms.
[2020-06-03 23:01:31] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:01:31] [INFO ] [Nat]Absence check using 1 positive place invariants in 45 ms returned sat
[2020-06-03 23:01:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:01:38] [INFO ] [Nat]Absence check using state equation in 6401 ms returned sat
[2020-06-03 23:01:38] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints in 377 ms.
[2020-06-03 23:01:51] [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: Stream closed (=> (> t153 0) (or (and (> t142 0) (< o142 o153)) (and (> t157 0) (< o157 o153)) (and (> t377 0) (< o377 o153)) (and (> t384 0) (< o384 o153)) (and (> t391 0) (< o391 o153)) (and (> t6753 0) (< o6753 o153)) (and (> t6760 0) (< o6760 o153)) (and (> t6767 0) (< o6767 o153))))") while checking expression at index 9
[2020-06-03 23:01:51] [INFO ] [Real]Absence check using 1 positive place invariants in 12 ms returned sat
[2020-06-03 23:01:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:01:58] [INFO ] [Real]Absence check using state equation in 6601 ms returned sat
[2020-06-03 23:01:59] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints in 350 ms.
[2020-06-03 23:01:59] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:01:59] [INFO ] [Nat]Absence check using 1 positive place invariants in 41 ms returned sat
[2020-06-03 23:01:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:02:06] [INFO ] [Nat]Absence check using state equation in 6239 ms returned sat
[2020-06-03 23:02:06] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints in 332 ms.
[2020-06-03 23:02:19] [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 (=> (> t159 0) (or (and (> t150 0) (< o150 o159)) (and (> t173 0) (< o173 o159)) (and (> t385 0) (< o385 o159)) (and (> t392 0) (< o392 o159)) (and (> t407 0) (< o407 o159)) (and (> t6761 0) (< o6761 o159)) (and (> t6768 0) (< o6768 o159)) (and (> t6783 0) (< o6783 o159))))") while checking expression at index 10
[2020-06-03 23:02:19] [INFO ] [Real]Absence check using 1 positive place invariants in 17 ms returned sat
[2020-06-03 23:02:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:02:26] [INFO ] [Real]Absence check using state equation in 6854 ms returned sat
[2020-06-03 23:02:26] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:02:27] [INFO ] [Nat]Absence check using 1 positive place invariants in 48 ms returned sat
[2020-06-03 23:02:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:02:33] [INFO ] [Nat]Absence check using state equation in 6597 ms returned sat
[2020-06-03 23:02:34] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints in 415 ms.
[2020-06-03 23:02:46] [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 (=> (> t342 0) (or (and (> t97 0) (< o97 o342)) (and (> t104 0) (< o104 o342)) (and (> t111 0) (< o111 o342)) (and (> t331 0) (< o331 o342)) (and (> t346 0) (< o346 o342)) (and (> t563 0) (< o563 o342)) (and (> t570 0) (< o570 o342)) (and (> t577 0) (< o577 o342))))") while checking expression at index 11
[2020-06-03 23:02:47] [INFO ] [Real]Absence check using 1 positive place invariants in 16 ms returned sat
[2020-06-03 23:02:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:02:54] [INFO ] [Real]Absence check using state equation in 7256 ms returned sat
[2020-06-03 23:02:54] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints in 351 ms.
[2020-06-03 23:02:55] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:02:55] [INFO ] [Nat]Absence check using 1 positive place invariants in 46 ms returned sat
[2020-06-03 23:02:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:03:01] [INFO ] [Nat]Absence check using state equation in 5974 ms returned sat
[2020-06-03 23:03:02] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints in 328 ms.
[2020-06-03 23:03:15] [INFO ] Added : 205 causal constraints over 41 iterations in 13815 ms. Result :unknown
[2020-06-03 23:03:15] [INFO ] [Real]Absence check using 1 positive place invariants in 7 ms returned unsat
[2020-06-03 23:03:15] [INFO ] [Real]Absence check using 1 positive place invariants in 18 ms returned sat
[2020-06-03 23:03:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:03:22] [INFO ] [Real]Absence check using state equation in 7134 ms returned sat
[2020-06-03 23:03:23] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints in 434 ms.
[2020-06-03 23:03:24] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:03:24] [INFO ] [Nat]Absence check using 1 positive place invariants in 41 ms returned sat
[2020-06-03 23:03:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:03:31] [INFO ] [Nat]Absence check using state equation in 6677 ms returned sat
[2020-06-03 23:03:31] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints in 421 ms.
[2020-06-03 23:03:44] [INFO ] Added : 225 causal constraints over 45 iterations in 13084 ms. Result :(error "Failed to check-sat")
[2020-06-03 23:03:44] [INFO ] [Real]Absence check using 1 positive place invariants in 18 ms returned sat
[2020-06-03 23:03:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:03:50] [INFO ] [Real]Absence check using state equation in 6127 ms returned sat
[2020-06-03 23:03:51] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints in 472 ms.
[2020-06-03 23:03:52] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:03:52] [INFO ] [Nat]Absence check using 1 positive place invariants in 41 ms returned sat
[2020-06-03 23:03:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:03:59] [INFO ] [Nat]Absence check using state equation in 6726 ms returned sat
[2020-06-03 23:03:59] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints in 409 ms.
[2020-06-03 23:04:12] [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: Stream closed (=> (> t127 0) (or (and (> t118 0) (< o118 o127)) (and (> t133 0) (< o133 o127)) (and (> t353 0) (< o353 o127)) (and (> t360 0) (< o360 o127)) (and (> t367 0) (< o367 o127)) (and (> t6729 0) (< o6729 o127)) (and (> t6736 0) (< o6736 o127)) (and (> t6743 0) (< o6743 o127))))") while checking expression at index 15
[2020-06-03 23:04:12] [INFO ] [Real]Absence check using 1 positive place invariants in 21 ms returned sat
[2020-06-03 23:04:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:04:18] [INFO ] [Real]Absence check using state equation in 6432 ms returned sat
[2020-06-03 23:04:18] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:04:19] [INFO ] [Nat]Absence check using 1 positive place invariants in 49 ms returned sat
[2020-06-03 23:04:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:04:26] [INFO ] [Nat]Absence check using state equation in 7019 ms returned sat
[2020-06-03 23:04:26] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints in 369 ms.
[2020-06-03 23:04:38] [INFO ] Added : 210 causal constraints over 42 iterations in 12717 ms. Result :unknown
[2020-06-03 23:04:39] [INFO ] [Real]Absence check using 1 positive place invariants in 22 ms returned sat
[2020-06-03 23:04:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:04:45] [INFO ] [Real]Absence check using state equation in 6581 ms returned sat
[2020-06-03 23:04:46] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints in 372 ms.
[2020-06-03 23:04:47] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:04:47] [INFO ] [Nat]Absence check using 1 positive place invariants in 42 ms returned sat
[2020-06-03 23:04:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:04:53] [INFO ] [Nat]Absence check using state equation in 5919 ms returned sat
[2020-06-03 23:04:53] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints in 389 ms.
[2020-06-03 23:05:07] [INFO ] Added : 200 causal constraints over 40 iterations in 13868 ms. Result :(error "Failed to check-sat")
[2020-06-03 23:05:07] [INFO ] [Real]Absence check using 1 positive place invariants in 16 ms returned sat
[2020-06-03 23:05:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:05:14] [INFO ] [Real]Absence check using state equation in 7510 ms returned sat
[2020-06-03 23:05:14] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:05:14] [INFO ] [Nat]Absence check using 1 positive place invariants in 33 ms returned sat
[2020-06-03 23:05:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:05:22] [INFO ] [Nat]Absence check using state equation in 7060 ms returned sat
[2020-06-03 23:05:22] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints in 406 ms.
[2020-06-03 23:05:34] [INFO ] Added : 215 causal constraints over 43 iterations in 12702 ms. Result :unknown
[2020-06-03 23:05:35] [INFO ] [Real]Absence check using 1 positive place invariants in 16 ms returned sat
[2020-06-03 23:05:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:05:41] [INFO ] [Real]Absence check using state equation in 6777 ms returned sat
[2020-06-03 23:05:41] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:05:42] [INFO ] [Nat]Absence check using 1 positive place invariants in 35 ms returned sat
[2020-06-03 23:05:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:05:49] [INFO ] [Nat]Absence check using state equation in 7039 ms returned sat
[2020-06-03 23:05:49] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints in 336 ms.
[2020-06-03 23:06:01] [INFO ] Added : 190 causal constraints over 38 iterations in 12734 ms. Result :(error "Failed to check-sat")
Successfully simplified 3 atomic propositions for a total of 3 simplifications.
[2020-06-03 23:06:02] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2020-06-03 23:06:02] [INFO ] Flatten gal took : 505 ms
FORMULA Diffusion2D-PT-D30N150-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Diffusion2D-PT-D30N150-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Diffusion2D-PT-D30N150-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 23:06:02] [INFO ] Flatten gal took : 156 ms
[2020-06-03 23:06:03] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 5 ms.
[2020-06-03 23:06:03] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 41 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ Diffusion2D-PT-D30N150 @ 3570 seconds
FORMULA Diffusion2D-PT-D30N150-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Diffusion2D-PT-D30N150-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Diffusion2D-PT-D30N150-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Diffusion2D-PT-D30N150-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Diffusion2D-PT-D30N150-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Diffusion2D-PT-D30N150-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Diffusion2D-PT-D30N150-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Diffusion2D-PT-D30N150-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Diffusion2D-PT-D30N150-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Diffusion2D-PT-D30N150-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Diffusion2D-PT-D30N150-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Diffusion2D-PT-D30N150-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Diffusion2D-PT-D30N150-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3396
rslt: Output for LTLCardinality @ Diffusion2D-PT-D30N150
{
"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": "Wed Jun 3 23:06:03 2020
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 272
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 4,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 6,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 1,
"tdisj": 3,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "G (F ((G ((F (G ((p286 <= 0))) OR (p835 + 1 <= p293))) OR ((p240 <= p126) AND (X ((p293 <= p835)) R (F (G ((p286 <= 0))) OR (p835 + 1 <= p293)))))))",
"processed_size": 148,
"rewrites": 78
},
"result":
{
"edges": 366035,
"markings": 130248,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 23
},
"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": 295
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 3,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "G (F ((X ((X (G ((p235 + 1 <= p667))) OR (p556 + 1 <= p793))) OR (p858 <= 0))))",
"processed_size": 79,
"rewrites": 78
},
"result":
{
"edges": 2518967,
"markings": 630593,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 1,
"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": 320
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 1,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"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": "X (((p479 <= p88) U X (G ((p827 <= p265)))))",
"processed_size": 44,
"rewrites": 78
},
"result":
{
"edges": 2057525,
"markings": 515059,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"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"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 351
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 351
},
"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": "(p363 <= 2)",
"processed_size": 11,
"rewrites": 78
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 3,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 390
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"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": "((2 <= p468) R X ((p81 <= p730)))",
"processed_size": 33,
"rewrites": 78
},
"result":
{
"edges": 4118471,
"markings": 1030885,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 3,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 387
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 2,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G ((X ((p190 <= 2)) AND G ((p488 <= 0))))",
"processed_size": 41,
"rewrites": 78
},
"result":
{
"edges": 181254,
"markings": 64710,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 435
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 1,
"X": 3,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"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": "X (F ((((3 <= p480) U X (X ((2 <= p452)))) OR (p400 <= p546))))",
"processed_size": 63,
"rewrites": 78
},
"result":
{
"edges": 8,
"markings": 9,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 497
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "X (F ((G (((p304 <= p418) OR (p38 + 1 <= p413))) OR ((2 <= p543) AND (p304 <= p418)))))",
"processed_size": 88,
"rewrites": 78
},
"result":
{
"edges": 3379786,
"markings": 840391,
"produced_by": "LTL model checker",
"value": false
},
"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"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 575
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 575
},
"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": "(p717 <= p792)",
"processed_size": 14,
"rewrites": 78
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 7,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 690
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G (F ((p495 <= p370)))",
"processed_size": 22,
"rewrites": 78
},
"result":
{
"edges": 792049,
"markings": 284546,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "fairness",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 7,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 689
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 1,
"X": 4,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X ((X (X (X (G ((p501 + 1 <= p606))))) U (3 <= p704)))",
"processed_size": 54,
"rewrites": 78
},
"result":
{
"edges": 2251,
"markings": 2251,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 8,
"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": 861
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 3,
"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 (X (X (F ((1 <= p18)))))",
"processed_size": 26,
"rewrites": 78
},
"result":
{
"edges": 2251,
"markings": 2251,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 9,
"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": 1148
},
"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": "(p879 <= 1)",
"processed_size": 11,
"rewrites": 80
},
"result":
{
"edges": 1364,
"markings": 1364,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 16
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1723
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"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": 1,
"visible_transitions": 0
},
"processed": "G ((F ((3 <= p297)) AND (F (G ((p297 <= 2))) OR (3 <= p297))))",
"processed_size": 62,
"rewrites": 78
},
"result":
{
"edges": 618,
"markings": 618,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 11,
"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": 3446
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 4,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "G ((G ((G ((p187 <= p708)) AND (p476 <= p468))) OR G (F ((p854 <= p199)))))",
"processed_size": 75,
"rewrites": 78
},
"result":
{
"edges": 6563012,
"markings": 1213779,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"compoundnumber": 12,
"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": 72544,
"runtime": 174.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "G(F((G((F(G(*)) OR *)) OR (* AND (X(*) R (F(G(*)) OR *)))))) : G((G((G(**) AND **)) OR G(F(**)))) : G(F((X((X(G(*)) OR *)) OR *))) : X((* U X(G(**)))) : (X(F(*)) AND ((* R X(**)) AND **)) : G((X(*) AND G(*))) : G((F(**) AND (F(G(*)) OR **))) : F(**) : X(F(((** U X(X(**))) OR **))) : X(F((G(**) OR **))) : (X(*) AND (G(F(**)) AND **)) : X((X(X(X(G(**)))) U **)) : X(X(X(F(**))))"
},
"net":
{
"arcs": 13688,
"conflict_clusters": 900,
"places": 900,
"places_significant": 899,
"singleton_clusters": 0,
"transitions": 6844
},
"result":
{
"preliminary_value": "no no no no no no no no yes no no no no ",
"value": "no no no no no no no no yes no no no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 7744/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 28800
lola: finding significant places
lola: 900 places, 6844 transitions, 899 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: NOT(F (G (((p126 + 1 <= p240) U (X ((p835 + 1 <= p293)) U (G (F ((1 <= p286))) AND (p293 <= p835))))))) : G ((G ((G ((p187 <= p708)) AND (p476 <= p468))) OR X (G (F ((p854 <= p199)))))) : G (NOT(F (G (((X (NOT(G (NOT(X ((p667 <= p235)))))) AND X ((p793 <= p556))) AND (1 <= p858)))))) : (NOT(X ((p88 + 1 <= p479))) U X (X (G ((p827 <= p265))))) : ((NOT(X (G (((p326 <= p866) OR (3 <= p363))))) AND NOT(((p468 <= 1) U NOT(X ((p81 <= p730)))))) AND (p363 <= 2)) : G ((NOT(X ((3 <= p190))) AND NOT(F ((1 <= p488))))) : G ((F ((3 <= p297)) AND (G (F (NOT(F ((3 <= p297))))) OR (3 <= p297)))) : ((G ((p457 <= p127)) U (0 <= 0)) U (2 <= p879)) : F ((((1 <= 0) U X (((3 <= p480) U X (X ((2 <= p452)))))) OR X ((p400 <= p546)))) : F (X ((G (((p304 <= p418) OR (p38 + 1 <= p413))) OR ((2 <= p543) AND (p304 <= p418))))) : ((NOT(X ((p717 <= p792))) AND G (F (G (F ((p495 <= p370)))))) AND (p717 <= p792)) : X ((X (X (G (X ((p501 + 1 <= p606))))) U (3 <= p704))) : X (X (X (F ((1 <= p18)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:522
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:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:377
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:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:525
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:315
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:115
lola: rewrite Frontend/Parser/formula_rewrite.k:124
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:528
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 272 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((G ((F (G ((p286 <= 0))) OR (p835 + 1 <= p293))) OR ((p240 <= p126) AND (X ((p293 <= p835)) R (F (G ((p286 <= 0))) OR (p835 + 1 <= p293)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((G ((F (G ((p286 <= 0))) OR (p835 + 1 <= p293))) OR ((p240 <= p126) AND (X ((p293 <= p835)) R (F (G ((p286 <= 0))) OR (p835 + 1 <= p293)))))))
lola: processed formula length: 148
lola: 78 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 23 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: add low 4829
lola: add low 5372
lola: add low 2088
lola: add low 2794
lola: add low 3560
lola: add low 4366
lola: add low 5032
lola: add low 1634
lola: add low 2259
lola: add low 3025
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: 130248 markings, 366035 edges
lola: subprocess 1 will run for 295 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((X ((X (G ((p235 + 1 <= p667))) OR (p556 + 1 <= p793))) OR (p858 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((X ((X (G ((p235 + 1 <= p667))) OR (p556 + 1 <= p793))) OR (p858 <= 0))))
lola: processed formula length: 79
lola: 78 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: ========================================
lola: 185365 markings, 683613 edges, 37073 markings/sec, 0 secs
lola: 367160 markings, 1440894 edges, 36359 markings/sec, 5 secs
lola: 546019 markings, 2182186 edges, 35772 markings/sec, 10 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: 630593 markings, 2518967 edges
lola: ========================================
lola: subprocess 2 will run for 320 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((p479 <= p88) U X (G ((p827 <= p265)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((p479 <= p88) U X (G ((p827 <= p265)))))
lola: processed formula length: 44
lola: 78 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: 179950 markings, 661034 edges, 35990 markings/sec, 0 secs
lola: 341645 markings, 1334533 edges, 32339 markings/sec, 5 secs
lola: 506753 markings, 2022804 edges, 33022 markings/sec, 10 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: 515059 markings, 2057525 edges
lola: ========================================
lola: subprocess 3 will run for 351 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (F (((p866 + 1 <= p326) AND (p363 <= 2)))) AND (((2 <= p468) R X ((p81 <= p730))) AND (p363 <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 351 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p363 <= 2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p363 <= 2)
lola: processed formula length: 11
lola: 78 rewrites
lola: closed formula file LTLCardinality.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 4 will run for 390 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((2 <= p468) R X ((p81 <= p730)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((2 <= p468) R X ((p81 <= p730)))
lola: processed formula length: 33
lola: 78 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: 194691 markings, 634521 edges, 38938 markings/sec, 0 secs
lola: 371039 markings, 1368597 edges, 35270 markings/sec, 5 secs
lola: 551255 markings, 2119212 edges, 36043 markings/sec, 10 secs
lola: 712997 markings, 2793014 edges, 32348 markings/sec, 15 secs
lola: 897851 markings, 3562396 edges, 36971 markings/sec, 20 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: 1030885 markings, 4118471 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 4 will run for 387 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((X ((p190 <= 2)) AND G ((p488 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((X ((p190 <= 2)) AND G ((p488 <= 0))))
lola: processed formula length: 41
lola: 78 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 64710 markings, 181254 edges
lola: ========================================
lola: subprocess 5 will run for 435 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((((3 <= p480) U X (X ((2 <= p452)))) OR (p400 <= p546))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((((3 <= p480) U X (X ((2 <= p452)))) OR (p400 <= p546))))
lola: processed formula length: 63
lola: 78 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 9 markings, 8 edges
lola: ========================================
lola: subprocess 6 will run for 497 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((G (((p304 <= p418) OR (p38 + 1 <= p413))) OR ((2 <= p543) AND (p304 <= p418)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((G (((p304 <= p418) OR (p38 + 1 <= p413))) OR ((2 <= p543) AND (p304 <= p418)))))
lola: processed formula length: 88
lola: 78 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: 168286 markings, 612589 edges, 33657 markings/sec, 0 secs
lola: 336539 markings, 1313290 edges, 33651 markings/sec, 5 secs
lola: 510910 markings, 2040347 edges, 34874 markings/sec, 10 secs
lola: 656372 markings, 2623787 edges, 29092 markings/sec, 15 secs
lola: 774990 markings, 3113021 edges, 23724 markings/sec, 20 secs
lola: add low 931
lola: add low 1623
lola: add low 2309
lola: add low 3129
lola: add low 175
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: 840391 markings, 3379786 edges
lola: ========================================
lola: subprocess 7 will run for 575 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X ((p792 + 1 <= p717)) AND (G (F ((p495 <= p370))) AND (p717 <= p792)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 575 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p717 <= p792)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p717 <= p792)
lola: processed formula length: 14
lola: 78 rewrites
lola: closed formula file LTLCardinality.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 8 will run for 690 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((p495 <= p370)))
lola: ========================================
lola: SUBTASK
lola: checking fairness
lola: fairness not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((p495 <= p370)))
lola: processed formula length: 22
lola: 78 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: 203347 markings, 529672 edges, 40669 markings/sec, 0 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: 284546 markings, 792049 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 8 will run for 689 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X (X (X (G ((p501 + 1 <= p606))))) U (3 <= p704)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X (X (X (G ((p501 + 1 <= p606))))) U (3 <= p704)))
lola: processed formula length: 54
lola: 78 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: 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: 2251 markings, 2251 edges
lola: ========================================
lola: subprocess 9 will run for 861 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (X (F ((1 <= p18)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (X (F ((1 <= p18)))))
lola: processed formula length: 26
lola: 78 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 2251 markings, 2251 edges
lola: ========================================
lola: subprocess 10 will run for 1148 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((2 <= p879))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (p879 <= 1)
lola: processed formula length: 11
lola: 80 rewrites
lola: closed formula file LTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 1364 markings, 1364 edges
lola: ========================================
lola: subprocess 11 will run for 1723 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((F ((3 <= p297)) AND (F (G ((p297 <= 2))) OR (3 <= p297))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((F ((3 <= p297)) AND (F (G ((p297 <= 2))) OR (3 <= p297))))
lola: processed formula length: 62
lola: 78 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 618 markings, 618 edges
lola: ========================================
lola: subprocess 12 will run for 3446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((G ((G ((p187 <= p708)) AND (p476 <= p468))) OR G (F ((p854 <= p199)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((G ((G ((p187 <= p708)) AND (p476 <= p468))) OR G (F ((p854 <= p199)))))
lola: processed formula length: 75
lola: 78 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: 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: 213288 markings, 545464 edges, 42658 markings/sec, 0 secs
lola: 322082 markings, 1223238 edges, 21759 markings/sec, 5 secs
lola: 433313 markings, 1889117 edges, 22246 markings/sec, 10 secs
lola: 537583 markings, 2513265 edges, 20854 markings/sec, 15 secs
lola: 649007 markings, 3179338 edges, 22285 markings/sec, 20 secs
lola: 760275 markings, 3847184 edges, 22254 markings/sec, 25 secs
lola: 871938 markings, 4514880 edges, 22333 markings/sec, 30 secs
lola: 983438 markings, 5183755 edges, 22300 markings/sec, 35 secs
lola: 1095488 markings, 5854888 edges, 22410 markings/sec, 40 secs
lola: 1208475 markings, 6528851 edges, 22597 markings/sec, 45 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: 1213779 markings, 6563012 edges
lola: RESULT
lola:
SUMMARY: no no no no no no no no yes no no no no
lola:
preliminary result: no no no no no no no no yes no no no no
lola: ========================================
lola: memory consumption: 72544 KB
lola: time consumption: 174 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="Diffusion2D-PT-D30N150"
export BK_EXAMINATION="LTLCardinality"
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 Diffusion2D-PT-D30N150, 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 r178-tajo-158987882500513"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Diffusion2D-PT-D30N150.tgz
mv Diffusion2D-PT-D30N150 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 '
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 ;