fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r132-tall-162075428500322
Last Updated
Jun 28, 2021

About the Execution of 2020-gold for LamportFastMutEx-PT-2

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
4332.859 3600000.00 9720.00 224.00 FTFFFFFFFFFFTFTF normal

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.r132-tall-162075428500322.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2020
Input is LamportFastMutEx-PT-2, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r132-tall-162075428500322
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 716K
-rw-r--r-- 1 mcc users 32K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 184K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 43K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 232K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 6.3K Apr 26 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 36K Apr 26 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.3K Apr 26 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 24K Apr 26 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 27 06:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 27 06:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Mar 25 07:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 26K Mar 25 07:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.3K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 2 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 48K May 5 16:51 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 LamportFastMutEx-PT-2-00
FORMULA_NAME LamportFastMutEx-PT-2-01
FORMULA_NAME LamportFastMutEx-PT-2-02
FORMULA_NAME LamportFastMutEx-PT-2-03
FORMULA_NAME LamportFastMutEx-PT-2-04
FORMULA_NAME LamportFastMutEx-PT-2-05
FORMULA_NAME LamportFastMutEx-PT-2-06
FORMULA_NAME LamportFastMutEx-PT-2-07
FORMULA_NAME LamportFastMutEx-PT-2-08
FORMULA_NAME LamportFastMutEx-PT-2-09
FORMULA_NAME LamportFastMutEx-PT-2-10
FORMULA_NAME LamportFastMutEx-PT-2-11
FORMULA_NAME LamportFastMutEx-PT-2-12
FORMULA_NAME LamportFastMutEx-PT-2-13
FORMULA_NAME LamportFastMutEx-PT-2-14
FORMULA_NAME LamportFastMutEx-PT-2-15

=== Now, execution of the tool begins

BK_START 1620931592084

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-13 18:46:33] [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-13 18:46:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 18:46:33] [INFO ] Load time of PNML (sax parser for PT used): 53 ms
[2021-05-13 18:46:33] [INFO ] Transformed 69 places.
[2021-05-13 18:46:33] [INFO ] Transformed 96 transitions.
[2021-05-13 18:46:33] [INFO ] Found NUPN structural information;
[2021-05-13 18:46:33] [INFO ] Completing missing partition info from NUPN : creating a component with [P_start_1_0, P_start_1_1, P_start_1_2, P_b_0_false, P_b_0_true, P_b_1_false, P_b_1_true, P_b_2_false, P_b_2_true, P_setx_3_0, P_setx_3_1, P_setx_3_2, P_setbi_5_0, P_setbi_5_1, P_setbi_5_2, P_ify0_4_0, P_ify0_4_1, P_ify0_4_2, P_sety_9_0, P_sety_9_1, P_sety_9_2, P_ifxi_10_0, P_ifxi_10_1, P_ifxi_10_2, P_setbi_11_0, P_setbi_11_1, P_setbi_11_2, P_fordo_12_0, P_fordo_12_1, P_fordo_12_2, P_wait_0_0, P_wait_0_1, P_wait_0_2, P_wait_1_0, P_wait_1_1, P_wait_1_2, P_wait_2_0, P_wait_2_1, P_wait_2_2, P_await_13_0, P_await_13_1, P_await_13_2, P_done_0_0, P_done_0_1, P_done_0_2, P_done_1_0, P_done_1_1, P_done_1_2, P_done_2_0, P_done_2_1, P_done_2_2, P_ifyi_15_0, P_ifyi_15_1, P_ifyi_15_2, P_awaity_0, P_awaity_1, P_awaity_2, P_CS_21_0, P_CS_21_1, P_CS_21_2, P_setbi_24_0, P_setbi_24_1, P_setbi_24_2]
[2021-05-13 18:46:33] [INFO ] Parsed PT model containing 69 places and 96 transitions in 91 ms.
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 34 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 21 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 251 ms. (steps per millisecond=398 ) properties seen :[0, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-05-13 18:46:33] [INFO ] Flow matrix only has 56 transitions (discarded 6 similar events)
// Phase 1: matrix 56 rows 44 cols
[2021-05-13 18:46:33] [INFO ] Computed 10 place invariants in 4 ms
[2021-05-13 18:46:34] [INFO ] [Real]Absence check using 10 positive place invariants in 13 ms returned sat
[2021-05-13 18:46:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 18:46:34] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2021-05-13 18:46:34] [INFO ] State equation strengthened by 20 read => feed constraints.
[2021-05-13 18:46:34] [INFO ] [Real]Added 20 Read/Feed constraints in 5 ms returned sat
[2021-05-13 18:46:34] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 18:46:34] [INFO ] [Nat]Absence check using 10 positive place invariants in 10 ms returned sat
[2021-05-13 18:46:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 18:46:34] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2021-05-13 18:46:34] [INFO ] [Nat]Added 20 Read/Feed constraints in 10 ms returned sat
[2021-05-13 18:46:34] [INFO ] Deduced a trap composed of 16 places in 30 ms
[2021-05-13 18:46:34] [INFO ] Deduced a trap composed of 9 places in 30 ms
[2021-05-13 18:46:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 77 ms
[2021-05-13 18:46:34] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2021-05-13 18:46:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 18:46:34] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2021-05-13 18:46:34] [INFO ] [Real]Added 20 Read/Feed constraints in 2 ms returned sat
[2021-05-13 18:46:34] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 18:46:34] [INFO ] [Nat]Absence check using 10 positive place invariants in 7 ms returned sat
[2021-05-13 18:46:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 18:46:34] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2021-05-13 18:46:34] [INFO ] [Nat]Added 20 Read/Feed constraints in 9 ms returned sat
[2021-05-13 18:46:34] [INFO ] Deduced a trap composed of 9 places in 20 ms
[2021-05-13 18:46:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2021-05-13 18:46:34] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2021-05-13 18:46:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 18:46:34] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2021-05-13 18:46:34] [INFO ] [Real]Added 20 Read/Feed constraints in 7 ms returned sat
[2021-05-13 18:46:34] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 18:46:34] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2021-05-13 18:46:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 18:46:34] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2021-05-13 18:46:34] [INFO ] [Nat]Added 20 Read/Feed constraints in 2 ms returned sat
[2021-05-13 18:46:34] [INFO ] Deduced a trap composed of 9 places in 20 ms
[2021-05-13 18:46:34] [INFO ] Deduced a trap composed of 10 places in 21 ms
[2021-05-13 18:46:34] [INFO ] Deduced a trap composed of 8 places in 17 ms
[2021-05-13 18:46:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 3 trap constraints in 68 ms
[2021-05-13 18:46:34] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2021-05-13 18:46:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 18:46:34] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2021-05-13 18:46:34] [INFO ] [Real]Added 20 Read/Feed constraints in 2 ms returned sat
[2021-05-13 18:46:34] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 18:46:34] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2021-05-13 18:46:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 18:46:34] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2021-05-13 18:46:34] [INFO ] [Nat]Added 20 Read/Feed constraints in 2 ms returned sat
[2021-05-13 18:46:34] [INFO ] Deduced a trap composed of 8 places in 16 ms
[2021-05-13 18:46:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2021-05-13 18:46:34] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2021-05-13 18:46:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 18:46:34] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2021-05-13 18:46:34] [INFO ] [Real]Added 20 Read/Feed constraints in 2 ms returned sat
[2021-05-13 18:46:34] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 18:46:34] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2021-05-13 18:46:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 18:46:34] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2021-05-13 18:46:34] [INFO ] [Nat]Added 20 Read/Feed constraints in 2 ms returned sat
[2021-05-13 18:46:34] [INFO ] Deduced a trap composed of 8 places in 17 ms
[2021-05-13 18:46:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2021-05-13 18:46:34] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2021-05-13 18:46:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 18:46:34] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2021-05-13 18:46:34] [INFO ] [Real]Added 20 Read/Feed constraints in 2 ms returned sat
[2021-05-13 18:46:34] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 18:46:34] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2021-05-13 18:46:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 18:46:34] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2021-05-13 18:46:34] [INFO ] [Nat]Added 20 Read/Feed constraints in 2 ms returned sat
[2021-05-13 18:46:34] [INFO ] Deduced a trap composed of 10 places in 17 ms
[2021-05-13 18:46:34] [INFO ] Deduced a trap composed of 8 places in 10 ms
[2021-05-13 18:46:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 32 ms
Successfully simplified 6 atomic propositions for a total of 8 simplifications.
[2021-05-13 18:46:34] [INFO ] Initial state reduction rules for CTL removed 7 formulas.
[2021-05-13 18:46:34] [INFO ] Flatten gal took : 29 ms
FORMULA LamportFastMutEx-PT-2-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-2-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-2-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-2-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-2-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-2-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-2-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-13 18:46:34] [INFO ] Applying decomposition
[2021-05-13 18:46:34] [INFO ] Flatten gal took : 8 ms
[2021-05-13 18:46:34] [INFO ] Decomposing Gal with order
[2021-05-13 18:46:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-13 18:46:35] [INFO ] Removed a total of 41 redundant transitions.
[2021-05-13 18:46:35] [INFO ] Flatten gal took : 34 ms
[2021-05-13 18:46:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 2 ms.
[2021-05-13 18:46:35] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 4 ms.
[2021-05-13 18:46:35] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 1 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ LamportFastMutEx-PT-2 @ 3570 seconds

FORMULA LamportFastMutEx-PT-2-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA LamportFastMutEx-PT-2-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA LamportFastMutEx-PT-2-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA LamportFastMutEx-PT-2-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA LamportFastMutEx-PT-2-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA LamportFastMutEx-PT-2-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA LamportFastMutEx-PT-2-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA LamportFastMutEx-PT-2-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA LamportFastMutEx-PT-2-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3567
rslt: Output for LTLFireability @ LamportFastMutEx-PT-2

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 1,
"aconj": 6,
"adisj": 10,
"aneg": 1,
"comp": 22,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 22,
"taut": 0,
"tconj": 1,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 11,
"visible_transitions": 0
},
"processed": "X (G (((((1 <= p6) AND (1 <= p17)) OR ((1 <= p7) AND (1 <= p16))) OR (F ((((1 <= p24)) OR ((1 <= p25)))) AND (F ((((1 <= p6) AND (1 <= p16)) OR ((1 <= p6) AND (1 <= p17)) OR ((1 <= p7) AND (1 <= p16)) OR ((1 <= p7) AND (1 <= p17)))) OR (((p2 <= 0) OR (p21 <= 0)) AND ((p4 <= 0) OR (p20 <= 0)) AND ((p2 <= 0) OR (p20 <= 0)) AND ((p3 <= 0) OR (p21 <= 0))))))))",
"processed_size": 367,
"rewrites": 63
},
"result":
{
"edges": 9,
"markings": 9,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"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": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 2,
"aconj": 16,
"adisj": 4,
"aneg": 4,
"comp": 32,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 32,
"taut": 0,
"tconj": 4,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 9,
"visible_transitions": 0
},
"processed": "F ((X (((((p10 <= 0) OR (p23 <= 0)) AND ((p9 <= 0) OR (p22 <= 0)) AND ((p11 <= 0) OR (p23 <= 0)) AND ((p8 <= 0) OR (p22 <= 0))) AND ((F ((((1 <= p5) AND (1 <= p16)) OR ((1 <= p5) AND (1 <= p17)))) OR G ((((p10 <= 0) OR (p23 <= 0)) AND ((p9 <= 0) OR (p22 <= 0)) AND ((p11 <= 0) OR (p23 <= 0)) AND ((p8 <= 0) OR (p22 <= 0))))) AND X ((((1 <= p10) AND (1 <= p23)) OR ((1 <= p9) AND (1 <= p22)) OR ((1 <= p11) AND (1 <= p23)) OR ((1 <= p8) AND (1 <= p22))))))) AND (((p9 <= 0) OR (p22 <= 0)) AND ((p11 <= 0) OR (p23 <= 0)))))",
"processed_size": 535,
"rewrites": 63
},
"result":
{
"edges": 388,
"markings": 187,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 15
},
"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": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 2,
"aconj": 18,
"adisj": 5,
"aneg": 0,
"comp": 34,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 34,
"taut": 0,
"tconj": 1,
"tdisj": 3,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 12,
"visible_transitions": 0
},
"processed": "X ((X (((((1 <= p10) AND (1 <= p23)) OR ((1 <= p9) AND (1 <= p22)) OR ((1 <= p11) AND (1 <= p23)) OR ((1 <= p8) AND (1 <= p22))) OR (G ((((1 <= p10) AND (1 <= p23)) OR ((1 <= p9) AND (1 <= p22)) OR ((1 <= p11) AND (1 <= p23)) OR ((1 <= p8) AND (1 <= p22)))) AND F ((((1 <= p10) AND (1 <= p23)) OR ((1 <= p9) AND (1 <= p22)) OR ((1 <= p11) AND (1 <= p23)) OR ((1 <= p8) AND (1 <= p22))))))) OR (G ((((1 <= p24)) OR ((1 <= p25)))) OR F ((((1 <= p6) AND (1 <= p16)) OR ((1 <= p6) AND (1 <= p17)) OR ((1 <= p7) AND (1 <= p16)) OR ((1 <= p7) AND (1 <= p17)))))))",
"processed_size": 570,
"rewrites": 63
},
"result":
{
"edges": 10,
"markings": 10,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 12
},
"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": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 4,
"G": 0,
"U": 0,
"X": 2,
"aconj": 13,
"adisj": 7,
"aneg": 4,
"comp": 36,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 36,
"taut": 0,
"tconj": 2,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 12,
"visible_transitions": 0
},
"processed": "X (F ((F ((((p8 <= 0) OR (p28 <= 0) OR (p31 <= 0)) AND ((p10 <= 0) OR (p29 <= 0) OR (p31 <= 0)) AND ((p10 <= 0) OR (p27 <= 0) OR (p30 <= 0)) AND ((p8 <= 0) OR (p26 <= 0) OR (p30 <= 0)))) AND (X (((((p6 <= 0) OR (p16 <= 0)) AND ((p6 <= 0) OR (p17 <= 0)) AND ((p7 <= 0) OR (p16 <= 0)) AND ((p7 <= 0) OR (p17 <= 0))) R F ((((1 <= p6) AND (1 <= p16)) OR ((1 <= p6) AND (1 <= p17)) OR ((1 <= p7) AND (1 <= p16)) OR ((1 <= p7) AND (1 <= p17)))))) AND F ((((p6 <= 0) OR (p16 <= 0)) AND ((p6 <= 0) OR (p17 <= 0)) AND ((p7 <= 0) OR (p16 <= 0)) AND ((p7 <= 0) OR (p17 <= 0))))))))",
"processed_size": 589,
"rewrites": 63
},
"result":
{
"edges": 10,
"markings": 10,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 10
},
"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": 713
},
"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 <= p24))))",
"processed_size": 20,
"rewrites": 63
},
"result":
{
"edges": 10,
"markings": 10,
"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": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "F (G (((1 <= p3) AND (1 <= p20))))",
"processed_size": 34,
"rewrites": 63
},
"result":
{
"edges": 18,
"markings": 17,
"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": 1189
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 1,
"X": 0,
"aconj": 6,
"adisj": 2,
"aneg": 0,
"comp": 10,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "(F ((((1 <= p24)) OR ((1 <= p25)))) U (((1 <= p7) AND (1 <= p36)) OR ((1 <= p5) AND (1 <= p36)) OR ((1 <= p6) AND (1 <= p37)) OR ((1 <= p5) AND (1 <= p37))))",
"processed_size": 161,
"rewrites": 63
},
"result":
{
"edges": 10,
"markings": 10,
"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": 1783
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 0,
"aconj": 10,
"adisj": 2,
"aneg": 0,
"comp": 20,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 20,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 10,
"visible_transitions": 0
},
"processed": "F (G ((G (F ((((1 <= p3) AND (1 <= p13)) OR ((1 <= p3) AND (1 <= p12)) OR ((1 <= p4) AND (1 <= p12)) OR ((1 <= p4) AND (1 <= p13)) OR ((1 <= p2) AND (1 <= p13)) OR ((1 <= p2) AND (1 <= p12))))) AND (((1 <= p7) AND (1 <= p36)) OR ((1 <= p5) AND (1 <= p36)) OR ((1 <= p6) AND (1 <= p37)) OR ((1 <= p5) AND (1 <= p37))))))",
"processed_size": 327,
"rewrites": 63
},
"result":
{
"edges": 11,
"markings": 10,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 7,
"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": 3567
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 3,
"U": 0,
"X": 0,
"aconj": 7,
"adisj": 4,
"aneg": 5,
"comp": 18,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 18,
"taut": 0,
"tconj": 2,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 11,
"visible_transitions": 0
},
"processed": "G (F ((((G ((((1 <= p30) AND (1 <= p32) AND (1 <= p33)) OR ((1 <= p31) AND (1 <= p34) AND (1 <= p35)))) AND (((p5 <= 0) OR (p16 <= 0)) AND ((p5 <= 0) OR (p17 <= 0)))) OR G ((((p5 <= 0) OR (p16 <= 0)) AND ((p5 <= 0) OR (p17 <= 0))))) R (((p5 <= 0) OR (p38 <= 0)) AND ((p5 <= 0) OR (p39 <= 0))))))",
"processed_size": 302,
"rewrites": 63
},
"result":
{
"edges": 53,
"markings": 49,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 15
},
"compoundnumber": 8,
"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": 71504,
"runtime": 3.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "X(G((** OR (F(**) AND (F(*) OR **))))) : F((X((* AND ((F(**) OR G(*)) AND X(**)))) AND (* AND *))) : (F(**) U **) : F(G((G(F(**)) AND **))) : G(F((((G(*) AND (* AND *)) OR G(*)) R *))) : X((X((** OR (G(**) AND F(**)))) OR (G(**) OR F(**)))) : X(F((F(*) AND (X((* R F(*))) AND F(*))))) : G(F(**)) : F(G(**))"
},
"net":
{
"arcs": 256,
"conflict_clusters": 5,
"places": 44,
"places_significant": 34,
"singleton_clusters": 0,
"transitions": 62
},
"result":
{
"preliminary_value": "no no no no no no no no no ",
"value": "no no 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: 106/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 44
lola: finding significant places
lola: 44 places, 62 transitions, 34 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: (p6 <= 1)
lola: LP says that atomic proposition is always true: (p17 <= 1)
lola: LP says that atomic proposition is always true: (p7 <= 1)
lola: LP says that atomic proposition is always true: (p16 <= 1)
lola: LP says that atomic proposition is always true: (p24 <= 1)
lola: LP says that atomic proposition is always true: (p25 <= 1)
lola: LP says that atomic proposition is always true: (p6 <= 1)
lola: LP says that atomic proposition is always true: (p16 <= 1)
lola: LP says that atomic proposition is always true: (p6 <= 1)
lola: LP says that atomic proposition is always true: (p17 <= 1)
lola: LP says that atomic proposition is always true: (p7 <= 1)
lola: LP says that atomic proposition is always true: (p16 <= 1)
lola: LP says that atomic proposition is always true: (p7 <= 1)
lola: LP says that atomic proposition is always true: (p17 <= 1)
lola: LP says that atomic proposition is always true: (p2 <= 1)
lola: LP says that atomic proposition is always true: (p21 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p20 <= 1)
lola: LP says that atomic proposition is always true: (p2 <= 1)
lola: LP says that atomic proposition is always true: (p20 <= 1)
lola: LP says that atomic proposition is always true: (p3 <= 1)
lola: LP says that atomic proposition is always true: (p21 <= 1)
lola: LP says that atomic proposition is always true: (p5 <= 1)
lola: LP says that atomic proposition is always true: (p16 <= 1)
lola: LP says that atomic proposition is always true: (p5 <= 1)
lola: LP says that atomic proposition is always true: (p17 <= 1)
lola: LP says that atomic proposition is always true: (p10 <= 1)
lola: LP says that atomic proposition is always true: (p23 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p22 <= 1)
lola: LP says that atomic proposition is always true: (p11 <= 1)
lola: LP says that atomic proposition is always true: (p23 <= 1)
lola: LP says that atomic proposition is always true: (p8 <= 1)
lola: LP says that atomic proposition is always true: (p22 <= 1)
lola: LP says that atomic proposition is always true: (p10 <= 1)
lola: LP says that atomic proposition is always true: (p23 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p22 <= 1)
lola: LP says that atomic proposition is always true: (p11 <= 1)
lola: LP says that atomic proposition is always true: (p23 <= 1)
lola: LP says that atomic proposition is always true: (p8 <= 1)
lola: LP says that atomic proposition is always true: (p22 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p22 <= 1)
lola: LP says that atomic proposition is always true: (p11 <= 1)
lola: LP says that atomic proposition is always true: (p23 <= 1)
lola: LP says that atomic proposition is always true: (p24 <= 1)
lola: LP says that atomic proposition is always true: (p25 <= 1)
lola: LP says that atomic proposition is always true: (p7 <= 1)
lola: LP says that atomic proposition is always true: (p36 <= 1)
lola: LP says that atomic proposition is always true: (p5 <= 1)
lola: LP says that atomic proposition is always true: (p36 <= 1)
lola: LP says that atomic proposition is always true: (p6 <= 1)
lola: LP says that atomic proposition is always true: (p37 <= 1)
lola: LP says that atomic proposition is always true: (p5 <= 1)
lola: LP says that atomic proposition is always true: (p37 <= 1)
lola: LP says that atomic proposition is always true: (p3 <= 1)
lola: LP says that atomic proposition is always true: (p13 <= 1)
lola: LP says that atomic proposition is always true: (p3 <= 1)
lola: LP says that atomic proposition is always true: (p12 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p12 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p13 <= 1)
lola: LP says that atomic proposition is always true: (p2 <= 1)
lola: LP says that atomic proposition is always true: (p13 <= 1)
lola: LP says that atomic proposition is always true: (p2 <= 1)
lola: LP says that atomic proposition is always true: (p12 <= 1)
lola: LP says that atomic proposition is always true: (p7 <= 1)
lola: LP says that atomic proposition is always true: (p36 <= 1)
lola: LP says that atomic proposition is always true: (p5 <= 1)
lola: LP says that atomic proposition is always true: (p36 <= 1)
lola: LP says that atomic proposition is always true: (p6 <= 1)
lola: LP says that atomic proposition is always true: (p37 <= 1)
lola: LP says that atomic proposition is always true: (p5 <= 1)
lola: LP says that atomic proposition is always true: (p37 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p32 <= 1)
lola: LP says that atomic proposition is always true: (p33 <= 1)
lola: LP says that atomic proposition is always true: (p31 <= 1)
lola: LP says that atomic proposition is always true: (p34 <= 1)
lola: LP says that atomic proposition is always true: (p35 <= 1)
lola: LP says that atomic proposition is always true: (p5 <= 1)
lola: LP says that atomic proposition is always true: (p16 <= 1)
lola: LP says that atomic proposition is always true: (p5 <= 1)
lola: LP says that atomic proposition is always true: (p17 <= 1)
lola: LP says that atomic proposition is always true: (p5 <= 1)
lola: LP says that atomic proposition is always true: (p16 <= 1)
lola: LP says that atomic proposition is always true: (p5 <= 1)
lola: LP says that atomic proposition is always true: (p17 <= 1)
lola: LP says that atomic proposition is always true: (p5 <= 1)
lola: LP says that atomic proposition is always true: (p38 <= 1)
lola: LP says that atomic proposition is always true: (p5 <= 1)
lola: LP says that atomic proposition is always true: (p39 <= 1)
lola: LP says that atomic proposition is always true: (p10 <= 1)
lola: LP says that atomic proposition is always true: (p23 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p22 <= 1)
lola: LP says that atomic proposition is always true: (p11 <= 1)
lola: LP says that atomic proposition is always true: (p23 <= 1)
lola: LP says that atomic proposition is always true: (p8 <= 1)
lola: LP says that atomic proposition is always true: (p22 <= 1)
lola: LP says that atomic proposition is always true: (p10 <= 1)
lola: LP says that atomic proposition is always true: (p23 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p22 <= 1)
lola: LP says that atomic proposition is always true: (p11 <= 1)
lola: LP says that atomic proposition is always true: (p23 <= 1)
lola: LP says that atomic proposition is always true: (p8 <= 1)
lola: LP says that atomic proposition is always true: (p22 <= 1)
lola: LP says that atomic proposition is always true: (p24 <= 1)
lola: LP says that atomic proposition is always true: (p25 <= 1)
lola: LP says that atomic proposition is always true: (p6 <= 1)
lola: LP says that atomic proposition is always true: (p16 <= 1)
lola: LP says that atomic proposition is always true: (p6 <= 1)
lola: LP says that atomic proposition is always true: (p17 <= 1)
lola: LP says that atomic proposition is always true: (p7 <= 1)
lola: LP says that atomic proposition is always true: (p16 <= 1)
lola: LP says that atomic proposition is always true: (p7 <= 1)
lola: LP says that atomic proposition is always true: (p17 <= 1)
lola: LP says that atomic proposition is always true: (p8 <= 1)
lola: LP says that atomic proposition is always true: (p28 <= 1)
lola: LP says that atomic proposition is always true: (p31 <= 1)
lola: LP says that atomic proposition is always true: (p10 <= 1)
lola: LP says that atomic proposition is always true: (p29 <= 1)
lola: LP says that atomic proposition is always true: (p31 <= 1)
lola: LP says that atomic proposition is always true: (p10 <= 1)
lola: LP says that atomic proposition is always true: (p27 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p8 <= 1)
lola: LP says that atomic proposition is always true: (p26 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p6 <= 1)
lola: LP says that atomic proposition is always true: (p16 <= 1)
lola: LP says that atomic proposition is always true: (p6 <= 1)
lola: LP says that atomic proposition is always true: (p17 <= 1)
lola: LP says that atomic proposition is always true: (p7 <= 1)
lola: LP says that atomic proposition is always true: (p16 <= 1)
lola: LP says that atomic proposition is always true: (p7 <= 1)
lola: LP says that atomic proposition is always true: (p17 <= 1)
lola: LP says that atomic proposition is always true: (p6 <= 1)
lola: LP says that atomic proposition is always true: (p16 <= 1)
lola: LP says that atomic proposition is always true: (p6 <= 1)
lola: LP says that atomic proposition is always true: (p17 <= 1)
lola: LP says that atomic proposition is always true: (p7 <= 1)
lola: LP says that atomic proposition is always true: (p16 <= 1)
lola: LP says that atomic proposition is always true: (p7 <= 1)
lola: LP says that atomic proposition is always true: (p17 <= 1)
lola: LP says that atomic proposition is always true: (p6 <= 1)
lola: LP says that atomic proposition is always true: (p16 <= 1)
lola: LP says that atomic proposition is always true: (p6 <= 1)
lola: LP says that atomic proposition is always true: (p17 <= 1)
lola: LP says that atomic proposition is always true: (p7 <= 1)
lola: LP says that atomic proposition is always true: (p16 <= 1)
lola: LP says that atomic proposition is always true: (p7 <= 1)
lola: LP says that atomic proposition is always true: (p17 <= 1)
lola: LP says that atomic proposition is always true: (p24 <= 1)
lola: LP says that atomic proposition is always true: (p3 <= 1)
lola: LP says that atomic proposition is always true: (p20 <= 1)
lola: X (G (((((1 <= p6) AND (1 <= p17)) OR ((1 <= p7) AND (1 <= p16))) OR (F ((((1 <= p24)) OR ((1 <= p25)))) AND (NOT(G ((((p6 <= 0) OR (p16 <= 0)) AND ((p6 <= 0) OR (p17 <= 0)) AND ((p7 <= 0) OR (p16 <= 0)) AND ((p7 <= 0) OR (p17 <= 0))))) OR (((p2 <= 0) OR (p21 <= 0)) AND ((p4 <= 0) OR (p20 <= 0)) AND ((p2 <= 0) OR (p20 <= 0)) AND ((p3 <= 0) OR (p21 <= 0)))))))) : NOT(G ((((X ((NOT(F ((((1 <= p5) AND (1 <= p16)) OR ((1 <= p5) AND (1 <= p17))))) U (((1 <= p10) AND (1 <= p23)) OR ((1 <= p9) AND (1 <= p22)) OR ((1 <= p11) AND (1 <= p23)) OR ((1 <= p8) AND (1 <= p22))))) OR X (NOT(X ((((1 <= p10) AND (1 <= p23)) OR ((1 <= p9) AND (1 <= p22)) OR ((1 <= p11) AND (1 <= p23)) OR ((1 <= p8) AND (1 <= p22))))))) OR ((1 <= p9) AND (1 <= p22))) OR ((1 <= p11) AND (1 <= p23))))) : (F ((((1 <= p24)) OR ((1 <= p25)))) U (((1 <= p7) AND (1 <= p36)) OR ((1 <= p5) AND (1 <= p36)) OR ((1 <= p6) AND (1 <= p37)) OR ((1 <= p5) AND (1 <= p37)))) : X (F (G ((F (X (X (X (X (G (F ((((1 <= p3) AND (1 <= p13)) OR ((1 <= p3) AND (1 <= p12)) OR ((1 <= p4) AND (1 <= p12)) OR ((1 <= p4) AND (1 <= p13)) OR ((1 <= p2) AND (1 <= p13)) OR ((1 <= p2) AND (1 <= p12)))))))))) AND (((1 <= p7) AND (1 <= p36)) OR ((1 <= p5) AND (1 <= p36)) OR ((1 <= p6) AND (1 <= p37)) OR ((1 <= p5) AND (1 <= p37))))))) : G (F (NOT(((((F ((((p30 <= 0) OR (p32 <= 0) OR (p33 <= 0)) AND ((p31 <= 0) OR (p34 <= 0) OR (p35 <= 0)))) OR ((1 <= p5) AND (1 <= p16))) OR ((1 <= p5) AND (1 <= p17))) AND F ((((1 <= p5) AND (1 <= p16)) OR ((1 <= p5) AND (1 <= p17))))) U (((1 <= p5) AND (1 <= p38)) OR ((1 <= p5) AND (1 <= p39))))))) : X (((X ((G ((((1 <= p10) AND (1 <= p23)) OR ((1 <= p9) AND (1 <= p22)) OR ((1 <= p11) AND (1 <= p23)) OR ((1 <= p8) AND (1 <= p22)))) U (((1 <= p10) AND (1 <= p23)) OR ((1 <= p9) AND (1 <= p22)) OR ((1 <= p11) AND (1 <= p23)) OR ((1 <= p8) AND (1 <= p22))))) OR G ((((1 <= p24)) OR ((1 <= p25))))) OR F ((((1 <= p6) AND (1 <= p16)) OR ((1 <= p6) AND (1 <= p17)) OR ((1 <= p7) AND (1 <= p16)) OR ((1 <= p7) AND (1 <= p17)))))) : X (NOT(G (((G ((((1 <= p8) AND (1 <= p28) AND (1 <= p31)) OR ((1 <= p10) AND (1 <= p29) AND (1 <= p31)) OR ((1 <= p10) AND (1 <= p27) AND (1 <= p30)) OR ((1 <= p8) AND (1 <= p26) AND (1 <= p30)))) OR X (((((1 <= p6) AND (1 <= p16)) OR ((1 <= p6) AND (1 <= p17)) OR ((1 <= p7) AND (1 <= p16)) OR ((1 <= p7) AND (1 <= p17))) U G ((((p6 <= 0) OR (p16 <= 0)) AND ((p6 <= 0) OR (p17 <= 0)) AND ((p7 <= 0) OR (p16 <= 0)) AND ((p7 <= 0) OR (p17 <= 0))))))) OR G ((((1 <= p6) AND (1 <= p16)) OR ((1 <= p6) AND (1 <= p17)) OR ((1 <= p7) AND (1 <= p16)) OR ((1 <= p7) AND (1 <= p17)))))))) : X (X (G (F (((1 <= p24)))))) : F (X (G (((1 <= p3) AND (1 <= p20)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:528
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
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 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G (((((1 <= p6) AND (1 <= p17)) OR ((1 <= p7) AND (1 <= p16))) OR (F ((((1 <= p24)) OR ((1 <= p25)))) AND (F ((((1 <= p6) AND (1 <= p16)) OR ((1 <= p6) AND (1 <= p17)) OR ((1 <= p7) AND (1 <= p16)) OR ((1 <= p7) AND (1 <= p17)))) OR (((p2 <= 0) OR (p21 <= 0)) AND ((p4 <= 0) OR (p20 <= 0)) AND ((p2 <= 0) OR (p20 <= 0)) AND ((p3 <= 0) OR (p21 <= 0))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G (((((1 <= p6) AND (1 <= p17)) OR ((1 <= p7) AND (1 <= p16))) OR (F ((((1 <= p24)) OR ((1 <= p25)))) AND (F ((((1 <= p6) AND (1 <= p16)) OR ((1 <= p6) AND (1 <= p17)) OR ((1 <= p7) AND (1 <= p16)) OR ((1 <= p7) AND (1 <= p17)))) OR (((p2 <= 0) OR (p21 <= 0)) AND ((p4 <= 0) OR (p20 <= 0)) AND ((p2 <= 0) OR (p20 <= 0)) AND ((p3 <= 0) OR (p21 <= 0))))))))
lola: processed formula length: 367
lola: 63 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: 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: 9 markings, 9 edges
lola: ========================================
lola: subprocess 1 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((X (((((p10 <= 0) OR (p23 <= 0)) AND ((p9 <= 0) OR (p22 <= 0)) AND ((p11 <= 0) OR (p23 <= 0)) AND ((p8 <= 0) OR (p22 <= 0))) AND ((F ((((1 <= p5) AND (1 <= p16)) OR ((1 <= p5) AND (1 <= p17)))) OR G ((((p10 <= 0) OR (p23 <= 0)) AND ((p9 <= 0) OR (p22 <= 0)) AND ((p11 <= 0) OR (p23 <= 0)) AND ((p8 <= 0) OR (p22 <= 0))))) AND X ((((1 <= p10) AND (1 <= p23)) OR ((1 <= p9) AND (1 <= p22))... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((X (((((p10 <= 0) OR (p23 <= 0)) AND ((p9 <= 0) OR (p22 <= 0)) AND ((p11 <= 0) OR (p23 <= 0)) AND ((p8 <= 0) OR (p22 <= 0))) AND ((F ((((1 <= p5) AND (1 <= p16)) OR ((1 <= p5) AND (1 <= p17)))) OR G ((((p10 <= 0) OR (p23 <= 0)) AND ((p9 <= 0) OR (p22 <= 0)) AND ((p11 <= 0) OR (p23 <= 0)) AND ((p8 <= 0) OR (p22 <= 0))))) AND X ((((1 <= p10) AND (1 <= p23)) OR ((1 <= p9) AND (1 <= p22))... (shortened)
lola: processed formula length: 535
lola: 63 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 15 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: 187 markings, 388 edges
lola: ========================================
lola: subprocess 2 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X (((((1 <= p10) AND (1 <= p23)) OR ((1 <= p9) AND (1 <= p22)) OR ((1 <= p11) AND (1 <= p23)) OR ((1 <= p8) AND (1 <= p22))) OR (G ((((1 <= p10) AND (1 <= p23)) OR ((1 <= p9) AND (1 <= p22)) OR ((1 <= p11) AND (1 <= p23)) OR ((1 <= p8) AND (1 <= p22)))) AND F ((((1 <= p10) AND (1 <= p23)) OR ((1 <= p9) AND (1 <= p22)) OR ((1 <= p11) AND (1 <= p23)) OR ((1 <= p8) AND (1 <= p22))))))) O... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X (((((1 <= p10) AND (1 <= p23)) OR ((1 <= p9) AND (1 <= p22)) OR ((1 <= p11) AND (1 <= p23)) OR ((1 <= p8) AND (1 <= p22))) OR (G ((((1 <= p10) AND (1 <= p23)) OR ((1 <= p9) AND (1 <= p22)) OR ((1 <= p11) AND (1 <= p23)) OR ((1 <= p8) AND (1 <= p22)))) AND F ((((1 <= p10) AND (1 <= p23)) OR ((1 <= p9) AND (1 <= p22)) OR ((1 <= p11) AND (1 <= p23)) OR ((1 <= p8) AND (1 <= p22))))))) O... (shortened)
lola: processed formula length: 570
lola: 63 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 12 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: 10 markings, 10 edges
lola: ========================================
lola: subprocess 3 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((F ((((p8 <= 0) OR (p28 <= 0) OR (p31 <= 0)) AND ((p10 <= 0) OR (p29 <= 0) OR (p31 <= 0)) AND ((p10 <= 0) OR (p27 <= 0) OR (p30 <= 0)) AND ((p8 <= 0) OR (p26 <= 0) OR (p30 <= 0)))) AND (X (((((p6 <= 0) OR (p16 <= 0)) AND ((p6 <= 0) OR (p17 <= 0)) AND ((p7 <= 0) OR (p16 <= 0)) AND ((p7 <= 0) OR (p17 <= 0))) R F ((((1 <= p6) AND (1 <= p16)) OR ((1 <= p6) AND (1 <= p17)) OR ((1 <=... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((F ((((p8 <= 0) OR (p28 <= 0) OR (p31 <= 0)) AND ((p10 <= 0) OR (p29 <= 0) OR (p31 <= 0)) AND ((p10 <= 0) OR (p27 <= 0) OR (p30 <= 0)) AND ((p8 <= 0) OR (p26 <= 0) OR (p30 <= 0)))) AND (X (((((p6 <= 0) OR (p16 <= 0)) AND ((p6 <= 0) OR (p17 <= 0)) AND ((p7 <= 0) OR (p16 <= 0)) AND ((p7 <= 0) OR (p17 <= 0))) R F ((((1 <= p6) AND (1 <= p16)) OR ((1 <= p6) AND (1 <= p17)) OR ((1 <=... (shortened)
lola: processed formula length: 589
lola: 63 rewrites
lola: closed formula file LTLFireability.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: 10 markings, 10 edges
lola: ========================================
lola: subprocess 4 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F (((1 <= p24))))
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 <= p24))))
lola: processed formula length: 20
lola: 63 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: 10 markings, 10 edges
lola: ========================================
lola: subprocess 5 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((1 <= p3) AND (1 <= p20))))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G (((1 <= p3) AND (1 <= p20))))
lola: processed formula length: 34
lola: 63 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: 17 markings, 18 edges
lola: ========================================
lola: subprocess 6 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F ((((1 <= p24)) OR ((1 <= p25)))) U (((1 <= p7) AND (1 <= p36)) OR ((1 <= p5) AND (1 <= p36)) OR ((1 <= p6) AND (1 <= p37)) OR ((1 <= p5) AND (1 <= p37))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (F ((((1 <= p24)) OR ((1 <= p25)))) U (((1 <= p7) AND (1 <= p36)) OR ((1 <= p5) AND (1 <= p36)) OR ((1 <= p6) AND (1 <= p37)) OR ((1 <= p5) AND (1 <= p37))))
lola: processed formula length: 161
lola: 63 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: 10 markings, 10 edges
lola: ========================================
lola: subprocess 7 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((G (F ((((1 <= p3) AND (1 <= p13)) OR ((1 <= p3) AND (1 <= p12)) OR ((1 <= p4) AND (1 <= p12)) OR ((1 <= p4) AND (1 <= p13)) OR ((1 <= p2) AND (1 <= p13)) OR ((1 <= p2) AND (1 <= p12))))) AND (((1 <= p7) AND (1 <= p36)) OR ((1 <= p5) AND (1 <= p36)) OR ((1 <= p6) AND (1 <= p37)) OR ((1 <= p5) AND (1 <= p37))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((G (F ((((1 <= p3) AND (1 <= p13)) OR ((1 <= p3) AND (1 <= p12)) OR ((1 <= p4) AND (1 <= p12)) OR ((1 <= p4) AND (1 <= p13)) OR ((1 <= p2) AND (1 <= p13)) OR ((1 <= p2) AND (1 <= p12))))) AND (((1 <= p7) AND (1 <= p36)) OR ((1 <= p5) AND (1 <= p36)) OR ((1 <= p6) AND (1 <= p37)) OR ((1 <= p5) AND (1 <= p37))))))
lola: processed formula length: 327
lola: 63 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: 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: 10 markings, 11 edges
lola: ========================================
lola: subprocess 8 will run for 3567 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((((G ((((1 <= p30) AND (1 <= p32) AND (1 <= p33)) OR ((1 <= p31) AND (1 <= p34) AND (1 <= p35)))) AND (((p5 <= 0) OR (p16 <= 0)) AND ((p5 <= 0) OR (p17 <= 0)))) OR G ((((p5 <= 0) OR (p16 <= 0)) AND ((p5 <= 0) OR (p17 <= 0))))) R (((p5 <= 0) OR (p38 <= 0)) AND ((p5 <= 0) OR (p39 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((((G ((((1 <= p30) AND (1 <= p32) AND (1 <= p33)) OR ((1 <= p31) AND (1 <= p34) AND (1 <= p35)))) AND (((p5 <= 0) OR (p16 <= 0)) AND ((p5 <= 0) OR (p17 <= 0)))) OR G ((((p5 <= 0) OR (p16 <= 0)) AND ((p5 <= 0) OR (p17 <= 0))))) R (((p5 <= 0) OR (p38 <= 0)) AND ((p5 <= 0) OR (p39 <= 0))))))
lola: processed formula length: 302
lola: 63 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 15 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: 49 markings, 53 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no no no no no no
lola:
preliminary result: no no no no no no no no no
lola: memory consumption: 71504 KB
lola: time consumption: 3 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="LamportFastMutEx-PT-2"
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 LamportFastMutEx-PT-2, 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 r132-tall-162075428500322"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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