Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2021-input.r170-oct2-162089286900001.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2021-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2020
Input is PhilosophersDyn-COL-03, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r170-oct2-162089286900001
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 392K
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 96K 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 99K 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.3K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Mar 28 16:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 16:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 28 16:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 28 16:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Mar 27 09:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 14K Mar 27 09:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Mar 25 11:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 25 11:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 22 09:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 09:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_pt
-rw-r--r-- 1 mcc users 3 May 5 16:51 instance
-rw-r--r-- 1 mcc users 5 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 31K 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 PhilosophersDyn-COL-03-00
FORMULA_NAME PhilosophersDyn-COL-03-01
FORMULA_NAME PhilosophersDyn-COL-03-02
FORMULA_NAME PhilosophersDyn-COL-03-03
FORMULA_NAME PhilosophersDyn-COL-03-04
FORMULA_NAME PhilosophersDyn-COL-03-05
FORMULA_NAME PhilosophersDyn-COL-03-06
FORMULA_NAME PhilosophersDyn-COL-03-07
FORMULA_NAME PhilosophersDyn-COL-03-08
FORMULA_NAME PhilosophersDyn-COL-03-09
FORMULA_NAME PhilosophersDyn-COL-03-10
FORMULA_NAME PhilosophersDyn-COL-03-11
FORMULA_NAME PhilosophersDyn-COL-03-12
FORMULA_NAME PhilosophersDyn-COL-03-13
FORMULA_NAME PhilosophersDyn-COL-03-14
FORMULA_NAME PhilosophersDyn-COL-03-15

=== Now, execution of the tool begins

BK_START 1621372013519

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-18 21:06:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2021-05-18 21:06:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-18 21:06:55] [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-18 21:06:56] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 584 ms
[2021-05-18 21:06:56] [INFO ] sort/places :
Neighbourhood->Neighbourhood,
Philosopher->Outside,Think,Forks,WaitLeft,WaitRight,HasLeft,HasRight,

[2021-05-18 21:06:56] [INFO ] Imported 8 HL places and 7 HL transitions for a total of 30 PT places and 87.0 transition bindings in 14 ms.
[2021-05-18 21:06:56] [INFO ] Computed order based on color domains.
[2021-05-18 21:06:56] [INFO ] Unfolded HLPN to a Petri net with 30 places and 84 transitions in 89 ms.
[2021-05-18 21:06:56] [INFO ] Unfolded HLPN properties in 2 ms.
Ensure Unique test removed 3 transitions
Reduce redundant transitions removed 3 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 123 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 14350 resets, run finished after 363 ms. (steps per millisecond=275 ) properties seen :[0, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 0, 1, 1, 1, 1, 1]
[2021-05-18 21:06:57] [INFO ] Flow matrix only has 57 transitions (discarded 24 similar events)
// Phase 1: matrix 57 rows 30 cols
[2021-05-18 21:06:57] [INFO ] Computed 11 place invariants in 4 ms
[2021-05-18 21:06:57] [INFO ] [Real]Absence check using 10 positive place invariants in 14 ms returned sat
[2021-05-18 21:06:57] [INFO ] [Real]Absence check using 10 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-18 21:06:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 21:06:57] [INFO ] [Real]Absence check using state equation in 58 ms returned sat
[2021-05-18 21:06:57] [INFO ] State equation strengthened by 36 read => feed constraints.
[2021-05-18 21:06:57] [INFO ] [Real]Added 36 Read/Feed constraints in 22 ms returned sat
[2021-05-18 21:06:57] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 21:06:57] [INFO ] [Nat]Absence check using 10 positive place invariants in 9 ms returned sat
[2021-05-18 21:06:57] [INFO ] [Nat]Absence check using 10 positive and 1 generalized place invariants in 0 ms returned sat
[2021-05-18 21:06:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 21:06:57] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2021-05-18 21:06:57] [INFO ] [Nat]Added 36 Read/Feed constraints in 6 ms returned sat
[2021-05-18 21:06:57] [INFO ] Computed and/alt/rep : 78/1419/54 causal constraints in 7 ms.
[2021-05-18 21:06:57] [INFO ] Added : 28 causal constraints over 6 iterations in 119 ms. Result :sat
[2021-05-18 21:06:57] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2021-05-18 21:06:57] [INFO ] [Real]Absence check using 10 positive and 1 generalized place invariants in 0 ms returned sat
[2021-05-18 21:06:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 21:06:57] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2021-05-18 21:06:57] [INFO ] [Real]Added 36 Read/Feed constraints in 51 ms returned sat
[2021-05-18 21:06:57] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 21:06:57] [INFO ] [Nat]Absence check using 10 positive place invariants in 7 ms returned sat
[2021-05-18 21:06:57] [INFO ] [Nat]Absence check using 10 positive and 1 generalized place invariants in 0 ms returned sat
[2021-05-18 21:06:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 21:06:57] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2021-05-18 21:06:57] [INFO ] [Nat]Added 36 Read/Feed constraints in 30 ms returned sat
[2021-05-18 21:06:57] [INFO ] Computed and/alt/rep : 78/1419/54 causal constraints in 34 ms.
[2021-05-18 21:06:57] [INFO ] Added : 32 causal constraints over 7 iterations in 109 ms. Result :sat
[2021-05-18 21:06:57] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned unsat
[2021-05-18 21:06:57] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2021-05-18 21:06:57] [INFO ] [Real]Absence check using 10 positive and 1 generalized place invariants in 1 ms returned unsat
[2021-05-18 21:06:57] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2021-05-18 21:06:57] [INFO ] [Real]Absence check using 10 positive and 1 generalized place invariants in 2 ms returned unsat
[2021-05-18 21:06:57] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2021-05-18 21:06:57] [INFO ] [Real]Absence check using 10 positive and 1 generalized place invariants in 0 ms returned unsat
[2021-05-18 21:06:57] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned unsat
[2021-05-18 21:06:57] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2021-05-18 21:06:57] [INFO ] [Real]Absence check using 10 positive and 1 generalized place invariants in 1 ms returned unsat
[2021-05-18 21:06:57] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned unsat
[2021-05-18 21:06:57] [INFO ] [Real]Absence check using 10 positive place invariants in 7 ms returned unsat
Successfully simplified 8 atomic propositions for a total of 10 simplifications.
[2021-05-18 21:06:58] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2021-05-18 21:06:58] [INFO ] Flatten gal took : 34 ms
FORMULA PhilosophersDyn-COL-03-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-COL-03-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-COL-03-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-COL-03-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-COL-03-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-18 21:06:58] [INFO ] Applying decomposition
[2021-05-18 21:06:58] [INFO ] Flatten gal took : 14 ms
[2021-05-18 21:06:58] [INFO ] Decomposing Gal with order
[2021-05-18 21:06:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-18 21:06:58] [INFO ] Removed a total of 198 redundant transitions.
[2021-05-18 21:06:58] [INFO ] Flatten gal took : 35 ms
[2021-05-18 21:06:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 4 ms.
[2021-05-18 21:06:58] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2021-05-18 21:06:58] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 3 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ PhilosophersDyn-COL-03 @ 3570 seconds

FORMULA PhilosophersDyn-COL-03-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhilosophersDyn-COL-03-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhilosophersDyn-COL-03-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhilosophersDyn-COL-03-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhilosophersDyn-COL-03-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhilosophersDyn-COL-03-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhilosophersDyn-COL-03-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhilosophersDyn-COL-03-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhilosophersDyn-COL-03-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhilosophersDyn-COL-03-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhilosophersDyn-COL-03-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3567
rslt: Output for LTLCardinality @ PhilosophersDyn-COL-03

{
"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",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Tue May 18 21:06:58 2021
",
"timelimit": 3570
},
"child":
[

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"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 ((3 <= p24 + p25 + p26)))",
"processed_size": 30,
"rewrites": 48
},
"result":
{
"edges": 8,
"markings": 8,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 0,
"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": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"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 (((p12 + p13 + p14 + 1 <= p11 + p10 + p9)))",
"processed_size": 45,
"rewrites": 48
},
"result":
{
"edges": 6,
"markings": 6,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 1,
"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": 396
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"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": "X (F ((p15 + p16 + p17 <= 0)))",
"processed_size": 30,
"rewrites": 48
},
"result":
{
"edges": 666,
"markings": 325,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 0,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"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": "X (G ((p15 + p16 + p17 <= p27 + p28 + p29)))",
"processed_size": 44,
"rewrites": 48
},
"result":
{
"edges": 6,
"markings": 6,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 1,
"X": 4,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 15,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 12,
"visible_transitions": 0
},
"processed": "((p15 + p16 + p17 <= p20 + p19 + p18) U X (X ((F ((X ((3 <= p12 + p13 + p14)) OR (3 <= p12 + p13 + p14))) AND X ((1 <= p23 + p22 + p21))))))",
"processed_size": 140,
"rewrites": 48
},
"result":
{
"edges": 6,
"markings": 6,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 17
},
"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": 445
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"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": "X (F ((p11 + p10 + p9 <= 0)))",
"processed_size": 29,
"rewrites": 48
},
"result":
{
"edges": 6,
"markings": 6,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"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": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 3,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 30,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 24,
"visible_transitions": 0
},
"processed": "X (F ((G ((2 <= p27 + p28 + p29)) OR (G (((p15 + p16 + p17 <= p23 + p22 + p21) OR (p11 + p10 + p9 <= p23 + p22 + p21) OR (p0 + p1 + p2 + p3 + p4 + p5 + p8 + p7 + p6 <= p20 + p19 + p18))) AND F (G ((2 <= p27 + p28 + p29)))))))",
"processed_size": 227,
"rewrites": 48
},
"result":
{
"edges": 38,
"markings": 22,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 12
},
"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": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 21,
"taut": 0,
"tconj": 0,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 12,
"visible_transitions": 0
},
"processed": "X (F (((p0 + p1 + p2 + p3 + p4 + p5 + p8 + p7 + p6 <= 0) OR (X ((1 <= p0 + p1 + p2 + p3 + p4 + p5 + p8 + p7 + p6)) OR G ((1 <= p24 + p25 + p26))))))",
"processed_size": 148,
"rewrites": 48
},
"result":
{
"edges": 21,
"markings": 19,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"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": "X (F ((1 <= p0 + p1 + p2 + p3 + p4 + p5 + p8 + p7 + p6)))",
"processed_size": 57,
"rewrites": 48
},
"result":
{
"edges": 3,
"markings": 4,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"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": 9,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 9,
"visible_transitions": 0
},
"processed": "G (F (((p24 + p25 + p26 <= p20 + p19 + p18) AND (2 <= p15 + p16 + p17))))",
"processed_size": 73,
"rewrites": 48
},
"result":
{
"edges": 7,
"markings": 7,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 7,
"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": 1189
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "F ((G ((3 <= p11 + p10 + p9)) AND (p20 + p19 + p18 + 1 <= p11 + p10 + p9)))",
"processed_size": 75,
"rewrites": 48
},
"result":
{
"edges": 7,
"markings": 7,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 8,
"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": 0,
"G": 2,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 9,
"visible_transitions": 0
},
"processed": "G ((G ((p24 + p25 + p26 <= 2)) OR (p27 + p28 + p29 + 1 <= p12 + p13 + p14)))",
"processed_size": 76,
"rewrites": 48
},
"result":
{
"edges": 1863,
"markings": 631,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 9,
"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": 2,
"G": 2,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 2,
"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": 18,
"visible_transitions": 0
},
"processed": "G (F ((G ((p15 + p16 + p17 + 1 <= p0 + p1 + p2 + p3 + p4 + p5 + p8 + p7 + p6)) OR F ((p11 + p10 + p9 + 1 <= p27 + p28 + p29)))))",
"processed_size": 128,
"rewrites": 48
},
"result":
{
"edges": 8,
"markings": 8,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 10,
"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": 21608,
"runtime": 3.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "G((G(*) OR **)) : (X(F(*)) OR (G(*) AND (G(*) OR G(F(**))))) : X(G(**)) : (** U X(X((F((X(**) OR **)) AND X(**))))) : X(F(*)) : G(F((G(*) OR F(*)))) : F((G(**) AND **)) : X(F((G(**) OR (G(**) AND F(G(**)))))) : X(F((* OR (X(**) OR G(**))))) : X(F(**)) : G(F(**))"
},
"net":
{
"arcs": 534,
"conflict_clusters": 1,
"places": 30,
"places_significant": 19,
"singleton_clusters": 0,
"transitions": 81
},
"result":
{
"preliminary_value": "yes yes no no no no no no yes yes no ",
"value": "yes yes no no no no no no yes yes no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 111/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 960
lola: finding significant places
lola: 30 places, 81 transitions, 19 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: G ((NOT(F ((3 <= p24 + p25 + p26))) OR (p27 + p28 + p29 + 1 <= p12 + p13 + p14))) : (NOT(X (G ((1 <= p15 + p16 + p17)))) OR NOT((F (NOT(F ((3 <= p24 + p25 + p26)))) U F (((p11 + p10 + p9 <= p12 + p13 + p14)))))) : G (X (G ((p15 + p16 + p17 <= p27 + p28 + p29)))) : ((p15 + p16 + p17 <= p20 + p19 + p18) U X (X ((F ((X ((3 <= p12 + p13 + p14)) OR (3 <= p12 + p13 + p14))) AND X ((1 <= p23 + p22 + p21)))))) : F (NOT(X ((1 <= p11 + p10 + p9)))) : G (NOT(G ((F ((p0 + p1 + p2 + p3 + p4 + p5 + p8 + p7 + p6 <= p15 + p16 + p17)) AND G ((p27 + p28 + p29 <= p11 + p10 + p9)))))) : F ((G ((3 <= p11 + p10 + p9)) AND (p20 + p19 + p18 + 1 <= p11 + p10 + p9))) : F (X (((p20 + p19 + p18 + 1 <= p0 + p1 + p2 + p3 + p4 + p5 + p8 + p7 + p6) U F ((G (((p15 + p16 + p17 <= p23 + p22 + p21) OR (p11 + p10 + p9 <= p23 + p22 + p21) OR (p0 + p1 + p2 + p3 + p4 + p5 + p8 + p7 + p6 <= p20 + p19 + p18))) U G ((2 <= p27 + p28 + p29))))))) : X ((NOT(G ((1 <= p0 + p1 + p2 + p3 + p4 + p5 + p8 + p7 + p6))) OR F ((X ((1 <= p0 + p1 + p2 + p3 + p4 + p5 + p8 + p7 + p6)) OR G ((1 <= p24 + p25 + p26)))))) : X (F ((1 <= p0 + p1 + p2 + p3 + p4 + p5 + p8 + p7 + p6))) : X (NOT(((p20 + p19 + p18 + 1 <= p24 + p25 + p26) U G (F (NOT(F (X (((p24 + p25 + p26 <= p20 + p19 + p18) AND (2 <= p15 + p16 + p17))))))))))
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: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:428
lola: rewrite Frontend/Parser/formula_rewrite.k:347
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:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
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:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:519
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:422
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: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (F ((p15 + p16 + p17 <= 0))) OR (G (((p12 + p13 + p14 + 1 <= p11 + p10 + p9))) AND (G (((p12 + p13 + p14 + 1 <= p11 + p10 + p9))) OR G (F ((3 <= p24 + p25 + p26))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((3 <= p24 + p25 + p26)))
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 ((3 <= p24 + p25 + p26)))
lola: processed formula length: 30
lola: 48 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: 8 markings, 8 edges
lola: ========================================
lola: subprocess 1 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((p12 + p13 + p14 + 1 <= p11 + p10 + p9)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((p12 + p13 + p14 + 1 <= p11 + p10 + p9)))
lola: processed formula length: 45
lola: 48 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: 6 markings, 6 edges
lola: ========================================
lola: subprocess 2 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((p15 + p16 + p17 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((p15 + p16 + p17 <= 0)))
lola: processed formula length: 30
lola: 48 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 325 markings, 666 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 1 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((p15 + p16 + p17 <= p27 + p28 + p29)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((p15 + p16 + p17 <= p27 + p28 + p29)))
lola: processed formula length: 44
lola: 48 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 6 markings, 6 edges
lola: ========================================
lola: subprocess 2 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p15 + p16 + p17 <= p20 + p19 + p18) U X (X ((F ((X ((3 <= p12 + p13 + p14)) OR (3 <= p12 + p13 + p14))) AND X ((1 <= p23 + p22 + p21))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((p15 + p16 + p17 <= p20 + p19 + p18) U X (X ((F ((X ((3 <= p12 + p13 + p14)) OR (3 <= p12 + p13 + p14))) AND X ((1 <= p23 + p22 + p21))))))
lola: processed formula length: 140
lola: 48 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 17 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: 6 markings, 6 edges
lola: ========================================
lola: subprocess 3 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((p11 + p10 + p9 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((p11 + p10 + p9 <= 0)))
lola: processed formula length: 29
lola: 48 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 6 markings, 6 edges
lola: ========================================
lola: subprocess 4 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((G ((2 <= p27 + p28 + p29)) OR (G (((p15 + p16 + p17 <= p23 + p22 + p21) OR (p11 + p10 + p9 <= p23 + p22 + p21) OR (p0 + p1 + p2 + p3 + p4 + p5 + p8 + p7 + p6 <= p20 + p19 + p18))) AND F (G ((2 <= p27 + p28 + p29)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((G ((2 <= p27 + p28 + p29)) OR (G (((p15 + p16 + p17 <= p23 + p22 + p21) OR (p11 + p10 + p9 <= p23 + p22 + p21) OR (p0 + p1 + p2 + p3 + p4 + p5 + p8 + p7 + p6 <= p20 + p19 + p18))) AND F (G ((2 <= p27 + p28 + p29)))))))
lola: processed formula length: 227
lola: 48 rewrites
lola: closed formula file LTLCardinality.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: add low 76
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: 22 markings, 38 edges
lola: ========================================
lola: subprocess 5 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F (((p0 + p1 + p2 + p3 + p4 + p5 + p8 + p7 + p6 <= 0) OR (X ((1 <= p0 + p1 + p2 + p3 + p4 + p5 + p8 + p7 + p6)) OR G ((1 <= p24 + p25 + p26))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F (((p0 + p1 + p2 + p3 + p4 + p5 + p8 + p7 + p6 <= 0) OR (X ((1 <= p0 + p1 + p2 + p3 + p4 + p5 + p8 + p7 + p6)) OR G ((1 <= p24 + p25 + p26))))))
lola: processed formula length: 148
lola: 48 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 19 markings, 21 edges
lola: ========================================
lola: subprocess 6 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((1 <= p0 + p1 + p2 + p3 + p4 + p5 + p8 + p7 + p6)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((1 <= p0 + p1 + p2 + p3 + p4 + p5 + p8 + p7 + p6)))
lola: processed formula length: 57
lola: 48 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: 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 7 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F (((p24 + p25 + p26 <= p20 + p19 + p18) AND (2 <= p15 + p16 + p17))))
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 (((p24 + p25 + p26 <= p20 + p19 + p18) AND (2 <= p15 + p16 + p17))))
lola: processed formula length: 73
lola: 48 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: 7 markings, 7 edges
lola: ========================================
lola: subprocess 8 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((G ((3 <= p11 + p10 + p9)) AND (p20 + p19 + p18 + 1 <= p11 + p10 + p9)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((G ((3 <= p11 + p10 + p9)) AND (p20 + p19 + p18 + 1 <= p11 + p10 + p9)))
lola: processed formula length: 75
lola: 48 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: 7 markings, 7 edges
lola: ========================================
lola: subprocess 9 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((G ((p24 + p25 + p26 <= 2)) OR (p27 + p28 + p29 + 1 <= p12 + p13 + p14)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((G ((p24 + p25 + p26 <= 2)) OR (p27 + p28 + p29 + 1 <= p12 + p13 + p14)))
lola: processed formula length: 76
lola: 48 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 631 markings, 1863 edges
lola: ========================================
lola: subprocess 10 will run for 3567 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((G ((p15 + p16 + p17 + 1 <= p0 + p1 + p2 + p3 + p4 + p5 + p8 + p7 + p6)) OR F ((p11 + p10 + p9 + 1 <= p27 + p28 + p29)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((G ((p15 + p16 + p17 + 1 <= p0 + p1 + p2 + p3 + p4 + p5 + p8 + p7 + p6)) OR F ((p11 + p10 + p9 + 1 <= p27 + p28 + p29)))))
lola: processed formula length: 128
lola: 48 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: 8 markings, 8 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes yes no no no no no no yes yes no
lola:
preliminary result: yes yes no no no no no no yes yes no
lola: memory consumption: 21608 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="PhilosophersDyn-COL-03"
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 PhilosophersDyn-COL-03, 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 r170-oct2-162089286900001"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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