Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r246-smll-162106594400186.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2021-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 gold2020
Input is SimpleLoadBal-PT-10, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r246-smll-162106594400186
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 984K
-rw-r--r-- 1 mcc users 26K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 142K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 21K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 100K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.6K Apr 26 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 26 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Apr 26 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 26 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.5K Mar 27 13:40 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 27 13:40 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.7K Mar 25 19:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 25 19:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 22 08:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Mar 22 08:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:52 equiv_col
-rw-r--r-- 1 mcc users 3 May 5 16:52 instance
-rw-r--r-- 1 mcc users 6 May 5 16:52 iscolored
-rw-r--r-- 1 mcc users 535K May 5 16:52 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-10-00
FORMULA_NAME SimpleLoadBal-PT-10-01
FORMULA_NAME SimpleLoadBal-PT-10-02
FORMULA_NAME SimpleLoadBal-PT-10-03
FORMULA_NAME SimpleLoadBal-PT-10-04
FORMULA_NAME SimpleLoadBal-PT-10-05
FORMULA_NAME SimpleLoadBal-PT-10-06
FORMULA_NAME SimpleLoadBal-PT-10-07
FORMULA_NAME SimpleLoadBal-PT-10-08
FORMULA_NAME SimpleLoadBal-PT-10-09
FORMULA_NAME SimpleLoadBal-PT-10-10
FORMULA_NAME SimpleLoadBal-PT-10-11
FORMULA_NAME SimpleLoadBal-PT-10-12
FORMULA_NAME SimpleLoadBal-PT-10-13
FORMULA_NAME SimpleLoadBal-PT-10-14
FORMULA_NAME SimpleLoadBal-PT-10-15

=== Now, execution of the tool begins

BK_START 1621339101796

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-18 11:58:25] [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]
[2021-05-18 11:58:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-18 11:58:25] [INFO ] Load time of PNML (sax parser for PT used): 182 ms
[2021-05-18 11:58:25] [INFO ] Transformed 104 places.
[2021-05-18 11:58:25] [INFO ] Transformed 605 transitions.
[2021-05-18 11:58:25] [INFO ] Found NUPN structural information;
[2021-05-18 11:58:25] [INFO ] Completing missing partition info from NUPN : creating a component with [P_client_idle_1, P_client_idle_2, P_client_idle_3, P_client_idle_4, P_client_idle_5, P_client_idle_6, P_client_idle_7, P_client_idle_8, P_client_idle_9, P_client_idle_10, P_client_waiting_1, P_client_waiting_2, P_client_waiting_3, P_client_waiting_4, P_client_waiting_5, P_client_waiting_6, P_client_waiting_7, P_client_waiting_8, P_client_waiting_9, P_client_waiting_10, P_client_request_1, P_client_request_2, P_client_request_3, P_client_request_4, P_client_request_5, P_client_request_6, P_client_request_7, P_client_request_8, P_client_request_9, P_client_request_10, P_client_ack_1, P_client_ack_2, P_client_ack_3, P_client_ack_4, P_client_ack_5, P_client_ack_6, P_client_ack_7, P_client_ack_8, P_client_ack_9, P_client_ack_10, P_server_idle_1, P_server_idle_2, P_server_waiting_1, P_server_waiting_2, P_server_processed_1, P_server_processed_2, P_server_notification_1, P_server_notification_2, P_server_notification_ack_1, P_server_notification_ack_2, P_server_request_1_1, P_server_request_1_2, P_server_request_2_1, P_server_request_2_2, P_server_request_3_1, P_server_request_3_2, P_server_request_4_1, P_server_request_4_2, P_server_request_5_1, P_server_request_5_2, P_server_request_6_1, P_server_request_6_2, P_server_request_7_1, P_server_request_7_2, P_server_request_8_1, P_server_request_8_2, P_server_request_9_1, P_server_request_9_2, P_server_request_10_1, P_server_request_10_2, P_lb_idle_1, P_lb_routing_1_1, P_lb_routing_1_2, P_lb_routing_1_3, P_lb_routing_1_4, P_lb_routing_1_5, P_lb_routing_1_6, P_lb_routing_1_7, P_lb_routing_1_8, P_lb_routing_1_9, P_lb_routing_1_10, P_lb_balancing_1, P_lb_load_1_0, P_lb_load_1_1, P_lb_load_1_2, P_lb_load_1_3, P_lb_load_1_4, P_lb_load_1_5, P_lb_load_1_6, P_lb_load_1_7, P_lb_load_1_8, P_lb_load_1_9, P_lb_load_1_10, P_lb_load_2_0, P_lb_load_2_1, P_lb_load_2_2, P_lb_load_2_3, P_lb_load_2_4, P_lb_load_2_5, P_lb_load_2_6, P_lb_load_2_7, P_lb_load_2_8, P_lb_load_2_9, P_lb_load_2_10]
[2021-05-18 11:58:25] [INFO ] Parsed PT model containing 104 places and 605 transitions in 261 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 46 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 688 ms. (steps per millisecond=145 ) properties seen :[1, 0, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 0, 1, 0, 0, 1, 0, 0, 1, 1, 1, 0, 0, 1, 0, 1, 0, 1, 0, 0, 1, 0, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 1, 0]
[2021-05-18 11:58:26] [INFO ] Flow matrix only has 475 transitions (discarded 130 similar events)
// Phase 1: matrix 475 rows 104 cols
[2021-05-18 11:58:26] [INFO ] Computed 29 place invariants in 26 ms
[2021-05-18 11:58:26] [INFO ] [Real]Absence check using 25 positive place invariants in 33 ms returned sat
[2021-05-18 11:58:26] [INFO ] [Real]Absence check using 25 positive and 4 generalized place invariants in 3 ms returned unsat
[2021-05-18 11:58:26] [INFO ] [Real]Absence check using 25 positive place invariants in 26 ms returned sat
[2021-05-18 11:58:26] [INFO ] [Real]Absence check using 25 positive and 4 generalized place invariants in 16 ms returned unsat
[2021-05-18 11:58:27] [INFO ] [Real]Absence check using 25 positive place invariants in 20 ms returned sat
[2021-05-18 11:58:27] [INFO ] [Real]Absence check using 25 positive and 4 generalized place invariants in 4 ms returned unsat
[2021-05-18 11:58:27] [INFO ] [Real]Absence check using 25 positive place invariants in 10 ms returned unsat
[2021-05-18 11:58:27] [INFO ] [Real]Absence check using 25 positive place invariants in 18 ms returned sat
[2021-05-18 11:58:27] [INFO ] [Real]Absence check using 25 positive and 4 generalized place invariants in 3 ms returned unsat
[2021-05-18 11:58:27] [INFO ] [Real]Absence check using 25 positive place invariants in 22 ms returned sat
[2021-05-18 11:58:27] [INFO ] [Real]Absence check using 25 positive and 4 generalized place invariants in 4 ms returned unsat
[2021-05-18 11:58:27] [INFO ] [Real]Absence check using 25 positive place invariants in 28 ms returned sat
[2021-05-18 11:58:27] [INFO ] [Real]Absence check using 25 positive and 4 generalized place invariants in 5 ms returned sat
[2021-05-18 11:58:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 11:58:27] [INFO ] [Real]Absence check using state equation in 255 ms returned sat
[2021-05-18 11:58:27] [INFO ] State equation strengthened by 221 read => feed constraints.
[2021-05-18 11:58:27] [INFO ] [Real]Added 221 Read/Feed constraints in 93 ms returned sat
[2021-05-18 11:58:27] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 11:58:27] [INFO ] [Nat]Absence check using 25 positive place invariants in 22 ms returned sat
[2021-05-18 11:58:27] [INFO ] [Nat]Absence check using 25 positive and 4 generalized place invariants in 3 ms returned sat
[2021-05-18 11:58:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 11:58:28] [INFO ] [Nat]Absence check using state equation in 212 ms returned sat
[2021-05-18 11:58:28] [INFO ] [Nat]Added 221 Read/Feed constraints in 123 ms returned sat
[2021-05-18 11:58:28] [INFO ] Deduced a trap composed of 14 places in 230 ms
[2021-05-18 11:58:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 293 ms
[2021-05-18 11:58:28] [INFO ] Computed and/alt/rep : 595/39742/465 causal constraints in 189 ms.
[2021-05-18 11:58:47] [INFO ] Added : 295 causal constraints over 59 iterations in 19333 ms. Result :(error "Solver has unexpectedly terminated")
[2021-05-18 11:58:47] [INFO ] [Real]Absence check using 25 positive place invariants in 14 ms returned sat
[2021-05-18 11:58:47] [INFO ] [Real]Absence check using 25 positive and 4 generalized place invariants in 3 ms returned sat
[2021-05-18 11:58:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 11:58:48] [INFO ] [Real]Absence check using state equation in 216 ms returned sat
[2021-05-18 11:58:48] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 11:58:48] [INFO ] [Nat]Absence check using 25 positive place invariants in 17 ms returned sat
[2021-05-18 11:58:48] [INFO ] [Nat]Absence check using 25 positive and 4 generalized place invariants in 6 ms returned sat
[2021-05-18 11:58:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 11:58:48] [INFO ] [Nat]Absence check using state equation in 216 ms returned sat
[2021-05-18 11:58:48] [INFO ] [Nat]Added 221 Read/Feed constraints in 195 ms returned sat
[2021-05-18 11:58:48] [INFO ] Deduced a trap composed of 16 places in 256 ms
[2021-05-18 11:58:49] [INFO ] Deduced a trap composed of 14 places in 212 ms
[2021-05-18 11:58:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 554 ms
[2021-05-18 11:58:49] [INFO ] Computed and/alt/rep : 595/39742/465 causal constraints in 143 ms.
[2021-05-18 11:59:08] [INFO ] Added : 290 causal constraints over 58 iterations in 18997 ms. Result :unknown
[2021-05-18 11:59:08] [INFO ] [Real]Absence check using 25 positive place invariants in 14 ms returned sat
[2021-05-18 11:59:08] [INFO ] [Real]Absence check using 25 positive and 4 generalized place invariants in 6 ms returned unsat
[2021-05-18 11:59:08] [INFO ] [Real]Absence check using 25 positive place invariants in 14 ms returned sat
[2021-05-18 11:59:08] [INFO ] [Real]Absence check using 25 positive and 4 generalized place invariants in 3 ms returned sat
[2021-05-18 11:59:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 11:59:08] [INFO ] [Real]Absence check using state equation in 179 ms returned sat
[2021-05-18 11:59:08] [INFO ] [Real]Added 221 Read/Feed constraints in 72 ms returned sat
[2021-05-18 11:59:08] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 11:59:08] [INFO ] [Nat]Absence check using 25 positive place invariants in 14 ms returned sat
[2021-05-18 11:59:08] [INFO ] [Nat]Absence check using 25 positive and 4 generalized place invariants in 3 ms returned sat
[2021-05-18 11:59:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 11:59:08] [INFO ] [Nat]Absence check using state equation in 182 ms returned sat
[2021-05-18 11:59:08] [INFO ] [Nat]Added 221 Read/Feed constraints in 100 ms returned sat
[2021-05-18 11:59:08] [INFO ] Computed and/alt/rep : 595/39742/465 causal constraints in 70 ms.
[2021-05-18 11:59:28] [INFO ] Added : 290 causal constraints over 58 iterations in 19665 ms. Result :unknown
[2021-05-18 11:59:28] [INFO ] [Real]Absence check using 25 positive place invariants in 12 ms returned sat
[2021-05-18 11:59:28] [INFO ] [Real]Absence check using 25 positive and 4 generalized place invariants in 2 ms returned unsat
[2021-05-18 11:59:28] [INFO ] [Real]Absence check using 25 positive place invariants in 13 ms returned sat
[2021-05-18 11:59:28] [INFO ] [Real]Absence check using 25 positive and 4 generalized place invariants in 3 ms returned unsat
[2021-05-18 11:59:28] [INFO ] [Real]Absence check using 25 positive place invariants in 12 ms returned sat
[2021-05-18 11:59:28] [INFO ] [Real]Absence check using 25 positive and 4 generalized place invariants in 3 ms returned unsat
[2021-05-18 11:59:28] [INFO ] [Real]Absence check using 25 positive place invariants in 13 ms returned sat
[2021-05-18 11:59:28] [INFO ] [Real]Absence check using 25 positive and 4 generalized place invariants in 7 ms returned unsat
[2021-05-18 11:59:28] [INFO ] [Real]Absence check using 25 positive place invariants in 12 ms returned sat
[2021-05-18 11:59:28] [INFO ] [Real]Absence check using 25 positive and 4 generalized place invariants in 2 ms returned unsat
[2021-05-18 11:59:28] [INFO ] [Real]Absence check using 25 positive place invariants in 15 ms returned sat
[2021-05-18 11:59:28] [INFO ] [Real]Absence check using 25 positive and 4 generalized place invariants in 3 ms returned unsat
[2021-05-18 11:59:28] [INFO ] [Real]Absence check using 25 positive place invariants in 11 ms returned sat
[2021-05-18 11:59:28] [INFO ] [Real]Absence check using 25 positive and 4 generalized place invariants in 2 ms returned unsat
[2021-05-18 11:59:28] [INFO ] [Real]Absence check using 25 positive place invariants in 12 ms returned sat
[2021-05-18 11:59:28] [INFO ] [Real]Absence check using 25 positive and 4 generalized place invariants in 3 ms returned unsat
[2021-05-18 11:59:28] [INFO ] [Real]Absence check using 25 positive place invariants in 13 ms returned sat
[2021-05-18 11:59:28] [INFO ] [Real]Absence check using 25 positive and 4 generalized place invariants in 4 ms returned sat
[2021-05-18 11:59:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 11:59:29] [INFO ] [Real]Absence check using state equation in 172 ms returned sat
[2021-05-18 11:59:29] [INFO ] [Real]Added 221 Read/Feed constraints in 71 ms returned sat
[2021-05-18 11:59:29] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 11:59:29] [INFO ] [Nat]Absence check using 25 positive place invariants in 14 ms returned sat
[2021-05-18 11:59:29] [INFO ] [Nat]Absence check using 25 positive and 4 generalized place invariants in 3 ms returned sat
[2021-05-18 11:59:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 11:59:29] [INFO ] [Nat]Absence check using state equation in 168 ms returned sat
[2021-05-18 11:59:29] [INFO ] [Nat]Added 221 Read/Feed constraints in 78 ms returned sat
[2021-05-18 11:59:29] [INFO ] Deduced a trap composed of 54 places in 126 ms
[2021-05-18 11:59:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 139 ms
[2021-05-18 11:59:29] [INFO ] [Real]Absence check using 25 positive place invariants in 12 ms returned sat
[2021-05-18 11:59:29] [INFO ] [Real]Absence check using 25 positive and 4 generalized place invariants in 3 ms returned sat
[2021-05-18 11:59:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 11:59:29] [INFO ] [Real]Absence check using state equation in 178 ms returned sat
[2021-05-18 11:59:29] [INFO ] [Real]Added 221 Read/Feed constraints in 149 ms returned sat
[2021-05-18 11:59:29] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 11:59:30] [INFO ] [Nat]Absence check using 25 positive place invariants in 12 ms returned sat
[2021-05-18 11:59:30] [INFO ] [Nat]Absence check using 25 positive and 4 generalized place invariants in 3 ms returned sat
[2021-05-18 11:59:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 11:59:30] [INFO ] [Nat]Absence check using state equation in 166 ms returned sat
[2021-05-18 11:59:30] [INFO ] [Nat]Added 221 Read/Feed constraints in 82 ms returned sat
[2021-05-18 11:59:30] [INFO ] Deduced a trap composed of 18 places in 326 ms
[2021-05-18 11:59:30] [INFO ] Deduced a trap composed of 15 places in 210 ms
[2021-05-18 11:59:31] [INFO ] Deduced a trap composed of 14 places in 268 ms
[2021-05-18 11:59:31] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 910 ms
[2021-05-18 11:59:31] [INFO ] Computed and/alt/rep : 595/39742/465 causal constraints in 149 ms.
[2021-05-18 11:59:48] [INFO ] Added : 280 causal constraints over 56 iterations in 17379 ms. Result :sat
[2021-05-18 11:59:48] [INFO ] [Real]Absence check using 25 positive place invariants in 21 ms returned sat
[2021-05-18 11:59:48] [INFO ] [Real]Absence check using 25 positive and 4 generalized place invariants in 4 ms returned unsat
[2021-05-18 11:59:48] [INFO ] [Real]Absence check using 25 positive place invariants in 19 ms returned sat
[2021-05-18 11:59:48] [INFO ] [Real]Absence check using 25 positive and 4 generalized place invariants in 4 ms returned unsat
[2021-05-18 11:59:48] [INFO ] [Real]Absence check using 25 positive place invariants in 17 ms returned sat
[2021-05-18 11:59:48] [INFO ] [Real]Absence check using 25 positive and 4 generalized place invariants in 2 ms returned unsat
Successfully simplified 19 atomic propositions for a total of 21 simplifications.
[2021-05-18 11:59:49] [INFO ] Initial state reduction rules for CTL removed 7 formulas.
[2021-05-18 11:59:49] [INFO ] Flatten gal took : 173 ms
FORMULA SimpleLoadBal-PT-10-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SimpleLoadBal-PT-10-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SimpleLoadBal-PT-10-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SimpleLoadBal-PT-10-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SimpleLoadBal-PT-10-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SimpleLoadBal-PT-10-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SimpleLoadBal-PT-10-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-18 11:59:49] [INFO ] Applying decomposition
[2021-05-18 11:59:49] [INFO ] Flatten gal took : 86 ms
[2021-05-18 11:59:49] [INFO ] Decomposing Gal with order
[2021-05-18 11:59:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-18 11:59:49] [INFO ] Flatten gal took : 86 ms
[2021-05-18 11:59:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-18 11:59:49] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 6 ms.
[2021-05-18 11:59:49] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 12 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ SimpleLoadBal-PT-10 @ 3570 seconds

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

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

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

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

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

FORMULA SimpleLoadBal-PT-10-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SimpleLoadBal-PT-10-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SimpleLoadBal-PT-10-06 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SimpleLoadBal-PT-10-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2250
rslt: Output for LTLFireability @ SimpleLoadBal-PT-10

{
"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": "Tue May 18 11:59:50 2021
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 3,
"adisj": 1,
"aneg": 0,
"comp": 10,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "F ((X (G (((1 <= p47) AND (1 <= p70) AND (1 <= p97)))) AND (((1 <= p47) AND (1 <= p70) AND (1 <= p97)) OR ((1 <= p57) AND (1 <= p81) AND (1 <= p86) AND (1 <= p99)))))",
"processed_size": 167,
"rewrites": 48
},
"result":
{
"edges": 11,
"markings": 11,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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": 452
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 1,
"aconj": 4,
"adisj": 0,
"aneg": 3,
"comp": 16,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 16,
"taut": 0,
"tconj": 1,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "X (((((p73 <= 0) OR (p86 <= 0) OR (2 <= p98) OR (p98 <= 0)) AND (G (((p73 <= 0) OR (p86 <= 0) OR (2 <= p98) OR (p98 <= 0))) OR G (F (((1 <= p55) AND (1 <= p81) AND (1 <= p84) AND (1 <= p97)))))) OR F (((p55 <= 0) OR (p81 <= 0) OR (p84 <= 0) OR (p97 <= 0)))))",
"processed_size": 267,
"rewrites": 48
},
"result":
{
"edges": 20,
"markings": 21,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 7
},
"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": 528
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 2,
"X": 1,
"aconj": 5,
"adisj": 2,
"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": 8,
"visible_transitions": 0
},
"processed": "X (((((1 <= p73) AND (1 <= p85) AND (1 <= p96)) U ((1 <= p23) AND (1 <= p70))) AND ((((1 <= p80) AND (1 <= p84) AND (1 <= p94)) U ((1 <= p23) AND (1 <= p70))) OR (((p73 <= 0) OR (p85 <= 0) OR (p96 <= 0)) AND ((p80 <= 0) OR (p84 <= 0) OR (p94 <= 0))))))",
"processed_size": 256,
"rewrites": 48
},
"result":
{
"edges": 12,
"markings": 12,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"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": 633
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"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": "G (F (((p42 <= 0) OR (p48 <= 0))))",
"processed_size": 35,
"rewrites": 48
},
"result":
{
"edges": 48,
"markings": 48,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 4,
"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": 792
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"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": "G (F (((p54 <= 0) OR (p81 <= 0) OR (p85 <= 0) OR (p94 <= 0))))",
"processed_size": 65,
"rewrites": 48
},
"result":
{
"edges": 6912667,
"markings": 4592837,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 5,
"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": 1023
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"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": "G (((p61 <= 0) OR (p81 <= 0) OR (p86 <= 0) OR (p99 <= 0)))",
"processed_size": 61,
"rewrites": 48
},
"result":
{
"edges": 2253509,
"markings": 1549238,
"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": "LTL",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1512
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"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": "((1 <= p72) AND (1 <= p85) AND (1 <= p97))",
"processed_size": 42,
"rewrites": 48
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 7,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3025
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"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": "((p72 <= 0) OR (p85 <= 0) OR (p97 <= 0))",
"processed_size": 42,
"rewrites": 50
},
"result":
{
"edges": 37,
"markings": 37,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 176
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 7,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3025
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"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": 3,
"visible_transitions": 0
},
"processed": "((p80 <= 0) OR (p86 <= 0) OR (2 <= p98) OR (p98 <= 0))",
"processed_size": 57,
"rewrites": 48
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 8,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 8,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"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": 3,
"visible_transitions": 0
},
"processed": "((p80 <= 0) OR (p86 <= 0) OR (2 <= p98) OR (p98 <= 0))",
"processed_size": 57,
"rewrites": 48
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 10,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"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 (((p75 <= 0) OR (p85 <= 0) OR (p96 <= 0))))",
"processed_size": 50,
"rewrites": 48
},
"result":
{
"edges": 1215,
"markings": 1115,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 10,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 5736,
"runtime": 1320.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(** OR (G(**) AND F(**))) : G(F(*)) : G(F(*)) : X(G((X(*) OR (** OR (** OR **))))) : (F(G(*)) AND **) : G(*) : F((X(G(**)) AND **)) : X(((* AND (G(*) OR G(F(**)))) OR F(*))) : X(((** U **) AND ((** U **) OR **)))"
},
"net":
{
"arcs": 4148,
"conflict_clusters": 25,
"places": 104,
"places_significant": 75,
"singleton_clusters": 0,
"transitions": 605
},
"result":
{
"preliminary_value": "no no yes unknown no no no yes no ",
"value": "no no yes unknown no no no yes no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 709/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 104
lola: finding significant places
lola: 104 places, 605 transitions, 75 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: LP says that atomic proposition is always true: (p72 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p97 <= 1)
lola: LP says that atomic proposition is always true: (p74 <= 1)
lola: LP says that atomic proposition is always true: (p84 <= 1)
lola: LP says that atomic proposition is always true: (p95 <= 1)
lola: LP says that atomic proposition is always true: (p72 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p97 <= 1)
lola: LP says that atomic proposition is always true: (p42 <= 1)
lola: LP says that atomic proposition is always true: (p48 <= 1)
lola: LP says that atomic proposition is always true: (p54 <= 1)
lola: LP says that atomic proposition is always true: (p81 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p94 <= 1)
lola: LP says that atomic proposition is always true: (p74 <= 1)
lola: LP says that atomic proposition is always true: (p87 <= 1)
lola: LP says that atomic proposition is always true: (p99 <= 1)
lola: LP says that atomic proposition is always true: (p74 <= 1)
lola: LP says that atomic proposition is always true: (p87 <= 1)
lola: LP says that atomic proposition is always true: (p99 <= 1)
lola: LP says that atomic proposition is always true: (p75 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p96 <= 1)
lola: LP says that atomic proposition is always true: (p80 <= 1)
lola: LP says that atomic proposition is always true: (p86 <= 1)
lola: LP says that atomic proposition is always true: (p61 <= 1)
lola: LP says that atomic proposition is always true: (p81 <= 1)
lola: LP says that atomic proposition is always true: (p86 <= 1)
lola: LP says that atomic proposition is always true: (p99 <= 1)
lola: LP says that atomic proposition is always true: (p47 <= 1)
lola: LP says that atomic proposition is always true: (p70 <= 1)
lola: LP says that atomic proposition is always true: (p97 <= 1)
lola: LP says that atomic proposition is always true: (p47 <= 1)
lola: LP says that atomic proposition is always true: (p70 <= 1)
lola: LP says that atomic proposition is always true: (p97 <= 1)
lola: LP says that atomic proposition is always true: (p57 <= 1)
lola: LP says that atomic proposition is always true: (p81 <= 1)
lola: LP says that atomic proposition is always true: (p86 <= 1)
lola: LP says that atomic proposition is always true: (p99 <= 1)
lola: LP says that atomic proposition is always true: (p55 <= 1)
lola: LP says that atomic proposition is always true: (p81 <= 1)
lola: LP says that atomic proposition is always true: (p84 <= 1)
lola: LP says that atomic proposition is always true: (p97 <= 1)
lola: LP says that atomic proposition is always true: (p73 <= 1)
lola: LP says that atomic proposition is always true: (p86 <= 1)
lola: LP says that atomic proposition is always true: (p55 <= 1)
lola: LP says that atomic proposition is always true: (p81 <= 1)
lola: LP says that atomic proposition is always true: (p84 <= 1)
lola: LP says that atomic proposition is always true: (p97 <= 1)
lola: LP says that atomic proposition is always true: (p73 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p96 <= 1)
lola: LP says that atomic proposition is always true: (p23 <= 1)
lola: LP says that atomic proposition is always true: (p70 <= 1)
lola: LP says that atomic proposition is always true: (p80 <= 1)
lola: LP says that atomic proposition is always true: (p84 <= 1)
lola: LP says that atomic proposition is always true: (p94 <= 1)
lola: LP says that atomic proposition is always true: (p23 <= 1)
lola: LP says that atomic proposition is always true: (p70 <= 1)
lola: LP says that atomic proposition is always true: (p73 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p96 <= 1)
lola: LP says that atomic proposition is always true: (p80 <= 1)
lola: LP says that atomic proposition is always true: (p84 <= 1)
lola: LP says that atomic proposition is always true: (p94 <= 1)
lola: (G (((p72 <= 0) OR (p85 <= 0) OR (p97 <= 0) OR ((1 <= p74) AND (1 <= p84) AND (1 <= p95)))) U ((1 <= p72) AND (1 <= p85) AND (1 <= p97))) : G (F (G (NOT(G (F (G (((1 <= p42) AND (1 <= p48))))))))) : NOT(G (F (G (((1 <= p54) AND (1 <= p81) AND (1 <= p85) AND (1 <= p94)))))) : G (X (G ((((NOT(X (((1 <= p74) AND (1 <= p87) AND (1 <= p99)))) OR ((p74 <= 0))) OR ((p87 <= 0))) OR ((p99 <= 0)))))) : (NOT(G (F (((1 <= 0) U ((1 <= p75) AND (1 <= p85) AND (1 <= p96)))))) AND ((p80 <= 0) OR (p86 <= 0) OR (2 <= p98) OR (p98 <= 0))) : G (NOT(((1 <= 0) U ((1 <= p61) AND (1 <= p81) AND (1 <= p86) AND (1 <= p99))))) : F ((X (G (((1 <= p47) AND (1 <= p70) AND (1 <= p97)))) AND ((1 <= 0) U (((1 <= p47) AND (1 <= p70) AND (1 <= p97)) OR ((1 <= p57) AND (1 <= p81) AND (1 <= p86) AND (1 <= p99)))))) : X ((NOT((((0 <= 0) U NOT(G (F (((1 <= p55) AND (1 <= p81) AND (1 <= p84) AND (1 <= p97)))))) U ((1 <= p73) AND (1 <= p86) AND (p98 <= 1) AND (1 <= p98)))) OR NOT(G (((1 <= p55) AND (1 <= p81) AND (1 <= p84) AND (1 <= p97)))))) : (X ((((1 <= p73) AND (1 <= p85) AND (1 <= p96)) U ((1 <= p23) AND (1 <= p70)))) AND (X ((((1 <= p80) AND (1 <= p84) AND (1 <= p94)) U ((1 <= p23) AND (1 <= p70)))) OR X ((((p73 <= 0) OR (p85 <= 0) OR (p96 <= 0)) AND ((p80 <= 0) OR (p84 <= 0) OR (p94 <= 0))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
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:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
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:100
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:169
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:428
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:528
lola: rewrite Frontend/Parser/formula_rewrite.k:525
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((X (((p74 <= 0) OR (p87 <= 0) OR (p99 <= 0))) OR (((p74 <= 0)) OR (((p87 <= 0)) OR ((p99 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((X (((p74 <= 0) OR (p87 <= 0) OR (p99 <= 0))) OR (((p74 <= 0)) OR (((p87 <= 0)) OR ((p99 <= 0)))))))
lola: processed formula length: 108
lola: 48 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 1018100 markings, 2272400 edges, 203620 markings/sec, 0 secs
lola: 1944023 markings, 4437609 edges, 185185 markings/sec, 5 secs
lola: 2830270 markings, 6539612 edges, 177249 markings/sec, 10 secs
lola: 3680747 markings, 8571140 edges, 170095 markings/sec, 15 secs
lola: 4521459 markings, 10593565 edges, 168142 markings/sec, 20 secs
lola: 5315558 markings, 12516829 edges, 158820 markings/sec, 25 secs
lola: 6101572 markings, 14426653 edges, 157203 markings/sec, 30 secs
lola: 6854407 markings, 16258980 edges, 150567 markings/sec, 35 secs
lola: 7602603 markings, 18088470 edges, 149639 markings/sec, 40 secs
lola: 8337026 markings, 19888477 edges, 146885 markings/sec, 45 secs
lola: 9061224 markings, 21666051 edges, 144840 markings/sec, 50 secs
lola: 9788418 markings, 23458911 edges, 145439 markings/sec, 55 secs
lola: 10521914 markings, 25262972 edges, 146699 markings/sec, 60 secs
lola: 11241160 markings, 27035787 edges, 143849 markings/sec, 65 secs
lola: 11990942 markings, 28888905 edges, 149956 markings/sec, 70 secs
lola: 12742473 markings, 30745689 edges, 150306 markings/sec, 75 secs
lola: 13487383 markings, 32593723 edges, 148982 markings/sec, 80 secs
lola: 14238800 markings, 34460069 edges, 150283 markings/sec, 85 secs
lola: 14986162 markings, 36318338 edges, 149472 markings/sec, 90 secs
lola: 15729503 markings, 38169752 edges, 148668 markings/sec, 95 secs
lola: 16470716 markings, 40018989 edges, 148243 markings/sec, 100 secs
lola: 17202823 markings, 41849010 edges, 146421 markings/sec, 105 secs
lola: 17947504 markings, 43711351 edges, 148936 markings/sec, 110 secs
lola: 18688753 markings, 45562537 edges, 148250 markings/sec, 115 secs
lola: 19436847 markings, 47434636 edges, 149619 markings/sec, 120 secs
lola: 20179731 markings, 49294771 edges, 148577 markings/sec, 125 secs
lola: 20925664 markings, 51163480 edges, 149187 markings/sec, 130 secs
lola: 21667104 markings, 53021022 edges, 148288 markings/sec, 135 secs
lola: 22406006 markings, 54875190 edges, 147780 markings/sec, 140 secs
lola: 23142005 markings, 56719729 edges, 147200 markings/sec, 145 secs
lola: 23890453 markings, 58600039 edges, 149690 markings/sec, 150 secs
lola: 24638770 markings, 60479140 edges, 149663 markings/sec, 155 secs
lola: 25381977 markings, 62346467 edges, 148641 markings/sec, 160 secs
lola: 26118184 markings, 64200013 edges, 147241 markings/sec, 165 secs
lola: 26844381 markings, 66027174 edges, 145239 markings/sec, 170 secs
lola: 27543115 markings, 67783945 edges, 139747 markings/sec, 175 secs
lola: 28231211 markings, 69518747 edges, 137619 markings/sec, 180 secs
lola: 28943172 markings, 71313198 edges, 142392 markings/sec, 185 secs
lola: 29666464 markings, 73142442 edges, 144658 markings/sec, 190 secs
lola: 30376984 markings, 74932336 edges, 142104 markings/sec, 195 secs
lola: 31103473 markings, 76767428 edges, 145298 markings/sec, 200 secs
lola: 31818145 markings, 78570263 edges, 142934 markings/sec, 205 secs
lola: 32521222 markings, 80348154 edges, 140615 markings/sec, 210 secs
lola: 33216289 markings, 82107126 edges, 139013 markings/sec, 215 secs
lola: 33918785 markings, 83881471 edges, 140499 markings/sec, 220 secs
lola: 34634465 markings, 85690606 edges, 143136 markings/sec, 225 secs
lola: 35344448 markings, 87486614 edges, 141997 markings/sec, 230 secs
lola: 36056807 markings, 89288645 edges, 142472 markings/sec, 235 secs
lola: 36751101 markings, 91044011 edges, 138859 markings/sec, 240 secs
lola: 37457914 markings, 92829324 edges, 141363 markings/sec, 245 secs
lola: 38135338 markings, 94543113 edges, 135485 markings/sec, 250 secs
lola: 38824664 markings, 96285112 edges, 137865 markings/sec, 255 secs
lola: 39500050 markings, 97996157 edges, 135077 markings/sec, 260 secs
lola: 40189105 markings, 99740033 edges, 137811 markings/sec, 265 secs
lola: 40853743 markings, 101420982 edges, 132928 markings/sec, 270 secs
lola: 41546534 markings, 103173181 edges, 138558 markings/sec, 275 secs
lola: 42231017 markings, 104905888 edges, 136897 markings/sec, 280 secs
lola: 42936860 markings, 106692700 edges, 141169 markings/sec, 285 secs
lola: 43627584 markings, 108443996 edges, 138145 markings/sec, 290 secs
lola: 44334819 markings, 110235559 edges, 141447 markings/sec, 295 secs
lola: 45018636 markings, 111968620 edges, 136763 markings/sec, 300 secs
lola: 45699684 markings, 113691017 edges, 136210 markings/sec, 305 secs
lola: 46383063 markings, 115420799 edges, 136676 markings/sec, 310 secs
lola: 47054948 markings, 117121867 edges, 134377 markings/sec, 315 secs
lola: 47728995 markings, 118831442 edges, 134809 markings/sec, 320 secs
lola: 48415763 markings, 120569322 edges, 137354 markings/sec, 325 secs
lola: 49084787 markings, 122265344 edges, 133805 markings/sec, 330 secs
lola: 49769559 markings, 124000485 edges, 136954 markings/sec, 335 secs
lola: 50451174 markings, 125727279 edges, 136323 markings/sec, 340 secs
lola: 51133680 markings, 127456547 edges, 136501 markings/sec, 345 secs
lola: 51808018 markings, 129165652 edges, 134868 markings/sec, 350 secs
lola: 52467214 markings, 130837771 edges, 131839 markings/sec, 355 secs
lola: 53119232 markings, 132491180 edges, 130404 markings/sec, 360 secs
lola: 53783721 markings, 134176293 edges, 132898 markings/sec, 365 secs
lola: 54456556 markings, 135882359 edges, 134567 markings/sec, 370 secs
lola: 55124929 markings, 137574627 edges, 133675 markings/sec, 375 secs
lola: 55786607 markings, 139250984 edges, 132336 markings/sec, 380 secs
lola: 56449954 markings, 140931753 edges, 132669 markings/sec, 385 secs
lola: 57105798 markings, 142597251 edges, 131169 markings/sec, 390 secs
lola: local time limit reached - aborting
lola:
preliminary result: unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola: memory consumption: 11137292 KB
lola: time consumption: 401 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLFireability.json
lola: closed JSON file LTLFireability.json
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 1 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((X (G (((1 <= p47) AND (1 <= p70) AND (1 <= p97)))) AND (((1 <= p47) AND (1 <= p70) AND (1 <= p97)) OR ((1 <= p57) AND (1 <= p81) AND (1 <= p86) AND (1 <= p99)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((X (G (((1 <= p47) AND (1 <= p70) AND (1 <= p97)))) AND (((1 <= p47) AND (1 <= p70) AND (1 <= p97)) OR ((1 <= p57) AND (1 <= p81) AND (1 <= p86) AND (1 <= p99)))))
lola: processed formula length: 167
lola: 48 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: 11 markings, 11 edges
lola: ========================================
lola: subprocess 2 will run for 452 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((((p73 <= 0) OR (p86 <= 0) OR (2 <= p98) OR (p98 <= 0)) AND (G (((p73 <= 0) OR (p86 <= 0) OR (2 <= p98) OR (p98 <= 0))) OR G (F (((1 <= p55) AND (1 <= p81) AND (1 <= p84) AND (1 <= p97)))))) OR F (((p55 <= 0) OR (p81 <= 0) OR (p84 <= 0) OR (p97 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((((p73 <= 0) OR (p86 <= 0) OR (2 <= p98) OR (p98 <= 0)) AND (G (((p73 <= 0) OR (p86 <= 0) OR (2 <= p98) OR (p98 <= 0))) OR G (F (((1 <= p55) AND (1 <= p81) AND (1 <= p84) AND (1 <= p97)))))) OR F (((p55 <= 0) OR (p81 <= 0) OR (p84 <= 0) OR (p97 <= 0)))))
lola: processed formula length: 267
lola: 48 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 7 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 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: 21 markings, 20 edges
lola: ========================================
lola: subprocess 3 will run for 528 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((((1 <= p73) AND (1 <= p85) AND (1 <= p96)) U ((1 <= p23) AND (1 <= p70))) AND ((((1 <= p80) AND (1 <= p84) AND (1 <= p94)) U ((1 <= p23) AND (1 <= p70))) OR (((p73 <= 0) OR (p85 <= 0) OR (p96 <= 0)) AND ((p80 <= 0) OR (p84 <= 0) OR (p94 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((((1 <= p73) AND (1 <= p85) AND (1 <= p96)) U ((1 <= p23) AND (1 <= p70))) AND ((((1 <= p80) AND (1 <= p84) AND (1 <= p94)) U ((1 <= p23) AND (1 <= p70))) OR (((p73 <= 0) OR (p85 <= 0) OR (p96 <= 0)) AND ((p80 <= 0) OR (p84 <= 0) OR (p94 <= 0))))))
lola: processed formula length: 256
lola: 48 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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 12 markings, 12 edges
lola: ========================================
lola: subprocess 4 will run for 633 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F (((p42 <= 0) OR (p48 <= 0))))
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 (((p42 <= 0) OR (p48 <= 0))))
lola: processed formula length: 35
lola: 48 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: 48 markings, 48 edges
lola: ========================================
lola: subprocess 5 will run for 792 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F (((p54 <= 0) OR (p81 <= 0) OR (p85 <= 0) OR (p94 <= 0))))
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 (((p54 <= 0) OR (p81 <= 0) OR (p85 <= 0) OR (p94 <= 0))))
lola: processed formula length: 65
lola: 48 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: 82866 markings, 106322 edges, 16573 markings/sec, 0 secs
lola: 194352 markings, 258661 edges, 22297 markings/sec, 5 secs
lola: 350838 markings, 485159 edges, 31297 markings/sec, 10 secs
lola: 519896 markings, 730657 edges, 33812 markings/sec, 15 secs
lola: 688135 markings, 973680 edges, 33648 markings/sec, 20 secs
lola: 899219 markings, 1291573 edges, 42217 markings/sec, 25 secs
lola: 1145564 markings, 1668006 edges, 49269 markings/sec, 30 secs
lola: 1379203 markings, 2026582 edges, 46728 markings/sec, 35 secs
lola: 1641825 markings, 2423133 edges, 52524 markings/sec, 40 secs
lola: 1929751 markings, 2865359 edges, 57585 markings/sec, 45 secs
lola: 2260541 markings, 3370967 edges, 66158 markings/sec, 50 secs
lola: 2586843 markings, 3852750 edges, 65260 markings/sec, 55 secs
lola: 2848100 markings, 4243283 edges, 52251 markings/sec, 60 secs
lola: 3095684 markings, 4615636 edges, 49517 markings/sec, 65 secs
lola: 3345741 markings, 4988887 edges, 50011 markings/sec, 70 secs
lola: 3611215 markings, 5384856 edges, 53095 markings/sec, 75 secs
lola: 3875087 markings, 5785930 edges, 52774 markings/sec, 80 secs
lola: 4128738 markings, 6179217 edges, 50730 markings/sec, 85 secs
lola: 4387949 markings, 6589510 edges, 51842 markings/sec, 90 secs
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: 4592837 markings, 6912667 edges
lola: ========================================
lola: subprocess 6 will run for 1023 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((p61 <= 0) OR (p81 <= 0) OR (p86 <= 0) OR (p99 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((p61 <= 0) OR (p81 <= 0) OR (p86 <= 0) OR (p99 <= 0)))
lola: processed formula length: 61
lola: 48 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: 72656 markings, 88546 edges, 14531 markings/sec, 0 secs
lola: 154428 markings, 197181 edges, 16354 markings/sec, 5 secs
lola: 265647 markings, 358472 edges, 22244 markings/sec, 10 secs
lola: 422231 markings, 582199 edges, 31317 markings/sec, 15 secs
lola: 603138 markings, 838262 edges, 36181 markings/sec, 20 secs
lola: 813329 markings, 1149004 edges, 42038 markings/sec, 25 secs
lola: 1047582 markings, 1500334 edges, 46851 markings/sec, 30 secs
lola: 1307495 markings, 1891896 edges, 51983 markings/sec, 35 secs
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 1549238 markings, 2253509 edges
lola: ========================================
lola: subprocess 7 will run for 1512 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p72) AND (1 <= p85) AND (1 <= p97)) OR (G (((p72 <= 0) OR (p85 <= 0) OR (p97 <= 0) OR ((1 <= p74) AND (1 <= p84) AND (1 <= p95)))) AND F (((1 <= p72) AND (1 <= p85) AND (1 <= p97)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 1512 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p72) AND (1 <= p85) AND (1 <= p97))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p72) AND (1 <= p85) AND (1 <= p97))
lola: processed formula length: 42
lola: 48 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 3 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 8 will run for 3025 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((1 <= p72) AND (1 <= p85) AND (1 <= p97)))
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: ((p72 <= 0) OR (p85 <= 0) OR (p97 <= 0))
lola: processed formula length: 42
lola: 50 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: 37 markings, 37 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 8 will run for 3025 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (G (((p75 <= 0) OR (p85 <= 0) OR (p96 <= 0)))) AND ((p80 <= 0) OR (p86 <= 0) OR (2 <= p98) OR (p98 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 3025 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p80 <= 0) OR (p86 <= 0) OR (2 <= p98) OR (p98 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p80 <= 0) OR (p86 <= 0) OR (2 <= p98) OR (p98 <= 0))
lola: processed formula length: 57
lola: 48 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 4 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: X (G ((X (((p74 <= 0) OR (p87 <= 0) OR (p99 <= 0))) OR (((p74 <= 0)) OR (((p87 <= 0)) OR ((p99 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((X (((p74 <= 0) OR (p87 <= 0) OR (p99 <= 0))) OR (((p74 <= 0)) OR (((p87 <= 0)) OR ((p99 <= 0)))))))
lola: processed formula length: 108
lola: 48 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 1024871 markings, 2288353 edges, 204974 markings/sec, 0 secs
lola: 2030354 markings, 4642117 edges, 201097 markings/sec, 5 secs
lola: 3003445 markings, 6951539 edges, 194618 markings/sec, 10 secs
lola: 3944135 markings, 9204923 edges, 188138 markings/sec, 15 secs
lola: 4864971 markings, 11424595 edges, 184167 markings/sec, 20 secs
lola: 5764254 markings, 13605262 edges, 179857 markings/sec, 25 secs
lola: 6651398 markings, 15764978 edges, 177429 markings/sec, 30 secs
lola: 7528633 markings, 17907454 edges, 175447 markings/sec, 35 secs
lola: 8390170 markings, 20018920 edges, 172307 markings/sec, 40 secs
lola: 9246198 markings, 22121395 edges, 171206 markings/sec, 45 secs
lola: 10093116 markings, 24208295 edges, 169384 markings/sec, 50 secs
lola: 10935104 markings, 26283302 edges, 168398 markings/sec, 55 secs
lola: 11767275 markings, 28334576 edges, 166434 markings/sec, 60 secs
lola: 12595781 markings, 30382154 edges, 165701 markings/sec, 65 secs
lola: 13416778 markings, 32418921 edges, 164199 markings/sec, 70 secs
lola: 14229084 markings, 34435937 edges, 162461 markings/sec, 75 secs
lola: 15036231 markings, 36442774 edges, 161429 markings/sec, 80 secs
lola: 15837857 markings, 38440879 edges, 160325 markings/sec, 85 secs
lola: 16635433 markings, 40429219 edges, 159515 markings/sec, 90 secs
lola: 17429021 markings, 42414164 edges, 158718 markings/sec, 95 secs
lola: 18219361 markings, 44390943 edges, 158068 markings/sec, 100 secs
lola: 19006741 markings, 46359296 edges, 157476 markings/sec, 105 secs
lola: 19789588 markings, 48316940 edges, 156569 markings/sec, 110 secs
lola: 20566001 markings, 50261314 edges, 155283 markings/sec, 115 secs
lola: 21339711 markings, 52200112 edges, 154742 markings/sec, 120 secs
lola: 22112156 markings, 54136866 edges, 154489 markings/sec, 125 secs
lola: 22879563 markings, 56062318 edges, 153481 markings/sec, 130 secs
lola: 23646100 markings, 57986270 edges, 153307 markings/sec, 135 secs
lola: 24409147 markings, 59903157 edges, 152609 markings/sec, 140 secs
lola: 25169901 markings, 61812007 edges, 152151 markings/sec, 145 secs
lola: 25924698 markings, 63713817 edges, 150959 markings/sec, 150 secs
lola: 26679645 markings, 65614344 edges, 150989 markings/sec, 155 secs
lola: 27430732 markings, 67501256 edges, 150217 markings/sec, 160 secs
lola: 28179161 markings, 69387785 edges, 149686 markings/sec, 165 secs
lola: 28925082 markings, 71267768 edges, 149184 markings/sec, 170 secs
lola: 29666358 markings, 73142176 edges, 148255 markings/sec, 175 secs
lola: 30409168 markings, 75013189 edges, 148562 markings/sec, 180 secs
lola: 31147823 markings, 76879426 edges, 147731 markings/sec, 185 secs
lola: 31885288 markings, 78739935 edges, 147493 markings/sec, 190 secs
lola: 32617776 markings, 80592007 edges, 146498 markings/sec, 195 secs
lola: 33348275 markings, 82440821 edges, 146100 markings/sec, 200 secs
lola: 34078805 markings, 84285992 edges, 146106 markings/sec, 205 secs
lola: 34808048 markings, 86129039 edges, 145849 markings/sec, 210 secs
lola: 35534156 markings, 87965822 edges, 145222 markings/sec, 215 secs
lola: 36257967 markings, 89796832 edges, 144762 markings/sec, 220 secs
lola: 36982325 markings, 91627582 edges, 144872 markings/sec, 225 secs
lola: 37704209 markings, 93452251 edges, 144377 markings/sec, 230 secs
lola: 38424537 markings, 95273624 edges, 144066 markings/sec, 235 secs
lola: 39142113 markings, 97089544 edges, 143515 markings/sec, 240 secs
lola: 39858943 markings, 98903689 edges, 143366 markings/sec, 245 secs
lola: 40575060 markings, 100716174 edges, 143223 markings/sec, 250 secs
lola: 41289675 markings, 102523566 edges, 142923 markings/sec, 255 secs
lola: 42003292 markings, 104329253 edges, 142723 markings/sec, 260 secs
lola: 42714850 markings, 106130548 edges, 142312 markings/sec, 265 secs
lola: 43423095 markings, 107925194 edges, 141649 markings/sec, 270 secs
lola: 44132321 markings, 109722208 edges, 141845 markings/sec, 275 secs
lola: 44839072 markings, 111512667 edges, 141350 markings/sec, 280 secs
lola: 45546207 markings, 113303535 edges, 141427 markings/sec, 285 secs
lola: 46251539 markings, 115087140 edges, 141066 markings/sec, 290 secs
lola: 46956267 markings, 116872342 edges, 140946 markings/sec, 295 secs
lola: 47657772 markings, 118650924 edges, 140301 markings/sec, 300 secs
lola: 48361204 markings, 120431491 edges, 140686 markings/sec, 305 secs
lola: 49060769 markings, 122204682 edges, 139913 markings/sec, 310 secs
lola: 49760465 markings, 123977425 edges, 139939 markings/sec, 315 secs
lola: 50458516 markings, 125746117 edges, 139610 markings/sec, 320 secs
lola: 51145522 markings, 127486594 edges, 137401 markings/sec, 325 secs
lola: 51841796 markings, 129250712 edges, 139255 markings/sec, 330 secs
lola: 52529366 markings, 130995072 edges, 137514 markings/sec, 335 secs
lola: 53222930 markings, 132754468 edges, 138713 markings/sec, 340 secs
lola: 53906447 markings, 134488108 edges, 136703 markings/sec, 345 secs
lola: 54598821 markings, 136241519 edges, 138475 markings/sec, 350 secs
lola: 55290204 markings, 137992479 edges, 138277 markings/sec, 355 secs
lola: 55980657 markings, 139742867 edges, 138091 markings/sec, 360 secs
lola: 56665098 markings, 141478151 edges, 136888 markings/sec, 365 secs
lola: 57343503 markings, 143200139 edges, 135681 markings/sec, 370 secs
lola: 58022734 markings, 144925841 edges, 135846 markings/sec, 375 secs
lola: 58703162 markings, 146650522 edges, 136086 markings/sec, 380 secs
lola: 59380011 markings, 148369795 edges, 135370 markings/sec, 385 secs
lola: 60056504 markings, 150086912 edges, 135299 markings/sec, 390 secs
lola: 60731254 markings, 151799284 edges, 134950 markings/sec, 395 secs
lola: 61404829 markings, 153506681 edges, 134715 markings/sec, 400 secs
lola: 62077493 markings, 155214030 edges, 134533 markings/sec, 405 secs
lola: 62747668 markings, 156915930 edges, 134035 markings/sec, 410 secs
lola: 63417963 markings, 158617116 edges, 134059 markings/sec, 415 secs
lola: 64088423 markings, 160315962 edges, 134092 markings/sec, 420 secs
lola: 64755117 markings, 162010688 edges, 133339 markings/sec, 425 secs
lola: 65421453 markings, 163703847 edges, 133267 markings/sec, 430 secs
lola: 66082884 markings, 165382738 edges, 132286 markings/sec, 435 secs
lola: 66740378 markings, 167050725 edges, 131499 markings/sec, 440 secs
lola: 67397280 markings, 168717602 edges, 131380 markings/sec, 445 secs
lola: 68054082 markings, 170386218 edges, 131360 markings/sec, 450 secs
lola: 68710230 markings, 172052437 edges, 131230 markings/sec, 455 secs
lola: 69363530 markings, 173712067 edges, 130660 markings/sec, 460 secs
lola: 70017752 markings, 175372761 edges, 130844 markings/sec, 465 secs
lola: 70671246 markings, 177032689 edges, 130699 markings/sec, 470 secs
lola: 71322562 markings, 178691584 edges, 130263 markings/sec, 475 secs
lola: 71976700 markings, 180356703 edges, 130828 markings/sec, 480 secs
lola: 72632169 markings, 182023307 edges, 131094 markings/sec, 485 secs
lola: 73283230 markings, 183680499 edges, 130212 markings/sec, 490 secs
lola: 73932375 markings, 185330768 edges, 129829 markings/sec, 495 secs
lola: 74579809 markings, 186978456 edges, 129487 markings/sec, 500 secs
lola: 75228232 markings, 188628874 edges, 129685 markings/sec, 505 secs
lola: 75875070 markings, 190273382 edges, 129368 markings/sec, 510 secs
lola: 76520941 markings, 191917396 edges, 129174 markings/sec, 515 secs
lola: 77166412 markings, 193560785 edges, 129094 markings/sec, 520 secs
lola: 77813047 markings, 195206099 edges, 129327 markings/sec, 525 secs
lola: 78457810 markings, 196848236 edges, 128953 markings/sec, 530 secs
lola: 79100572 markings, 198487427 edges, 128552 markings/sec, 535 secs
lola: 79745554 markings, 200127539 edges, 128996 markings/sec, 540 secs
lola: 80389250 markings, 201767095 edges, 128739 markings/sec, 545 secs
lola: 81033580 markings, 203407593 edges, 128866 markings/sec, 550 secs
lola: 81676550 markings, 205044975 edges, 128594 markings/sec, 555 secs
lola: 82319188 markings, 206685005 edges, 128528 markings/sec, 560 secs
lola: 82952545 markings, 208296071 edges, 126671 markings/sec, 565 secs
lola: 83570771 markings, 209874541 edges, 123645 markings/sec, 570 secs
lola: 84145809 markings, 211342191 edges, 115008 markings/sec, 575 secs
lola: 84718590 markings, 212801559 edges, 114556 markings/sec, 580 secs
lola: 85271664 markings, 214212686 edges, 110615 markings/sec, 585 secs
lola: 85772104 markings, 215489449 edges, 100088 markings/sec, 590 secs
lola: 86341775 markings, 216940048 edges, 113934 markings/sec, 595 secs
lola: 86804216 markings, 218120150 edges, 92488 markings/sec, 600 secs
lola: 87327551 markings, 219455367 edges, 104667 markings/sec, 605 secs
lola: 87899859 markings, 220916176 edges, 114462 markings/sec, 610 secs
lola: 88426861 markings, 222261220 edges, 105400 markings/sec, 615 secs
lola: 88998476 markings, 223717676 edges, 114323 markings/sec, 620 secs
lola: 89497216 markings, 224989240 edges, 99748 markings/sec, 625 secs
lola: 90002871 markings, 226276723 edges, 101131 markings/sec, 630 secs
lola: 90576810 markings, 227739618 edges, 114788 markings/sec, 635 secs
lola: 91168377 markings, 229247258 edges, 118313 markings/sec, 640 secs
lola: 91744922 markings, 230716548 edges, 115309 markings/sec, 645 secs
lola: 92325945 markings, 232196387 edges, 116205 markings/sec, 650 secs
lola: 92920529 markings, 233709221 edges, 118917 markings/sec, 655 secs
lola: 93495588 markings, 235172287 edges, 115012 markings/sec, 660 secs
lola: 94084558 markings, 236674783 edges, 117794 markings/sec, 665 secs
lola: 94623550 markings, 238045706 edges, 107798 markings/sec, 670 secs
lola: 95234016 markings, 239596817 edges, 122093 markings/sec, 675 secs
lola: 95761053 markings, 240937370 edges, 105407 markings/sec, 680 secs
lola: 96354039 markings, 242448341 edges, 118597 markings/sec, 685 secs
lola: 96898537 markings, 243833600 edges, 108900 markings/sec, 690 secs
lola: 97411800 markings, 245139149 edges, 102653 markings/sec, 695 secs
lola: 98002267 markings, 246641815 edges, 118093 markings/sec, 700 secs
lola: 98604809 markings, 248173342 edges, 120508 markings/sec, 705 secs
lola: 99224909 markings, 249750046 edges, 124020 markings/sec, 710 secs
lola: 99821696 markings, 251266811 edges, 119357 markings/sec, 715 secs
lola: 100421921 markings, 252795127 edges, 120045 markings/sec, 720 secs
lola: 100960497 markings, 254166504 edges, 107715 markings/sec, 725 secs
lola: 101547455 markings, 255662418 edges, 117392 markings/sec, 730 secs
lola: 102138663 markings, 257166234 edges, 118242 markings/sec, 735 secs
lola: 102732177 markings, 258675078 edges, 118703 markings/sec, 740 secs
lola: 103280192 markings, 260073061 edges, 109603 markings/sec, 745 secs
lola: 103787209 markings, 261361988 edges, 101403 markings/sec, 750 secs
lola: 104372806 markings, 262850720 edges, 117119 markings/sec, 755 secs
lola: 104971300 markings, 264371382 edges, 119699 markings/sec, 760 secs
lola: 105450029 markings, 265590001 edges, 95746 markings/sec, 765 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: (F (G (((p75 <= 0) OR (p85 <= 0) OR (p96 <= 0)))) AND ((p80 <= 0) OR (p86 <= 0) OR (2 <= p98) OR (p98 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: ((p80 <= 0) OR (p86 <= 0) OR (2 <= p98) OR (p98 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p80 <= 0) OR (p86 <= 0) OR (2 <= p98) OR (p98 <= 0))
lola: processed formula length: 57
lola: 48 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 4 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: F (G (((p75 <= 0) OR (p85 <= 0) OR (p96 <= 0))))
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 (((p75 <= 0) OR (p85 <= 0) OR (p96 <= 0))))
lola: processed formula length: 50
lola: 48 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: 1115 markings, 1215 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no yes unknown no no no yes no
lola:
preliminary result: no no yes unknown no no no yes no
lola: memory consumption: 5736 KB
lola: time consumption: 1320 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-10"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2020"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool gold2020"
echo " Input is SimpleLoadBal-PT-10, 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 r246-smll-162106594400186"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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