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-162106594400189.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-15, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r246-smll-162106594400189
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.6M
-rw-r--r-- 1 mcc users 26K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 146K 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 99K 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.2K Apr 26 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 26 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 26 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 26 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.7K 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 17K 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 1.2M 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-15-00
FORMULA_NAME SimpleLoadBal-PT-15-01
FORMULA_NAME SimpleLoadBal-PT-15-02
FORMULA_NAME SimpleLoadBal-PT-15-03
FORMULA_NAME SimpleLoadBal-PT-15-04
FORMULA_NAME SimpleLoadBal-PT-15-05
FORMULA_NAME SimpleLoadBal-PT-15-06
FORMULA_NAME SimpleLoadBal-PT-15-07
FORMULA_NAME SimpleLoadBal-PT-15-08
FORMULA_NAME SimpleLoadBal-PT-15-09
FORMULA_NAME SimpleLoadBal-PT-15-10
FORMULA_NAME SimpleLoadBal-PT-15-11
FORMULA_NAME SimpleLoadBal-PT-15-12
FORMULA_NAME SimpleLoadBal-PT-15-13
FORMULA_NAME SimpleLoadBal-PT-15-14
FORMULA_NAME SimpleLoadBal-PT-15-15

=== Now, execution of the tool begins

BK_START 1621339267607

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-18 12:01:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2021-05-18 12:01:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-18 12:01:12] [INFO ] Load time of PNML (sax parser for PT used): 317 ms
[2021-05-18 12:01:12] [INFO ] Transformed 149 places.
[2021-05-18 12:01:12] [INFO ] Transformed 1280 transitions.
[2021-05-18 12:01:12] [INFO ] Found NUPN structural information;
[2021-05-18 12:01:12] [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_idle_11, P_client_idle_12, P_client_idle_13, P_client_idle_14, P_client_idle_15, 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_waiting_11, P_client_waiting_12, P_client_waiting_13, P_client_waiting_14, P_client_waiting_15, 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_request_11, P_client_request_12, P_client_request_13, P_client_request_14, P_client_request_15, 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_client_ack_11, P_client_ack_12, P_client_ack_13, P_client_ack_14, P_client_ack_15, 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_server_request_11_1, P_server_request_11_2, P_server_request_12_1, P_server_request_12_2, P_server_request_13_1, P_server_request_13_2, P_server_request_14_1, P_server_request_14_2, P_server_request_15_1, P_server_request_15_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_routing_1_11, P_lb_routing_1_12, P_lb_routing_1_13, P_lb_routing_1_14, P_lb_routing_1_15, 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_1_11, P_lb_load_1_12, P_lb_load_1_13, P_lb_load_1_14, P_lb_load_1_15, 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, P_lb_load_2_11, P_lb_load_2_12, P_lb_load_2_13, P_lb_load_2_14, P_lb_load_2_15]
[2021-05-18 12:01:12] [INFO ] Parsed PT model containing 149 places and 1280 transitions in 410 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 126 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 923 ms. (steps per millisecond=108 ) properties seen :[0, 1, 0, 0, 1, 0, 1, 0, 1, 0, 1, 1, 1, 0, 0, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1]
[2021-05-18 12:01:13] [INFO ] Flow matrix only has 1010 transitions (discarded 270 similar events)
// Phase 1: matrix 1010 rows 149 cols
[2021-05-18 12:01:13] [INFO ] Computed 39 place invariants in 55 ms
[2021-05-18 12:01:13] [INFO ] [Real]Absence check using 35 positive place invariants in 61 ms returned sat
[2021-05-18 12:01:13] [INFO ] [Real]Absence check using 35 positive and 4 generalized place invariants in 7 ms returned sat
[2021-05-18 12:01:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:01:14] [INFO ] [Real]Absence check using state equation in 826 ms returned sat
[2021-05-18 12:01:14] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:01:14] [INFO ] [Nat]Absence check using 35 positive place invariants in 17 ms returned unsat
[2021-05-18 12:01:15] [INFO ] [Real]Absence check using 35 positive place invariants in 20 ms returned sat
[2021-05-18 12:01:15] [INFO ] [Real]Absence check using 35 positive and 4 generalized place invariants in 5 ms returned sat
[2021-05-18 12:01:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:01:15] [INFO ] [Real]Absence check using state equation in 603 ms returned sat
[2021-05-18 12:01:15] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:01:15] [INFO ] [Nat]Absence check using 35 positive place invariants in 31 ms returned sat
[2021-05-18 12:01:15] [INFO ] [Nat]Absence check using 35 positive and 4 generalized place invariants in 5 ms returned sat
[2021-05-18 12:01:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:01:16] [INFO ] [Nat]Absence check using state equation in 499 ms returned sat
[2021-05-18 12:01:16] [INFO ] State equation strengthened by 481 read => feed constraints.
[2021-05-18 12:01:16] [INFO ] [Nat]Added 481 Read/Feed constraints in 393 ms returned sat
[2021-05-18 12:01:17] [INFO ] Deduced a trap composed of 20 places in 645 ms
[2021-05-18 12:01:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 816 ms
[2021-05-18 12:01:18] [INFO ] Computed and/alt/rep : 1265/132297/995 causal constraints in 696 ms.
[2021-05-18 12:01:35] [INFO ] Added : 310 causal constraints over 62 iterations in 18076 ms. Result :unknown
[2021-05-18 12:01:35] [INFO ] [Real]Absence check using 35 positive place invariants in 38 ms returned sat
[2021-05-18 12:01:35] [INFO ] [Real]Absence check using 35 positive and 4 generalized place invariants in 7 ms returned sat
[2021-05-18 12:01:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:01:36] [INFO ] [Real]Absence check using state equation in 671 ms returned sat
[2021-05-18 12:01:36] [INFO ] [Real]Added 481 Read/Feed constraints in 313 ms returned sat
[2021-05-18 12:01:36] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:01:36] [INFO ] [Nat]Absence check using 35 positive place invariants in 28 ms returned sat
[2021-05-18 12:01:36] [INFO ] [Nat]Absence check using 35 positive and 4 generalized place invariants in 6 ms returned sat
[2021-05-18 12:01:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:01:37] [INFO ] [Nat]Absence check using state equation in 647 ms returned sat
[2021-05-18 12:01:37] [INFO ] [Nat]Added 481 Read/Feed constraints in 270 ms returned sat
[2021-05-18 12:01:38] [INFO ] Deduced a trap composed of 20 places in 393 ms
[2021-05-18 12:01:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 475 ms
[2021-05-18 12:01:38] [INFO ] Computed and/alt/rep : 1265/132297/995 causal constraints in 386 ms.
[2021-05-18 12:01:56] [INFO ] Added : 355 causal constraints over 71 iterations in 18540 ms. Result :unknown
[2021-05-18 12:01:56] [INFO ] [Real]Absence check using 35 positive place invariants in 18 ms returned sat
[2021-05-18 12:01:56] [INFO ] [Real]Absence check using 35 positive and 4 generalized place invariants in 4 ms returned sat
[2021-05-18 12:01:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:01:57] [INFO ] [Real]Absence check using state equation in 401 ms returned sat
[2021-05-18 12:01:57] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:01:57] [INFO ] [Nat]Absence check using 35 positive place invariants in 9 ms returned unsat
[2021-05-18 12:01:57] [INFO ] [Real]Absence check using 35 positive place invariants in 19 ms returned sat
[2021-05-18 12:01:57] [INFO ] [Real]Absence check using 35 positive and 4 generalized place invariants in 7 ms returned sat
[2021-05-18 12:01:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:01:57] [INFO ] [Real]Absence check using state equation in 372 ms returned sat
[2021-05-18 12:01:57] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:01:57] [INFO ] [Nat]Absence check using 35 positive place invariants in 8 ms returned unsat
[2021-05-18 12:01:57] [INFO ] [Real]Absence check using 35 positive place invariants in 17 ms returned sat
[2021-05-18 12:01:58] [INFO ] [Real]Absence check using 35 positive and 4 generalized place invariants in 14 ms returned sat
[2021-05-18 12:01:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:01:58] [INFO ] [Real]Absence check using state equation in 431 ms returned sat
[2021-05-18 12:01:58] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:01:58] [INFO ] [Nat]Absence check using 35 positive place invariants in 14 ms returned unsat
[2021-05-18 12:01:58] [INFO ] [Real]Absence check using 35 positive place invariants in 17 ms returned sat
[2021-05-18 12:01:58] [INFO ] [Real]Absence check using 35 positive and 4 generalized place invariants in 3 ms returned sat
[2021-05-18 12:01:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:01:58] [INFO ] [Real]Absence check using state equation in 378 ms returned sat
[2021-05-18 12:01:58] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:01:59] [INFO ] [Nat]Absence check using 35 positive place invariants in 36 ms returned sat
[2021-05-18 12:01:59] [INFO ] [Nat]Absence check using 35 positive and 4 generalized place invariants in 4 ms returned sat
[2021-05-18 12:01:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:01:59] [INFO ] [Nat]Absence check using state equation in 379 ms returned sat
[2021-05-18 12:01:59] [INFO ] [Nat]Added 481 Read/Feed constraints in 262 ms returned sat
[2021-05-18 12:02:00] [INFO ] Deduced a trap composed of 18 places in 353 ms
[2021-05-18 12:02:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 418 ms
[2021-05-18 12:02:00] [INFO ] Computed and/alt/rep : 1265/132297/995 causal constraints in 120 ms.
[2021-05-18 12:02:18] [INFO ] Added : 370 causal constraints over 74 iterations in 18869 ms. Result :unknown
[2021-05-18 12:02:19] [INFO ] [Real]Absence check using 35 positive place invariants in 18 ms returned sat
[2021-05-18 12:02:19] [INFO ] [Real]Absence check using 35 positive and 4 generalized place invariants in 5 ms returned sat
[2021-05-18 12:02:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:02:19] [INFO ] [Real]Absence check using state equation in 388 ms returned sat
[2021-05-18 12:02:19] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:02:19] [INFO ] [Nat]Absence check using 35 positive place invariants in 18 ms returned sat
[2021-05-18 12:02:19] [INFO ] [Nat]Absence check using 35 positive and 4 generalized place invariants in 9 ms returned sat
[2021-05-18 12:02:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:02:19] [INFO ] [Nat]Absence check using state equation in 369 ms returned sat
[2021-05-18 12:02:20] [INFO ] [Nat]Added 481 Read/Feed constraints in 263 ms returned sat
[2021-05-18 12:02:20] [INFO ] Deduced a trap composed of 18 places in 321 ms
[2021-05-18 12:02:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 382 ms
[2021-05-18 12:02:20] [INFO ] Computed and/alt/rep : 1265/132297/995 causal constraints in 130 ms.
[2021-05-18 12:02:39] [INFO ] Added : 365 causal constraints over 73 iterations in 18921 ms. Result :unknown
[2021-05-18 12:02:39] [INFO ] [Real]Absence check using 35 positive place invariants in 18 ms returned sat
[2021-05-18 12:02:39] [INFO ] [Real]Absence check using 35 positive and 4 generalized place invariants in 4 ms returned sat
[2021-05-18 12:02:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:02:39] [INFO ] [Real]Absence check using state equation in 385 ms returned sat
[2021-05-18 12:02:39] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:02:39] [INFO ] [Nat]Absence check using 35 positive place invariants in 9 ms returned unsat
[2021-05-18 12:02:40] [INFO ] [Real]Absence check using 35 positive place invariants in 18 ms returned sat
[2021-05-18 12:02:40] [INFO ] [Real]Absence check using 35 positive and 4 generalized place invariants in 4 ms returned sat
[2021-05-18 12:02:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 12:02:40] [INFO ] [Real]Absence check using state equation in 370 ms returned sat
[2021-05-18 12:02:40] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 12:02:40] [INFO ] [Nat]Absence check using 35 positive place invariants in 19 ms returned sat
[2021-05-18 12:02:40] [INFO ] [Nat]Absence check using 35 positive and 4 generalized place invariants in 4 ms returned sat
[2021-05-18 12:02:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 12:02:40] [INFO ] [Nat]Absence check using state equation in 379 ms returned sat
[2021-05-18 12:02:41] [INFO ] [Nat]Added 481 Read/Feed constraints in 273 ms returned sat
[2021-05-18 12:02:41] [INFO ] Deduced a trap composed of 22 places in 298 ms
[2021-05-18 12:02:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 358 ms
[2021-05-18 12:02:41] [INFO ] Computed and/alt/rep : 1265/132297/995 causal constraints in 122 ms.
[2021-05-18 12:03:00] [INFO ] Added : 365 causal constraints over 73 iterations in 18963 ms. Result :(error "Solver has unexpectedly terminated")
Successfully simplified 5 atomic propositions for a total of 6 simplifications.
[2021-05-18 12:03:01] [INFO ] Initial state reduction rules for CTL removed 8 formulas.
[2021-05-18 12:03:01] [INFO ] Flatten gal took : 584 ms
FORMULA SimpleLoadBal-PT-15-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SimpleLoadBal-PT-15-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SimpleLoadBal-PT-15-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SimpleLoadBal-PT-15-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SimpleLoadBal-PT-15-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SimpleLoadBal-PT-15-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SimpleLoadBal-PT-15-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SimpleLoadBal-PT-15-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-18 12:03:01] [INFO ] Applying decomposition
[2021-05-18 12:03:01] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2021-05-18 12:03:01] [INFO ] Flatten gal took : 139 ms
[2021-05-18 12:03:01] [INFO ] Decomposing Gal with order
[2021-05-18 12:03:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-18 12:03:02] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2021-05-18 12:03:02] [INFO ] Flatten gal took : 141 ms
[2021-05-18 12:03:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-18 12:03:02] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA SimpleLoadBal-PT-15-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-18 12:03:02] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 18 ms.
[2021-05-18 12:03:02] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 17 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ SimpleLoadBal-PT-15 @ 3570 seconds

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

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

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

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

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

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

FORMULA SimpleLoadBal-PT-15-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3560
rslt: Output for LTLCardinality @ SimpleLoadBal-PT-15

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 508
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X ((((p32 <= 0)) OR ((1 <= p76))))",
"processed_size": 34,
"rewrites": 36
},
"result":
{
"edges": 182,
"markings": 182,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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": 593
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 2,
"aconj": 1,
"adisj": 2,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (X (G ((((1 <= p132)) AND ((p21 <= 0))))))",
"processed_size": 44,
"rewrites": 36
},
"result":
{
"edges": 170,
"markings": 170,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 712
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"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": "((p112 <= 0))",
"processed_size": 13,
"rewrites": 38
},
"result":
{
"edges": 254,
"markings": 254,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 46
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 890
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "G (F (((1 <= p72))))",
"processed_size": 20,
"rewrites": 36
},
"result":
{
"edges": 34,
"markings": 34,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 3,
"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": 1187
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G (F ((((p60 <= 0)) OR ((1 <= p126)))))",
"processed_size": 40,
"rewrites": 36
},
"result":
{
"edges": 38340,
"markings": 28990,
"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": 1780
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "F (G ((((p84 <= 0)) OR ((1 <= p29)))))",
"processed_size": 39,
"rewrites": 36
},
"result":
{
"edges": 11266,
"markings": 9137,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3560
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 0,
"aconj": 15,
"adisj": 5,
"aneg": 0,
"comp": 13,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 13,
"taut": 0,
"tconj": 1,
"tdisj": 4,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "G ((((((p78 <= 0)) OR ((1 <= p61))) AND (((p12 <= 0)) OR ((1 <= p60)))) OR ((G ((((p12 <= 0)) OR ((1 <= p60)))) AND F (((((p78 <= 0)) OR ((1 <= p61))) AND (((p12 <= 0)) OR ((1 <= p60)))))) OR (((p78 <= 0)) OR (((1 <= p61)) OR ((1 <= p40)))))))",
"processed_size": 248,
"rewrites": 36
},
"result":
{
"edges": 4180,
"markings": 2530,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"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": 44648,
"runtime": 10.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "G(F(**)) : G(F(**)) : X((** OR **)) : F(**) : X(X(G(**))) : F(G(**)) : G((** OR ((G(**) AND F(**)) OR (** OR (** OR **)))))"
},
"net":
{
"arcs": 8988,
"conflict_clusters": 35,
"places": 149,
"places_significant": 110,
"singleton_clusters": 0,
"transitions": 1280
},
"result":
{
"preliminary_value": "no no no no no no no ",
"value": "no no no 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: 1429/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 149
lola: finding significant places
lola: 149 places, 1280 transitions, 110 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from LTLCardinality.xml
lola: LP says that atomic proposition is always true: (p72 <= 1)
lola: LP says that atomic proposition is always true: (p126 <= 1)
lola: LP says that atomic proposition is always true: (p50 <= 1)
lola: LP says that atomic proposition is always true: (p76 <= 1)
lola: LP says that atomic proposition is always true: (p112 <= 1)
lola: LP says that atomic proposition is always true: (p21 <= 1)
lola: LP says that atomic proposition is always true: (p29 <= 1)
lola: LP says that atomic proposition is always true: (p29 <= 1)
lola: LP says that atomic proposition is always true: (p60 <= 1)
lola: LP says that atomic proposition is always true: (p61 <= 1)
lola: LP says that atomic proposition is always true: (p60 <= 1)
lola: LP says that atomic proposition is always true: (p61 <= 1)
lola: LP says that atomic proposition is always true: (p40 <= 1)
lola: NOT(G (F (NOT(F (X (((1 <= p72)))))))) : G (F (X (F ((((p60 <= 0)) OR ((1 <= p126))))))) : X (((NOT((F (((1 <= p50))) U (0 <= 0))) OR ((p32 <= 0))) OR ((1 <= p76)))) : F (((1 <= p112))) : G (X (X ((((1 <= p132)) AND ((p21 <= 0)))))) : (F (((((p84 <= 0)) OR ((1 <= p29))) U G ((((p84 <= 0)) OR ((1 <= p29)))))) OR X (X (X (((0 <= 0) U (1 <= 0)))))) : G (((((G ((((p12 <= 0)) OR ((1 <= p60)))) U ((((p78 <= 0)) OR ((1 <= p61))) AND (((p12 <= 0)) OR ((1 <= p60))))) OR ((p78 <= 0))) OR ((1 <= p61))) OR ((1 <= p40))))
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
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:300
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:166
lola: rewrite Frontend/Parser/formula_rewrite.k:279
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:121
lola: rewrite Frontend/Parser/formula_rewrite.k:431
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:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 508 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((((p32 <= 0)) OR ((1 <= p76))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((((p32 <= 0)) OR ((1 <= p76))))
lola: processed formula length: 34
lola: 36 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 182 markings, 182 edges
lola: ========================================
lola: subprocess 1 will run for 593 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (G ((((1 <= p132)) AND ((p21 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (G ((((1 <= p132)) AND ((p21 <= 0))))))
lola: processed formula length: 44
lola: 36 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 170 markings, 170 edges
lola: ========================================
lola: subprocess 2 will run for 712 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((1 <= p112)))
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: ((p112 <= 0))
lola: processed formula length: 13
lola: 38 rewrites
lola: closed formula file LTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 254 markings, 254 edges
lola: ========================================
lola: subprocess 3 will run for 890 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F (((1 <= p72))))
lola: ========================================
lola: SUBTASK
lola: checking fairness
lola: fairness not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F (((1 <= p72))))
lola: processed formula length: 20
lola: 36 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: 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: 34 markings, 34 edges
lola: ========================================
lola: subprocess 4 will run for 1187 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((((p60 <= 0)) OR ((1 <= p126)))))
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 ((((p60 <= 0)) OR ((1 <= p126)))))
lola: processed formula length: 40
lola: 36 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: 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: 28990 markings, 38340 edges
lola: ========================================
lola: subprocess 5 will run for 1780 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((((p84 <= 0)) OR ((1 <= p29)))))
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 ((((p84 <= 0)) OR ((1 <= p29)))))
lola: processed formula length: 39
lola: 36 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: 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: 9137 markings, 11266 edges
lola: ========================================
lola: subprocess 6 will run for 3560 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((((((p78 <= 0)) OR ((1 <= p61))) AND (((p12 <= 0)) OR ((1 <= p60)))) OR ((G ((((p12 <= 0)) OR ((1 <= p60)))) AND F (((((p78 <= 0)) OR ((1 <= p61))) AND (((p12 <= 0)) OR ((1 <= p60)))))) OR (((p78 <= 0)) OR (((1 <= p61)) OR ((1 <= p40)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((((((p78 <= 0)) OR ((1 <= p61))) AND (((p12 <= 0)) OR ((1 <= p60)))) OR ((G ((((p12 <= 0)) OR ((1 <= p60)))) AND F (((((p78 <= 0)) OR ((1 <= p61))) AND (((p12 <= 0)) OR ((1 <= p60)))))) OR (((p78 <= 0)) OR (((1 <= p61)) OR ((1 <= p40)))))))
lola: processed formula length: 248
lola: 36 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 2530 markings, 4180 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no no no no
lola:
preliminary result: no no no no no no no
lola: memory consumption: 44648 KB
lola: time consumption: 10 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.json
rslt: finished

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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