Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 4.5K Apr 12 17:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Apr 12 17:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Apr 11 20:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 11 20:01 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:38 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Mar 24 05:38 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.5K Apr 14 12:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 30 14:52 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 14 12:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 30 14:52 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 10 20:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Apr 10 20:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.8K Apr 10 05:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 10 05:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 10 22:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 10 22:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 24 05:38 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 iscolored
-rw-r--r-- 1 mcc users 1.2M Mar 24 05:38 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 SimpleLoadBal-PT-15-00
FORMULA_NAME SimpleLoadBal-PT-15-01
FORMULA_NAME SimpleLoadBal-PT-15-02
FORMULA_NAME SimpleLoadBal-PT-15-03
FORMULA_NAME SimpleLoadBal-PT-15-04
FORMULA_NAME SimpleLoadBal-PT-15-05
FORMULA_NAME SimpleLoadBal-PT-15-06
FORMULA_NAME SimpleLoadBal-PT-15-07
FORMULA_NAME SimpleLoadBal-PT-15-08
FORMULA_NAME SimpleLoadBal-PT-15-09
FORMULA_NAME SimpleLoadBal-PT-15-10
FORMULA_NAME SimpleLoadBal-PT-15-11
FORMULA_NAME SimpleLoadBal-PT-15-12
FORMULA_NAME SimpleLoadBal-PT-15-13
FORMULA_NAME SimpleLoadBal-PT-15-14
FORMULA_NAME SimpleLoadBal-PT-15-15

=== Now, execution of the tool begins

BK_START 1591255211683

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-04 07:20:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-04 07:20:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-04 07:20:14] [INFO ] Load time of PNML (sax parser for PT used): 144 ms
[2020-06-04 07:20:14] [INFO ] Transformed 149 places.
[2020-06-04 07:20:14] [INFO ] Transformed 1280 transitions.
[2020-06-04 07:20:14] [INFO ] Parsed PT model containing 149 places and 1280 transitions in 212 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 25 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 707 ms. (steps per millisecond=141 ) properties seen :[1, 1, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 0, 0, 1, 0, 0, 1, 0, 1, 0, 1, 0, 1, 1, 1]
[2020-06-04 07:20:15] [INFO ] Flow matrix only has 1010 transitions (discarded 270 similar events)
// Phase 1: matrix 1010 rows 149 cols
[2020-06-04 07:20:15] [INFO ] Computed 39 place invariants in 27 ms
[2020-06-04 07:20:15] [INFO ] [Real]Absence check using 35 positive place invariants in 45 ms returned sat
[2020-06-04 07:20:15] [INFO ] [Real]Absence check using 35 positive and 4 generalized place invariants in 2 ms returned sat
[2020-06-04 07:20:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 07:20:15] [INFO ] [Real]Absence check using state equation in 357 ms returned sat
[2020-06-04 07:20:15] [INFO ] State equation strengthened by 481 read => feed constraints.
[2020-06-04 07:20:16] [INFO ] [Real]Added 481 Read/Feed constraints in 205 ms returned sat
[2020-06-04 07:20:16] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 07:20:16] [INFO ] [Nat]Absence check using 35 positive place invariants in 70 ms returned sat
[2020-06-04 07:20:16] [INFO ] [Nat]Absence check using 35 positive and 4 generalized place invariants in 8 ms returned sat
[2020-06-04 07:20:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 07:20:16] [INFO ] [Nat]Absence check using state equation in 368 ms returned sat
[2020-06-04 07:20:16] [INFO ] [Nat]Added 481 Read/Feed constraints in 219 ms returned sat
[2020-06-04 07:20:17] [INFO ] Computed and/alt/rep : 1265/132297/995 causal constraints in 553 ms.
[2020-06-04 07:20:36] [INFO ] Added : 375 causal constraints over 75 iterations in 19284 ms. Result :unknown
[2020-06-04 07:20:36] [INFO ] [Real]Absence check using 35 positive place invariants in 17 ms returned unsat
[2020-06-04 07:20:36] [INFO ] [Real]Absence check using 35 positive place invariants in 12 ms returned sat
[2020-06-04 07:20:36] [INFO ] [Real]Absence check using 35 positive and 4 generalized place invariants in 3 ms returned unsat
[2020-06-04 07:20:36] [INFO ] [Real]Absence check using 35 positive place invariants in 212 ms returned sat
[2020-06-04 07:20:36] [INFO ] [Real]Absence check using 35 positive and 4 generalized place invariants in 27 ms returned sat
[2020-06-04 07:20:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 07:20:37] [INFO ] [Real]Absence check using state equation in 1017 ms returned sat
[2020-06-04 07:20:37] [INFO ] [Real]Added 481 Read/Feed constraints in 261 ms returned sat
[2020-06-04 07:20:37] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 07:20:37] [INFO ] [Nat]Absence check using 35 positive place invariants in 17 ms returned sat
[2020-06-04 07:20:37] [INFO ] [Nat]Absence check using 35 positive and 4 generalized place invariants in 7 ms returned sat
[2020-06-04 07:20:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 07:20:39] [INFO ] [Nat]Absence check using state equation in 1225 ms returned sat
[2020-06-04 07:20:39] [INFO ] [Nat]Added 481 Read/Feed constraints in 288 ms returned sat
[2020-06-04 07:20:40] [INFO ] Deduced a trap composed of 81 places in 1038 ms
[2020-06-04 07:20:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 1095 ms
[2020-06-04 07:20:40] [INFO ] [Real]Absence check using 35 positive place invariants in 9 ms returned sat
[2020-06-04 07:20:40] [INFO ] [Real]Absence check using 35 positive and 4 generalized place invariants in 2 ms returned unsat
[2020-06-04 07:20:40] [INFO ] [Real]Absence check using 35 positive place invariants in 8 ms returned sat
[2020-06-04 07:20:40] [INFO ] [Real]Absence check using 35 positive and 4 generalized place invariants in 2 ms returned unsat
[2020-06-04 07:20:40] [INFO ] [Real]Absence check using 35 positive place invariants in 10 ms returned sat
[2020-06-04 07:20:40] [INFO ] [Real]Absence check using 35 positive and 4 generalized place invariants in 1 ms returned unsat
[2020-06-04 07:20:40] [INFO ] [Real]Absence check using 35 positive place invariants in 120 ms returned sat
[2020-06-04 07:20:40] [INFO ] [Real]Absence check using 35 positive and 4 generalized place invariants in 4 ms returned sat
[2020-06-04 07:20:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 07:20:42] [INFO ] [Real]Absence check using state equation in 1218 ms returned sat
[2020-06-04 07:20:42] [INFO ] [Real]Added 481 Read/Feed constraints in 236 ms returned sat
[2020-06-04 07:20:42] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 07:20:42] [INFO ] [Nat]Absence check using 35 positive place invariants in 21 ms returned sat
[2020-06-04 07:20:42] [INFO ] [Nat]Absence check using 35 positive and 4 generalized place invariants in 26 ms returned sat
[2020-06-04 07:20:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 07:20:43] [INFO ] [Nat]Absence check using state equation in 815 ms returned sat
[2020-06-04 07:20:43] [INFO ] [Nat]Added 481 Read/Feed constraints in 267 ms returned sat
[2020-06-04 07:20:43] [INFO ] Computed and/alt/rep : 1265/132297/995 causal constraints in 208 ms.
[2020-06-04 07:21:02] [INFO ] Added : 345 causal constraints over 69 iterations in 18841 ms. Result :unknown
[2020-06-04 07:21:02] [INFO ] [Real]Absence check using 35 positive place invariants in 9 ms returned sat
[2020-06-04 07:21:02] [INFO ] [Real]Absence check using 35 positive and 4 generalized place invariants in 3 ms returned unsat
[2020-06-04 07:21:02] [INFO ] [Real]Absence check using 35 positive place invariants in 8 ms returned sat
[2020-06-04 07:21:02] [INFO ] [Real]Absence check using 35 positive and 4 generalized place invariants in 2 ms returned sat
[2020-06-04 07:21:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 07:21:02] [INFO ] [Real]Absence check using state equation in 265 ms returned sat
[2020-06-04 07:21:02] [INFO ] [Real]Added 481 Read/Feed constraints in 205 ms returned sat
[2020-06-04 07:21:02] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 07:21:03] [INFO ] [Nat]Absence check using 35 positive place invariants in 69 ms returned sat
[2020-06-04 07:21:03] [INFO ] [Nat]Absence check using 35 positive and 4 generalized place invariants in 3 ms returned sat
[2020-06-04 07:21:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 07:21:03] [INFO ] [Nat]Absence check using state equation in 486 ms returned sat
[2020-06-04 07:21:03] [INFO ] [Nat]Added 481 Read/Feed constraints in 256 ms returned sat
[2020-06-04 07:21:03] [INFO ] Computed and/alt/rep : 1265/132297/995 causal constraints in 159 ms.
[2020-06-04 07:21:23] [INFO ] Added : 365 causal constraints over 73 iterations in 19205 ms. Result :(error "Failed to check-sat")
[2020-06-04 07:21:23] [INFO ] [Real]Absence check using 35 positive place invariants in 148 ms returned sat
[2020-06-04 07:21:23] [INFO ] [Real]Absence check using 35 positive and 4 generalized place invariants in 14 ms returned sat
[2020-06-04 07:21:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 07:21:24] [INFO ] [Real]Absence check using state equation in 982 ms returned sat
[2020-06-04 07:21:24] [INFO ] [Real]Added 481 Read/Feed constraints in 302 ms returned sat
[2020-06-04 07:21:24] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 07:21:24] [INFO ] [Nat]Absence check using 35 positive place invariants in 11 ms returned sat
[2020-06-04 07:21:24] [INFO ] [Nat]Absence check using 35 positive and 4 generalized place invariants in 17 ms returned sat
[2020-06-04 07:21:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 07:21:25] [INFO ] [Nat]Absence check using state equation in 1075 ms returned sat
[2020-06-04 07:21:26] [INFO ] [Nat]Added 481 Read/Feed constraints in 322 ms returned sat
[2020-06-04 07:21:26] [INFO ] Computed and/alt/rep : 1265/132297/995 causal constraints in 523 ms.
[2020-06-04 07:21:44] [INFO ] Added : 325 causal constraints over 65 iterations in 18554 ms. Result :(error "Failed to check-sat")
[2020-06-04 07:21:44] [INFO ] [Real]Absence check using 35 positive place invariants in 164 ms returned sat
[2020-06-04 07:21:44] [INFO ] [Real]Absence check using 35 positive and 4 generalized place invariants in 12 ms returned sat
[2020-06-04 07:21:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 07:21:45] [INFO ] [Real]Absence check using state equation in 1007 ms returned sat
[2020-06-04 07:21:46] [INFO ] [Real]Added 481 Read/Feed constraints in 161 ms returned sat
[2020-06-04 07:21:46] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 07:21:46] [INFO ] [Nat]Absence check using 35 positive place invariants in 9 ms returned sat
[2020-06-04 07:21:46] [INFO ] [Nat]Absence check using 35 positive and 4 generalized place invariants in 3 ms returned sat
[2020-06-04 07:21:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 07:21:46] [INFO ] [Nat]Absence check using state equation in 602 ms returned sat
[2020-06-04 07:21:47] [INFO ] [Nat]Added 481 Read/Feed constraints in 295 ms returned sat
[2020-06-04 07:21:47] [INFO ] Computed and/alt/rep : 1265/132297/995 causal constraints in 111 ms.
[2020-06-04 07:22:06] [INFO ] Added : 365 causal constraints over 73 iterations in 19094 ms. Result :(error "Solver has unexpectedly terminated")
[2020-06-04 07:22:06] [INFO ] [Real]Absence check using 35 positive place invariants in 145 ms returned sat
[2020-06-04 07:22:06] [INFO ] [Real]Absence check using 35 positive and 4 generalized place invariants in 5 ms returned sat
[2020-06-04 07:22:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 07:22:06] [INFO ] [Real]Absence check using state equation in 463 ms returned sat
[2020-06-04 07:22:06] [INFO ] [Real]Added 481 Read/Feed constraints in 174 ms returned sat
[2020-06-04 07:22:06] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 07:22:07] [INFO ] [Nat]Absence check using 35 positive place invariants in 219 ms returned sat
[2020-06-04 07:22:07] [INFO ] [Nat]Absence check using 35 positive and 4 generalized place invariants in 2 ms returned sat
[2020-06-04 07:22:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 07:22:07] [INFO ] [Nat]Absence check using state equation in 629 ms returned sat
[2020-06-04 07:22:08] [INFO ] [Nat]Added 481 Read/Feed constraints in 263 ms returned sat
[2020-06-04 07:22:08] [INFO ] Computed and/alt/rep : 1265/132297/995 causal constraints in 124 ms.
[2020-06-04 07:22:27] [INFO ] Added : 380 causal constraints over 76 iterations in 18873 ms. Result :(error "Solver has unexpectedly terminated")
[2020-06-04 07:22:27] [INFO ] [Real]Absence check using 35 positive place invariants in 9 ms returned sat
[2020-06-04 07:22:27] [INFO ] [Real]Absence check using 35 positive and 4 generalized place invariants in 2 ms returned unsat
[2020-06-04 07:22:27] [INFO ] [Real]Absence check using 35 positive place invariants in 11 ms returned sat
[2020-06-04 07:22:27] [INFO ] [Real]Absence check using 35 positive and 4 generalized place invariants in 4 ms returned sat
[2020-06-04 07:22:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 07:22:27] [INFO ] [Real]Absence check using state equation in 687 ms returned sat
[2020-06-04 07:22:27] [INFO ] [Real]Added 481 Read/Feed constraints in 123 ms returned sat
[2020-06-04 07:22:27] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 07:22:28] [INFO ] [Nat]Absence check using 35 positive place invariants in 230 ms returned sat
[2020-06-04 07:22:28] [INFO ] [Nat]Absence check using 35 positive and 4 generalized place invariants in 27 ms returned sat
[2020-06-04 07:22:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 07:22:29] [INFO ] [Nat]Absence check using state equation in 1107 ms returned sat
[2020-06-04 07:22:29] [INFO ] [Nat]Added 481 Read/Feed constraints in 183 ms returned sat
[2020-06-04 07:22:29] [INFO ] Deduced a trap composed of 21 places in 379 ms
[2020-06-04 07:22:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 442 ms
[2020-06-04 07:22:30] [INFO ] Computed and/alt/rep : 1265/132297/995 causal constraints in 173 ms.
[2020-06-04 07:22:48] [INFO ] Added : 375 causal constraints over 75 iterations in 18031 ms. Result :unknown
[2020-06-04 07:22:48] [INFO ] [Real]Absence check using 35 positive place invariants in 39 ms returned sat
[2020-06-04 07:22:48] [INFO ] [Real]Absence check using 35 positive and 4 generalized place invariants in 3 ms returned sat
[2020-06-04 07:22:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 07:22:49] [INFO ] [Real]Absence check using state equation in 1002 ms returned sat
[2020-06-04 07:22:49] [INFO ] [Real]Added 481 Read/Feed constraints in 156 ms returned sat
[2020-06-04 07:22:49] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 07:22:49] [INFO ] [Nat]Absence check using 35 positive place invariants in 320 ms returned sat
[2020-06-04 07:22:49] [INFO ] [Nat]Absence check using 35 positive and 4 generalized place invariants in 3 ms returned sat
[2020-06-04 07:22:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 07:22:50] [INFO ] [Nat]Absence check using state equation in 714 ms returned sat
[2020-06-04 07:22:50] [INFO ] [Nat]Added 481 Read/Feed constraints in 214 ms returned sat
[2020-06-04 07:22:50] [INFO ] Deduced a trap composed of 19 places in 307 ms
[2020-06-04 07:22:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 375 ms
[2020-06-04 07:22:51] [INFO ] Computed and/alt/rep : 1265/132297/995 causal constraints in 315 ms.
[2020-06-04 07:23:09] [INFO ] Added : 380 causal constraints over 76 iterations in 18375 ms. Result :(error "Solver has unexpectedly terminated")
[2020-06-04 07:23:09] [INFO ] [Real]Absence check using 35 positive place invariants in 286 ms returned sat
[2020-06-04 07:23:09] [INFO ] [Real]Absence check using 35 positive and 4 generalized place invariants in 34 ms returned sat
[2020-06-04 07:23:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 07:23:10] [INFO ] [Real]Absence check using state equation in 857 ms returned sat
[2020-06-04 07:23:10] [INFO ] [Real]Added 481 Read/Feed constraints in 193 ms returned sat
[2020-06-04 07:23:10] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 07:23:10] [INFO ] [Nat]Absence check using 35 positive place invariants in 11 ms returned sat
[2020-06-04 07:23:10] [INFO ] [Nat]Absence check using 35 positive and 4 generalized place invariants in 5 ms returned sat
[2020-06-04 07:23:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 07:23:11] [INFO ] [Nat]Absence check using state equation in 836 ms returned sat
[2020-06-04 07:23:11] [INFO ] [Nat]Added 481 Read/Feed constraints in 270 ms returned sat
[2020-06-04 07:23:12] [INFO ] Computed and/alt/rep : 1265/132297/995 causal constraints in 134 ms.
[2020-06-04 07:23:30] [INFO ] Added : 365 causal constraints over 73 iterations in 18852 ms. Result :unknown
[2020-06-04 07:23:30] [INFO ] [Real]Absence check using 35 positive place invariants in 96 ms returned sat
[2020-06-04 07:23:30] [INFO ] [Real]Absence check using 35 positive and 4 generalized place invariants in 4 ms returned unsat
[2020-06-04 07:23:31] [INFO ] [Real]Absence check using 35 positive place invariants in 114 ms returned sat
[2020-06-04 07:23:31] [INFO ] [Real]Absence check using 35 positive and 4 generalized place invariants in 21 ms returned sat
[2020-06-04 07:23:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 07:23:32] [INFO ] [Real]Absence check using state equation in 1061 ms returned sat
[2020-06-04 07:23:32] [INFO ] [Real]Added 481 Read/Feed constraints in 248 ms returned sat
[2020-06-04 07:23:32] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 07:23:32] [INFO ] [Nat]Absence check using 35 positive place invariants in 69 ms returned sat
[2020-06-04 07:23:32] [INFO ] [Nat]Absence check using 35 positive and 4 generalized place invariants in 14 ms returned sat
[2020-06-04 07:23:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 07:23:33] [INFO ] [Nat]Absence check using state equation in 1021 ms returned sat
[2020-06-04 07:23:33] [INFO ] [Nat]Added 481 Read/Feed constraints in 266 ms returned sat
[2020-06-04 07:23:35] [INFO ] Deduced a trap composed of 19 places in 1472 ms
[2020-06-04 07:23:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1551 ms
[2020-06-04 07:23:35] [INFO ] Computed and/alt/rep : 1265/132297/995 causal constraints in 277 ms.
[2020-06-04 07:23:52] [INFO ] Added : 330 causal constraints over 66 iterations in 17057 ms. Result :unknown
[2020-06-04 07:23:52] [INFO ] [Real]Absence check using 35 positive place invariants in 14 ms returned sat
[2020-06-04 07:23:52] [INFO ] [Real]Absence check using 35 positive and 4 generalized place invariants in 3 ms returned unsat
[2020-06-04 07:23:52] [INFO ] [Real]Absence check using 35 positive place invariants in 202 ms returned sat
[2020-06-04 07:23:52] [INFO ] [Real]Absence check using 35 positive and 4 generalized place invariants in 3 ms returned sat
[2020-06-04 07:23:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 07:23:53] [INFO ] [Real]Absence check using state equation in 848 ms returned sat
[2020-06-04 07:23:53] [INFO ] [Real]Added 481 Read/Feed constraints in 196 ms returned sat
[2020-06-04 07:23:53] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 07:23:54] [INFO ] [Nat]Absence check using 35 positive place invariants in 234 ms returned sat
[2020-06-04 07:23:54] [INFO ] [Nat]Absence check using 35 positive and 4 generalized place invariants in 29 ms returned sat
[2020-06-04 07:23:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 07:23:55] [INFO ] [Nat]Absence check using state equation in 929 ms returned sat
[2020-06-04 07:23:55] [INFO ] [Nat]Added 481 Read/Feed constraints in 245 ms returned sat
[2020-06-04 07:23:55] [INFO ] Computed and/alt/rep : 1265/132297/995 causal constraints in 144 ms.
[2020-06-04 07:24:13] [INFO ] Added : 360 causal constraints over 72 iterations in 18448 ms. Result :(error "Failed to check-sat")
[2020-06-04 07:24:14] [INFO ] [Real]Absence check using 35 positive place invariants in 85 ms returned sat
[2020-06-04 07:24:14] [INFO ] [Real]Absence check using 35 positive and 4 generalized place invariants in 2 ms returned sat
[2020-06-04 07:24:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 07:24:14] [INFO ] [Real]Absence check using state equation in 808 ms returned sat
[2020-06-04 07:24:15] [INFO ] [Real]Added 481 Read/Feed constraints in 269 ms returned sat
[2020-06-04 07:24:15] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 07:24:15] [INFO ] [Nat]Absence check using 35 positive place invariants in 151 ms returned sat
[2020-06-04 07:24:15] [INFO ] [Nat]Absence check using 35 positive and 4 generalized place invariants in 13 ms returned sat
[2020-06-04 07:24:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 07:24:16] [INFO ] [Nat]Absence check using state equation in 1004 ms returned sat
[2020-06-04 07:24:16] [INFO ] [Nat]Added 481 Read/Feed constraints in 249 ms returned sat
[2020-06-04 07:24:16] [INFO ] Computed and/alt/rep : 1265/132297/995 causal constraints in 119 ms.
[2020-06-04 07:24:35] [INFO ] Added : 375 causal constraints over 75 iterations in 18563 ms. Result :unknown
[2020-06-04 07:24:35] [INFO ] [Real]Absence check using 35 positive place invariants in 38 ms returned sat
[2020-06-04 07:24:35] [INFO ] [Real]Absence check using 35 positive and 4 generalized place invariants in 3 ms returned sat
[2020-06-04 07:24:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 07:24:36] [INFO ] [Real]Absence check using state equation in 877 ms returned sat
[2020-06-04 07:24:36] [INFO ] [Real]Added 481 Read/Feed constraints in 192 ms returned sat
[2020-06-04 07:24:36] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 07:24:36] [INFO ] [Nat]Absence check using 35 positive place invariants in 39 ms returned sat
[2020-06-04 07:24:36] [INFO ] [Nat]Absence check using 35 positive and 4 generalized place invariants in 8 ms returned sat
[2020-06-04 07:24:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 07:24:37] [INFO ] [Nat]Absence check using state equation in 878 ms returned sat
[2020-06-04 07:24:37] [INFO ] [Nat]Added 481 Read/Feed constraints in 237 ms returned sat
[2020-06-04 07:24:39] [INFO ] Deduced a trap composed of 22 places in 1504 ms
[2020-06-04 07:24:40] [INFO ] Deduced a trap composed of 21 places in 1373 ms
[2020-06-04 07:24:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 2979 ms
[2020-06-04 07:24:40] [INFO ] Computed and/alt/rep : 1265/132297/995 causal constraints in 126 ms.
[2020-06-04 07:24:56] [INFO ] Added : 350 causal constraints over 70 iterations in 15855 ms. Result :unknown
[2020-06-04 07:24:56] [INFO ] [Real]Absence check using 35 positive place invariants in 257 ms returned sat
[2020-06-04 07:24:56] [INFO ] [Real]Absence check using 35 positive and 4 generalized place invariants in 12 ms returned sat
[2020-06-04 07:24:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 07:24:57] [INFO ] [Real]Absence check using state equation in 1002 ms returned sat
[2020-06-04 07:24:58] [INFO ] [Real]Added 481 Read/Feed constraints in 256 ms returned sat
[2020-06-04 07:24:58] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 07:24:58] [INFO ] [Nat]Absence check using 35 positive place invariants in 122 ms returned sat
[2020-06-04 07:24:58] [INFO ] [Nat]Absence check using 35 positive and 4 generalized place invariants in 4 ms returned sat
[2020-06-04 07:24:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 07:24:59] [INFO ] [Nat]Absence check using state equation in 818 ms returned sat
[2020-06-04 07:24:59] [INFO ] [Nat]Added 481 Read/Feed constraints in 251 ms returned sat
[2020-06-04 07:25:00] [INFO ] Deduced a trap composed of 21 places in 1456 ms
[2020-06-04 07:25:02] [INFO ] Deduced a trap composed of 20 places in 1350 ms
[2020-06-04 07:25:04] [INFO ] Deduced a trap composed of 19 places in 1883 ms
[2020-06-04 07:25:04] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 4877 ms
[2020-06-04 07:25:04] [INFO ] Computed and/alt/rep : 1265/132297/995 causal constraints in 134 ms.
[2020-06-04 07:25:18] [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 (=> (> t326 0) (and (and (> t65 0) (< o65 o326)) (or (and (> t86 0) (< o86 o326)) (and (> t101 0) (< o101 o326)) (and (> t116 0) (< o116 o326)) (and (> t131 0) (< o131 o326)) (and (> t146 0) (< o146 o326)) (and (> t161 0) (< o161 o326)) (and (> t176 0) (< o176 o326)) (and (> t191 0) (< o191 o326)) (and (> t206 0) (< o206 o326)) (and (> t221 0) (< o221 o326)) (and (> t236 0) (< o236 o326)) (and (> t251 0) (< o251 o326)) (and (> t266 0) (< o266 o326)) (and (> t281 0) (< o281 o326)) (and (> t296 0) (< o296 o326)) (and (> t537 0) (< o537 o326)) (and (> t665 0) (< o665 o326)) (and (> t666 0) (< o666 o326)) (and (> t667 0) (< o667 o326)) (and (> t668 0) (< o668 o326)) (and (> t669 0) (< o669 o326)) (and (> t670 0) (< o670 o326)) (and (> t671 0) (< o671 o326)) (and (> t672 0) (< o672 o326)) (and (> t673 0) (< o673 o326)) (and (> t674 0) (< o674 o326)) (and (> t675 0) (< o675 o326)) (and (> t676 0) (< o676 o326)) (and (> t677 0) (< o677 o326)) (and (> t678 0) (< o678 o326)) (and (> t679 0) (< o679 o326)) (and (> t875 0) (< o875 o326)) (and (> t876 0) (< o876 o326)) (and (> t877 0) (< o877 o326)) (and (> t878 0) (< o878 o326)) (and (> t879 0) (< o879 o326)) (and (> t880 0) (< o880 o326)) (and (> t881 0) (< o881 o326)) (and (> t882 0) (< o882 o326)) (and (> t883 0) (< o883 o326)) (and (> t884 0) (< o884 o326)) (and (> t885 0) (< o885 o326)) (and (> t886 0) (< o886 o326)) (and (> t887 0) (< o887 o326)) (and (> t888 0) (< o888 o326)) (and (> t889 0) (< o889 o326)) (and (> t988 0) (< o988 o326))) (or (and (> t310 0) (< o310 o326)) (and (> t325 0) (< o325 o326)) (and (> t340 0) (< o340 o326)) (and (> t355 0) (< o355 o326)) (and (> t370 0) (< o370 o326)) (and (> t385 0) (< o385 o326)) (and (> t400 0) (< o400 o326)) (and (> t415 0) (< o415 o326)) (and (> t430 0) (< o430 o326)) (and (> t445 0) (< o445 o326)) (and (> t460 0) (< o460 o326)) (and (> t475 0) (< o475 o326)) (and (> t490 0) (< o490 o326)) (and (> t505 0) (< o505 o326)) (and (> t520 0) (< o520 o326)) (and (> t551 0) (< o551 o326)) (and (> t650 0) (< o650 o326)) (and (> t651 0) (< o651 o326)) (and (> t652 0) (< o652 o326)) (and (> t653 0) (< o653 o326)) (and (> t654 0) (< o654 o326)) (and (> t655 0) (< o655 o326)) (and (> t656 0) (< o656 o326)) (and (> t657 0) (< o657 o326)) (and (> t658 0) (< o658 o326)) (and (> t659 0) (< o659 o326)) (and (> t660 0) (< o660 o326)) (and (> t661 0) (< o661 o326)) (and (> t662 0) (< o662 o326)) (and (> t663 0) (< o663 o326)) (and (> t664 0) (< o664 o326)) (and (> t860 0) (< o860 o326)) (and (> t861 0) (< o861 o326)) (and (> t862 0) (< o862 o326)) (and (> t863 0) (< o863 o326)) (and (> t864 0) (< o864 o326)) (and (> t865 0) (< o865 o326)) (and (> t866 0) (< o866 o326)) (and (> t867 0) (< o867 o326)) (and (> t868 0) (< o868 o326)) (and (> t869 0) (< o869 o326)) (and (> t870 0) (< o870 o326)) (and (> t871 0) (< o871 o326)) (and (> t872 0) (< o872 o326)) (and (> t873 0) (< o873 o326)) (and (> t874 0) (< o874 o326)) (and (> t1002 0) (< o1002 o326)))))") while checking expression at index 23
[2020-06-04 07:25:18] [INFO ] [Real]Absence check using 35 positive place invariants in 20 ms returned sat
[2020-06-04 07:25:18] [INFO ] [Real]Absence check using 35 positive and 4 generalized place invariants in 3 ms returned sat
[2020-06-04 07:25:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 07:25:19] [INFO ] [Real]Absence check using state equation in 1041 ms returned sat
[2020-06-04 07:25:19] [INFO ] [Real]Added 481 Read/Feed constraints in 211 ms returned sat
[2020-06-04 07:25:19] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 07:25:19] [INFO ] [Nat]Absence check using 35 positive place invariants in 230 ms returned sat
[2020-06-04 07:25:19] [INFO ] [Nat]Absence check using 35 positive and 4 generalized place invariants in 11 ms returned sat
[2020-06-04 07:25:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 07:25:20] [INFO ] [Nat]Absence check using state equation in 896 ms returned sat
[2020-06-04 07:25:20] [INFO ] [Nat]Added 481 Read/Feed constraints in 238 ms returned sat
[2020-06-04 07:25:21] [INFO ] Computed and/alt/rep : 1265/132297/995 causal constraints in 121 ms.
[2020-06-04 07:25:39] [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 (=> (> t397 0) (and (and (> t70 0) (< o70 o397)) (or (and (> t82 0) (< o82 o397)) (and (> t97 0) (< o97 o397)) (and (> t112 0) (< o112 o397)) (and (> t127 0) (< o127 o397)) (and (> t142 0) (< o142 o397)) (and (> t157 0) (< o157 o397)) (and (> t172 0) (< o172 o397)) (and (> t187 0) (< o187 o397)) (and (> t202 0) (< o202 o397)) (and (> t217 0) (< o217 o397)) (and (> t232 0) (< o232 o397)) (and (> t247 0) (< o247 o397)) (and (> t262 0) (< o262 o397)) (and (> t277 0) (< o277 o397)) (and (> t292 0) (< o292 o397)) (and (> t533 0) (< o533 o397)) (and (> t605 0) (< o605 o397)) (and (> t606 0) (< o606 o397)) (and (> t607 0) (< o607 o397)) (and (> t608 0) (< o608 o397)) (and (> t609 0) (< o609 o397)) (and (> t610 0) (< o610 o397)) (and (> t611 0) (< o611 o397)) (and (> t612 0) (< o612 o397)) (and (> t613 0) (< o613 o397)) (and (> t614 0) (< o614 o397)) (and (> t615 0) (< o615 o397)) (and (> t616 0) (< o616 o397)) (and (> t617 0) (< o617 o397)) (and (> t618 0) (< o618 o397)) (and (> t619 0) (< o619 o397)) (and (> t815 0) (< o815 o397)) (and (> t816 0) (< o816 o397)) (and (> t817 0) (< o817 o397)) (and (> t818 0) (< o818 o397)) (and (> t819 0) (< o819 o397)) (and (> t820 0) (< o820 o397)) (and (> t821 0) (< o821 o397)) (and (> t822 0) (< o822 o397)) (and (> t823 0) (< o823 o397)) (and (> t824 0) (< o824 o397)) (and (> t825 0) (< o825 o397)) (and (> t826 0) (< o826 o397)) (and (> t827 0) (< o827 o397)) (and (> t828 0) (< o828 o397)) (and (> t829 0) (< o829 o397)) (and (> t984 0) (< o984 o397))) (or (and (> t306 0) (< o306 o397)) (and (> t321 0) (< o321 o397)) (and (> t336 0) (< o336 o397)) (and (> t351 0) (< o351 o397)) (and (> t366 0) (< o366 o397)) (and (> t381 0) (< o381 o397)) (and (> t396 0) (< o396 o397)) (and (> t411 0) (< o411 o397)) (and (> t426 0) (< o426 o397)) (and (> t441 0) (< o441 o397)) (and (> t456 0) (< o456 o397)) (and (> t471 0) (< o471 o397)) (and (> t486 0) (< o486 o397)) (and (> t501 0) (< o501 o397)) (and (> t516 0) (< o516 o397)) (and (> t547 0) (< o547 o397)) (and (> t590 0) (< o590 o397)) (and (> t591 0) (< o591 o397)) (and (> t592 0) (< o592 o397)) (and (> t593 0) (< o593 o397)) (and (> t594 0) (< o594 o397)) (and (> t595 0) (< o595 o397)) (and (> t596 0) (< o596 o397)) (and (> t597 0) (< o597 o397)) (and (> t598 0) (< o598 o397)) (and (> t599 0) (< o599 o397)) (and (> t600 0) (< o600 o397)) (and (> t601 0) (< o601 o397)) (and (> t602 0) (< o602 o397)) (and (> t603 0) (< o603 o397)) (and (> t604 0) (< o604 o397)) (and (> t800 0) (< o800 o397)) (and (> t801 0) (< o801 o397)) (and (> t802 0) (< o802 o397)) (and (> t803 0) (< o803 o397)) (and (> t804 0) (< o804 o397)) (and (> t805 0) (< o805 o397)) (and (> t806 0) (< o806 o397)) (and (> t807 0) (< o807 o397)) (and (> t808 0) (< o808 o397)) (and (> t809 0) (< o809 o397)) (and (> t810 0) (< o810 o397)) (and (> t811 0) (< o811 o397)) (and (> t812 0) (< o812 o397)) (and (> t813 0) (< o813 o397)) (and (> t814 0) (< o814 o397)) (and (> t998 0) (< o998 o397)))))") while checking expression at index 24
[2020-06-04 07:25:39] [INFO ] [Real]Absence check using 35 positive place invariants in 92 ms returned sat
[2020-06-04 07:25:39] [INFO ] [Real]Absence check using 35 positive and 4 generalized place invariants in 20 ms returned unsat
[2020-06-04 07:25:39] [INFO ] [Real]Absence check using 35 positive place invariants in 45 ms returned sat
[2020-06-04 07:25:39] [INFO ] [Real]Absence check using 35 positive and 4 generalized place invariants in 24 ms returned unsat
Successfully simplified 12 atomic propositions for a total of 13 simplifications.
[2020-06-04 07:25:40] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2020-06-04 07:25:41] [INFO ] Flatten gal took : 606 ms
FORMULA SimpleLoadBal-PT-15-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SimpleLoadBal-PT-15-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SimpleLoadBal-PT-15-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SimpleLoadBal-PT-15-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SimpleLoadBal-PT-15-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-04 07:25:41] [INFO ] Flatten gal took : 287 ms
[2020-06-04 07:25:41] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA SimpleLoadBal-PT-15-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-04 07:25:41] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2020-06-04 07:25:41] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 31 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ SimpleLoadBal-PT-15 @ 3570 seconds

FORMULA SimpleLoadBal-PT-15-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SimpleLoadBal-PT-15-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SimpleLoadBal-PT-15-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SimpleLoadBal-PT-15-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SimpleLoadBal-PT-15-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SimpleLoadBal-PT-15-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SimpleLoadBal-PT-15-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SimpleLoadBal-PT-15-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SimpleLoadBal-PT-15-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SimpleLoadBal-PT-15-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2399
rslt: Output for LTLFireability @ SimpleLoadBal-PT-15

{
"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=LTLFireability.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--safe",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Thu Jun 4 07:25:43 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 2,
"aconj": 3,
"adisj": 1,
"aneg": 3,
"comp": 13,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 13,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 9,
"visible_transitions": 0
},
"processed": "(X ((((p67 <= 0) OR (p116 <= 0) OR (p137 <= 0)) R ((p72 <= 0) OR (p116 <= 0) OR (p120 <= 0) OR (p134 <= 0)))) U (X (((p109 <= 0) OR (p122 <= 0) OR (p139 <= 0))) AND ((p109 <= 0) OR (p122 <= 0) OR (p139 <= 0))))",
"processed_size": 219,
"rewrites": 56
},
"result":
{
"edges": 30,
"markings": 31,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 5
},
"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": 395
},
"child":
[

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 1,
"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": 4,
"visible_transitions": 0
},
"processed": "X (((1 <= p72) AND (1 <= p116) AND (1 <= p119) AND (1 <= p133)))",
"processed_size": 64,
"rewrites": 56
},
"result":
{
"edges": 170,
"markings": 170,
"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": 445
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 1,
"X": 5,
"aconj": 2,
"adisj": 0,
"aneg": 0,
"comp": 10,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 4,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 10,
"visible_transitions": 0
},
"processed": "(X (X (((1 <= p110) AND (1 <= p118) AND (1 <= p133)))) U (X (X (X (G (((1 <= p113) AND (1 <= p119) AND (1 <= p136)))))) AND ((1 <= p83) AND ((1 <= p116) AND ((1 <= p129) AND (1 <= p147))))))",
"processed_size": 190,
"rewrites": 56
},
"result":
{
"edges": 170,
"markings": 170,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 21
},
"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": 508
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (((1 <= p20) AND (1 <= p50)))",
"processed_size": 31,
"rewrites": 56
},
"result":
{
"edges": 170,
"markings": 170,
"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"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 610
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "(((1 <= p114) AND (1 <= p123) AND (1 <= p138)) AND (1 <= p101) AND (1 <= p125) AND (1 <= p140))",
"processed_size": 95,
"rewrites": 61
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 5,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 763
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 0,
"aneg": 2,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "(X (((p113 <= 0) OR (p122 <= 0) OR (p137 <= 0))) R ((p113 <= 0) OR (p122 <= 0) OR (p137 <= 0)))",
"processed_size": 99,
"rewrites": 56
},
"result":
{
"edges": 15,
"markings": 16,
"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": 5,
"type": "boolean"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1526
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 2,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "G ((((p114 <= 0) OR (p119 <= 0) OR (p136 <= 0)) AND ((p111 <= 0) OR (p117 <= 0) OR (p134 <= 0))))",
"processed_size": 101,
"rewrites": 56
},
"result":
{
"edges": 7844,
"markings": 7081,
"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": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3052
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 1,
"X": 0,
"aconj": 3,
"adisj": 1,
"aneg": 0,
"comp": 16,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 16,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 10,
"visible_transitions": 0
},
"processed": "(((p94 <= 0) OR (p116 <= 0) OR (p125 <= 0) OR (p139 <= 0)) U G ((F (((1 <= p76) AND (1 <= p116) AND (1 <= p121) AND (1 <= p135))) AND (((1 <= p92) AND (1 <= p116) AND (1 <= p119) AND (1 <= p133)) OR ((1 <= p76) AND (1 <= p116) AND (1 <= p121) AND (1 <= p135))))))",
"processed_size": 266,
"rewrites": 56
},
"result":
{
"edges": 154,
"markings": 153,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 9,
"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": 6564,
"runtime": 1171.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(X((* R *)) U (X(*) AND **)) : G(F(**)) : (** U G((F(**) AND (** OR **)))) : (X((F(**) U **)) AND (X(**) OR F(G(**)))) : F(G(**)) : G(**) : (X(X(**)) U (X(X(X(G(**)))) AND (** AND (** AND (** AND **))))) : G(F(((* R X(*)) OR **))) : X(**) : ((X(*) R *) OR (** AND (** AND (** AND **))))"
},
"net":
{
"arcs": 8988,
"conflict_clusters": 35,
"places": 149,
"places_significant": 110,
"singleton_clusters": 0,
"transitions": 1280
},
"result":
{
"preliminary_value": "yes no no no no no no unknown no yes ",
"value": "yes no no no no no no unknown no yes "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 1429/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 149
lola: finding significant places
lola: 149 places, 1280 transitions, 110 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 LTLFireability.xml
lola: (X (NOT((((1 <= p67) AND (1 <= p116) AND (1 <= p137)) U ((1 <= p72) AND (1 <= p116) AND (1 <= p120) AND (1 <= p134))))) U (NOT(((1 <= 0) U X (((1 <= p109) AND (1 <= p122) AND (1 <= p139))))) AND ((p109 <= 0) OR (p122 <= 0) OR (p139 <= 0)))) : G (F ((G (((1 <= 0) U (1 <= 0))) OR ((1 <= p106) AND (1 <= p120) AND (1 <= p137))))) : (((p94 <= 0) OR (p116 <= 0) OR (p125 <= 0) OR (p139 <= 0)) U ((1 <= 0) U G ((((1 <= p92) AND (1 <= p116) AND (1 <= p119) AND (1 <= p133)) U ((1 <= p76) AND (1 <= p116) AND (1 <= p121) AND (1 <= p135)))))) : (X ((F (((1 <= p61) AND (1 <= p99))) U ((1 <= p72) AND (1 <= p116) AND (1 <= p119) AND (1 <= p133)))) AND (X (((1 <= p72) AND (1 <= p116) AND (1 <= p119) AND (1 <= p133))) OR F (G (((1 <= p27) AND (1 <= p57)))))) : X (F (X (X (((((p91 <= 0) OR (p116 <= 0) OR (p130 <= 0) OR (p148 <= 0)) AND ((p38 <= 0) OR (p100 <= 0))) U F (G (((1 <= p112) AND (1 <= p122) AND (1 <= p137))))))))) : G ((((p114 <= 0) OR (p119 <= 0) OR (p136 <= 0)) AND ((p111 <= 0) OR (p117 <= 0) OR (p134 <= 0)))) : (X (X (((1 <= p110) AND (1 <= p118) AND (1 <= p133)))) U ((((X (NOT(X (NOT(G (X (((1 <= p113) AND (1 <= p119) AND (1 <= p136)))))))) AND (1 <= p83)) AND (1 <= p116)) AND (1 <= p129)) AND (1 <= p147))) : G (F (G (F ((NOT((((1 <= p71) AND (1 <= p116) AND (1 <= p122) AND (1 <= p140)) U X (((1 <= p67) AND (1 <= p116) AND (1 <= p144))))) OR ((1 <= p71) AND (1 <= p116) AND (1 <= p122) AND (1 <= p140))))))) : ((G (((1 <= p20) AND (1 <= p50))) U (1 <= 0)) U X (((1 <= p20) AND (1 <= p50)))) : (NOT((X (((1 <= p113) AND (1 <= p122) AND (1 <= p137))) U ((1 <= p113) AND (1 <= p122) AND (1 <= p137)))) OR (((((1 <= 0) U ((1 <= p114) AND (1 <= p123) AND (1 <= p138))) AND (1 <= p101)) AND (1 <= p125)) AND (1 <= p140)))
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:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:380
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:297
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:300
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:117
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:185
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X ((((p67 <= 0) OR (p116 <= 0) OR (p137 <= 0)) R ((p72 <= 0) OR (p116 <= 0) OR (p120 <= 0) OR (p134 <= 0)))) U (X (((p109 <= 0) OR (p122 <= 0) OR (p139 <= 0))) AND ((p109 <= 0) OR (p122 <= 0) OR (p139 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (X ((((p67 <= 0) OR (p116 <= 0) OR (p137 <= 0)) R ((p72 <= 0) OR (p116 <= 0) OR (p120 <= 0) OR (p134 <= 0)))) U (X (((p109 <= 0) OR (p122 <= 0) OR (p139 <= 0))) AND ((p109 <= 0) OR (p122 <= 0) OR (p139 <= 0))))
lola: processed formula length: 219
lola: 56 rewrites
lola: closed formula file LTLFireability.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: 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: 31 markings, 30 edges
lola: ========================================
lola: subprocess 1 will run for 395 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X ((F (((1 <= p61) AND (1 <= p99))) U ((1 <= p72) AND (1 <= p116) AND (1 <= p119) AND (1 <= p133)))) AND (X (((1 <= p72) AND (1 <= p116) AND (1 <= p119) AND (1 <= p133))) OR F (G (((1 <= p27) AND (1 <= p57))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 395 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((1 <= p27) AND (1 <= p57))))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G (((1 <= p27) AND (1 <= p57))))
lola: processed formula length: 35
lola: 56 rewrites
lola: closed formula file LTLFireability.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: 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: 162 markings, 163 edges
lola: ========================================
lola: subprocess 2 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((1 <= p72) AND (1 <= p116) AND (1 <= p119) AND (1 <= p133)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((1 <= p72) AND (1 <= p116) AND (1 <= p119) AND (1 <= p133)))
lola: processed formula length: 64
lola: 56 rewrites
lola: closed formula file LTLFireability.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: 170 markings, 170 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (X (((1 <= p110) AND (1 <= p118) AND (1 <= p133)))) U (X (X (X (G (((1 <= p113) AND (1 <= p119) AND (1 <= p136)))))) AND ((1 <= p83) AND ((1 <= p116) AND ((1 <= p129) AND (1 <= p147))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (X (X (((1 <= p110) AND (1 <= p118) AND (1 <= p133)))) U (X (X (X (G (((1 <= p113) AND (1 <= p119) AND (1 <= p136)))))) AND ((1 <= p83) AND ((1 <= p116) AND ((1 <= p129) AND (1 <= p147))))))
lola: processed formula length: 190
lola: 56 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 21 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: 170 markings, 170 edges
lola: ========================================
lola: subprocess 3 will run for 508 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F (((((p71 <= 0) OR (p116 <= 0) OR (p122 <= 0) OR (p140 <= 0)) R X (((p67 <= 0) OR (p116 <= 0) OR (p144 <= 0)))) OR ((1 <= p71) AND (1 <= p116) AND (1 <= p122) AND (1 <= p140)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F (((((p71 <= 0) OR (p116 <= 0) OR (p122 <= 0) OR (p140 <= 0)) R X (((p67 <= 0) OR (p116 <= 0) OR (p144 <= 0)))) OR ((1 <= p71) AND (1 <= p116) AND (1 <= p122) AND (1 <= p140)))))
lola: processed formula length: 187
lola: 56 rewrites
lola: closed formula file LTLFireability.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: 1670334 markings, 2399185 edges, 334067 markings/sec, 0 secs
lola: 3115816 markings, 4597377 edges, 289096 markings/sec, 5 secs
lola: 4571586 markings, 6860861 edges, 291154 markings/sec, 10 secs
lola: 6010347 markings, 9134425 edges, 287752 markings/sec, 15 secs
lola: 7432245 markings, 11394872 edges, 284380 markings/sec, 20 secs
lola: 8815992 markings, 13622386 edges, 276749 markings/sec, 25 secs
lola: 10169134 markings, 15822987 edges, 270628 markings/sec, 30 secs
lola: 11534953 markings, 18050892 edges, 273164 markings/sec, 35 secs
lola: 12889403 markings, 20280716 edges, 270890 markings/sec, 40 secs
lola: 14229984 markings, 22492917 edges, 268116 markings/sec, 45 secs
lola: 15563578 markings, 24704661 edges, 266719 markings/sec, 50 secs
lola: 16907616 markings, 26943109 edges, 268808 markings/sec, 55 secs
lola: 18278196 markings, 29232547 edges, 274116 markings/sec, 60 secs
lola: 19622714 markings, 31483189 edges, 268904 markings/sec, 65 secs
lola: 20971940 markings, 33751108 edges, 269845 markings/sec, 70 secs
lola: 22281411 markings, 35966876 edges, 261894 markings/sec, 75 secs
lola: 23605014 markings, 38204171 edges, 264721 markings/sec, 80 secs
lola: 24915039 markings, 40426262 edges, 262005 markings/sec, 85 secs
lola: 26239813 markings, 42680303 edges, 264955 markings/sec, 90 secs
lola: 27533705 markings, 44881590 edges, 258778 markings/sec, 95 secs
lola: 28845100 markings, 47124726 edges, 262279 markings/sec, 100 secs
lola: 30123889 markings, 49315697 edges, 255758 markings/sec, 105 secs
lola: 31415821 markings, 51530705 edges, 258386 markings/sec, 110 secs
lola: 32684169 markings, 53707331 edges, 253670 markings/sec, 115 secs
lola: 33964902 markings, 55915019 edges, 256147 markings/sec, 120 secs
lola: 35209871 markings, 58063196 edges, 248994 markings/sec, 125 secs
lola: 36496446 markings, 60288004 edges, 257315 markings/sec, 130 secs
lola: 37728993 markings, 62415647 edges, 246509 markings/sec, 135 secs
lola: 39001442 markings, 64617680 edges, 254490 markings/sec, 140 secs
lola: 40230151 markings, 66747130 edges, 245742 markings/sec, 145 secs
lola: 41498883 markings, 68952324 edges, 253746 markings/sec, 150 secs
lola: 42730331 markings, 71102245 edges, 246290 markings/sec, 155 secs
lola: 43995328 markings, 73302928 edges, 252999 markings/sec, 160 secs
lola: 45232311 markings, 75457362 edges, 247397 markings/sec, 165 secs
lola: 46486483 markings, 77646223 edges, 250834 markings/sec, 170 secs
lola: 47718739 markings, 79811105 edges, 246451 markings/sec, 175 secs
lola: 48965236 markings, 81997707 edges, 249299 markings/sec, 180 secs
lola: 50213182 markings, 84186441 edges, 249589 markings/sec, 185 secs
lola: 51409456 markings, 86290401 edges, 239255 markings/sec, 190 secs
lola: 52636728 markings, 88442251 edges, 245454 markings/sec, 195 secs
lola: 53868110 markings, 90610868 edges, 246276 markings/sec, 200 secs
lola: 55105552 markings, 92791746 edges, 247488 markings/sec, 205 secs
lola: 56350817 markings, 94983924 edges, 249053 markings/sec, 210 secs
lola: 57591232 markings, 97178476 edges, 248083 markings/sec, 215 secs
lola: 58833094 markings, 99374541 edges, 248372 markings/sec, 220 secs
lola: 60069257 markings, 101556764 edges, 247233 markings/sec, 225 secs
lola: 61313085 markings, 103755517 edges, 248766 markings/sec, 230 secs
lola: 62542454 markings, 105930981 edges, 245874 markings/sec, 235 secs
lola: 63776259 markings, 108114508 edges, 246761 markings/sec, 240 secs
lola: 65007429 markings, 110294081 edges, 246234 markings/sec, 245 secs
lola: 66234079 markings, 112473522 edges, 245330 markings/sec, 250 secs
lola: 67456133 markings, 114642090 edges, 244411 markings/sec, 255 secs
lola: 68687867 markings, 116838378 edges, 246347 markings/sec, 260 secs
lola: 69919764 markings, 119030330 edges, 246379 markings/sec, 265 secs
lola: 71140216 markings, 121212517 edges, 244090 markings/sec, 270 secs
lola: 72365509 markings, 123405046 edges, 245059 markings/sec, 275 secs
lola: 73588959 markings, 125591733 edges, 244690 markings/sec, 280 secs
lola: 74816285 markings, 127772835 edges, 245465 markings/sec, 285 secs
lola: 76038078 markings, 129966588 edges, 244359 markings/sec, 290 secs
lola: 77258089 markings, 132153519 edges, 244002 markings/sec, 295 secs
lola: 78476332 markings, 134331818 edges, 243649 markings/sec, 300 secs
lola: 79695254 markings, 136510591 edges, 243784 markings/sec, 305 secs
lola: 80903559 markings, 138679969 edges, 241661 markings/sec, 310 secs
lola: 82116617 markings, 140858285 edges, 242612 markings/sec, 315 secs
lola: 83310600 markings, 143003217 edges, 238797 markings/sec, 320 secs
lola: 84497846 markings, 145150238 edges, 237449 markings/sec, 325 secs
lola: 85694978 markings, 147300114 edges, 239426 markings/sec, 330 secs
lola: 86883526 markings, 149442186 edges, 237710 markings/sec, 335 secs
lola: 88080251 markings, 151607972 edges, 239345 markings/sec, 340 secs
lola: 89268380 markings, 153755795 edges, 237626 markings/sec, 345 secs
lola: 90449621 markings, 155886699 edges, 236248 markings/sec, 350 secs
lola: 91627001 markings, 158008354 edges, 235476 markings/sec, 355 secs
lola: 92807577 markings, 160146774 edges, 236115 markings/sec, 360 secs
lola: 93974489 markings, 162265172 edges, 233382 markings/sec, 365 secs
lola: 95105054 markings, 164313841 edges, 226113 markings/sec, 370 secs
lola: 95876061 markings, 165702589 edges, 154201 markings/sec, 375 secs
lola: 96265062 markings, 166415550 edges, 77800 markings/sec, 380 secs
lola: 96679095 markings, 167158444 edges, 82807 markings/sec, 385 secs
lola: 97033819 markings, 167797952 edges, 70945 markings/sec, 390 secs
lola: 97336170 markings, 168346411 edges, 60470 markings/sec, 395 secs
lola: 97625798 markings, 168872144 edges, 57926 markings/sec, 400 secs
lola: 98067835 markings, 169676167 edges, 88407 markings/sec, 405 secs
lola: 98578114 markings, 170605315 edges, 102056 markings/sec, 410 secs
lola: 98950416 markings, 171280332 edges, 74460 markings/sec, 415 secs
lola: 99323427 markings, 171954133 edges, 74602 markings/sec, 420 secs
lola: 99784344 markings, 172789114 edges, 92183 markings/sec, 425 secs
lola: 100506368 markings, 174102124 edges, 144405 markings/sec, 430 secs
lola: 101356063 markings, 175650653 edges, 169939 markings/sec, 435 secs
lola: 101779147 markings, 176419625 edges, 84617 markings/sec, 440 secs
lola: 102473099 markings, 177682724 edges, 138790 markings/sec, 445 secs
lola: 103132585 markings, 178887751 edges, 131897 markings/sec, 450 secs
lola: 103937437 markings, 180353669 edges, 160970 markings/sec, 455 secs
lola: 104464571 markings, 181320447 edges, 105427 markings/sec, 460 secs
lola: 104816837 markings, 181964756 edges, 70453 markings/sec, 465 secs
lola: 105486888 markings, 183189138 edges, 134010 markings/sec, 470 secs
lola: 105995996 markings, 184109875 edges, 101822 markings/sec, 475 secs
lola: 106551153 markings, 185119516 edges, 111031 markings/sec, 480 secs
lola: 106869134 markings, 185697089 edges, 63596 markings/sec, 485 secs
lola: 107161530 markings, 186229594 edges, 58479 markings/sec, 490 secs
lola: 107449570 markings, 186753711 edges, 57608 markings/sec, 495 secs
lola: 107712232 markings, 187232988 edges, 52532 markings/sec, 500 secs
lola: local time limit reached - aborting
lola:
preliminary result: yes unknown unknown no unknown unknown no unknown unknown unknown
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 508 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((1 <= p20) AND (1 <= p50)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((1 <= p20) AND (1 <= p50)))
lola: processed formula length: 31
lola: 56 rewrites
lola: closed formula file LTLFireability.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: 170 markings, 170 edges
lola: ========================================
lola: subprocess 5 will run for 610 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((X (((p113 <= 0) OR (p122 <= 0) OR (p137 <= 0))) R ((p113 <= 0) OR (p122 <= 0) OR (p137 <= 0))) OR (((1 <= p114) AND (1 <= p123) AND (1 <= p138)) AND ((1 <= p101) AND ((1 <= p125) AND (1 <= p140)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 610 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p114) AND (1 <= p123) AND (1 <= p138)) AND ((1 <= p101) AND ((1 <= p125) AND (1 <= p140))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: rewrite Frontend/Parser/formula_rewrite.k:794
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: rewrite Frontend/Parser/formula_rewrite.k:794
lola: processed formula: (((1 <= p114) AND (1 <= p123) AND (1 <= p138)) AND (1 <= p101) AND (1 <= p125) AND (1 <= p140))
lola: processed formula length: 95
lola: 61 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 6 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 6 will run for 763 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (((p113 <= 0) OR (p122 <= 0) OR (p137 <= 0))) R ((p113 <= 0) OR (p122 <= 0) OR (p137 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (X (((p113 <= 0) OR (p122 <= 0) OR (p137 <= 0))) R ((p113 <= 0) OR (p122 <= 0) OR (p137 <= 0)))
lola: processed formula length: 99
lola: 56 rewrites
lola: closed formula file LTLFireability.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: 16 markings, 15 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 6 will run for 763 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F (((1 <= p106) AND (1 <= p120) AND (1 <= p137))))
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 (((1 <= p106) AND (1 <= p120) AND (1 <= p137))))
lola: processed formula length: 53
lola: 56 rewrites
lola: closed formula file LTLFireability.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: 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: 112 markings, 112 edges
lola: ========================================
lola: subprocess 7 will run for 1017 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((1 <= p112) AND (1 <= p122) AND (1 <= p137))))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G (((1 <= p112) AND (1 <= p122) AND (1 <= p137))))
lola: processed formula length: 53
lola: 56 rewrites
lola: closed formula file LTLFireability.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: 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: 65 markings, 66 edges
lola: ========================================
lola: subprocess 8 will run for 1526 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((((p114 <= 0) OR (p119 <= 0) OR (p136 <= 0)) AND ((p111 <= 0) OR (p117 <= 0) OR (p134 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((((p114 <= 0) OR (p119 <= 0) OR (p136 <= 0)) AND ((p111 <= 0) OR (p117 <= 0) OR (p134 <= 0))))
lola: processed formula length: 101
lola: 56 rewrites
lola: closed formula file LTLFireability.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: 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: 7081 markings, 7844 edges
lola: ========================================
lola: subprocess 9 will run for 3052 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p94 <= 0) OR (p116 <= 0) OR (p125 <= 0) OR (p139 <= 0)) U G ((F (((1 <= p76) AND (1 <= p116) AND (1 <= p121) AND (1 <= p135))) AND (((1 <= p92) AND (1 <= p116) AND (1 <= p119) AND (1 <= p133)) OR ((1 <= p76) AND (1 <= p116) AND (1 <= p121) AND (1 <= p135))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (((p94 <= 0) OR (p116 <= 0) OR (p125 <= 0) OR (p139 <= 0)) U G ((F (((1 <= p76) AND (1 <= p116) AND (1 <= p121) AND (1 <= p135))) AND (((1 <= p92) AND (1 <= p116) AND (1 <= p119) AND (1 <= p133)) OR ((1 <= p76) AND (1 <= p116) AND (1 <= p121) AND (1 <= p135))))))
lola: processed formula length: 266
lola: 56 rewrites
lola: closed formula file LTLFireability.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: 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: 153 markings, 154 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: G (F (((((p71 <= 0) OR (p116 <= 0) OR (p122 <= 0) OR (p140 <= 0)) R X (((p67 <= 0) OR (p116 <= 0) OR (p144 <= 0)))) OR ((1 <= p71) AND (1 <= p116) AND (1 <= p122) AND (1 <= p140)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F (((((p71 <= 0) OR (p116 <= 0) OR (p122 <= 0) OR (p140 <= 0)) R X (((p67 <= 0) OR (p116 <= 0) OR (p144 <= 0)))) OR ((1 <= p71) AND (1 <= p116) AND (1 <= p122) AND (1 <= p140)))))
lola: processed formula length: 187
lola: 56 rewrites
lola: closed formula file LTLFireability.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: 1623768 markings, 2330109 edges, 324754 markings/sec, 0 secs
lola: 3119605 markings, 4603738 edges, 299167 markings/sec, 5 secs
lola: 4543680 markings, 6817424 edges, 284815 markings/sec, 10 secs
lola: 5916198 markings, 8984130 edges, 274504 markings/sec, 15 secs
lola: 7264502 markings, 11128907 edges, 269661 markings/sec, 20 secs
lola: 8604864 markings, 13280198 edges, 268072 markings/sec, 25 secs
lola: 9909962 markings, 15400091 edges, 261020 markings/sec, 30 secs
lola: 11202186 markings, 17504987 edges, 258445 markings/sec, 35 secs
lola: 12430558 markings, 19523754 edges, 245674 markings/sec, 40 secs
lola: 13672125 markings, 21573576 edges, 248313 markings/sec, 45 secs
lola: 14960053 markings, 23703384 edges, 257586 markings/sec, 50 secs
lola: 16189494 markings, 25744051 edges, 245888 markings/sec, 55 secs
lola: 17457856 markings, 27860700 edges, 253672 markings/sec, 60 secs
lola: 18685558 markings, 29913932 edges, 245540 markings/sec, 65 secs
lola: 19930028 markings, 32003917 edges, 248894 markings/sec, 70 secs
lola: 21146663 markings, 34046488 edges, 243327 markings/sec, 75 secs
lola: 22358560 markings, 36098104 edges, 242379 markings/sec, 80 secs
lola: 23569819 markings, 38144151 edges, 242252 markings/sec, 85 secs
lola: 24805115 markings, 40238824 edges, 247059 markings/sec, 90 secs
lola: 25986993 markings, 42250584 edges, 236376 markings/sec, 95 secs
lola: 27214749 markings, 44337098 edges, 245551 markings/sec, 100 secs
lola: 28390341 markings, 46347067 edges, 235118 markings/sec, 105 secs
lola: 29590512 markings, 48395625 edges, 240034 markings/sec, 110 secs
lola: 30757120 markings, 50402494 edges, 233322 markings/sec, 115 secs
lola: 31956220 markings, 52456420 edges, 239820 markings/sec, 120 secs
lola: 33116789 markings, 54452546 edges, 232114 markings/sec, 125 secs
lola: 34302328 markings, 56495846 edges, 237108 markings/sec, 130 secs
lola: 35475979 markings, 58523731 edges, 234730 markings/sec, 135 secs
lola: 36634887 markings, 60528037 edges, 231782 markings/sec, 140 secs
lola: 37743814 markings, 62441526 edges, 221785 markings/sec, 145 secs
lola: 38816469 markings, 64297647 edges, 214531 markings/sec, 150 secs
lola: 40004041 markings, 66351860 edges, 237514 markings/sec, 155 secs
lola: 41166017 markings, 68373740 edges, 232395 markings/sec, 160 secs
lola: 42338869 markings, 70419109 edges, 234570 markings/sec, 165 secs
lola: 43483143 markings, 72411232 edges, 228855 markings/sec, 170 secs
lola: 44644678 markings, 74435419 edges, 232307 markings/sec, 175 secs
lola: 45805057 markings, 76457525 edges, 232076 markings/sec, 180 secs
lola: 46961760 markings, 78482028 edges, 231341 markings/sec, 185 secs
lola: 48108879 markings, 80496189 edges, 229424 markings/sec, 190 secs
lola: 49262128 markings, 82519982 edges, 230650 markings/sec, 195 secs
lola: 50425498 markings, 84560963 edges, 232674 markings/sec, 200 secs
lola: 51619431 markings, 86658401 edges, 238787 markings/sec, 205 secs
lola: 52800950 markings, 88731374 edges, 236304 markings/sec, 210 secs
lola: 53998411 markings, 90841016 edges, 239492 markings/sec, 215 secs
lola: 55184363 markings, 92931952 edges, 237190 markings/sec, 220 secs
lola: 56388143 markings, 95050259 edges, 240756 markings/sec, 225 secs
lola: 57558716 markings, 97120985 edges, 234115 markings/sec, 230 secs
lola: 58761556 markings, 99248772 edges, 240568 markings/sec, 235 secs
lola: 59945905 markings, 101339288 edges, 236870 markings/sec, 240 secs
lola: 61156518 markings, 103478053 edges, 242123 markings/sec, 245 secs
lola: 62343375 markings, 105579809 edges, 237371 markings/sec, 250 secs
lola: 63551167 markings, 107715442 edges, 241558 markings/sec, 255 secs
lola: 64735114 markings, 109811426 edges, 236789 markings/sec, 260 secs
lola: 65935621 markings, 111944876 edges, 240101 markings/sec, 265 secs
lola: 67117775 markings, 114040835 edges, 236431 markings/sec, 270 secs
lola: 68302188 markings, 116152846 edges, 236883 markings/sec, 275 secs
lola: 69480757 markings, 118247452 edges, 235714 markings/sec, 280 secs
lola: 70657289 markings, 120347587 edges, 235306 markings/sec, 285 secs
lola: 71816201 markings, 122421630 edges, 231782 markings/sec, 290 secs
lola: 73004083 markings, 124546281 edges, 237576 markings/sec, 295 secs
lola: 74165231 markings, 126612307 edges, 232230 markings/sec, 300 secs
lola: 75341326 markings, 128714918 edges, 235219 markings/sec, 305 secs
lola: 76484994 markings, 130767036 edges, 228734 markings/sec, 310 secs
lola: 77663468 markings, 132876907 edges, 235695 markings/sec, 315 secs
lola: 78812959 markings, 134935036 edges, 229898 markings/sec, 320 secs
lola: 79999350 markings, 137055704 edges, 237278 markings/sec, 325 secs
lola: 81148593 markings, 139121303 edges, 229849 markings/sec, 330 secs
lola: 82320697 markings, 141225015 edges, 234421 markings/sec, 335 secs
lola: 83476839 markings, 143302271 edges, 231228 markings/sec, 340 secs
lola: 84640686 markings, 145406574 edges, 232769 markings/sec, 345 secs
lola: 85788011 markings, 147468060 edges, 229465 markings/sec, 350 secs
lola: 86943327 markings, 149548852 edges, 231063 markings/sec, 355 secs
lola: 88107131 markings, 151657243 edges, 232761 markings/sec, 360 secs
lola: 89249080 markings, 153720706 edges, 228390 markings/sec, 365 secs
lola: 90407449 markings, 155810819 edges, 231674 markings/sec, 370 secs
lola: 91546540 markings, 157866657 edges, 227818 markings/sec, 375 secs
lola: 92710991 markings, 159970203 edges, 232890 markings/sec, 380 secs
lola: 93866693 markings, 162071002 edges, 231140 markings/sec, 385 secs
lola: 95027286 markings, 164173011 edges, 232119 markings/sec, 390 secs
lola: 96135392 markings, 166170641 edges, 221621 markings/sec, 395 secs
lola: 96628302 markings, 167070212 edges, 98582 markings/sec, 400 secs
lola: 97001359 markings, 167739922 edges, 74611 markings/sec, 405 secs
lola: 97296978 markings, 168274380 edges, 59124 markings/sec, 410 secs
lola: 97583620 markings, 168795172 edges, 57328 markings/sec, 415 secs
lola: 98325995 markings, 170146721 edges, 148475 markings/sec, 420 secs
lola: 98971003 markings, 171317263 edges, 129002 markings/sec, 425 secs
lola: 99556028 markings, 172375516 edges, 117005 markings/sec, 430 secs
lola: 99918341 markings, 173031864 edges, 72463 markings/sec, 435 secs
lola: 100266493 markings, 173666475 edges, 69630 markings/sec, 440 secs
lola: 100600240 markings, 174274511 edges, 66749 markings/sec, 445 secs
lola: 100992736 markings, 174988810 edges, 78499 markings/sec, 450 secs
lola: 101469479 markings, 175856645 edges, 95349 markings/sec, 455 secs
lola: 101788185 markings, 176436553 edges, 63741 markings/sec, 460 secs
lola: 102333435 markings, 177430327 edges, 109050 markings/sec, 465 secs
lola: 102941229 markings, 178539489 edges, 121559 markings/sec, 470 secs
lola: 103492159 markings, 179543238 edges, 110186 markings/sec, 475 secs
lola: 103936301 markings, 180351614 edges, 88828 markings/sec, 480 secs
lola: 104533645 markings, 181447325 edges, 119469 markings/sec, 485 secs
lola: 105085263 markings, 182452816 edges, 110324 markings/sec, 490 secs
lola: 105655144 markings, 183495242 edges, 113976 markings/sec, 495 secs
lola: 106361272 markings, 184772892 edges, 141226 markings/sec, 500 secs
lola: 107186370 markings, 186275025 edges, 165020 markings/sec, 505 secs
lola: 107379723 markings, 186626132 edges, 38671 markings/sec, 510 secs
lola: 108148171 markings, 188028091 edges, 153690 markings/sec, 515 secs
lola: 108904290 markings, 189412350 edges, 151224 markings/sec, 520 secs
lola: 109616537 markings, 190715430 edges, 142449 markings/sec, 525 secs
lola: 110301222 markings, 191964937 edges, 136937 markings/sec, 530 secs
lola: 110966488 markings, 193180512 edges, 133053 markings/sec, 535 secs
lola: 111643637 markings, 194418182 edges, 135430 markings/sec, 540 secs
lola: 112119294 markings, 195288779 edges, 95131 markings/sec, 545 secs
lola: 112707412 markings, 196365865 edges, 117624 markings/sec, 550 secs
lola: 112976469 markings, 196856381 edges, 53811 markings/sec, 555 secs
lola: 113597400 markings, 197993248 edges, 124186 markings/sec, 560 secs
lola: 113952714 markings, 198645010 edges, 71063 markings/sec, 565 secs
lola: 114665379 markings, 199951094 edges, 142533 markings/sec, 570 secs
lola: 115261950 markings, 201043234 edges, 119314 markings/sec, 575 secs
lola: 115982928 markings, 202358996 edges, 144196 markings/sec, 580 secs
lola: 116847615 markings, 203941054 edges, 172937 markings/sec, 585 secs
lola: 117178746 markings, 204552053 edges, 66226 markings/sec, 590 secs
lola: 117471749 markings, 205092172 edges, 58601 markings/sec, 595 secs
lola: 117760949 markings, 205622611 edges, 57840 markings/sec, 600 secs
lola: 118035543 markings, 206127099 edges, 54919 markings/sec, 605 secs
lola: 118308912 markings, 206629632 edges, 54674 markings/sec, 610 secs
lola: 118582772 markings, 207134099 edges, 54772 markings/sec, 615 secs
lola: 118824286 markings, 207578262 edges, 48303 markings/sec, 620 secs
lola: 119078398 markings, 208047593 edges, 50822 markings/sec, 625 secs
lola: 119332657 markings, 208513013 edges, 50852 markings/sec, 630 secs
lola: 119619029 markings, 209035395 edges, 57274 markings/sec, 635 secs
lola: 119815271 markings, 209394461 edges, 39248 markings/sec, 640 secs
lola: 120335067 markings, 210345355 edges, 103959 markings/sec, 645 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: yes no no no no no no unknown no yes
lola:
preliminary result: yes no no no no no no unknown no yes
lola: memory consumption: 6564 KB
lola: time consumption: 1171 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLFireability.json
lola: closed JSON file LTLFireability.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="SimpleLoadBal-PT-15"
export BK_EXAMINATION="LTLFireability"
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 SimpleLoadBal-PT-15, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r186-oct2-158987939300618"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SimpleLoadBal-PT-15.tgz
mv SimpleLoadBal-PT-15 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;