fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r170-oct2-162089287100093
Last Updated
Jun 28, 2021

About the Execution of 2020-gold for PolyORBLF-COL-S06J04T08

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
4343.000 3600000.00 174092.00 259.80 FFFFTFFFTTFTFFTT normal

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-162089287100093.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 PolyORBLF-COL-S06J04T08, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r170-oct2-162089287100093
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 532K
-rw-r--r-- 1 mcc users 17K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 104K 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 96K 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.8K Mar 28 16:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 28 16:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 28 16:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.5K Mar 27 09:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 27 09:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Mar 25 12:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 25 12:08 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 10 May 5 16:51 instance
-rw-r--r-- 1 mcc users 5 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 154K 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 PolyORBLF-COL-S06J04T08-00
FORMULA_NAME PolyORBLF-COL-S06J04T08-01
FORMULA_NAME PolyORBLF-COL-S06J04T08-02
FORMULA_NAME PolyORBLF-COL-S06J04T08-03
FORMULA_NAME PolyORBLF-COL-S06J04T08-04
FORMULA_NAME PolyORBLF-COL-S06J04T08-05
FORMULA_NAME PolyORBLF-COL-S06J04T08-06
FORMULA_NAME PolyORBLF-COL-S06J04T08-07
FORMULA_NAME PolyORBLF-COL-S06J04T08-08
FORMULA_NAME PolyORBLF-COL-S06J04T08-09
FORMULA_NAME PolyORBLF-COL-S06J04T08-10
FORMULA_NAME PolyORBLF-COL-S06J04T08-11
FORMULA_NAME PolyORBLF-COL-S06J04T08-12
FORMULA_NAME PolyORBLF-COL-S06J04T08-13
FORMULA_NAME PolyORBLF-COL-S06J04T08-14
FORMULA_NAME PolyORBLF-COL-S06J04T08-15

=== Now, execution of the tool begins

BK_START 1621378476137

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-18 22:54:39] [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 22:54:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-18 22:54:40] [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 22:54:41] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1593 ms
[2021-05-18 22:54:41] [INFO ] sort/places :
D4->DisablePollingE,DisablePollingB,Insert_Source_B,P_1119,P_2579,
Threads->AwakeTasks,IdleTasks,NotifyEventJobQueuedE,QueueJobE,P_2321,TryAllocateOneTaskE,TryAllocateOneTaskB,P_2318,EnablePollingE,EnablePollingB,FetchJobB,ScheduleTaskE_Check,ScheduleTaskB,Abort_Check_Sources_E,Abort_Check_Sources_B,NotifyEventSourceAddedB,Insert_Source_E,NotifyEventSourceAddedE,P_1113,ProcessingEvt,P_1155,nyo,P_1158,P_1159,P_1160,NotifyEventEndOfCheckSourcesB,NotifyEventEndOfCheckSourcesE,Check_Sources_B,Check_Sources_E,Idle,NotifyEventJobCompletedE,NotifyEventJobCompletedB,RunE,RunB,Perform_Work_E,Try_Check_Sources_B,Try_Check_Sources_E,P_1617,ScheduleTaskE_Idle,
D6->CreatedJobs,
Jobs->P_1725,P_1724,P_1712,AvailableJobId,
Dot->cJobCnt,JobCnt,cBlockedTasks,PollingAbort,cPollingAbort,BlockedTasks,MarkerWrite,P_1727,P_1726,MarkerRead,P_1717,P_1716,CanInjectEvent,SigAbort,NoSigAbort,P_1093,P_1095,P_1097,P_1099,cSources,cIsMonitoring,IsMonitoring,cIdleTasks,ORB_Lock,
Sources->DataOnSrc,PlaceSources,ModifiedSrc,AbourtToModifySrc,
D1->NotifyEventJobQueuedB,QueueJobB,FetchJobE,ScheduleTaskE_Work,

[2021-05-18 22:54:41] [INFO ] ms2 symmetric to ms1 in transition T_1124
[2021-05-18 22:54:41] [INFO ] ms3 symmetric to ms2 in transition T_1125
[2021-05-18 22:54:41] [INFO ] ms2 symmetric to ms1 in transition T_1125
[2021-05-18 22:54:41] [INFO ] ms3 symmetric to ms4 in transition T_1126
[2021-05-18 22:54:41] [INFO ] ms4 symmetric to ms2 in transition T_1126
[2021-05-18 22:54:41] [INFO ] ms2 symmetric to ms1 in transition T_1126
[2021-05-18 22:54:41] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 810 PT places and 14100.0 transition bindings in 51 ms.
[2021-05-18 22:54:41] [INFO ] Computed order based on color domains.
[2021-05-18 22:54:41] [INFO ] Unfolded HLPN to a Petri net with 810 places and 3254 transitions in 127 ms.
[2021-05-18 22:54:41] [INFO ] Unfolded HLPN properties in 1 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 239 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 604 resets, run finished after 853 ms. (steps per millisecond=117 ) properties seen :[1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 1, 0, 1, 0, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1]
[2021-05-18 22:54:42] [INFO ] Flow matrix only has 3206 transitions (discarded 48 similar events)
// Phase 1: matrix 3206 rows 810 cols
[2021-05-18 22:54:43] [INFO ] Computed 58 place invariants in 160 ms
[2021-05-18 22:54:43] [INFO ] [Real]Absence check using 19 positive place invariants in 66 ms returned sat
[2021-05-18 22:54:43] [INFO ] [Real]Absence check using 19 positive and 39 generalized place invariants in 118 ms returned unsat
[2021-05-18 22:54:43] [INFO ] [Real]Absence check using 19 positive place invariants in 31 ms returned sat
[2021-05-18 22:54:43] [INFO ] [Real]Absence check using 19 positive and 39 generalized place invariants in 27 ms returned unsat
[2021-05-18 22:54:43] [INFO ] [Real]Absence check using 19 positive place invariants in 18 ms returned sat
[2021-05-18 22:54:43] [INFO ] [Real]Absence check using 19 positive and 39 generalized place invariants in 38 ms returned unsat
[2021-05-18 22:54:43] [INFO ] [Real]Absence check using 19 positive place invariants in 12 ms returned unsat
[2021-05-18 22:54:44] [INFO ] [Real]Absence check using 19 positive place invariants in 32 ms returned sat
[2021-05-18 22:54:44] [INFO ] [Real]Absence check using 19 positive and 39 generalized place invariants in 141 ms returned unsat
[2021-05-18 22:54:44] [INFO ] [Real]Absence check using 19 positive place invariants in 37 ms returned unsat
[2021-05-18 22:54:44] [INFO ] [Real]Absence check using 19 positive place invariants in 42 ms returned sat
[2021-05-18 22:54:44] [INFO ] [Real]Absence check using 19 positive and 39 generalized place invariants in 67 ms returned unsat
[2021-05-18 22:54:44] [INFO ] [Real]Absence check using 19 positive place invariants in 17 ms returned sat
[2021-05-18 22:54:44] [INFO ] [Real]Absence check using 19 positive and 39 generalized place invariants in 38 ms returned unsat
[2021-05-18 22:54:44] [INFO ] [Real]Absence check using 19 positive place invariants in 6 ms returned unsat
[2021-05-18 22:54:45] [INFO ] [Real]Absence check using 19 positive place invariants in 6 ms returned unsat
[2021-05-18 22:54:45] [INFO ] [Real]Absence check using 19 positive place invariants in 5 ms returned unsat
[2021-05-18 22:54:45] [INFO ] [Real]Absence check using 19 positive place invariants in 31 ms returned unsat
Successfully simplified 12 atomic propositions for a total of 14 simplifications.
[2021-05-18 22:54:46] [INFO ] Initial state reduction rules for CTL removed 8 formulas.
[2021-05-18 22:54:46] [INFO ] Flatten gal took : 646 ms
FORMULA PolyORBLF-COL-S06J04T08-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S06J04T08-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S06J04T08-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S06J04T08-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S06J04T08-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S06J04T08-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S06J04T08-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S06J04T08-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-18 22:54:46] [INFO ] Applying decomposition
[2021-05-18 22:54:46] [INFO ] Flatten gal took : 446 ms
[2021-05-18 22:54:47] [INFO ] Decomposing Gal with order
[2021-05-18 22:54:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-18 22:54:48] [INFO ] Removed a total of 17147 redundant transitions.
[2021-05-18 22:54:48] [INFO ] Flatten gal took : 1315 ms
[2021-05-18 22:54:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 80 labels/synchronizations in 286 ms.
[2021-05-18 22:54:50] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2021-05-18 22:54:50] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 34 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ PolyORBLF-COL-S06J04T08 @ 3570 seconds

FORMULA PolyORBLF-COL-S06J04T08-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBLF-COL-S06J04T08-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBLF-COL-S06J04T08-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBLF-COL-S06J04T08-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBLF-COL-S06J04T08-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBLF-COL-S06J04T08-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBLF-COL-S06J04T08-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBLF-COL-S06J04T08-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3435
rslt: Output for LTLCardinality @ PolyORBLF-COL-S06J04T08

{
"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 22:54:50 2021
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 434
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 13,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 13,
"visible_transitions": 0
},
"processed": "X (X (F ((p450 + p451 + p452 + p453 + p454 <= p442 + p443 + p444 + p445 + p446 + p447 + p448 + p449))))",
"processed_size": 103,
"rewrites": 24
},
"result":
{
"edges": 28,
"markings": 28,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 496
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 14,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 14,
"visible_transitions": 0
},
"processed": "X (G ((p610 + p611 + p612 + p613 + p614 + p615 + p616 + p617 <= p708 + p709 + p710 + p711 + p712 + p713)))",
"processed_size": 106,
"rewrites": 24
},
"result":
{
"edges": 28,
"markings": 28,
"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": 579
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 579
},
"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": 48,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 48,
"visible_transitions": 0
},
"processed": "(p570 + p571 + p572 + p573 + p574 + p575 + p576 + p577 + 1 <= p64 + p63 + p62 + p61 + p60 + p59 + p58 + p57 + p56 + p55 + p54 + p53 + p52 + p51 + p50 + p49 + p48 + p47 + p46 + p45 + p44 + p43 + p42 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p65)",
"processed_size": 300,
"rewrites": 26
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 296
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 695
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 2,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 25,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 25,
"visible_transitions": 0
},
"processed": "X (X (((p263 <= p354 + p355 + p356 + p357 + p358 + p359 + p360 + p361) AND (p648 + p649 + p650 + p651 + p652 + p653 + p654 + p655 <= p442 + p443 + p444 + p445 + p446 + p447 + p448 + p449))))",
"processed_size": 190,
"rewrites": 24
},
"result":
{
"edges": 42,
"markings": 28,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 4
},
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 2,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 695
},
"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": 8,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "X (F ((2 <= p578 + p579 + p580 + p581 + p582 + p583 + p584 + p585)))",
"processed_size": 68,
"rewrites": 24
},
"result":
{
"edges": 28,
"markings": 28,
"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": 868
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 2,
"U": 0,
"X": 4,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 10,
"visible_transitions": 0
},
"processed": "X (X (X (G ((X ((p457 <= p594 + p595 + p596 + p597 + p598 + p599 + p600 + p601)) OR G ((1 <= p315)))))))",
"processed_size": 104,
"rewrites": 24
},
"result":
{
"edges": 27297,
"markings": 21519,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 8
},
"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": 1158
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 26,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 21,
"visible_transitions": 0
},
"processed": "G ((X ((p450 + p451 + p452 + p453 + p454 <= 1)) OR (G ((p618 + p619 + p620 + p621 + p622 + p623 + p624 + p625 + 1 <= p672 + p673 + p674 + p675 + p676 + p677 + p678 + p679)) AND X (F ((p450 + p451 + p452 + p453 + p454 <= 1))))))",
"processed_size": 227,
"rewrites": 24
},
"result":
{
"edges": 28,
"markings": 28,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"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": 1737
},
"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": 8,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "G (F ((1 <= p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129)))",
"processed_size": 68,
"rewrites": 24
},
"result":
{
"edges": 412164,
"markings": 318878,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "fairness",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3449
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 3,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 76,
"taut": 0,
"tconj": 1,
"tdisj": 3,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 74,
"visible_transitions": 0
},
"processed": "G ((G ((F (G ((F ((p264 <= p347)) AND ((1 <= p163) OR (p264 <= p347))))) OR (1 <= p455))) OR (p515 + p516 + p517 + p518 + p519 + p521 + p522 + p523 + p524 + p525 + p527 + p528 + p529 + p530 + p531 + p533 + p534 + p535 + p536 + p537 + p539 + p540 + p541 + p542 + p543 + p544 + p538 + p532 + p526 + p520 <= p770 + p771 + p772 + p773 + p774 + p775 + p776 + p777 + p778 + p779 + p780 + p781 + p782 + p783 + p784 + p785 + p786 + p787 + p788 + p789 + p790 + p791 + p792 + p793 + p794 + p795 + p796 + p797 + p798 + p799 + p800 + p801 + p802 + p803 + p804 + p805 + p806 + p807 + p808 + p809)))",
"processed_size": 585,
"rewrites": 24
},
"result":
{
"edges": 491854,
"markings": 291663,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"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": 86608,
"runtime": 135.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "G(F(**)) : G((G((F(G((F(**) AND (** OR **)))) OR **)) OR **)) : X(X(F(**))) : X(G(*)) : (F(**) AND X(X(**))) : X(F(**)) : X(X(X(G((X(**) OR G(**)))))) : G((X(**) OR (G(**) AND X(F(**)))))"
},
"net":
{
"arcs": 19908,
"conflict_clusters": 307,
"places": 810,
"places_significant": 752,
"singleton_clusters": 0,
"transitions": 3254
},
"result":
{
"preliminary_value": "no no no no yes no no no ",
"value": "no no no no yes 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: 4064/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 25920
lola: finding significant places
lola: 810 places, 3254 transitions, 752 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 (X (F (((0 <= 0) U F ((1 <= p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129))))))) : G ((G ((F (G (((1 <= p163) U (p264 <= p347)))) OR (1 <= p455))) OR (p515 + p516 + p517 + p518 + p519 + p521 + p522 + p523 + p524 + p525 + p527 + p528 + p529 + p530 + p531 + p533 + p534 + p535 + p536 + p537 + p539 + p540 + p541 + p542 + p543 + p544 + p538 + p532 + p526 + p520 <= p770 + p771 + p772 + p773 + p774 + p775 + p776 + p777 + p778 + p779 + p780 + p781 + p782 + p783 + p784 + p785 + p786 + p787 + p788 + p789 + p790 + p791 + p792 + p793 + p794 + p795 + p796 + p797 + p798 + p799 + p800 + p801 + p802 + p803 + p804 + p805 + p806 + p807 + p808 + p809))) : F (X (X ((p450 + p451 + p452 + p453 + p454 <= p442 + p443 + p444 + p445 + p446 + p447 + p448 + p449)))) : NOT(X (F (((0 <= 0) U (p708 + p709 + p710 + p711 + p712 + p713 + 1 <= p610 + p611 + p612 + p613 + p614 + p615 + p616 + p617))))) : (F ((p64 + p63 + p62 + p61 + p60 + p59 + p58 + p57 + p56 + p55 + p54 + p53 + p52 + p51 + p50 + p49 + p48 + p47 + p46 + p45 + p44 + p43 + p42 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p65 <= p570 + p571 + p572 + p573 + p574 + p575 + p576 + p577)) AND X (X (((p263 <= p354 + p355 + p356 + p357 + p358 + p359 + p360 + p361) AND (p648 + p649 + p650 + p651 + p652 + p653 + p654 + p655 <= p442 + p443 + p444 + p445 + p446 + p447 + p448 + p449))))) : X (F ((2 <= p578 + p579 + p580 + p581 + p582 + p583 + p584 + p585))) : X (G (X (G (X ((X ((p457 <= p594 + p595 + p596 + p597 + p598 + p599 + p600 + p601)) OR G ((1 <= p315)))))))) : G ((G ((p618 + p619 + p620 + p621 + p622 + p623 + p624 + p625 + 1 <= p672 + p673 + p674 + p675 + p676 + p677 + p678 + p679)) U X ((p450 + p451 + p452 + p453 + p454 <= 1))))
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 434 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (F ((p450 + p451 + p452 + p453 + p454 <= p442 + p443 + p444 + p445 + p446 + p447 + p448 + p449))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (F ((p450 + p451 + p452 + p453 + p454 <= p442 + p443 + p444 + p445 + p446 + p447 + p448 + p449))))
lola: processed formula length: 103
lola: 24 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: 28 markings, 28 edges
lola: subprocess 1 will run for 496 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((p610 + p611 + p612 + p613 + p614 + p615 + p616 + p617 <= p708 + p709 + p710 + p711 + p712 + p713)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((p610 + p611 + p612 + p613 + p614 + p615 + p616 + p617 <= p708 + p709 + p710 + p711 + p712 + p713)))
lola: processed formula length: 106
lola: 24 rewrites
lola: ========================================
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: 28 markings, 28 edges
lola: ========================================
lola: subprocess 2 will run for 579 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F ((p64 + p63 + p62 + p61 + p60 + p59 + p58 + p57 + p56 + p55 + p54 + p53 + p52 + p51 + p50 + p49 + p48 + p47 + p46 + p45 + p44 + p43 + p42 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p65 <= p570 + p571 + p572 + p573 + p574 + p575 + p576 + p577)) AND X (X (((p263 <= p354 + p355 + p356 + p357 + p358 + p359 + p360 + p361) AND (p648 + p649 + p650... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 579 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((p64 + p63 + p62 + p61 + p60 + p59 + p58 + p57 + p56 + p55 + p54 + p53 + p52 + p51 + p50 + p49 + p48 + p47 + p46 + p45 + p44 + p43 + p42 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p65 <= p570 + p571 + p572 + p573 + p574 + p575 + p576 + p577))
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: (p570 + p571 + p572 + p573 + p574 + p575 + p576 + p577 + 1 <= p64 + p63 + p62 + p61 + p60 + p59 + p58 + p57 + p56 + p55 + p54 + p53 + p52 + p51 + p50 + p49 + p48 + p47 + p46 + p45 + p44 + p43 + p42 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p65)
lola: processed formula length: 300
lola: 26 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: subprocess 3 will run for 695 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (((p263 <= p354 + p355 + p356 + p357 + p358 + p359 + p360 + p361) AND (p648 + p649 + p650 + p651 + p652 + p653 + p654 + p655 <= p442 + p443 + p444 + p445 + p446 + p447 + p448 + p449))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (((p263 <= p354 + p355 + p356 + p357 + p358 + p359 + p360 + p361) AND (p648 + p649 + p650 + p651 + p652 + p653 + p654 + p655 <= p442 + p443 + p444 + p445 + p446 + p447 + p448 + p449))))
lola: processed formula length: 190
lola: 24 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: ========================================
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: 28 markings, 42 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 3 will run for 695 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((2 <= p578 + p579 + p580 + p581 + p582 + p583 + p584 + p585)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((2 <= p578 + p579 + p580 + p581 + p582 + p583 + p584 + p585)))
lola: processed formula length: 68
lola: 24 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: 28 markings, 28 edges
lola: ========================================
lola: subprocess 4 will run for 868 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (X (G ((X ((p457 <= p594 + p595 + p596 + p597 + p598 + p599 + p600 + p601)) OR G ((1 <= p315)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (X (G ((X ((p457 <= p594 + p595 + p596 + p597 + p598 + p599 + p600 + p601)) OR G ((1 <= p315)))))))
lola: processed formula length: 104
lola: 24 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 8 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 21519 markings, 27297 edges
lola: ========================================
lola: subprocess 5 will run for 1158 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((X ((p450 + p451 + p452 + p453 + p454 <= 1)) OR (G ((p618 + p619 + p620 + p621 + p622 + p623 + p624 + p625 + 1 <= p672 + p673 + p674 + p675 + p676 + p677 + p678 + p679)) AND X (F ((p450 + p451 + p452 + p453 + p454 <= 1))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((X ((p450 + p451 + p452 + p453 + p454 <= 1)) OR (G ((p618 + p619 + p620 + p621 + p622 + p623 + p624 + p625 + 1 <= p672 + p673 + p674 + p675 + p676 + p677 + p678 + p679)) AND X (F ((p450 + p451 + p452 + p453 + p454 <= 1))))))
lola: processed formula length: 227
lola: 24 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: 28 markings, 28 edges
lola: ========================================
lola: subprocess 6 will run for 1737 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((1 <= p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129)))
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 <= p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129)))
lola: processed formula length: 68
lola: 24 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: 67062 markings, 83181 edges, 13412 markings/sec, 0 secs
lola: 131962 markings, 166622 edges, 12980 markings/sec, 5 secs
lola: 198331 markings, 251432 edges, 13274 markings/sec, 10 secs
lola: 261845 markings, 333656 edges, 12703 markings/sec, 15 secs
lola: 317434 markings, 409242 edges, 11118 markings/sec, 20 secs
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: 318878 markings, 412164 edges
lola: ========================================
lola: subprocess 7 will run for 3449 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((G ((F (G ((F ((p264 <= p347)) AND ((1 <= p163) OR (p264 <= p347))))) OR (1 <= p455))) OR (p515 + p516 + p517 + p518 + p519 + p521 + p522 + p523 + p524 + p525 + p527 + p528 + p529 + p530 + p531 + p533 + p534 + p535 + p536 + p537 + p539 + p540 + p541 + p542 + p543 + p544 + p538 + p532 + p526 + p520 <= p770 + p771 + p772 + p773 + p774 + p775 + p776 + p777 + p778 + p779 + p780 + p781 + p782 + p783... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((G ((F (G ((F ((p264 <= p347)) AND ((1 <= p163) OR (p264 <= p347))))) OR (1 <= p455))) OR (p515 + p516 + p517 + p518 + p519 + p521 + p522 + p523 + p524 + p525 + p527 + p528 + p529 + p530 + p531 + p533 + p534 + p535 + p536 + p537 + p539 + p540 + p541 + p542 + p543 + p544 + p538 + p532 + p526 + p520 <= p770 + p771 + p772 + p773 + p774 + p775 + p776 + p777 + p778 + p779 + p780 + p781 + p782 + p783... (shortened)
lola: processed formula length: 585
lola: 24 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: 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: 99853 markings, 168776 edges, 19971 markings/sec, 0 secs
lola: 200726 markings, 339409 edges, 20175 markings/sec, 5 secs
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: 291663 markings, 491854 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no yes no no no
lola:
preliminary result: no no no no yes no no no
lola: memory consumption: 86608 KB
lola: time consumption: 135 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="PolyORBLF-COL-S06J04T08"
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 PolyORBLF-COL-S06J04T08, 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-162089287100093"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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