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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 420K
-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 12K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 91K 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.5K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Mar 28 16:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 16:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 28 16:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Mar 27 06:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 14K Mar 27 06:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.4K Mar 25 08:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 21K Mar 25 08:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K 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 42K 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 Peterson-COL-2-00
FORMULA_NAME Peterson-COL-2-01
FORMULA_NAME Peterson-COL-2-02
FORMULA_NAME Peterson-COL-2-03
FORMULA_NAME Peterson-COL-2-04
FORMULA_NAME Peterson-COL-2-05
FORMULA_NAME Peterson-COL-2-06
FORMULA_NAME Peterson-COL-2-07
FORMULA_NAME Peterson-COL-2-08
FORMULA_NAME Peterson-COL-2-09
FORMULA_NAME Peterson-COL-2-10
FORMULA_NAME Peterson-COL-2-11
FORMULA_NAME Peterson-COL-2-12
FORMULA_NAME Peterson-COL-2-13
FORMULA_NAME Peterson-COL-2-14
FORMULA_NAME Peterson-COL-2-15

=== Now, execution of the tool begins

BK_START 1621019575944

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-14 19:12:57] [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-14 19:12:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-14 19:12:57] [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-14 19:12:58] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 537 ms
[2021-05-14 19:12:58] [INFO ] sort/places :
ProcTourProc->BeginLoop,TestIdentity,TestAlone,IsEndLoop,
ProcBool->WantSection,
TourProc->Turn,
ProcTour->AskForSection,TestTurn,EndTurn,
Process->Idle,CS,

[2021-05-14 19:12:58] [INFO ] Imported 11 HL places and 14 HL transitions for a total of 108 PT places and 159.0 transition bindings in 25 ms.
[2021-05-14 19:12:58] [INFO ] Computed order based on color domains.
[2021-05-14 19:12:58] [INFO ] Unfolded HLPN to a Petri net with 108 places and 138 transitions in 14 ms.
[2021-05-14 19:12:58] [INFO ] Unfolded HLPN properties in 0 ms.
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 12 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 39 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 417 ms. (steps per millisecond=239 ) properties seen :[1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 1, 1, 1, 0, 1, 1]
[2021-05-14 19:12:58] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
// Phase 1: matrix 120 rows 102 cols
[2021-05-14 19:12:58] [INFO ] Computed 11 place invariants in 6 ms
[2021-05-14 19:12:58] [INFO ] [Real]Absence check using 8 positive place invariants in 12 ms returned unsat
[2021-05-14 19:12:58] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned unsat
[2021-05-14 19:12:58] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned unsat
[2021-05-14 19:12:59] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2021-05-14 19:12:59] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-14 19:12:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 19:12:59] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2021-05-14 19:12:59] [INFO ] State equation strengthened by 26 read => feed constraints.
[2021-05-14 19:12:59] [INFO ] [Real]Added 26 Read/Feed constraints in 3 ms returned sat
[2021-05-14 19:12:59] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 19:12:59] [INFO ] [Nat]Absence check using 8 positive place invariants in 8 ms returned sat
[2021-05-14 19:12:59] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-14 19:12:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 19:12:59] [INFO ] [Nat]Absence check using state equation in 51 ms returned sat
[2021-05-14 19:12:59] [INFO ] [Nat]Added 26 Read/Feed constraints in 3 ms returned sat
[2021-05-14 19:12:59] [INFO ] Deduced a trap composed of 15 places in 44 ms
[2021-05-14 19:12:59] [INFO ] Deduced a trap composed of 31 places in 37 ms
[2021-05-14 19:12:59] [INFO ] Deduced a trap composed of 16 places in 39 ms
[2021-05-14 19:12:59] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 151 ms
[2021-05-14 19:12:59] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 8 ms.
[2021-05-14 19:12:59] [INFO ] Added : 117 causal constraints over 24 iterations in 270 ms. Result :sat
[2021-05-14 19:12:59] [INFO ] [Real]Absence check using 8 positive place invariants in 24 ms returned unsat
[2021-05-14 19:12:59] [INFO ] [Real]Absence check using 8 positive place invariants in 7 ms returned unsat
[2021-05-14 19:12:59] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned unsat
[2021-05-14 19:12:59] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2021-05-14 19:12:59] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 2 ms returned sat
[2021-05-14 19:12:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 19:12:59] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2021-05-14 19:12:59] [INFO ] [Real]Added 26 Read/Feed constraints in 3 ms returned sat
[2021-05-14 19:12:59] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 19:12:59] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2021-05-14 19:12:59] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 3 ms returned sat
[2021-05-14 19:12:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 19:12:59] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2021-05-14 19:12:59] [INFO ] [Nat]Added 26 Read/Feed constraints in 5 ms returned sat
[2021-05-14 19:12:59] [INFO ] Computed and/alt/rep : 123/264/117 causal constraints in 8 ms.
[2021-05-14 19:13:00] [INFO ] Added : 117 causal constraints over 24 iterations in 194 ms. Result :sat
[2021-05-14 19:13:00] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2021-05-14 19:13:00] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 2 ms returned sat
[2021-05-14 19:13:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 19:13:00] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2021-05-14 19:13:00] [INFO ] [Real]Added 26 Read/Feed constraints in 3 ms returned sat
[2021-05-14 19:13:00] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 19:13:00] [INFO ] [Nat]Absence check using 8 positive place invariants in 12 ms returned sat
[2021-05-14 19:13:00] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-14 19:13:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 19:13:00] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2021-05-14 19:13:00] [INFO ] [Nat]Added 26 Read/Feed constraints in 4 ms returned sat
[2021-05-14 19:13:00] [INFO ] Deduced a trap composed of 15 places in 27 ms
[2021-05-14 19:13:00] [INFO ] Deduced a trap composed of 12 places in 25 ms
[2021-05-14 19:13:00] [INFO ] Deduced a trap composed of 13 places in 28 ms
[2021-05-14 19:13:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 3 trap constraints in 95 ms
[2021-05-14 19:13:00] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2021-05-14 19:13:00] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-14 19:13:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 19:13:00] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2021-05-14 19:13:00] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 19:13:00] [INFO ] [Nat]Absence check using 8 positive place invariants in 7 ms returned sat
[2021-05-14 19:13:00] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-14 19:13:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 19:13:00] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2021-05-14 19:13:00] [INFO ] [Nat]Added 26 Read/Feed constraints in 6 ms returned sat
[2021-05-14 19:13:00] [INFO ] Deduced a trap composed of 15 places in 27 ms
[2021-05-14 19:13:00] [INFO ] Deduced a trap composed of 12 places in 27 ms
[2021-05-14 19:13:00] [INFO ] Deduced a trap composed of 13 places in 31 ms
[2021-05-14 19:13:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 3 trap constraints in 97 ms
[2021-05-14 19:13:00] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2021-05-14 19:13:00] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-14 19:13:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 19:13:00] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2021-05-14 19:13:00] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 19:13:00] [INFO ] [Nat]Absence check using 8 positive place invariants in 7 ms returned sat
[2021-05-14 19:13:00] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-14 19:13:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 19:13:00] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2021-05-14 19:13:00] [INFO ] [Nat]Added 26 Read/Feed constraints in 4 ms returned sat
[2021-05-14 19:13:00] [INFO ] Deduced a trap composed of 15 places in 27 ms
[2021-05-14 19:13:00] [INFO ] Deduced a trap composed of 12 places in 27 ms
[2021-05-14 19:13:00] [INFO ] Deduced a trap composed of 13 places in 42 ms
[2021-05-14 19:13:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 3 trap constraints in 109 ms
[2021-05-14 19:13:00] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned unsat
[2021-05-14 19:13:00] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned unsat
Successfully simplified 11 atomic propositions for a total of 12 simplifications.
[2021-05-14 19:13:01] [INFO ] Initial state reduction rules for CTL removed 8 formulas.
[2021-05-14 19:13:01] [INFO ] Flatten gal took : 36 ms
FORMULA Peterson-COL-2-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-COL-2-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-COL-2-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-COL-2-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-COL-2-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-COL-2-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-COL-2-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-COL-2-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-14 19:13:01] [INFO ] Applying decomposition
[2021-05-14 19:13:01] [INFO ] Flatten gal took : 12 ms
[2021-05-14 19:13:01] [INFO ] Decomposing Gal with order
[2021-05-14 19:13:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 19:13:01] [INFO ] Removed a total of 72 redundant transitions.
[2021-05-14 19:13:01] [INFO ] Flatten gal took : 37 ms
[2021-05-14 19:13:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2021-05-14 19:13:01] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2021-05-14 19:13:01] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 1 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ Peterson-COL-2 @ 3570 seconds

FORMULA Peterson-COL-2-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Peterson-COL-2-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Peterson-COL-2-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Peterson-COL-2-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Peterson-COL-2-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Peterson-COL-2-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Peterson-COL-2-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Peterson-COL-2-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3568
rslt: Output for LTLCardinality @ Peterson-COL-2

{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2020",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=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": "Fri May 14 19:13:02 2021
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 446
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 2,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 30,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 30,
"visible_transitions": 0
},
"processed": "G ((X ((2 <= p98 + p97 + p96 + p94 + p93 + p92 + p100 + p101 + p91 + p90 + p84 + p85 + p86 + p87 + p88 + p89 + p95 + p99)) AND G ((p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 <= 1))))",
"processed_size": 209,
"rewrites": 16
},
"result":
{
"edges": 46,
"markings": 46,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 3,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 63,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 45,
"visible_transitions": 0
},
"processed": "((((p21 + p22 + p23 + p24 + p25 + p26 <= 0) U ((p51 + p52 + p53 <= p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44) U (1 <= p21 + p22 + p23 + p24 + p25 + p26))) OR (X (F ((p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 <= 0))) AND (1 <= p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83))) U (2 <= p9 + p10 + p11 + p12 + p13 + p14))",
"processed_size": 433,
"rewrites": 16
},
"result":
{
"edges": 666,
"markings": 469,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"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": 594
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"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": 18,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 18,
"visible_transitions": 0
},
"processed": "F (G ((p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 <= p21 + p22 + p23 + p24 + p25 + p26)))",
"processed_size": 116,
"rewrites": 16
},
"result":
{
"edges": 88,
"markings": 86,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"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": 9,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 9,
"visible_transitions": 0
},
"processed": "(p21 + p22 + p23 + p24 + p25 + p26 + 1 <= p51 + p52 + p53)",
"processed_size": 58,
"rewrites": 18
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 54
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 892
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 1,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 18,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 9,
"visible_transitions": 0
},
"processed": "((p51 + p52 + p53 <= p21 + p22 + p23 + p24 + p25 + p26) U X (G ((p51 + p52 + p53 <= p21 + p22 + p23 + p24 + p25 + p26))))",
"processed_size": 121,
"rewrites": 16
},
"result":
{
"edges": 46,
"markings": 46,
"produced_by": "LTL model checker",
"value": false
},
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 2,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"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": 21,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 21,
"visible_transitions": 0
},
"processed": "(p51 + p52 + p53 <= p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44)",
"processed_size": 126,
"rewrites": 16
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 3,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 892
},
"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": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "X (F ((2 <= p45 + p46 + p47 + p48 + p49 + p50)))",
"processed_size": 48,
"rewrites": 16
},
"result":
{
"edges": 46,
"markings": 46,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 3,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 892
},
"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": 9,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 9,
"visible_transitions": 0
},
"processed": "F (G ((p45 + p46 + p47 + p48 + p49 + p50 + 1 <= p0 + p1 + p2)))",
"processed_size": 63,
"rewrites": 16
},
"result":
{
"edges": 166,
"markings": 152,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
},

{
"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": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 18,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 18,
"visible_transitions": 0
},
"processed": "G (F ((1 <= p98 + p97 + p96 + p94 + p93 + p92 + p100 + p101 + p91 + p90 + p84 + p85 + p86 + p87 + p88 + p89 + p95 + p99)))",
"processed_size": 122,
"rewrites": 16
},
"result":
{
"edges": 35,
"markings": 35,
"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": 1784
},
"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": 18,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 9,
"visible_transitions": 0
},
"processed": "G ((G ((p9 + p10 + p11 + p12 + p13 + p14 <= p0 + p1 + p2)) OR (p9 + p10 + p11 + p12 + p13 + p14 <= p0 + p1 + p2)))",
"processed_size": 114,
"rewrites": 16
},
"result":
{
"edges": 60,
"markings": 59,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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": 3568
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 60,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 39,
"visible_transitions": 0
},
"processed": "F (G ((F ((p98 + p97 + p96 + p94 + p93 + p92 + p100 + p101 + p91 + p90 + p84 + p85 + p86 + p87 + p88 + p89 + p95 + p99 <= p0 + p1 + p2)) AND ((1 <= p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71) OR (p98 + p97 + p96 + p94 + p93 + p92 + p100 + p101 + p91 + p90 + p84 + p85 + p86 + p87 + p88 + p89 + p95 + p99 <= p0 + p1 + p2)))))",
"processed_size": 387,
"rewrites": 16
},
"result":
{
"edges": 262,
"markings": 206,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 7,
"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": 20748,
"runtime": 2.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "G(F(**)) : G((X(**) AND G(*))) : F(G((F(**) AND (** OR **)))) : (((** U (** U **)) OR (X(F(**)) AND **)) U **) : F(G(**)) : (F(**) AND (F(G(**)) OR (** U X(G(**))))) : G((G(*) OR **)) : (X(F(**)) AND **)"
},
"net":
{
"arcs": 384,
"conflict_clusters": 65,
"places": 102,
"places_significant": 91,
"singleton_clusters": 0,
"transitions": 126
},
"result":
{
"preliminary_value": "no no no no no no no no ",
"value": "no no no no no no no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 228/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 102
lola: finding significant places
lola: 102 places, 126 transitions, 91 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 (F ((1 <= p98 + p97 + p96 + p94 + p93 + p92 + p100 + p101 + p91 + p90 + p84 + p85 + p86 + p87 + p88 + p89 + p95 + p99))) : NOT(F ((NOT(X ((2 <= p98 + p97 + p96 + p94 + p93 + p92 + p100 + p101 + p91 + p90 + p84 + p85 + p86 + p87 + p88 + p89 + p95 + p99))) OR F ((2 <= p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83))))) : F (((X (G ((1 <= p45 + p46 + p47 + p48 + p49 + p50))) OR (1 <= p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71)) U F (G (((1 <= p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71) U (p98 + p97 + p96 + p94 + p93 + p92 + p100 + p101 + p91 + p90 + p84 + p85 + p86 + p87 + p88 + p89 + p95 + p99 <= p0 + p1 + p2)))))) : ((((p21 + p22 + p23 + p24 + p25 + p26 <= 0) U ((p51 + p52 + p53 <= p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44) U (1 <= p21 + p22 + p23 + p24 + p25 + p26))) OR (X (F ((p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 <= 0))) AND (1 <= p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83))) U (2 <= p9 + p10 + p11 + p12 + p13 + p14)) : F (G ((p45 + p46 + p47 + p48 + p49 + p50 + 1 <= p0 + p1 + p2))) : (F ((p51 + p52 + p53 <= p21 + p22 + p23 + p24 + p25 + p26)) AND (G (F (G ((p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 <= p21 + p22 + p23 + p24 + p25 + p26)))) OR ((p51 + p52 + p53 <= p21 + p22 + p23 + p24 + p25 + p26) U G (X ((p51 + p52 + p53 <= p21 + p22 + p23 + p24 + p25 + p26)))))) : G ((NOT(F ((p0 + p1 + p2 + 1 <= p9 + p10 + p11 + p12 + p13 + p14))) OR (p9 + p10 + p11 + p12 + p13 + p14 <= p0 + p1 + p2))) : (X (F ((2 <= p45 + p46 + p47 + p48 + p49 + p50))) AND (p51 + p52 + p53 <= p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44))
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((X ((2 <= p98 + p97 + p96 + p94 + p93 + p92 + p100 + p101 + p91 + p90 + p84 + p85 + p86 + p87 + p88 + p89 + p95 + p99)) AND G ((p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((X ((2 <= p98 + p97 + p96 + p94 + p93 + p92 + p100 + p101 + p91 + p90 + p84 + p85 + p86 + p87 + p88 + p89 + p95 + p99)) AND G ((p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 <= 1))))
lola: processed formula length: 209
lola: 16 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: 46 markings, 46 edges
lola: ========================================
lola: subprocess 1 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((((p21 + p22 + p23 + p24 + p25 + p26 <= 0) U ((p51 + p52 + p53 <= p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44) U (1 <= p21 + p22 + p23 + p24 + p25 + p26))) OR (X (F ((p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 <= 0))) AND (1 <= p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83))) U (2 <= p... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((((p21 + p22 + p23 + p24 + p25 + p26 <= 0) U ((p51 + p52 + p53 <= p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44) U (1 <= p21 + p22 + p23 + p24 + p25 + p26))) OR (X (F ((p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 <= 0))) AND (1 <= p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83))) U (2 <= p... (shortened)
lola: processed formula length: 433
lola: 16 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 7 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: 469 markings, 666 edges
lola: ========================================
lola: subprocess 2 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F ((p51 + p52 + p53 <= p21 + p22 + p23 + p24 + p25 + p26)) AND (F (G ((p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 <= p21 + p22 + p23 + p24 + p25 + p26))) OR ((p51 + p52 + p53 <= p21 + p22 + p23 + p24 + p25 + p26) U X (G ((p51 + p52 + p53 <= p21 + p22 + p23 + p24 + p25 + p26))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 <= p21 + p22 + p23 + p24 + p25 + p26)))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 <= p21 + p22 + p23 + p24 + p25 + p26)))
lola: processed formula length: 116
lola: 16 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: 86 markings, 88 edges
lola: ========================================
lola: subprocess 3 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((p51 + p52 + p53 <= p21 + p22 + p23 + p24 + p25 + p26))
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: (p21 + p22 + p23 + p24 + p25 + p26 + 1 <= p51 + p52 + p53)
lola: processed formula length: 58
lola: 18 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 4 will run for 892 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p51 + p52 + p53 <= p21 + p22 + p23 + p24 + p25 + p26) U X (G ((p51 + p52 + p53 <= p21 + p22 + p23 + p24 + p25 + p26))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((p51 + p52 + p53 <= p21 + p22 + p23 + p24 + p25 + p26) U X (G ((p51 + p52 + p53 <= p21 + p22 + p23 + p24 + p25 + p26))))
lola: processed formula length: 121
lola: 16 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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 46 markings, 46 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 3 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (F ((2 <= p45 + p46 + p47 + p48 + p49 + p50))) AND (p51 + p52 + p53 <= p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p51 + p52 + p53 <= p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p51 + p52 + p53 <= p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44)
lola: processed formula length: 126
lola: 16 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 4 will run for 892 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((2 <= p45 + p46 + p47 + p48 + p49 + p50)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((2 <= p45 + p46 + p47 + p48 + p49 + p50)))
lola: processed formula length: 48
lola: 16 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: 46 markings, 46 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 4 will run for 892 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((p45 + p46 + p47 + p48 + p49 + p50 + 1 <= p0 + p1 + p2)))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((p45 + p46 + p47 + p48 + p49 + p50 + 1 <= p0 + p1 + p2)))
lola: processed formula length: 63
lola: 16 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: 152 markings, 166 edges
lola: ========================================
lola: subprocess 5 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((1 <= p98 + p97 + p96 + p94 + p93 + p92 + p100 + p101 + p91 + p90 + p84 + p85 + p86 + p87 + p88 + p89 + p95 + p99)))
lola: ========================================
lola: SUBTASK
lola: checking fairness
lola: fairness not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((1 <= p98 + p97 + p96 + p94 + p93 + p92 + p100 + p101 + p91 + p90 + p84 + p85 + p86 + p87 + p88 + p89 + p95 + p99)))
lola: processed formula length: 122
lola: 16 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: 35 markings, 35 edges
lola: ========================================
lola: subprocess 6 will run for 1784 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((G ((p9 + p10 + p11 + p12 + p13 + p14 <= p0 + p1 + p2)) OR (p9 + p10 + p11 + p12 + p13 + p14 <= p0 + p1 + p2)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((G ((p9 + p10 + p11 + p12 + p13 + p14 <= p0 + p1 + p2)) OR (p9 + p10 + p11 + p12 + p13 + p14 <= p0 + p1 + p2)))
lola: processed formula length: 114
lola: 16 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: 59 markings, 60 edges
lola: ========================================
lola: subprocess 7 will run for 3568 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((F ((p98 + p97 + p96 + p94 + p93 + p92 + p100 + p101 + p91 + p90 + p84 + p85 + p86 + p87 + p88 + p89 + p95 + p99 <= p0 + p1 + p2)) AND ((1 <= p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71) OR (p98 + p97 + p96 + p94 + p93 + p92 + p100 + p101 + p91 + p90 + p84 + p85 + p86 + p87 + p88 + p89 + p95 + p99 <= p0 + p1 + p2)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((F ((p98 + p97 + p96 + p94 + p93 + p92 + p100 + p101 + p91 + p90 + p84 + p85 + p86 + p87 + p88 + p89 + p95 + p99 <= p0 + p1 + p2)) AND ((1 <= p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71) OR (p98 + p97 + p96 + p94 + p93 + p92 + p100 + p101 + p91 + p90 + p84 + p85 + p86 + p87 + p88 + p89 + p95 + p99 <= p0 + p1 + p2)))))
lola: processed formula length: 387
lola: 16 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: 206 markings, 262 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no no no no no
lola:
preliminary result: no no no no no no no no
lola: memory consumption: 20748 KB
lola: time consumption: 2 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="Peterson-COL-2"
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 Peterson-COL-2, 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 r151-tall-162089151400277"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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