fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r186-oct2-158987939300626
Last Updated
Jun 28, 2020

About the Execution of ITS-LoLa for SimpleLoadBal-PT-20

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15726.670 3600000.00 510749.00 108.30 FFFTFTFFFFTFFFFF normal

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-158987939300626.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-20, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r186-oct2-158987939300626
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.2M
-rw-r--r-- 1 mcc users 3.6K Apr 12 17:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 16K Apr 12 17:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Apr 11 20:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 14K 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.2K 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.6K Apr 14 12:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 30 14:52 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K 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.6K Apr 10 05:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K 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 2.0M 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-20-00
FORMULA_NAME SimpleLoadBal-PT-20-01
FORMULA_NAME SimpleLoadBal-PT-20-02
FORMULA_NAME SimpleLoadBal-PT-20-03
FORMULA_NAME SimpleLoadBal-PT-20-04
FORMULA_NAME SimpleLoadBal-PT-20-05
FORMULA_NAME SimpleLoadBal-PT-20-06
FORMULA_NAME SimpleLoadBal-PT-20-07
FORMULA_NAME SimpleLoadBal-PT-20-08
FORMULA_NAME SimpleLoadBal-PT-20-09
FORMULA_NAME SimpleLoadBal-PT-20-10
FORMULA_NAME SimpleLoadBal-PT-20-11
FORMULA_NAME SimpleLoadBal-PT-20-12
FORMULA_NAME SimpleLoadBal-PT-20-13
FORMULA_NAME SimpleLoadBal-PT-20-14
FORMULA_NAME SimpleLoadBal-PT-20-15

=== Now, execution of the tool begins

BK_START 1591255284429

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-04 07:21:26] [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:21:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-04 07:21:26] [INFO ] Load time of PNML (sax parser for PT used): 161 ms
[2020-06-04 07:21:26] [INFO ] Transformed 194 places.
[2020-06-04 07:21:26] [INFO ] Transformed 2205 transitions.
[2020-06-04 07:21:26] [INFO ] Parsed PT model containing 194 places and 2205 transitions in 208 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 47 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 746 ms. (steps per millisecond=134 ) properties seen :[1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 0, 1, 1, 0, 0, 1, 0, 1, 1, 1, 1, 0, 0, 0, 1, 0, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0]
[2020-06-04 07:21:27] [INFO ] Flow matrix only has 1745 transitions (discarded 460 similar events)
// Phase 1: matrix 1745 rows 194 cols
[2020-06-04 07:21:27] [INFO ] Invariants computation overflowed in 26 ms
[2020-06-04 07:21:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 07:21:27] [INFO ] [Real]Absence check using state equation in 469 ms returned sat
[2020-06-04 07:21:27] [INFO ] State equation strengthened by 841 read => feed constraints.
[2020-06-04 07:21:28] [INFO ] [Real]Added 841 Read/Feed constraints in 241 ms returned sat
[2020-06-04 07:21:28] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 07:21:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 07:21:28] [INFO ] [Nat]Absence check using state equation in 575 ms returned sat
[2020-06-04 07:21:29] [INFO ] [Nat]Added 841 Read/Feed constraints in 458 ms returned sat
[2020-06-04 07:21:29] [INFO ] Deduced a trap composed of 24 places in 254 ms
[2020-06-04 07:21:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 382 ms
[2020-06-04 07:21:30] [INFO ] Computed and/alt/rep : 2185/311302/1725 causal constraints in 607 ms.
[2020-06-04 07:21:48] [INFO ] Added : 350 causal constraints over 70 iterations in 18587 ms. Result :(error "Failed to check-sat")
[2020-06-04 07:21:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 07:21:48] [INFO ] [Real]Absence check using state equation in 435 ms returned sat
[2020-06-04 07:21:48] [INFO ] [Real]Added 841 Read/Feed constraints in 278 ms returned sat
[2020-06-04 07:21:48] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 07:21:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 07:21:49] [INFO ] [Nat]Absence check using state equation in 444 ms returned sat
[2020-06-04 07:21:49] [INFO ] [Nat]Added 841 Read/Feed constraints in 418 ms returned sat
[2020-06-04 07:21:50] [INFO ] Deduced a trap composed of 31 places in 232 ms
[2020-06-04 07:21:50] [INFO ] Deduced a trap composed of 28 places in 343 ms
[2020-06-04 07:21:50] [INFO ] Deduced a trap composed of 27 places in 201 ms
[2020-06-04 07:21:51] [INFO ] Deduced a trap composed of 25 places in 250 ms
[2020-06-04 07:21:51] [INFO ] Deduced a trap composed of 36 places in 200 ms
[2020-06-04 07:21:51] [INFO ] Deduced a trap composed of 26 places in 199 ms
[2020-06-04 07:21:51] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1755 ms
[2020-06-04 07:21:51] [INFO ] Computed and/alt/rep : 2185/311302/1725 causal constraints in 202 ms.
[2020-06-04 07:22:09] [INFO ] Added : 345 causal constraints over 69 iterations in 17382 ms. Result :(error "Solver has unexpectedly terminated")
[2020-06-04 07:22:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 07:22:09] [INFO ] [Real]Absence check using state equation in 471 ms returned sat
[2020-06-04 07:22:09] [INFO ] [Real]Added 841 Read/Feed constraints in 228 ms returned sat
[2020-06-04 07:22:09] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 07:22:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 07:22:10] [INFO ] [Nat]Absence check using state equation in 531 ms returned sat
[2020-06-04 07:22:10] [INFO ] [Nat]Added 841 Read/Feed constraints in 470 ms returned sat
[2020-06-04 07:22:11] [INFO ] Computed and/alt/rep : 2185/311302/1725 causal constraints in 266 ms.
[2020-06-04 07:22:29] [INFO ] Added : 375 causal constraints over 75 iterations in 18972 ms. Result :unknown
[2020-06-04 07:22:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 07:22:30] [INFO ] [Real]Absence check using state equation in 725 ms returned sat
[2020-06-04 07:22:31] [INFO ] [Real]Added 841 Read/Feed constraints in 424 ms returned sat
[2020-06-04 07:22:31] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 07:22:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 07:22:31] [INFO ] [Nat]Absence check using state equation in 780 ms returned sat
[2020-06-04 07:22:32] [INFO ] [Nat]Added 841 Read/Feed constraints in 506 ms returned sat
[2020-06-04 07:22:32] [INFO ] Computed and/alt/rep : 2185/311302/1725 causal constraints in 193 ms.
[2020-06-04 07:22:51] [INFO ] Added : 370 causal constraints over 74 iterations in 18684 ms. Result :unknown
[2020-06-04 07:22:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 07:22:51] [INFO ] [Real]Absence check using state equation in 740 ms returned sat
[2020-06-04 07:22:52] [INFO ] [Real]Added 841 Read/Feed constraints in 264 ms returned sat
[2020-06-04 07:22:52] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 07:22:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 07:22:52] [INFO ] [Nat]Absence check using state equation in 491 ms returned sat
[2020-06-04 07:22:52] [INFO ] [Nat]Added 841 Read/Feed constraints in 248 ms returned sat
[2020-06-04 07:22:53] [INFO ] Computed and/alt/rep : 2185/311302/1725 causal constraints in 172 ms.
[2020-06-04 07:23:12] [INFO ] Added : 390 causal constraints over 78 iterations in 19220 ms. Result :unknown
[2020-06-04 07:23:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 07:23:12] [INFO ] [Real]Absence check using state equation in 549 ms returned sat
[2020-06-04 07:23:13] [INFO ] [Real]Added 841 Read/Feed constraints in 220 ms returned sat
[2020-06-04 07:23:13] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 07:23:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 07:23:13] [INFO ] [Nat]Absence check using state equation in 407 ms returned sat
[2020-06-04 07:23:13] [INFO ] [Nat]Added 841 Read/Feed constraints in 255 ms returned sat
[2020-06-04 07:23:13] [INFO ] Computed and/alt/rep : 2185/311302/1725 causal constraints in 217 ms.
[2020-06-04 07:23:33] [INFO ] Added : 360 causal constraints over 72 iterations in 19312 ms. Result :(error "Failed to check-sat")
[2020-06-04 07:23:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 07:23:33] [INFO ] [Real]Absence check using state equation in 437 ms returned sat
[2020-06-04 07:23:33] [INFO ] [Real]Added 841 Read/Feed constraints in 213 ms returned sat
[2020-06-04 07:23:33] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 07:23:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 07:23:34] [INFO ] [Nat]Absence check using state equation in 399 ms returned sat
[2020-06-04 07:23:34] [INFO ] [Nat]Added 841 Read/Feed constraints in 249 ms returned sat
[2020-06-04 07:23:34] [INFO ] Computed and/alt/rep : 2185/311302/1725 causal constraints in 209 ms.
[2020-06-04 07:23:53] [INFO ] Added : 370 causal constraints over 74 iterations in 19331 ms. Result :unknown
[2020-06-04 07:23:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 07:23:54] [INFO ] [Real]Absence check using state equation in 427 ms returned unsat
[2020-06-04 07:23:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 07:23:54] [INFO ] [Real]Absence check using state equation in 458 ms returned sat
[2020-06-04 07:23:55] [INFO ] [Real]Added 841 Read/Feed constraints in 234 ms returned sat
[2020-06-04 07:23:55] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 07:23:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 07:23:55] [INFO ] [Nat]Absence check using state equation in 439 ms returned sat
[2020-06-04 07:23:55] [INFO ] [Nat]Added 841 Read/Feed constraints in 244 ms returned sat
[2020-06-04 07:23:56] [INFO ] Computed and/alt/rep : 2185/311302/1725 causal constraints in 345 ms.
[2020-06-04 07:24:15] [INFO ] Added : 385 causal constraints over 77 iterations in 19280 ms. Result :(error "Solver has unexpectedly terminated")
[2020-06-04 07:24:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 07:24:15] [INFO ] [Real]Absence check using state equation in 431 ms returned sat
[2020-06-04 07:24:15] [INFO ] [Real]Added 841 Read/Feed constraints in 254 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]Adding state equation constraints to refine reachable states.
[2020-06-04 07:24:16] [INFO ] [Nat]Absence check using state equation in 379 ms returned sat
[2020-06-04 07:24:16] [INFO ] [Nat]Added 841 Read/Feed constraints in 322 ms returned sat
[2020-06-04 07:24:16] [INFO ] Computed and/alt/rep : 2185/311302/1725 causal constraints in 182 ms.
[2020-06-04 07:24:35] [INFO ] Added : 385 causal constraints over 77 iterations in 19274 ms. Result :unknown
[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 460 ms returned sat
[2020-06-04 07:24:36] [INFO ] [Real]Added 841 Read/Feed constraints in 211 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]Adding state equation constraints to refine reachable states.
[2020-06-04 07:24:37] [INFO ] [Nat]Absence check using state equation in 494 ms returned sat
[2020-06-04 07:24:37] [INFO ] [Nat]Added 841 Read/Feed constraints in 460 ms returned sat
[2020-06-04 07:24:37] [INFO ] Computed and/alt/rep : 2185/311302/1725 causal constraints in 273 ms.
[2020-06-04 07:24:56] [INFO ] Added : 375 causal constraints over 75 iterations in 19027 ms. Result :unknown
[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 467 ms returned sat
[2020-06-04 07:24:57] [INFO ] [Real]Added 841 Read/Feed constraints in 213 ms returned sat
[2020-06-04 07:24:57] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 07:24:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 07:24:57] [INFO ] [Nat]Absence check using state equation in 464 ms returned sat
[2020-06-04 07:24:58] [INFO ] [Nat]Added 841 Read/Feed constraints in 445 ms returned sat
[2020-06-04 07:24:58] [INFO ] Computed and/alt/rep : 2185/311302/1725 causal constraints in 261 ms.
[2020-06-04 07:25:17] [INFO ] Added : 375 causal constraints over 75 iterations in 19142 ms. Result :(error "Failed to check-sat")
[2020-06-04 07:25:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 07:25:18] [INFO ] [Real]Absence check using state equation in 459 ms returned unsat
[2020-06-04 07:25:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 07:25:18] [INFO ] [Real]Absence check using state equation in 415 ms returned sat
[2020-06-04 07:25:18] [INFO ] [Real]Added 841 Read/Feed constraints in 244 ms returned sat
[2020-06-04 07:25:18] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 07:25:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 07:25:19] [INFO ] [Nat]Absence check using state equation in 424 ms returned sat
[2020-06-04 07:25:19] [INFO ] [Nat]Added 841 Read/Feed constraints in 281 ms returned sat
[2020-06-04 07:25:19] [INFO ] Computed and/alt/rep : 2185/311302/1725 causal constraints in 260 ms.
[2020-06-04 07:25:38] [INFO ] Added : 380 causal constraints over 76 iterations in 19256 ms. Result :(error "Failed to check-sat")
[2020-06-04 07:25:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 07:25:39] [INFO ] [Real]Absence check using state equation in 462 ms returned unsat
[2020-06-04 07:25:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 07:25:39] [INFO ] [Real]Absence check using state equation in 575 ms returned sat
[2020-06-04 07:25:40] [INFO ] [Real]Added 841 Read/Feed constraints in 380 ms returned sat
[2020-06-04 07:25:40] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 07:25:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 07:25:40] [INFO ] [Nat]Absence check using state equation in 466 ms returned sat
[2020-06-04 07:25:41] [INFO ] [Nat]Added 841 Read/Feed constraints in 471 ms returned sat
[2020-06-04 07:25:41] [INFO ] Deduced a trap composed of 25 places in 232 ms
[2020-06-04 07:25:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 305 ms
[2020-06-04 07:25:41] [INFO ] Computed and/alt/rep : 2185/311302/1725 causal constraints in 170 ms.
[2020-06-04 07:26:00] [INFO ] Added : 375 causal constraints over 75 iterations in 18758 ms. Result :unknown
[2020-06-04 07:26:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 07:26:00] [INFO ] [Real]Absence check using state equation in 391 ms returned sat
[2020-06-04 07:26:01] [INFO ] [Real]Added 841 Read/Feed constraints in 215 ms returned sat
[2020-06-04 07:26:01] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 07:26:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 07:26:01] [INFO ] [Nat]Absence check using state equation in 401 ms returned sat
[2020-06-04 07:26:01] [INFO ] [Nat]Added 841 Read/Feed constraints in 444 ms returned sat
[2020-06-04 07:26:02] [INFO ] Deduced a trap composed of 26 places in 274 ms
[2020-06-04 07:26:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 347 ms
[2020-06-04 07:26:02] [INFO ] Computed and/alt/rep : 2185/311302/1725 causal constraints in 206 ms.
[2020-06-04 07:26:21] [INFO ] Added : 390 causal constraints over 78 iterations in 18791 ms. Result :(error "Solver has unexpectedly terminated")
[2020-06-04 07:26:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 07:26:21] [INFO ] [Real]Absence check using state equation in 562 ms returned unsat
[2020-06-04 07:26:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 07:26:22] [INFO ] [Real]Absence check using state equation in 423 ms returned sat
[2020-06-04 07:26:22] [INFO ] [Real]Added 841 Read/Feed constraints in 211 ms returned sat
[2020-06-04 07:26:22] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 07:26:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 07:26:22] [INFO ] [Nat]Absence check using state equation in 469 ms returned sat
[2020-06-04 07:26:23] [INFO ] [Nat]Added 841 Read/Feed constraints in 417 ms returned sat
[2020-06-04 07:26:23] [INFO ] Computed and/alt/rep : 2185/311302/1725 causal constraints in 161 ms.
[2020-06-04 07:26:42] [INFO ] Added : 400 causal constraints over 80 iterations in 19026 ms. Result :unknown
[2020-06-04 07:26:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 07:26:42] [INFO ] [Real]Absence check using state equation in 420 ms returned sat
[2020-06-04 07:26:43] [INFO ] [Real]Added 841 Read/Feed constraints in 222 ms returned sat
[2020-06-04 07:26:43] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 07:26:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 07:26:43] [INFO ] [Nat]Absence check using state equation in 402 ms returned sat
[2020-06-04 07:26:43] [INFO ] [Nat]Added 841 Read/Feed constraints in 269 ms returned sat
[2020-06-04 07:26:44] [INFO ] Computed and/alt/rep : 2185/311302/1725 causal constraints in 177 ms.
[2020-06-04 07:27:03] [INFO ] Added : 415 causal constraints over 83 iterations in 19289 ms. Result :unknown
[2020-06-04 07:27:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 07:27:03] [INFO ] [Real]Absence check using state equation in 418 ms returned sat
[2020-06-04 07:27:03] [INFO ] [Real]Added 841 Read/Feed constraints in 205 ms returned sat
[2020-06-04 07:27:03] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 07:27:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 07:27:04] [INFO ] [Nat]Absence check using state equation in 447 ms returned sat
[2020-06-04 07:27:04] [INFO ] [Nat]Added 841 Read/Feed constraints in 435 ms returned sat
[2020-06-04 07:27:04] [INFO ] Deduced a trap composed of 28 places in 201 ms
[2020-06-04 07:27:05] [INFO ] Deduced a trap composed of 23 places in 191 ms
[2020-06-04 07:27:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 541 ms
[2020-06-04 07:27:05] [INFO ] Computed and/alt/rep : 2185/311302/1725 causal constraints in 229 ms.
[2020-06-04 07:27:23] [INFO ] Added : 365 causal constraints over 73 iterations in 18580 ms. Result :unknown
[2020-06-04 07:27:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 07:27:24] [INFO ] [Real]Absence check using state equation in 406 ms returned sat
[2020-06-04 07:27:24] [INFO ] [Real]Added 841 Read/Feed constraints in 224 ms returned sat
[2020-06-04 07:27:24] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 07:27:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 07:27:25] [INFO ] [Nat]Absence check using state equation in 431 ms returned sat
[2020-06-04 07:27:25] [INFO ] [Nat]Added 841 Read/Feed constraints in 451 ms returned sat
[2020-06-04 07:27:25] [INFO ] Deduced a trap composed of 30 places in 197 ms
[2020-06-04 07:27:25] [INFO ] Deduced a trap composed of 109 places in 177 ms
[2020-06-04 07:27:26] [INFO ] Deduced a trap composed of 108 places in 166 ms
[2020-06-04 07:27:26] [INFO ] Deduced a trap composed of 26 places in 197 ms
[2020-06-04 07:27:26] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1006 ms
[2020-06-04 07:27:26] [INFO ] Computed and/alt/rep : 2185/311302/1725 causal constraints in 262 ms.
[2020-06-04 07:27:44] [INFO ] Added : 380 causal constraints over 76 iterations in 18099 ms. Result :(error "Solver has unexpectedly terminated")
[2020-06-04 07:27:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 07:27:45] [INFO ] [Real]Absence check using state equation in 419 ms returned unsat
[2020-06-04 07:27:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 07:27:45] [INFO ] [Real]Absence check using state equation in 413 ms returned sat
[2020-06-04 07:27:45] [INFO ] [Real]Added 841 Read/Feed constraints in 219 ms returned sat
[2020-06-04 07:27:45] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 07:27:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 07:27:46] [INFO ] [Nat]Absence check using state equation in 450 ms returned sat
[2020-06-04 07:27:46] [INFO ] [Nat]Added 841 Read/Feed constraints in 445 ms returned sat
[2020-06-04 07:27:46] [INFO ] Computed and/alt/rep : 2185/311302/1725 causal constraints in 167 ms.
[2020-06-04 07:28:05] [INFO ] Added : 400 causal constraints over 80 iterations in 19071 ms. Result :unknown
[2020-06-04 07:28:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 07:28:06] [INFO ] [Real]Absence check using state equation in 386 ms returned sat
[2020-06-04 07:28:06] [INFO ] [Real]Added 841 Read/Feed constraints in 220 ms returned sat
[2020-06-04 07:28:06] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 07:28:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 07:28:06] [INFO ] [Nat]Absence check using state equation in 423 ms returned sat
[2020-06-04 07:28:07] [INFO ] [Nat]Added 841 Read/Feed constraints in 395 ms returned sat
[2020-06-04 07:28:07] [INFO ] Computed and/alt/rep : 2185/311302/1725 causal constraints in 161 ms.
[2020-06-04 07:28:26] [INFO ] Added : 390 causal constraints over 78 iterations in 19149 ms. Result :unknown
[2020-06-04 07:28:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 07:28:26] [INFO ] [Real]Absence check using state equation in 494 ms returned unsat
[2020-06-04 07:28:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 07:28:27] [INFO ] [Real]Absence check using state equation in 580 ms returned sat
[2020-06-04 07:28:27] [INFO ] [Real]Added 841 Read/Feed constraints in 390 ms returned sat
[2020-06-04 07:28:27] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 07:28:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 07:28:28] [INFO ] [Nat]Absence check using state equation in 623 ms returned sat
[2020-06-04 07:28:29] [INFO ] [Nat]Added 841 Read/Feed constraints in 445 ms returned sat
[2020-06-04 07:28:29] [INFO ] Computed and/alt/rep : 2185/311302/1725 causal constraints in 232 ms.
[2020-06-04 07:28:48] [INFO ] Added : 390 causal constraints over 78 iterations in 18901 ms. Result :(error "Solver has unexpectedly terminated")
[2020-06-04 07:28:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 07:28:48] [INFO ] [Real]Absence check using state equation in 494 ms returned unsat
[2020-06-04 07:28:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 07:28:48] [INFO ] [Real]Absence check using state equation in 436 ms returned unsat
Successfully simplified 8 atomic propositions for a total of 8 simplifications.
[2020-06-04 07:28:49] [INFO ] Initial state reduction rules for CTL removed 9 formulas.
[2020-06-04 07:28:49] [INFO ] Flatten gal took : 216 ms
FORMULA SimpleLoadBal-PT-20-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SimpleLoadBal-PT-20-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SimpleLoadBal-PT-20-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SimpleLoadBal-PT-20-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SimpleLoadBal-PT-20-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SimpleLoadBal-PT-20-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SimpleLoadBal-PT-20-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SimpleLoadBal-PT-20-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SimpleLoadBal-PT-20-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-04 07:28:49] [INFO ] Flatten gal took : 134 ms
[2020-06-04 07:28:49] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2020-06-04 07:28:49] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 35 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ SimpleLoadBal-PT-20 @ 3570 seconds

FORMULA SimpleLoadBal-PT-20-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

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

FORMULA SimpleLoadBal-PT-20-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA SimpleLoadBal-PT-20-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SimpleLoadBal-PT-20-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3549
rslt: Output for LTLFireability @ SimpleLoadBal-PT-20

{
"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:28:49 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 507
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 2,
"aconj": 6,
"adisj": 2,
"aneg": 0,
"comp": 21,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 21,
"taut": 0,
"tconj": 2,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 12,
"visible_transitions": 0
},
"processed": "X ((((((1 <= p139) AND (1 <= p165) AND (1 <= p185)) OR ((1 <= p90) AND (1 <= p151) AND (1 <= p156) AND (1 <= p175))) OR (G (((1 <= p98) AND (1 <= p151) AND (1 <= p157) AND (1 <= p176))) AND F ((((1 <= p139) AND (1 <= p165) AND (1 <= p185)) OR ((1 <= p90) AND (1 <= p151) AND (1 <= p156) AND (1 <= p175)))))) AND X (((1 <= p132) AND (1 <= p154) AND (1 <= p175)))))",
"processed_size": 365,
"rewrites": 68
},
"result":
{
"edges": 81,
"markings": 81,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 8
},
"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": 591
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 2,
"aconj": 1,
"adisj": 0,
"aneg": 9,
"comp": 12,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 12,
"taut": 0,
"tconj": 0,
"tdisj": 8,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "X (X ((F (G (((p118 <= 0) OR (p151 <= 0) OR (p163 <= 0) OR (p182 <= 0)))) OR ((p118 <= 0) OR ((p151 <= 0) OR ((p163 <= 0) OR ((p182 <= 0) OR ((p128 <= 0) OR ((p151 <= 0) OR ((p162 <= 0) OR (p181 <= 0)))))))))))",
"processed_size": 213,
"rewrites": 68
},
"result":
{
"edges": 420,
"markings": 231,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 709
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 2,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 4,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "X (F ((X (((1 <= p145) AND (1 <= p161) AND (1 <= p181))) AND ((1 <= p96) AND ((1 <= p151) AND ((1 <= p166) AND (1 <= p185)))))))",
"processed_size": 128,
"rewrites": 68
},
"result":
{
"edges": 81,
"markings": 81,
"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"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 887
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"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 (F (((1 <= p116) AND (1 <= p151) AND (1 <= p160) AND (1 <= p179))))",
"processed_size": 69,
"rewrites": 68
},
"result":
{
"edges": 81,
"markings": 81,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 3,
"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": 1183
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 4,
"aconj": 4,
"adisj": 0,
"aneg": 0,
"comp": 14,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 14,
"taut": 0,
"tconj": 3,
"tdisj": 3,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "X (F ((G (((1 <= p132) AND (1 <= p153) AND (1 <= p174))) OR (X (X ((X (((1 <= p131) AND (1 <= p159) AND (1 <= p181))) OR (((1 <= p131) AND (1 <= p159) AND (1 <= p181)) OR ((1 <= p81) AND (1 <= p109)))))) AND ((1 <= p132) AND ((1 <= p153) AND (1 <= p174)))))))",
"processed_size": 259,
"rewrites": 68
},
"result":
{
"edges": 81,
"markings": 81,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 17
},
"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": 1774
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(1 <= p6)",
"processed_size": 9,
"rewrites": 70
},
"result":
{
"edges": 180,
"markings": 180,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 2
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3549
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 1,
"X": 0,
"aconj": 4,
"adisj": 0,
"aneg": 0,
"comp": 12,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 12,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "(F (((1 <= p149) AND (1 <= p158) AND (1 <= p179))) U G ((F (((1 <= p132) AND (1 <= p156) AND (1 <= p176))) AND (((1 <= p149) AND (1 <= p158) AND (1 <= p179)) OR ((1 <= p132) AND (1 <= p156) AND (1 <= p176))))))",
"processed_size": 210,
"rewrites": 68
},
"result":
{
"edges": 326,
"markings": 326,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 6,
"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": 80712,
"runtime": 21.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "X(((** OR (G(**) AND F(**))) AND X(**))) : (F(**) U G((F(**) AND (** OR **)))) : X(X((F(G(*)) OR (* OR (* OR (* OR (* OR (* OR (* OR (* OR *)))))))))) : X(F((X(**) AND (** AND (** AND (** AND **)))))) : X(F(**)) : F(**) : X(F((G(**) OR (X(X((X(**) OR (** OR **)))) AND (** AND (** AND **))))))"
},
"net":
{
"arcs": 15678,
"conflict_clusters": 45,
"places": 194,
"places_significant": 145,
"singleton_clusters": 0,
"transitions": 2205
},
"result":
{
"preliminary_value": "no no yes no no no no ",
"value": "no no yes no no no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 2399/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 194
lola: finding significant places
lola: 194 places, 2205 transitions, 145 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 (((G (((1 <= p98) AND (1 <= p151) AND (1 <= p157) AND (1 <= p176))) U (((1 <= p139) AND (1 <= p165) AND (1 <= p185)) OR ((1 <= p90) AND (1 <= p151) AND (1 <= p156) AND (1 <= p175)))) AND X (((1 <= p132) AND (1 <= p154) AND (1 <= p175))))) : (F (((1 <= p149) AND (1 <= p158) AND (1 <= p179))) U G ((((1 <= p149) AND (1 <= p158) AND (1 <= p179)) U ((1 <= p132) AND (1 <= p156) AND (1 <= p176))))) : NOT(X (X (((((((((X (G (F (((1 <= p118) AND (1 <= p151) AND (1 <= p163) AND (1 <= p182))))) AND (1 <= p118)) AND (1 <= p151)) AND (1 <= p163)) AND (1 <= p182)) AND (1 <= p128)) AND (1 <= p151)) AND (1 <= p162)) AND (1 <= p181))))) : X (((0 <= 0) U ((((X (((1 <= p145) AND (1 <= p161) AND (1 <= p181))) AND (1 <= p96)) AND (1 <= p151)) AND (1 <= p166)) AND (1 <= p185)))) : X ((NOT(G (((1 <= p148) AND (1 <= p160) AND (1 <= p180)))) U F (((1 <= p116) AND (1 <= p151) AND (1 <= p160) AND (1 <= p179))))) : F ((p6 <= 0)) : X (F ((G (((1 <= p132) AND (1 <= p153) AND (1 <= p174))) OR (((X (X (((X (((1 <= p131) AND (1 <= p159) AND (1 <= p181))) OR ((1 <= p131) AND (1 <= p159) AND (1 <= p181))) OR ((1 <= p81) AND (1 <= p109))))) AND (1 <= p132)) AND (1 <= p153)) AND (1 <= p174)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:377
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: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: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: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: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:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:100
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:169
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:254
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 507 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((((((1 <= p139) AND (1 <= p165) AND (1 <= p185)) OR ((1 <= p90) AND (1 <= p151) AND (1 <= p156) AND (1 <= p175))) OR (G (((1 <= p98) AND (1 <= p151) AND (1 <= p157) AND (1 <= p176))) AND F ((((1 <= p139) AND (1 <= p165) AND (1 <= p185)) OR ((1 <= p90) AND (1 <= p151) AND (1 <= p156) AND (1 <= p175)))))) AND X (((1 <= p132) AND (1 <= p154) AND (1 <= p175)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((((((1 <= p139) AND (1 <= p165) AND (1 <= p185)) OR ((1 <= p90) AND (1 <= p151) AND (1 <= p156) AND (1 <= p175))) OR (G (((1 <= p98) AND (1 <= p151) AND (1 <= p157) AND (1 <= p176))) AND F ((((1 <= p139) AND (1 <= p165) AND (1 <= p185)) OR ((1 <= p90) AND (1 <= p151) AND (1 <= p156) AND (1 <= p175)))))) AND X (((1 <= p132) AND (1 <= p154) AND (1 <= p175)))))
lola: processed formula length: 365
lola: 68 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 8 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: 81 markings, 81 edges
lola: ========================================
lola: subprocess 1 will run for 591 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X ((F (G (((p118 <= 0) OR (p151 <= 0) OR (p163 <= 0) OR (p182 <= 0)))) OR ((p118 <= 0) OR ((p151 <= 0) OR ((p163 <= 0) OR ((p182 <= 0) OR ((p128 <= 0) OR ((p151 <= 0) OR ((p162 <= 0) OR (p181 <= 0)))))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X ((F (G (((p118 <= 0) OR (p151 <= 0) OR (p163 <= 0) OR (p182 <= 0)))) OR ((p118 <= 0) OR ((p151 <= 0) OR ((p163 <= 0) OR ((p182 <= 0) OR ((p128 <= 0) OR ((p151 <= 0) OR ((p162 <= 0) OR (p181 <= 0)))))))))))
lola: processed formula length: 213
lola: 68 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: 231 markings, 420 edges
lola: subprocess 2 will run for 709 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((X (((1 <= p145) AND (1 <= p161) AND (1 <= p181))) AND ((1 <= p96) AND ((1 <= p151) AND ((1 <= p166) AND (1 <= p185)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((X (((1 <= p145) AND (1 <= p161) AND (1 <= p181))) AND ((1 <= p96) AND ((1 <= p151) AND ((1 <= p166) AND (1 <= p185)))))))
lola: processed formula length: 128
lola: 68 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: 81 markings, 81 edges
lola: ========================================
lola: subprocess 3 will run for 887 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ========================================
lola: ...considering subproblem: X (F (((1 <= p116) AND (1 <= p151) AND (1 <= p160) AND (1 <= p179))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F (((1 <= p116) AND (1 <= p151) AND (1 <= p160) AND (1 <= p179))))
lola: processed formula length: 69
lola: 68 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: 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: 81 markings, 81 edges
lola: ========================================
lola: subprocess 4 will run for 1183 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((G (((1 <= p132) AND (1 <= p153) AND (1 <= p174))) OR (X (X ((X (((1 <= p131) AND (1 <= p159) AND (1 <= p181))) OR (((1 <= p131) AND (1 <= p159) AND (1 <= p181)) OR ((1 <= p81) AND (1 <= p109)))))) AND ((1 <= p132) AND ((1 <= p153) AND (1 <= p174)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((G (((1 <= p132) AND (1 <= p153) AND (1 <= p174))) OR (X (X ((X (((1 <= p131) AND (1 <= p159) AND (1 <= p181))) OR (((1 <= p131) AND (1 <= p159) AND (1 <= p181)) OR ((1 <= p81) AND (1 <= p109)))))) AND ((1 <= p132) AND ((1 <= p153) AND (1 <= p174)))))))
lola: processed formula length: 259
lola: 68 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 17 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: 81 markings, 81 edges
lola: ========================================
lola: subprocess 5 will run for 1774 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((p6 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (1 <= p6)
lola: processed formula length: 9
lola: 70 rewrites
lola: closed formula file LTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 180 markings, 180 edges
lola: ========================================
lola: subprocess 6 will run for 3549 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (((1 <= p149) AND (1 <= p158) AND (1 <= p179))) U G ((F (((1 <= p132) AND (1 <= p156) AND (1 <= p176))) AND (((1 <= p149) AND (1 <= p158) AND (1 <= p179)) OR ((1 <= p132) AND (1 <= p156) AND (1 <= p176))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (F (((1 <= p149) AND (1 <= p158) AND (1 <= p179))) U G ((F (((1 <= p132) AND (1 <= p156) AND (1 <= p176))) AND (((1 <= p149) AND (1 <= p158) AND (1 <= p179)) OR ((1 <= p132) AND (1 <= p156) AND (1 <= p176))))))
lola: processed formula length: 210
lola: 68 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: 326 markings, 326 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no yes no no no no
lola:
preliminary result: no no yes no no no no
lola: memory consumption: 80712 KB
lola: time consumption: 21 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-20"
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-20, 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-158987939300626"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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