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

--------------------
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 1621339096586

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-18 11:58:19] [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 11:58:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-18 11:58:20] [INFO ] Load time of PNML (sax parser for PT used): 248 ms
[2021-05-18 11:58:20] [INFO ] Transformed 104 places.
[2021-05-18 11:58:20] [INFO ] Transformed 605 transitions.
[2021-05-18 11:58:20] [INFO ] Found NUPN structural information;
[2021-05-18 11:58:20] [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:20] [INFO ] Parsed PT model containing 104 places and 605 transitions in 365 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 69 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 587 ms. (steps per millisecond=170 ) properties seen :[1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-05-18 11:58:20] [INFO ] Flow matrix only has 475 transitions (discarded 130 similar events)
// Phase 1: matrix 475 rows 104 cols
[2021-05-18 11:58:20] [INFO ] Computed 29 place invariants in 25 ms
[2021-05-18 11:58:21] [INFO ] [Real]Absence check using 25 positive place invariants in 35 ms returned sat
[2021-05-18 11:58:21] [INFO ] [Real]Absence check using 25 positive and 4 generalized place invariants in 3 ms returned sat
[2021-05-18 11:58:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 11:58:21] [INFO ] [Real]Absence check using state equation in 263 ms returned sat
[2021-05-18 11:58:21] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 11:58:21] [INFO ] [Nat]Absence check using 25 positive place invariants in 21 ms returned unsat
[2021-05-18 11:58:21] [INFO ] [Real]Absence check using 25 positive place invariants in 19 ms returned sat
[2021-05-18 11:58:21] [INFO ] [Real]Absence check using 25 positive and 4 generalized place invariants in 3 ms returned sat
[2021-05-18 11:58:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 11:58:21] [INFO ] [Real]Absence check using state equation in 322 ms returned sat
[2021-05-18 11:58:21] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 11:58:22] [INFO ] [Nat]Absence check using 25 positive place invariants in 9 ms returned unsat
[2021-05-18 11:58:22] [INFO ] [Real]Absence check using 25 positive place invariants in 14 ms returned sat
[2021-05-18 11:58:22] [INFO ] [Real]Absence check using 25 positive and 4 generalized place invariants in 3 ms returned sat
[2021-05-18 11:58:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 11:58:22] [INFO ] [Real]Absence check using state equation in 218 ms returned sat
[2021-05-18 11:58:22] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 11:58:22] [INFO ] [Nat]Absence check using 25 positive place invariants in 12 ms returned unsat
Successfully simplified 3 atomic propositions for a total of 3 simplifications.
[2021-05-18 11:58:22] [INFO ] Initial state reduction rules for CTL removed 6 formulas.
[2021-05-18 11:58:22] [INFO ] Flatten gal took : 175 ms
FORMULA SimpleLoadBal-PT-10-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SimpleLoadBal-PT-10-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SimpleLoadBal-PT-10-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SimpleLoadBal-PT-10-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SimpleLoadBal-PT-10-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SimpleLoadBal-PT-10-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-18 11:58:22] [INFO ] Applying decomposition
[2021-05-18 11:58:22] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2021-05-18 11:58:22] [INFO ] Flatten gal took : 90 ms
[2021-05-18 11:58:23] [INFO ] Decomposing Gal with order
[2021-05-18 11:58:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-18 11:58:23] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2021-05-18 11:58:23] [INFO ] Flatten gal took : 81 ms
[2021-05-18 11:58:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-18 11:58:23] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
FORMULA SimpleLoadBal-PT-10-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SimpleLoadBal-PT-10-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SimpleLoadBal-PT-10-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-18 11:58:23] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 4 ms.
[2021-05-18 11:58:23] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 13 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ SimpleLoadBal-PT-10 @ 3570 seconds

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

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

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

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 FALSE 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-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3566
rslt: Output for LTLCardinality @ 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=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 11:58:24 2021
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"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 (G ((F (((1 <= p17))) OR ((1 <= p29)))))",
"processed_size": 42,
"rewrites": 23
},
"result":
{
"edges": 12,
"markings": 12,
"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": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 10,
"adisj": 3,
"aneg": 0,
"comp": 10,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 2,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X ((F ((((p56 <= 0)) OR ((1 <= p28)))) AND ((G ((((p56 <= 0)) OR ((1 <= p28)))) OR (((p13 <= 0)) OR ((1 <= p16)))) AND (((p56 <= 0)) OR ((1 <= p28)) OR ((p13 <= 0)) OR ((1 <= p16))))))",
"processed_size": 189,
"rewrites": 23
},
"result":
{
"edges": 38,
"markings": 38,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"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": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 2,
"aconj": 12,
"adisj": 5,
"aneg": 0,
"comp": 12,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 12,
"taut": 0,
"tconj": 3,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "X ((((((p49 <= 0)) OR ((1 <= p78))) U (X ((((p38 <= 0)) OR ((1 <= p94)))) OR (((p50 <= 0)) OR ((1 <= p50))))) AND ((((p66 <= 0)) OR ((1 <= p63))) AND ((((p49 <= 0)) OR ((1 <= p78))) AND (((p38 <= 0)) OR ((1 <= p94)))))))",
"processed_size": 225,
"rewrites": 23
},
"result":
{
"edges": 40,
"markings": 41,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 8
},
"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": 891
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"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 ((((p57 <= 0)) OR ((1 <= p49))))",
"processed_size": 35,
"rewrites": 23
},
"result":
{
"edges": 1136,
"markings": 1046,
"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": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1188
},
"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 ((((p57 <= 0)) OR ((1 <= p49)))))",
"processed_size": 39,
"rewrites": 23
},
"result":
{
"edges": 1036,
"markings": 944,
"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": "stabilization",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 3,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1188
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 0,
"U": 1,
"X": 3,
"aconj": 4,
"adisj": 3,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "X (((((p6 <= 0)) OR ((1 <= p3))) U X ((X (F (((p64 <= 0)))) AND F ((((p19 <= 0)) OR ((1 <= p11))))))))",
"processed_size": 104,
"rewrites": 23
},
"result":
{
"edges": 40,
"markings": 40,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 10
},
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1783
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"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": "X (F ((((p9 <= 0)) OR ((1 <= p99)))))",
"processed_size": 38,
"rewrites": 23
},
"result":
{
"edges": 12,
"markings": 11,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3566
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "F (G ((((p9 <= 0)) AND ((1 <= p9)))))",
"processed_size": 37,
"rewrites": 23
},
"result":
{
"edges": 128,
"markings": 127,
"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": "stabilization",
"workflow": "product automaton"
}
}
],
"exit":
{
"error": null,
"memory": 37204,
"runtime": 4.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "X(G((F(**) OR **))) : X((F(**) AND ((G(**) OR (** OR **)) AND **))) : X(((** U (X(**) OR (** OR **))) AND (** AND (** AND **)))) : (G(**) OR (G((X(**) OR (** OR **))) AND F(G(**)))) : X((** U X((X(F(**)) AND F(**))))) : X(F(**)) : F(G((* AND **)))"
},
"net":
{
"arcs": 4148,
"conflict_clusters": 25,
"places": 104,
"places_significant": 75,
"singleton_clusters": 0,
"transitions": 605
},
"result":
{
"preliminary_value": "no no yes no no no no ",
"value": "no no yes no no no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 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 LTLCardinality.xml
lola: LP says that atomic proposition is always true: (p17 <= 1)
lola: LP says that atomic proposition is always true: (p29 <= 1)
lola: LP says that atomic proposition is always true: (p28 <= 1)
lola: LP says that atomic proposition is always true: (p28 <= 1)
lola: LP says that atomic proposition is always true: (p16 <= 1)
lola: LP says that atomic proposition is always true: (p28 <= 1)
lola: LP says that atomic proposition is always true: (p16 <= 1)
lola: LP says that atomic proposition is always true: (p78 <= 1)
lola: LP says that atomic proposition is always true: (p94 <= 1)
lola: LP says that atomic proposition is always true: (p50 <= 1)
lola: LP says that atomic proposition is always true: (p63 <= 1)
lola: LP says that atomic proposition is always true: (p78 <= 1)
lola: LP says that atomic proposition is always true: (p94 <= 1)
lola: LP says that atomic proposition is always true: (p52 <= 1)
lola: LP says that atomic proposition is always true: (p49 <= 1)
lola: LP says that atomic proposition is always true: (p49 <= 1)
lola: LP says that atomic proposition is always true: (p3 <= 1)
lola: LP says that atomic proposition is always true: (p64 <= 1)
lola: LP says that atomic proposition is always true: (p11 <= 1)
lola: LP says that atomic proposition is always true: (p99 <= 1)
lola: LP says that atomic proposition is always true: (p99 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: X (G ((((0 <= 0) U ((1 <= p17))) OR ((1 <= p29))))) : X (((F ((((p56 <= 0)) OR ((1 <= p28)))) AND ((G ((((p56 <= 0)) OR ((1 <= p28)))) OR ((p13 <= 0))) OR ((1 <= p16)))) AND (((p56 <= 0)) OR ((1 <= p28)) OR ((p13 <= 0)) OR ((1 <= p16))))) : X ((((((((p49 <= 0)) OR ((1 <= p78))) U ((X ((((p38 <= 0)) OR ((1 <= p94)))) OR ((p50 <= 0))) OR ((1 <= p50)))) AND (((p66 <= 0)) OR ((1 <= p63)))) AND (((p49 <= 0)) OR ((1 <= p78)))) AND (((p38 <= 0)) OR ((1 <= p94))))) : (G (((X ((((p71 <= 0)) OR ((1 <= p52)))) OR ((p57 <= 0))) OR ((1 <= p49)))) U G ((((p57 <= 0)) OR ((1 <= p49))))) : (X ((((p6 <= 0)) OR ((1 <= p3)))) U X ((F (X (X (((p64 <= 0))))) AND F (X ((((p19 <= 0)) OR ((1 <= p11)))))))) : F (((((1 <= p9)) AND ((p99 <= 0))) U X ((((p9 <= 0)) OR ((1 <= p99)))))) : F (X ((NOT((((p9 <= 0)) U ((1 <= p9)))) AND G (((1 <= p9))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:525
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:419
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((F (((1 <= p17))) OR ((1 <= p29)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((F (((1 <= p17))) OR ((1 <= p29)))))
lola: processed formula length: 42
lola: 23 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: 12 markings, 12 edges
lola: ========================================
lola: subprocess 1 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((F ((((p56 <= 0)) OR ((1 <= p28)))) AND ((G ((((p56 <= 0)) OR ((1 <= p28)))) OR (((p13 <= 0)) OR ((1 <= p16)))) AND (((p56 <= 0)) OR ((1 <= p28)) OR ((p13 <= 0)) OR ((1 <= p16))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((F ((((p56 <= 0)) OR ((1 <= p28)))) AND ((G ((((p56 <= 0)) OR ((1 <= p28)))) OR (((p13 <= 0)) OR ((1 <= p16)))) AND (((p56 <= 0)) OR ((1 <= p28)) OR ((p13 <= 0)) OR ((1 <= p16))))))
lola: processed formula length: 189
lola: 23 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 38 markings, 38 edges
lola: ========================================
lola: subprocess 2 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((((((p49 <= 0)) OR ((1 <= p78))) U (X ((((p38 <= 0)) OR ((1 <= p94)))) OR (((p50 <= 0)) OR ((1 <= p50))))) AND ((((p66 <= 0)) OR ((1 <= p63))) AND ((((p49 <= 0)) OR ((1 <= p78))) AND (((p38 <= 0)) OR ((1 <= p94)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((((((p49 <= 0)) OR ((1 <= p78))) U (X ((((p38 <= 0)) OR ((1 <= p94)))) OR (((p50 <= 0)) OR ((1 <= p50))))) AND ((((p66 <= 0)) OR ((1 <= p63))) AND ((((p49 <= 0)) OR ((1 <= p78))) AND (((p38 <= 0)) OR ((1 <= p94)))))))
lola: processed formula length: 225
lola: 23 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 8 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 41 markings, 40 edges
lola: ========================================
lola: subprocess 3 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G ((((p57 <= 0)) OR ((1 <= p49)))) OR (G ((X ((((p71 <= 0)) OR ((1 <= p52)))) OR (((p57 <= 0)) OR ((1 <= p49))))) AND F (G ((((p57 <= 0)) OR ((1 <= p49)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((((p57 <= 0)) OR ((1 <= p49))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((((p57 <= 0)) OR ((1 <= p49))))
lola: processed formula length: 35
lola: 23 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: 1046 markings, 1136 edges
lola: ========================================
lola: subprocess 4 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((((p57 <= 0)) OR ((1 <= p49)))))
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 ((((p57 <= 0)) OR ((1 <= p49)))))
lola: processed formula length: 39
lola: 23 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: 944 markings, 1036 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 4 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((((p6 <= 0)) OR ((1 <= p3))) U X ((X (F (((p64 <= 0)))) AND F ((((p19 <= 0)) OR ((1 <= p11))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((((p6 <= 0)) OR ((1 <= p3))) U X ((X (F (((p64 <= 0)))) AND F ((((p19 <= 0)) OR ((1 <= p11))))))))
lola: processed formula length: 104
lola: 23 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 10 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: 40 markings, 40 edges
lola: ========================================
lola: subprocess 5 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((((p9 <= 0)) OR ((1 <= p99)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((((p9 <= 0)) OR ((1 <= p99)))))
lola: processed formula length: 38
lola: 23 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: 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, 12 edges
lola: ========================================
lola: subprocess 6 will run for 3566 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((((p9 <= 0)) AND ((1 <= p9)))))
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 ((((p9 <= 0)) AND ((1 <= p9)))))
lola: processed formula length: 37
lola: 23 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: 127 markings, 128 edges
lola: RESULT
lola:
SUMMARY: no no yes no no no no
lola:
preliminary result: no no yes no no no no
lola: ========================================
lola: memory consumption: 37204 KB
lola: time consumption: 4 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-10"
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-10, 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-162106594400185"
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 [ "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 ;