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-162075428500297.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-COL-3, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r132-tall-162075428500297
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 412K
-rw-r--r-- 1 mcc users 16K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 118K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 82K 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 4.0K Apr 26 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 26 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 26 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 26 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 27 06:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 27 06:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Mar 25 07:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 25 07:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_pt
-rw-r--r-- 1 mcc users 2 May 5 16:51 instance
-rw-r--r-- 1 mcc users 5 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 39K 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-COL-3-00
FORMULA_NAME LamportFastMutEx-COL-3-01
FORMULA_NAME LamportFastMutEx-COL-3-02
FORMULA_NAME LamportFastMutEx-COL-3-03
FORMULA_NAME LamportFastMutEx-COL-3-04
FORMULA_NAME LamportFastMutEx-COL-3-05
FORMULA_NAME LamportFastMutEx-COL-3-06
FORMULA_NAME LamportFastMutEx-COL-3-07
FORMULA_NAME LamportFastMutEx-COL-3-08
FORMULA_NAME LamportFastMutEx-COL-3-09
FORMULA_NAME LamportFastMutEx-COL-3-10
FORMULA_NAME LamportFastMutEx-COL-3-11
FORMULA_NAME LamportFastMutEx-COL-3-12
FORMULA_NAME LamportFastMutEx-COL-3-13
FORMULA_NAME LamportFastMutEx-COL-3-14
FORMULA_NAME LamportFastMutEx-COL-3-15

=== Now, execution of the tool begins

BK_START 1620928884043

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-13 18:01:26] [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-13 18:01:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 18:01:26] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
SLF4J: Failed to load class "org.slf4j.impl.StaticLoggerBinder".
SLF4J: Defaulting to no-operation (NOP) logger implementation
SLF4J: See http://www.slf4j.org/codes.html#StaticLoggerBinder for further details.
[2021-05-13 18:01:26] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 585 ms
[2021-05-13 18:01:26] [INFO ] sort/places :
pid * pid->P-wait,P-done,
pid * bool->P-b,
pid->P-start_1,x,y,P-setx_3,P-setbi_5,P-ify0_4,P-sety_9,P-ifxi_10,P-setbi_11,P-fordo_12,P-await_13,P-ifyi_15,P-awaity,P-CS_21,P-setbi_24,

[2021-05-13 18:01:26] [INFO ] Imported 18 HL places and 17 HL transitions for a total of 100 PT places and 192.0 transition bindings in 45 ms.
[2021-05-13 18:01:26] [INFO ] Computed order based on color domains.
[2021-05-13 18:01:26] [INFO ] Unfolded HLPN to a Petri net with 100 places and 156 transitions in 24 ms.
[2021-05-13 18:01:26] [INFO ] Unfolded HLPN properties in 0 ms.
Deduced a syphon composed of 29 places in 2 ms
Reduce places removed 29 places and 42 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 48 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 358 ms. (steps per millisecond=279 ) properties seen :[1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0]
[2021-05-13 18:01:27] [INFO ] Flow matrix only has 96 transitions (discarded 18 similar events)
// Phase 1: matrix 96 rows 71 cols
[2021-05-13 18:01:27] [INFO ] Computed 17 place invariants in 5 ms
[2021-05-13 18:01:27] [INFO ] [Real]Absence check using 17 positive place invariants in 14 ms returned sat
[2021-05-13 18:01:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 18:01:27] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
[2021-05-13 18:01:27] [INFO ] State equation strengthened by 33 read => feed constraints.
[2021-05-13 18:01:27] [INFO ] [Real]Added 33 Read/Feed constraints in 12 ms returned sat
[2021-05-13 18:01:27] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 18:01:27] [INFO ] [Nat]Absence check using 17 positive place invariants in 19 ms returned sat
[2021-05-13 18:01:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 18:01:27] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2021-05-13 18:01:27] [INFO ] [Nat]Added 33 Read/Feed constraints in 16 ms returned sat
[2021-05-13 18:01:27] [INFO ] Deduced a trap composed of 11 places in 51 ms
[2021-05-13 18:01:27] [INFO ] Deduced a trap composed of 9 places in 49 ms
[2021-05-13 18:01:27] [INFO ] Deduced a trap composed of 16 places in 54 ms
[2021-05-13 18:01:27] [INFO ] Deduced a trap composed of 9 places in 25 ms
[2021-05-13 18:01:27] [INFO ] Deduced a trap composed of 9 places in 23 ms
[2021-05-13 18:01:27] [INFO ] Deduced a trap composed of 9 places in 28 ms
[2021-05-13 18:01:27] [INFO ] Deduced a trap composed of 9 places in 60 ms
[2021-05-13 18:01:27] [INFO ] Deduced a trap composed of 18 places in 17 ms
[2021-05-13 18:01:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 8 trap constraints in 386 ms
[2021-05-13 18:01:27] [INFO ] [Real]Absence check using 17 positive place invariants in 3 ms returned unsat
[2021-05-13 18:01:27] [INFO ] [Real]Absence check using 17 positive place invariants in 5 ms returned sat
[2021-05-13 18:01:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 18:01:28] [INFO ] [Real]Absence check using state equation in 86 ms returned sat
[2021-05-13 18:01:28] [INFO ] [Real]Added 33 Read/Feed constraints in 10 ms returned sat
[2021-05-13 18:01:28] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 18:01:28] [INFO ] [Nat]Absence check using 17 positive place invariants in 9 ms returned sat
[2021-05-13 18:01:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 18:01:28] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2021-05-13 18:01:28] [INFO ] [Nat]Added 33 Read/Feed constraints in 4 ms returned sat
[2021-05-13 18:01:28] [INFO ] Deduced a trap composed of 17 places in 52 ms
[2021-05-13 18:01:28] [INFO ] Deduced a trap composed of 9 places in 25 ms
[2021-05-13 18:01:28] [INFO ] Deduced a trap composed of 9 places in 45 ms
[2021-05-13 18:01:28] [INFO ] Deduced a trap composed of 11 places in 32 ms
[2021-05-13 18:01:28] [INFO ] Deduced a trap composed of 15 places in 22 ms
[2021-05-13 18:01:28] [INFO ] Deduced a trap composed of 9 places in 24 ms
[2021-05-13 18:01:28] [INFO ] Deduced a trap composed of 17 places in 23 ms
[2021-05-13 18:01:28] [INFO ] Deduced a trap composed of 14 places in 28 ms
[2021-05-13 18:01:28] [INFO ] Deduced a trap composed of 12 places in 23 ms
[2021-05-13 18:01:28] [INFO ] Deduced a trap composed of 12 places in 20 ms
[2021-05-13 18:01:28] [INFO ] Deduced a trap composed of 5 places in 25 ms
[2021-05-13 18:01:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 11 trap constraints in 374 ms
[2021-05-13 18:01:28] [INFO ] [Real]Absence check using 17 positive place invariants in 3 ms returned unsat
[2021-05-13 18:01:28] [INFO ] [Real]Absence check using 17 positive place invariants in 9 ms returned sat
[2021-05-13 18:01:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 18:01:28] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2021-05-13 18:01:28] [INFO ] [Real]Added 33 Read/Feed constraints in 4 ms returned sat
[2021-05-13 18:01:28] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 18:01:28] [INFO ] [Nat]Absence check using 17 positive place invariants in 6 ms returned sat
[2021-05-13 18:01:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 18:01:28] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2021-05-13 18:01:28] [INFO ] [Nat]Added 33 Read/Feed constraints in 3 ms returned sat
[2021-05-13 18:01:28] [INFO ] Deduced a trap composed of 15 places in 21 ms
[2021-05-13 18:01:28] [INFO ] Deduced a trap composed of 11 places in 20 ms
[2021-05-13 18:01:28] [INFO ] Deduced a trap composed of 15 places in 17 ms
[2021-05-13 18:01:28] [INFO ] Deduced a trap composed of 15 places in 27 ms
[2021-05-13 18:01:28] [INFO ] Deduced a trap composed of 17 places in 19 ms
[2021-05-13 18:01:28] [INFO ] Deduced a trap composed of 14 places in 12 ms
[2021-05-13 18:01:28] [INFO ] Deduced a trap composed of 12 places in 14 ms
[2021-05-13 18:01:28] [INFO ] Deduced a trap composed of 12 places in 12 ms
[2021-05-13 18:01:28] [INFO ] Deduced a trap composed of 5 places in 11 ms
[2021-05-13 18:01:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 9 trap constraints in 192 ms
Successfully simplified 5 atomic propositions for a total of 7 simplifications.
[2021-05-13 18:01:28] [INFO ] Initial state reduction rules for CTL removed 6 formulas.
[2021-05-13 18:01:28] [INFO ] Flatten gal took : 66 ms
FORMULA LamportFastMutEx-COL-3-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-COL-3-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-COL-3-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-COL-3-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-COL-3-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-COL-3-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-13 18:01:28] [INFO ] Applying decomposition
[2021-05-13 18:01:28] [INFO ] Flatten gal took : 35 ms
[2021-05-13 18:01:29] [INFO ] Decomposing Gal with order
[2021-05-13 18:01:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-13 18:01:29] [INFO ] Removed a total of 127 redundant transitions.
[2021-05-13 18:01:29] [INFO ] Flatten gal took : 51 ms
[2021-05-13 18:01:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 15 labels/synchronizations in 4 ms.
[2021-05-13 18:01:29] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2021-05-13 18:01:29] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 2 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ LamportFastMutEx-COL-3 @ 3570 seconds

FORMULA LamportFastMutEx-COL-3-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA LamportFastMutEx-COL-3-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA LamportFastMutEx-COL-3-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA LamportFastMutEx-COL-3-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA LamportFastMutEx-COL-3-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA LamportFastMutEx-COL-3-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA LamportFastMutEx-COL-3-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA LamportFastMutEx-COL-3-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA LamportFastMutEx-COL-3-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA LamportFastMutEx-COL-3-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3567
rslt: Output for LTLCardinality @ LamportFastMutEx-COL-3

{
"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": "Thu May 13 18:01:29 2021
",
"timelimit": 3570
},
"child":
[

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "(p67 + p66 + p65 + 1 <= p68 + p69 + p70)",
"processed_size": 40,
"rewrites": 47
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 24
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 18,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 12,
"visible_transitions": 0
},
"processed": "F (G ((G (((p17 + p18 + p19 <= p61 + p60 + p59) AND (p47 + p48 + p49 <= p29 + p30 + p31))) OR X ((p47 + p48 + p49 <= p29 + p30 + p31)))))",
"processed_size": 137,
"rewrites": 45
},
"result":
{
"edges": 2062,
"markings": 1120,
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 0,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 2,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 12,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 9,
"visible_transitions": 0
},
"processed": "X (F ((X ((((2 <= p61 + p60 + p59) OR (2 <= p32 + p33 + p34)))) OR (p32 + p33 + p34 <= p68 + p69 + p70))))",
"processed_size": 107,
"rewrites": 45
},
"result":
{
"edges": 3,
"markings": 4,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"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": "G ((X (F ((p54 + p55 + p56 + p57 + p58 + p53 + p52 + p51 + p50 <= p23 + p24 + p25))) AND (F ((p54 + p55 + p56 + p57 + p58 + p53 + p52 + p51 + p50 <= p23 + p24 + p25)) AND (p54 + p55 + p56 + p57 + p58 + p53 + p52 + p51 + p50 <= p23 + p24 + p25))))",
"processed_size": 246,
"rewrites": 45
},
"result":
{
"edges": 1209,
"markings": 675,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"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": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 1,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 12,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "(((p0 + p1 + p2 <= 1) OR (G ((2 <= p26 + p27 + p28)) AND F ((p0 + p1 + p2 <= 1)))) U X ((2 <= p26 + p27 + p28)))",
"processed_size": 112,
"rewrites": 45
},
"result":
{
"edges": 9,
"markings": 9,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 8
},
"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": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 3,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 1,
"aneg": 1,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 24,
"taut": 0,
"tconj": 0,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 12,
"visible_transitions": 0
},
"processed": "G (F ((G ((p64 + p63 + p62 <= 0)) OR (X (G (((p17 + p18 + p19 <= p64 + p63 + p62) OR (1 <= p64 + p63 + p62) OR (p23 + p24 + p25 <= p68 + p69 + p70)))) OR (p23 + p24 + p25 <= p68 + p69 + p70)))))",
"processed_size": 196,
"rewrites": 45
},
"result":
{
"edges": 93105,
"markings": 35834,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 5
},
"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": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "G (F ((p26 + p27 + p28 <= 1)))",
"processed_size": 30,
"rewrites": 45
},
"result":
{
"edges": 2919,
"markings": 1539,
"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": "fairness",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 9,
"visible_transitions": 0
},
"processed": "G ((p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 <= 2))",
"processed_size": 62,
"rewrites": 45
},
"result":
{
"edges": 352,
"markings": 214,
"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": 1189
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 3,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 18,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 12,
"visible_transitions": 0
},
"processed": "G (F ((G ((p61 + p60 + p59 + 1 <= p26 + p27 + p28)) OR (((p68 + p69 + p70 + 1 <= p23 + p24 + p25)) AND (p61 + p60 + p59 + 1 <= p26 + p27 + p28)))))",
"processed_size": 147,
"rewrites": 45
},
"result":
{
"edges": 16,
"markings": 16,
"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": 1783
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1783
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "(2 <= p29 + p30 + p31)",
"processed_size": 22,
"rewrites": 45
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 8,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3567
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "(p29 + p30 + p31 <= 1)",
"processed_size": 22,
"rewrites": 47
},
"result":
{
"edges": 11,
"markings": 11,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 24
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 8,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3567
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "G (F ((p35 + p36 + p37 + 1 <= p61 + p60 + p59)))",
"processed_size": 48,
"rewrites": 45
},
"result":
{
"edges": 11,
"markings": 11,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "fairness",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 9,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "G (F ((p35 + p36 + p37 + 1 <= p61 + p60 + p59)))",
"processed_size": 48,
"rewrites": 45
},
"result":
{
"edges": 11,
"markings": 11,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "fairness",
"workflow": "product automaton"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 15,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 15,
"visible_transitions": 0
},
"processed": "G ((((p29 + p30 + p31 <= 2) AND (p26 + p27 + p28 <= p20 + p21 + p22)) AND F ((p35 + p36 + p37 + 1 <= p61 + p60 + p59))))",
"processed_size": 120,
"rewrites": 45
},
"result":
{
"edges": 11,
"markings": 11,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 10,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 21976,
"runtime": 3.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(F(**) AND F(G((G(**) OR X(**))))) : X(F((X(**) OR **))) : G(*) : G(F((G(*) OR (* AND *)))) : G((X(F(**)) AND (F(**) AND **))) : (G(F(*)) OR G((** AND F(*)))) : ((** OR (G(**) AND F(**))) U X(**)) : (** OR (G(**) AND F(**))) : G(F(**)) : G(F((G(*) OR (X(G(**)) OR **))))"
},
"net":
{
"arcs": 480,
"conflict_clusters": 6,
"places": 71,
"places_significant": 54,
"singleton_clusters": 0,
"transitions": 114
},
"result":
{
"preliminary_value": "no yes no no no no no no no yes ",
"value": "no yes no no no no no no no yes "
},
"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: 185/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 71
lola: finding significant places
lola: 71 places, 114 transitions, 54 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: (((0 <= 0) U (p68 + p69 + p70 <= p67 + p66 + p65)) AND F (G ((G (((p17 + p18 + p19 <= p61 + p60 + p59) AND (p47 + p48 + p49 <= p29 + p30 + p31))) OR X ((p47 + p48 + p49 <= p29 + p30 + p31)))))) : F (X ((X ((((2 <= p61 + p60 + p59) OR (2 <= p32 + p33 + p34)))) OR (p32 + p33 + p34 <= p68 + p69 + p70)))) : NOT(F ((3 <= p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46))) : NOT(X (F (X (F (G ((((p23 + p24 + p25 <= p68 + p69 + p70)) U (p26 + p27 + p28 <= p61 + p60 + p59)))))))) : G (((X (F (((0 <= 0) U (p54 + p55 + p56 + p57 + p58 + p53 + p52 + p51 + p50 <= p23 + p24 + p25)))) AND F ((p54 + p55 + p56 + p57 + p58 + p53 + p52 + p51 + p50 <= p23 + p24 + p25))) AND (p54 + p55 + p56 + p57 + p58 + p53 + p52 + p51 + p50 <= p23 + p24 + p25))) : (G (((p29 + p30 + p31 <= 2) AND (p26 + p27 + p28 <= p20 + p21 + p22))) U NOT(G (F (X (G ((p61 + p60 + p59 <= p35 + p36 + p37))))))) : ((G ((2 <= p26 + p27 + p28)) U (p0 + p1 + p2 <= 1)) U X ((2 <= p26 + p27 + p28))) : ((2 <= p29 + p30 + p31) OR (G ((p68 + p69 + p70 <= p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46)) AND F ((2 <= p29 + p30 + p31)))) : G (X (NOT(F (NOT(G (F ((p26 + p27 + p28 <= 1)))))))) : G (F (((NOT(F ((1 <= p64 + p63 + p62))) OR G (X (((p17 + p18 + p19 <= p64 + p63 + p62) OR (1 <= p64 + p63 + p62) OR (p23 + p24 + p25 <= p68 + p69 + p70))))) OR (p23 + p24 + p25 <= p68 + p69 + p70))))
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F ((p68 + p69 + p70 <= p67 + p66 + p65)) AND F (G ((G (((p17 + p18 + p19 <= p61 + p60 + p59) AND (p47 + p48 + p49 <= p29 + p30 + p31))) OR X ((p47 + p48 + p49 <= p29 + p30 + p31))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((p68 + p69 + p70 <= p67 + p66 + p65))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (p67 + p66 + p65 + 1 <= p68 + p69 + p70)
lola: processed formula length: 40
lola: 47 rewrites
lola: closed formula file LTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((G (((p17 + p18 + p19 <= p61 + p60 + p59) AND (p47 + p48 + p49 <= p29 + p30 + p31))) OR X ((p47 + p48 + p49 <= p29 + p30 + p31)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((G (((p17 + p18 + p19 <= p61 + p60 + p59) AND (p47 + p48 + p49 <= p29 + p30 + p31))) OR X ((p47 + p48 + p49 <= p29 + p30 + p31)))))
lola: processed formula length: 137
lola: 45 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: add low 90
lola: add low 99
lola: add low 35
lola: add low 2
lola: add low 108
lola: add low 34
lola: add low 17
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: 1120 markings, 2062 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((X ((((2 <= p61 + p60 + p59) OR (2 <= p32 + p33 + p34)))) OR (p32 + p33 + p34 <= p68 + p69 + p70))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((X ((((2 <= p61 + p60 + p59) OR (2 <= p32 + p33 + p34)))) OR (p32 + p33 + p34 <= p68 + p69 + p70))))
lola: processed formula length: 107
lola: 45 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 4 markings, 3 edges
lola: ========================================
lola: subprocess 2 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((X (F ((p54 + p55 + p56 + p57 + p58 + p53 + p52 + p51 + p50 <= p23 + p24 + p25))) AND (F ((p54 + p55 + p56 + p57 + p58 + p53 + p52 + p51 + p50 <= p23 + p24 + p25)) AND (p54 + p55 + p56 + p57 + p58 + p53 + p52 + p51 + p50 <= p23 + p24 + p25))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((X (F ((p54 + p55 + p56 + p57 + p58 + p53 + p52 + p51 + p50 <= p23 + p24 + p25))) AND (F ((p54 + p55 + p56 + p57 + p58 + p53 + p52 + p51 + p50 <= p23 + p24 + p25)) AND (p54 + p55 + p56 + p57 + p58 + p53 + p52 + p51 + p50 <= p23 + p24 + p25))))
lola: processed formula length: 246
lola: 45 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 675 markings, 1209 edges
lola: ========================================
lola: subprocess 3 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p0 + p1 + p2 <= 1) OR (G ((2 <= p26 + p27 + p28)) AND F ((p0 + p1 + p2 <= 1)))) U X ((2 <= p26 + p27 + p28)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (((p0 + p1 + p2 <= 1) OR (G ((2 <= p26 + p27 + p28)) AND F ((p0 + p1 + p2 <= 1)))) U X ((2 <= p26 + p27 + p28)))
lola: processed formula length: 112
lola: 45 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: 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 4 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((G ((p64 + p63 + p62 <= 0)) OR (X (G (((p17 + p18 + p19 <= p64 + p63 + p62) OR (1 <= p64 + p63 + p62) OR (p23 + p24 + p25 <= p68 + p69 + p70)))) OR (p23 + p24 + p25 <= p68 + p69 + p70)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((G ((p64 + p63 + p62 <= 0)) OR (X (G (((p17 + p18 + p19 <= p64 + p63 + p62) OR (1 <= p64 + p63 + p62) OR (p23 + p24 + p25 <= p68 + p69 + p70)))) OR (p23 + p24 + p25 <= p68 + p69 + p70)))))
lola: processed formula length: 196
lola: 45 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 35834 markings, 93105 edges
lola: ========================================
lola: subprocess 5 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((p26 + p27 + p28 <= 1)))
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 ((p26 + p27 + p28 <= 1)))
lola: processed formula length: 30
lola: 45 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: 1539 markings, 2919 edges
lola: ========================================
lola: subprocess 6 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 <= 2))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 <= 2))
lola: processed formula length: 62
lola: 45 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: 214 markings, 352 edges
lola: ========================================
lola: subprocess 7 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((G ((p61 + p60 + p59 + 1 <= p26 + p27 + p28)) OR (((p68 + p69 + p70 + 1 <= p23 + p24 + p25)) AND (p61 + p60 + p59 + 1 <= p26 + p27 + p28)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((G ((p61 + p60 + p59 + 1 <= p26 + p27 + p28)) OR (((p68 + p69 + p70 + 1 <= p23 + p24 + p25)) AND (p61 + p60 + p59 + 1 <= p26 + p27 + p28)))))
lola: processed formula length: 147
lola: 45 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 16 markings, 16 edges
lola: ========================================
lola: subprocess 8 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((2 <= p29 + p30 + p31) OR (G ((p68 + p69 + p70 <= p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46)) AND F ((2 <= p29 + p30 + p31))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (2 <= p29 + p30 + p31)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= p29 + p30 + p31)
lola: processed formula length: 22
lola: 45 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 9 will run for 3567 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((2 <= p29 + p30 + p31))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (p29 + p30 + p31 <= 1)
lola: processed formula length: 22
lola: 47 rewrites
lola: closed formula file LTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 11 markings, 11 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 9 will run for 3567 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G (F ((p35 + p36 + p37 + 1 <= p61 + p60 + p59))) OR G ((((p29 + p30 + p31 <= 2) AND (p26 + p27 + p28 <= p20 + p21 + p22)) AND F ((p35 + p36 + p37 + 1 <= p61 + p60 + p59)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 3567 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((p35 + p36 + p37 + 1 <= p61 + p60 + p59)))
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 ((p35 + p36 + p37 + 1 <= p61 + p60 + p59)))
lola: processed formula length: 48
lola: 45 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: 11 markings, 11 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (G (F ((p35 + p36 + p37 + 1 <= p61 + p60 + p59))) OR G ((((p29 + p30 + p31 <= 2) AND (p26 + p27 + p28 <= p20 + p21 + p22)) AND F ((p35 + p36 + p37 + 1 <= p61 + p60 + p59)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: G (F ((p35 + p36 + p37 + 1 <= p61 + p60 + p59)))
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 ((p35 + p36 + p37 + 1 <= p61 + p60 + p59)))
lola: processed formula length: 48
lola: 45 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: 11 markings, 11 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: G ((((p29 + p30 + p31 <= 2) AND (p26 + p27 + p28 <= p20 + p21 + p22)) AND F ((p35 + p36 + p37 + 1 <= p61 + p60 + p59))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((((p29 + p30 + p31 <= 2) AND (p26 + p27 + p28 <= p20 + p21 + p22)) AND F ((p35 + p36 + p37 + 1 <= p61 + p60 + p59))))
lola: processed formula length: 120
lola: 45 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: 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: 11 markings, 11 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes no no no no no no no yes
lola:
preliminary result: no yes no no no no no no no yes
lola: memory consumption: 21976 KB
lola: time consumption: 3 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="LamportFastMutEx-COL-3"
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 LamportFastMutEx-COL-3, 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 r132-tall-162075428500297"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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