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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
4311.979 3600000.00 197968.00 157.90 TFFFFFFTTTFTFTTT 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-162089287000053.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-S02J06T08, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r170-oct2-162089287000053
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 532K
-rw-r--r-- 1 mcc users 21K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 132K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.8K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 68K 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 4.0K Mar 28 16:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 28 16:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 28 16:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 16:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.0K Mar 27 09:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 27 09:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 25 11:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K Mar 25 11:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 22 09:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K 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-S02J06T08-00
FORMULA_NAME PolyORBLF-COL-S02J06T08-01
FORMULA_NAME PolyORBLF-COL-S02J06T08-02
FORMULA_NAME PolyORBLF-COL-S02J06T08-03
FORMULA_NAME PolyORBLF-COL-S02J06T08-04
FORMULA_NAME PolyORBLF-COL-S02J06T08-05
FORMULA_NAME PolyORBLF-COL-S02J06T08-06
FORMULA_NAME PolyORBLF-COL-S02J06T08-07
FORMULA_NAME PolyORBLF-COL-S02J06T08-08
FORMULA_NAME PolyORBLF-COL-S02J06T08-09
FORMULA_NAME PolyORBLF-COL-S02J06T08-10
FORMULA_NAME PolyORBLF-COL-S02J06T08-11
FORMULA_NAME PolyORBLF-COL-S02J06T08-12
FORMULA_NAME PolyORBLF-COL-S02J06T08-13
FORMULA_NAME PolyORBLF-COL-S02J06T08-14
FORMULA_NAME PolyORBLF-COL-S02J06T08-15

=== Now, execution of the tool begins

BK_START 1621375709551

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-18 22:08:31] [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:08:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-18 22:08:31] [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:08:32] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 708 ms
[2021-05-18 22:08:32] [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:08:32] [INFO ] ms2 symmetric to ms1 in transition T_1124
[2021-05-18 22:08:32] [INFO ] ms3 symmetric to ms2 in transition T_1125
[2021-05-18 22:08:32] [INFO ] ms2 symmetric to ms1 in transition T_1125
[2021-05-18 22:08:32] [INFO ] ms3 symmetric to ms2 in transition T_1126
[2021-05-18 22:08:32] [INFO ] ms2 symmetric to ms1 in transition T_1126
[2021-05-18 22:08:32] [INFO ] ms1 symmetric to ms4 in transition T_1126
[2021-05-18 22:08:32] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 690 PT places and 1492.0 transition bindings in 64 ms.
[2021-05-18 22:08:32] [INFO ] Computed order based on color domains.
[2021-05-18 22:08:32] [INFO ] Unfolded HLPN to a Petri net with 690 places and 1306 transitions in 59 ms.
[2021-05-18 22:08:32] [INFO ] Unfolded HLPN properties in 0 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 117 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 17 resets, run finished after 671 ms. (steps per millisecond=149 ) properties seen :[1, 1, 0, 0, 1, 1, 0, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0, 0, 0, 0, 1, 1, 0, 0, 0, 1, 1, 0, 1, 1, 1]
[2021-05-18 22:08:33] [INFO ] Flow matrix only has 1290 transitions (discarded 16 similar events)
// Phase 1: matrix 1290 rows 690 cols
[2021-05-18 22:08:33] [INFO ] Computed 54 place invariants in 62 ms
[2021-05-18 22:08:33] [INFO ] [Real]Absence check using 16 positive place invariants in 132 ms returned unsat
[2021-05-18 22:08:33] [INFO ] [Real]Absence check using 16 positive place invariants in 72 ms returned sat
[2021-05-18 22:08:33] [INFO ] [Real]Absence check using 16 positive and 38 generalized place invariants in 98 ms returned unsat
[2021-05-18 22:08:34] [INFO ] [Real]Absence check using 16 positive place invariants in 19 ms returned sat
[2021-05-18 22:08:34] [INFO ] [Real]Absence check using 16 positive and 38 generalized place invariants in 26 ms returned unsat
[2021-05-18 22:08:34] [INFO ] [Real]Absence check using 16 positive place invariants in 49 ms returned sat
[2021-05-18 22:08:34] [INFO ] [Real]Absence check using 16 positive and 38 generalized place invariants in 65 ms returned unsat
[2021-05-18 22:08:34] [INFO ] [Real]Absence check using 16 positive place invariants in 67 ms returned unsat
[2021-05-18 22:08:34] [INFO ] [Real]Absence check using 16 positive place invariants in 21 ms returned unsat
[2021-05-18 22:08:34] [INFO ] [Real]Absence check using 16 positive place invariants in 100 ms returned sat
[2021-05-18 22:08:34] [INFO ] [Real]Absence check using 16 positive and 38 generalized place invariants in 34 ms returned unsat
[2021-05-18 22:08:35] [INFO ] [Real]Absence check using 16 positive place invariants in 11 ms returned unsat
[2021-05-18 22:08:35] [INFO ] [Real]Absence check using 16 positive place invariants in 19 ms returned sat
[2021-05-18 22:08:35] [INFO ] [Real]Absence check using 16 positive and 38 generalized place invariants in 117 ms returned sat
[2021-05-18 22:08:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 22:08:38] [INFO ] [Real]Absence check using state equation in 3452 ms returned sat
[2021-05-18 22:08:38] [INFO ] State equation strengthened by 104 read => feed constraints.
[2021-05-18 22:08:38] [INFO ] [Real]Added 104 Read/Feed constraints in 78 ms returned sat
[2021-05-18 22:08:38] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 22:08:38] [INFO ] [Nat]Absence check using 16 positive place invariants in 26 ms returned sat
[2021-05-18 22:08:38] [INFO ] [Nat]Absence check using 16 positive and 38 generalized place invariants in 34 ms returned sat
[2021-05-18 22:08:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 22:08:48] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-18 22:08:51] [INFO ] [Nat]Absence check using state equation in 12185 ms returned unknown
[2021-05-18 22:08:51] [INFO ] [Real]Absence check using 16 positive place invariants in 20 ms returned sat
[2021-05-18 22:08:51] [INFO ] [Real]Absence check using 16 positive and 38 generalized place invariants in 36 ms returned sat
[2021-05-18 22:08:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 22:08:54] [INFO ] [Real]Absence check using state equation in 2894 ms returned sat
[2021-05-18 22:08:54] [INFO ] [Real]Added 104 Read/Feed constraints in 30 ms returned sat
[2021-05-18 22:08:54] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 22:08:54] [INFO ] [Nat]Absence check using 16 positive place invariants in 35 ms returned sat
[2021-05-18 22:08:54] [INFO ] [Nat]Absence check using 16 positive and 38 generalized place invariants in 267 ms returned sat
[2021-05-18 22:08:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 22:09:04] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-18 22:09:07] [INFO ] [Nat]Absence check using state equation in 12534 ms returned unknown
[2021-05-18 22:09:07] [INFO ] [Real]Absence check using 16 positive place invariants in 54 ms returned sat
[2021-05-18 22:09:07] [INFO ] [Real]Absence check using 16 positive and 38 generalized place invariants in 24 ms returned unsat
[2021-05-18 22:09:07] [INFO ] [Real]Absence check using 16 positive place invariants in 15 ms returned unsat
[2021-05-18 22:09:07] [INFO ] [Real]Absence check using 16 positive place invariants in 121 ms returned sat
[2021-05-18 22:09:07] [INFO ] [Real]Absence check using 16 positive and 38 generalized place invariants in 36 ms returned sat
[2021-05-18 22:09:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 22:09:09] [INFO ] [Real]Absence check using state equation in 1756 ms returned sat
[2021-05-18 22:09:09] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 22:09:09] [INFO ] [Nat]Absence check using 16 positive place invariants in 20 ms returned sat
[2021-05-18 22:09:09] [INFO ] [Nat]Absence check using 16 positive and 38 generalized place invariants in 34 ms returned sat
[2021-05-18 22:09:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 22:09:11] [INFO ] [Nat]Absence check using state equation in 1955 ms returned sat
[2021-05-18 22:09:12] [INFO ] [Nat]Added 104 Read/Feed constraints in 798 ms returned sat
[2021-05-18 22:09:12] [INFO ] Deduced a trap composed of 73 places in 225 ms
[2021-05-18 22:09:15] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-18 22:09:30] [INFO ] Deduced a trap composed of 2 places in 1195 ms
[2021-05-18 22:09:30] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s356 s359) 0)") while checking expression at index 12
[2021-05-18 22:09:31] [INFO ] [Real]Absence check using 16 positive place invariants in 32 ms returned sat
[2021-05-18 22:09:31] [INFO ] [Real]Absence check using 16 positive and 38 generalized place invariants in 70 ms returned unsat
[2021-05-18 22:09:31] [INFO ] [Real]Absence check using 16 positive place invariants in 78 ms returned sat
[2021-05-18 22:09:31] [INFO ] [Real]Absence check using 16 positive and 38 generalized place invariants in 35 ms returned unsat
[2021-05-18 22:09:31] [INFO ] [Real]Absence check using 16 positive place invariants in 58 ms returned unsat
Successfully simplified 13 atomic propositions for a total of 15 simplifications.
[2021-05-18 22:09:31] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2021-05-18 22:09:31] [INFO ] Flatten gal took : 318 ms
FORMULA PolyORBLF-COL-S02J06T08-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J06T08-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J06T08-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J06T08-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J06T08-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-18 22:09:31] [INFO ] Applying decomposition
[2021-05-18 22:09:32] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2021-05-18 22:09:32] [INFO ] Flatten gal took : 149 ms
[2021-05-18 22:09:32] [INFO ] Decomposing Gal with order
[2021-05-18 22:09:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-18 22:09:32] [INFO ] Removed a total of 3675 redundant transitions.
[2021-05-18 22:09:32] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2021-05-18 22:09:32] [INFO ] Flatten gal took : 408 ms
[2021-05-18 22:09:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 80 labels/synchronizations in 51 ms.
[2021-05-18 22:09:33] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA PolyORBLF-COL-S02J06T08-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J06T08-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-18 22:09:33] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 11 ms.
[2021-05-18 22:09:33] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 28 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ PolyORBLF-COL-S02J06T08 @ 3569 seconds

FORMULA PolyORBLF-COL-S02J06T08-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBLF-COL-S02J06T08-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA PolyORBLF-COL-S02J06T08-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA PolyORBLF-COL-S02J06T08-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA PolyORBLF-COL-S02J06T08-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBLF-COL-S02J06T08-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3446
rslt: Output for LTLCardinality @ PolyORBLF-COL-S02J06T08

{
"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=3569",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Tue May 18 22:09:34 2021
",
"timelimit": 3569
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 383
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 9,
"visible_transitions": 0
},
"processed": "X (G ((p359 <= p514 + p515 + p516 + p517 + p518 + p519 + p520 + p521)))",
"processed_size": 71,
"rewrites": 42
},
"result":
{
"edges": 354,
"markings": 354,
"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": 431
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 16,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 16,
"visible_transitions": 0
},
"processed": "X (X (G ((p506 + p507 + p508 + p509 + p510 + p511 + p512 + p513 <= p626 + p627 + p628 + p629 + p630 + p631 + p632 + p633))))",
"processed_size": 124,
"rewrites": 42
},
"result":
{
"edges": 354,
"markings": 354,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"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": 492
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 1,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 20,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 10,
"visible_transitions": 0
},
"processed": "(X (G (((p514 + p515 + p516 + p517 + p518 + p519 + p520 + p521 <= p608 + p609)))) U (p514 + p515 + p516 + p517 + p518 + p519 + p520 + p521 <= p608 + p609))",
"processed_size": 155,
"rewrites": 42
},
"result":
{
"edges": 354,
"markings": 354,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 575
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 1,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 32,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 24,
"visible_transitions": 0
},
"processed": "F ((X (F ((1 <= p458 + p459 + p460 + p461 + p462 + p463 + p464 + p465))) OR (G ((p17 + p16 + p15 + p14 + p13 + p12 + p11 + p10 <= p564 + p565 + p566 + p567 + p568 + p569 + p570 + p571)) AND X (F ((1 <= p458 + p459 + p460 + p461 + p462 + p463 + p464 + p465))))))",
"processed_size": 261,
"rewrites": 42
},
"result":
{
"edges": 613852,
"markings": 148167,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 5
},
"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": 689
},
"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": 16,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 16,
"visible_transitions": 0
},
"processed": "X (F ((p17 + p16 + p15 + p14 + p13 + p12 + p11 + p10 <= p450 + p451 + p452 + p453 + p454 + p455 + p456 + p457)))",
"processed_size": 112,
"rewrites": 42
},
"result":
{
"edges": 354,
"markings": 354,
"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"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 861
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 9,
"visible_transitions": 0
},
"processed": "X (F ((p506 + p507 + p508 + p509 + p510 + p511 + p512 + p513 + 1 <= p596)))",
"processed_size": 75,
"rewrites": 42
},
"result":
{
"edges": 75950,
"markings": 44687,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"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": 1149
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 17,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 17,
"visible_transitions": 0
},
"processed": "X (X ((G ((1 <= p392 + p393 + p394 + p395 + p396 + p397 + p398 + p399)) AND (p409 <= p498 + p499 + p500 + p501 + p502 + p503 + p504 + p505))))",
"processed_size": 142,
"rewrites": 42
},
"result":
{
"edges": 355,
"markings": 355,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1723
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 1,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 40,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 24,
"visible_transitions": 0
},
"processed": "G ((((1 <= p419 + p420 + p421 + p422 + p423 + p424 + p425 + p426 + p427 + p428 + p429 + p430 + p431 + p432 + p433 + p434) U X ((1 <= p186 + p187 + p188 + p189 + p190 + p191 + p192 + p193))) OR (1 <= p419 + p420 + p421 + p422 + p423 + p424 + p425 + p426 + p427 + p428 + p429 + p430 + p431 + p432 + p433 + p434)))",
"processed_size": 311,
"rewrites": 42
},
"result":
{
"edges": 354,
"markings": 354,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 7,
"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": 3447
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 1,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 48,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 32,
"visible_transitions": 0
},
"processed": "((1 <= p419 + p420 + p421 + p422 + p423 + p424 + p425 + p426 + p427 + p428 + p429 + p430 + p431 + p432 + p433 + p434) U X ((F ((1 <= p186 + p187 + p188 + p189 + p190 + p191 + p192 + p193)) OR (p419 + p420 + p421 + p422 + p423 + p424 + p425 + p426 + p427 + p428 + p429 + p430 + p431 + p432 + p433 + p434 <= p329 + p330 + p331 + p332 + p333 + p334 + p335 + p336))))",
"processed_size": 363,
"rewrites": 42
},
"result":
{
"edges": 4,
"markings": 5,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 8,
"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": 7,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3447
},
"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": 15,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 15,
"visible_transitions": 0
},
"processed": "F (G ((p186 + p187 + p188 + p189 + p190 + p191 + p192 + p193 <= p233 + p234 + p235 + p236 + p237 + p238 + p239)))",
"processed_size": 113,
"rewrites": 42
},
"result":
{
"edges": 1259,
"markings": 1250,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
}
],
"exit":
{
"error": null,
"memory": 53108,
"runtime": 122.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "X(G(**)) : X(X(G(*))) : F(G(**)) : (X(G(**)) U **) : F((X(F(**)) OR (G(**) AND X(F(**))))) : X(F(**)) : X(F(*)) : X(X((G(*) AND **))) : (G(((** U X(**)) OR **)) OR (** U X((F(**) OR **))))"
},
"net":
{
"arcs": 5668,
"conflict_clusters": 261,
"places": 690,
"places_significant": 636,
"singleton_clusters": 0,
"transitions": 1306
},
"result":
{
"preliminary_value": "no no no no yes no yes no yes ",
"value": "no no no no yes no yes no yes "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3569 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: 1996/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 22080
lola: finding significant places
lola: 690 places, 1306 transitions, 636 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 (X ((p359 <= p514 + p515 + p516 + p517 + p518 + p519 + p520 + p521))) : NOT(F (X (X (F ((p626 + p627 + p628 + p629 + p630 + p631 + p632 + p633 + 1 <= p506 + p507 + p508 + p509 + p510 + p511 + p512 + p513)))))) : G (NOT(G (F ((X (X (G ((p233 + p234 + p235 + p236 + p237 + p238 + p239 + 1 <= p186 + p187 + p188 + p189 + p190 + p191 + p192 + p193)))) U X (NOT(G ((p186 + p187 + p188 + p189 + p190 + p191 + p192 + p193 <= p233 + p234 + p235 + p236 + p237 + p238 + p239))))))))) : (X (G (((p514 + p515 + p516 + p517 + p518 + p519 + p520 + p521 <= p608 + p609)))) U (p514 + p515 + p516 + p517 + p518 + p519 + p520 + p521 <= p608 + p609)) : ((0 <= 0) U (G ((p17 + p16 + p15 + p14 + p13 + p12 + p11 + p10 <= p564 + p565 + p566 + p567 + p568 + p569 + p570 + p571)) U F (X ((1 <= p458 + p459 + p460 + p461 + p462 + p463 + p464 + p465))))) : F (X (((p450 + p451 + p452 + p453 + p454 + p455 + p456 + p457 + 1 <= p17 + p16 + p15 + p14 + p13 + p12 + p11 + p10) U (p17 + p16 + p15 + p14 + p13 + p12 + p11 + p10 <= p450 + p451 + p452 + p453 + p454 + p455 + p456 + p457)))) : F (NOT(G (X (G (((1 <= 0) U G ((p596 <= p506 + p507 + p508 + p509 + p510 + p511 + p512 + p513)))))))) : X ((NOT(X (F ((p392 + p393 + p394 + p395 + p396 + p397 + p398 + p399 <= 0)))) AND X ((p409 <= p498 + p499 + p500 + p501 + p502 + p503 + p504 + p505)))) : (G ((((1 <= p419 + p420 + p421 + p422 + p423 + p424 + p425 + p426 + p427 + p428 + p429 + p430 + p431 + p432 + p433 + p434) U X ((1 <= p186 + p187 + p188 + p189 + p190 + p191 + p192 + p193))) OR (1 <= p419 + p420 + p421 + p422 + p423 + p424 + p425 + p426 + p427 + p428 + p429 + p430 + p431 + p432 + p433 + p434))) OR ((1 <= p419 + p420 + p421 + p422 + p423 + p424 + p425 + p426 + p427 + p428 + p429 + p430 + p431 + p432 + p433 + p434) U X ((F ((1 <= p186 + p187 + p188 + p189 + p190 + p191 + p192 + p193)) OR (p419 + p420 + p421 + p422 + p423 + p424 + p425 + p426 + p427 + p428 + p429 + p430 + p431 + p432 + p433 + p434 <= p329 + p330 + p331 + p332 + p333 + p334 + p335 + p336)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
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:525
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 383 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((p359 <= p514 + p515 + p516 + p517 + p518 + p519 + p520 + p521)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((p359 <= p514 + p515 + p516 + p517 + p518 + p519 + p520 + p521)))
lola: processed formula length: 71
lola: 42 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: 354 markings, 354 edges
lola: ========================================
lola: subprocess 1 will run for 431 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (G ((p506 + p507 + p508 + p509 + p510 + p511 + p512 + p513 <= p626 + p627 + p628 + p629 + p630 + p631 + p632 + p633))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (G ((p506 + p507 + p508 + p509 + p510 + p511 + p512 + p513 <= p626 + p627 + p628 + p629 + p630 + p631 + p632 + p633))))
lola: processed formula length: 124
lola: 42 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: 354 markings, 354 edges
lola: ========================================
lola: subprocess 2 will run for 492 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (G (((p514 + p515 + p516 + p517 + p518 + p519 + p520 + p521 <= p608 + p609)))) U (p514 + p515 + p516 + p517 + p518 + p519 + p520 + p521 <= p608 + p609))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (X (G (((p514 + p515 + p516 + p517 + p518 + p519 + p520 + p521 <= p608 + p609)))) U (p514 + p515 + p516 + p517 + p518 + p519 + p520 + p521 <= p608 + p609))
lola: processed formula length: 155
lola: 42 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: 354 markings, 354 edges
lola: ========================================
lola: subprocess 3 will run for 575 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((X (F ((1 <= p458 + p459 + p460 + p461 + p462 + p463 + p464 + p465))) OR (G ((p17 + p16 + p15 + p14 + p13 + p12 + p11 + p10 <= p564 + p565 + p566 + p567 + p568 + p569 + p570 + p571)) AND X (F ((1 <= p458 + p459 + p460 + p461 + p462 + p463 + p464 + p465))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((X (F ((1 <= p458 + p459 + p460 + p461 + p462 + p463 + p464 + p465))) OR (G ((p17 + p16 + p15 + p14 + p13 + p12 + p11 + p10 <= p564 + p565 + p566 + p567 + p568 + p569 + p570 + p571)) AND X (F ((1 <= p458 + p459 + p460 + p461 + p462 + p463 + p464 + p465))))))
lola: processed formula length: 261
lola: 42 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 148167 markings, 613852 edges
lola: ========================================
lola: subprocess 4 will run for 689 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((p17 + p16 + p15 + p14 + p13 + p12 + p11 + p10 <= p450 + p451 + p452 + p453 + p454 + p455 + p456 + p457)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((p17 + p16 + p15 + p14 + p13 + p12 + p11 + p10 <= p450 + p451 + p452 + p453 + p454 + p455 + p456 + p457)))
lola: processed formula length: 112
lola: 42 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: 354 markings, 354 edges
lola: subprocess 5 will run for 861 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((p506 + p507 + p508 + p509 + p510 + p511 + p512 + p513 + 1 <= p596)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((p506 + p507 + p508 + p509 + p510 + p511 + p512 + p513 + 1 <= p596)))
lola: processed formula length: 75
lola: 42 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: ========================================
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: 44687 markings, 75950 edges
lola: ========================================
lola: subprocess 6 will run for 1149 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X ((G ((1 <= p392 + p393 + p394 + p395 + p396 + p397 + p398 + p399)) AND (p409 <= p498 + p499 + p500 + p501 + p502 + p503 + p504 + p505))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X ((G ((1 <= p392 + p393 + p394 + p395 + p396 + p397 + p398 + p399)) AND (p409 <= p498 + p499 + p500 + p501 + p502 + p503 + p504 + p505))))
lola: processed formula length: 142
lola: 42 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: 355 markings, 355 edges
lola: ========================================
lola: subprocess 7 will run for 1723 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G ((((1 <= p419 + p420 + p421 + p422 + p423 + p424 + p425 + p426 + p427 + p428 + p429 + p430 + p431 + p432 + p433 + p434) U X ((1 <= p186 + p187 + p188 + p189 + p190 + p191 + p192 + p193))) OR (1 <= p419 + p420 + p421 + p422 + p423 + p424 + p425 + p426 + p427 + p428 + p429 + p430 + p431 + p432 + p433 + p434))) OR ((1 <= p419 + p420 + p421 + p422 + p423 + p424 + p425 + p426 + p427 + p428 + p429 + ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 1723 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((((1 <= p419 + p420 + p421 + p422 + p423 + p424 + p425 + p426 + p427 + p428 + p429 + p430 + p431 + p432 + p433 + p434) U X ((1 <= p186 + p187 + p188 + p189 + p190 + p191 + p192 + p193))) OR (1 <= p419 + p420 + p421 + p422 + p423 + p424 + p425 + p426 + p427 + p428 + p429 + p430 + p431 + p432 + p433 + p434)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((((1 <= p419 + p420 + p421 + p422 + p423 + p424 + p425 + p426 + p427 + p428 + p429 + p430 + p431 + p432 + p433 + p434) U X ((1 <= p186 + p187 + p188 + p189 + p190 + p191 + p192 + p193))) OR (1 <= p419 + p420 + p421 + p422 + p423 + p424 + p425 + p426 + p427 + p428 + p429 + p430 + p431 + p432 + p433 + p434)))
lola: processed formula length: 311
lola: 42 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: 354 markings, 354 edges
lola: ========================================
lola: subprocess 8 will run for 3447 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p419 + p420 + p421 + p422 + p423 + p424 + p425 + p426 + p427 + p428 + p429 + p430 + p431 + p432 + p433 + p434) U X ((F ((1 <= p186 + p187 + p188 + p189 + p190 + p191 + p192 + p193)) OR (p419 + p420 + p421 + p422 + p423 + p424 + p425 + p426 + p427 + p428 + p429 + p430 + p431 + p432 + p433 + p434 <= p329 + p330 + p331 + p332 + p333 + p334 + p335 + p336))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((1 <= p419 + p420 + p421 + p422 + p423 + p424 + p425 + p426 + p427 + p428 + p429 + p430 + p431 + p432 + p433 + p434) U X ((F ((1 <= p186 + p187 + p188 + p189 + p190 + p191 + p192 + p193)) OR (p419 + p420 + p421 + p422 + p423 + p424 + p425 + p426 + p427 + p428 + p429 + p430 + p431 + p432 + p433 + p434 <= p329 + p330 + p331 + p332 + p333 + p334 + p335 + p336))))
lola: processed formula length: 363
lola: 42 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 5 markings, 4 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 8 will run for 3447 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((p186 + p187 + p188 + p189 + p190 + p191 + p192 + p193 <= p233 + p234 + p235 + p236 + p237 + p238 + p239)))
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 ((p186 + p187 + p188 + p189 + p190 + p191 + p192 + p193 <= p233 + p234 + p235 + p236 + p237 + p238 + p239)))
lola: processed formula length: 113
lola: 42 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: add low 1217
lola: add low 1241
lola: add low 473
lola: add low 457
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: 1250 markings, 1259 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no yes no yes no yes
lola:
preliminary result: no no no no yes no yes no yes
lola: memory consumption: 53108 KB
lola: time consumption: 122 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-S02J06T08"
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-S02J06T08, 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-162089287000053"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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