About the Execution of ITS-LoLa for PolyORBLF-COL-S06J04T04
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
15743.010 | 3600000.00 | 134799.00 | 91.30 | FFFTFFTTFFFFTTTF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2020-input.r176-tajo-158987871800361.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is PolyORBLF-COL-S06J04T04, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r176-tajo-158987871800361
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 332K
-rw-r--r-- 1 mcc users 5.0K Apr 12 05:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 12 05:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 11 05:12 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 11 05:12 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Apr 14 12:46 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 14 12:46 LTLFireability.txt
-rw-r--r-- 1 mcc users 14K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 10 12:43 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Apr 10 12:43 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 9 18:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 9 18:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 10 22:22 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 10 22:22 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 equiv_pt
-rw-r--r-- 1 mcc users 10 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 154K Mar 24 05:37 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-S06J04T04-00
FORMULA_NAME PolyORBLF-COL-S06J04T04-01
FORMULA_NAME PolyORBLF-COL-S06J04T04-02
FORMULA_NAME PolyORBLF-COL-S06J04T04-03
FORMULA_NAME PolyORBLF-COL-S06J04T04-04
FORMULA_NAME PolyORBLF-COL-S06J04T04-05
FORMULA_NAME PolyORBLF-COL-S06J04T04-06
FORMULA_NAME PolyORBLF-COL-S06J04T04-07
FORMULA_NAME PolyORBLF-COL-S06J04T04-08
FORMULA_NAME PolyORBLF-COL-S06J04T04-09
FORMULA_NAME PolyORBLF-COL-S06J04T04-10
FORMULA_NAME PolyORBLF-COL-S06J04T04-11
FORMULA_NAME PolyORBLF-COL-S06J04T04-12
FORMULA_NAME PolyORBLF-COL-S06J04T04-13
FORMULA_NAME PolyORBLF-COL-S06J04T04-14
FORMULA_NAME PolyORBLF-COL-S06J04T04-15
=== Now, execution of the tool begins
BK_START 1591146665461
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 01:11:06] [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]
[2020-06-03 01:11:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 01:11:06] [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.
[2020-06-03 01:11:07] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 568 ms
[2020-06-03 01:11:07] [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,
[2020-06-03 01:11:07] [INFO ] ms2 symmetric to ms1 in transition T_1124
[2020-06-03 01:11:07] [INFO ] ms3 symmetric to ms2 in transition T_1125
[2020-06-03 01:11:07] [INFO ] ms2 symmetric to ms1 in transition T_1125
[2020-06-03 01:11:07] [INFO ] ms3 symmetric to ms2 in transition T_1126
[2020-06-03 01:11:07] [INFO ] ms2 symmetric to ms1 in transition T_1126
[2020-06-03 01:11:07] [INFO ] ms1 symmetric to ms4 in transition T_1126
[2020-06-03 01:11:07] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 454 PT places and 7036.0 transition bindings in 22 ms.
[2020-06-03 01:11:07] [INFO ] Computed order based on color domains.
[2020-06-03 01:11:07] [INFO ] Unfolded HLPN to a Petri net with 454 places and 1614 transitions in 33 ms.
[2020-06-03 01:11:07] [INFO ] Unfolded HLPN properties in 0 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 73 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 510 resets, run finished after 436 ms. (steps per millisecond=229 ) properties seen :[1, 1, 1, 0, 0, 1, 1, 1, 0, 0, 1, 1, 0, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 0, 0, 1, 1, 1, 1, 0, 0, 1, 0, 1, 1, 1, 0, 1, 1, 1]
[2020-06-03 01:11:08] [INFO ] Flow matrix only has 1590 transitions (discarded 24 similar events)
// Phase 1: matrix 1590 rows 454 cols
[2020-06-03 01:11:08] [INFO ] Computed 50 place invariants in 86 ms
[2020-06-03 01:11:08] [INFO ] [Real]Absence check using 19 positive place invariants in 29 ms returned unsat
[2020-06-03 01:11:08] [INFO ] [Real]Absence check using 19 positive place invariants in 17 ms returned sat
[2020-06-03 01:11:08] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 29 ms returned unsat
[2020-06-03 01:11:08] [INFO ] [Real]Absence check using 19 positive place invariants in 12 ms returned unsat
[2020-06-03 01:11:08] [INFO ] [Real]Absence check using 19 positive place invariants in 10 ms returned unsat
[2020-06-03 01:11:08] [INFO ] [Real]Absence check using 19 positive place invariants in 17 ms returned sat
[2020-06-03 01:11:08] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 34 ms returned sat
[2020-06-03 01:11:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 01:11:10] [INFO ] [Real]Absence check using state equation in 1742 ms returned sat
[2020-06-03 01:11:10] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 01:11:10] [INFO ] [Nat]Absence check using 19 positive place invariants in 29 ms returned sat
[2020-06-03 01:11:10] [INFO ] [Nat]Absence check using 19 positive and 31 generalized place invariants in 26 ms returned unsat
[2020-06-03 01:11:10] [INFO ] [Real]Absence check using 19 positive place invariants in 11 ms returned unsat
[2020-06-03 01:11:10] [INFO ] [Real]Absence check using 19 positive place invariants in 6 ms returned unsat
[2020-06-03 01:11:11] [INFO ] [Real]Absence check using 19 positive place invariants in 113 ms returned sat
[2020-06-03 01:11:11] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 104 ms returned unsat
[2020-06-03 01:11:11] [INFO ] [Real]Absence check using 19 positive place invariants in 17 ms returned sat
[2020-06-03 01:11:11] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 29 ms returned unsat
[2020-06-03 01:11:11] [INFO ] [Real]Absence check using 19 positive place invariants in 8 ms returned unsat
[2020-06-03 01:11:11] [INFO ] [Real]Absence check using 19 positive place invariants in 15 ms returned sat
[2020-06-03 01:11:11] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 26 ms returned unsat
[2020-06-03 01:11:11] [INFO ] [Real]Absence check using 19 positive place invariants in 12 ms returned unsat
[2020-06-03 01:11:11] [INFO ] [Real]Absence check using 19 positive place invariants in 15 ms returned sat
[2020-06-03 01:11:11] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 19 ms returned unsat
Successfully simplified 13 atomic propositions for a total of 18 simplifications.
[2020-06-03 01:11:11] [INFO ] Initial state reduction rules for CTL removed 9 formulas.
[2020-06-03 01:11:12] [INFO ] Flatten gal took : 217 ms
FORMULA PolyORBLF-COL-S06J04T04-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S06J04T04-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S06J04T04-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S06J04T04-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S06J04T04-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S06J04T04-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S06J04T04-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S06J04T04-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S06J04T04-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 01:11:12] [INFO ] Applying decomposition
[2020-06-03 01:11:12] [INFO ] Flatten gal took : 145 ms
[2020-06-03 01:11:12] [INFO ] Decomposing Gal with order
[2020-06-03 01:11:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-06-03 01:11:12] [INFO ] Removed a total of 8427 redundant transitions.
[2020-06-03 01:11:12] [INFO ] Flatten gal took : 378 ms
[2020-06-03 01:11:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 40 labels/synchronizations in 57 ms.
[2020-06-03 01:11:13] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2020-06-03 01:11:13] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 15 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ PolyORBLF-COL-S06J04T04 @ 3570 seconds
FORMULA PolyORBLF-COL-S06J04T04-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PolyORBLF-COL-S06J04T04-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PolyORBLF-COL-S06J04T04-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PolyORBLF-COL-S06J04T04-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PolyORBLF-COL-S06J04T04-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PolyORBLF-COL-S06J04T04-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PolyORBLF-COL-S06J04T04-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3458
rslt: Output for LTLCardinality @ PolyORBLF-COL-S06J04T04
{
"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": "Wed Jun 3 01:11:13 2020
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 494
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 494
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "G ((p142 + p143 + p144 + p145 + p146 <= p202))",
"processed_size": 46,
"rewrites": 26
},
"result":
{
"edges": 763,
"markings": 490,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 576
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 0,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 32,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 32,
"visible_transitions": 0
},
"processed": "X (F ((X (F ((1 <= p93 + p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p92 + p91 + p90 + p89 + p88 + p87 + p86 + p94 + p95 + p96 + p97 + p98 + p99))) OR (p238 + p239 + p240 + p241 + 1 <= p70 + p71 + p72 + p73))))",
"processed_size": 236,
"rewrites": 26
},
"result":
{
"edges": 112546,
"markings": 59340,
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 0,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 576
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 89,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 59,
"visible_transitions": 0
},
"processed": "F (G ((F ((1 <= p283 + p284 + p285 + p286 + p287 + p289 + p290 + p291 + p292 + p293 + p295 + p296 + p297 + p298 + p299 + p301 + p302 + p303 + p304 + p305 + p307 + p308 + p309 + p310 + p311 + p312 + p306 + p300 + p294 + p288)) AND (F ((p137 + p138 + p139 + p140 + p141 <= p259 + p260 + p261 + p262 + p263 + p264 + p265 + p266 + p267 + p268 + p269 + p270 + p271 + p272 + p273 + p274 + p275 + p276 + p277 + p278 + p279 + p280 + p281 + p282)) OR X ((1 <= p283 + p284 + p285 + p286 + p287 + p289 + p290 + p291 + p292 + p293 + p295 + p296 + p297 + p298 + p299 + p301 + p302 + p303 + p304 + p305 + p307 + p308 + p309 + p310 + p311 + p312 + p306 + p300 + p294 + p288))))))",
"processed_size": 664,
"rewrites": 26
},
"result":
{
"edges": 39,
"markings": 38,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"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": 691
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X ((F ((p209 <= p84)) OR (1 <= p254)))",
"processed_size": 38,
"rewrites": 26
},
"result":
{
"edges": 6,
"markings": 7,
"produced_by": "LTL model checker",
"value": true
},
"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": 864
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 864
},
"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": "F (G ((p183 + p184 + p185 + p186 <= p342 + p343 + p344 + p345)))",
"processed_size": 64,
"rewrites": 26
},
"result":
{
"edges": 39262,
"markings": 13028,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 3,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1152
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 3,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 18,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 13,
"visible_transitions": 0
},
"processed": "X (F ((G ((p183 + p184 + p185 + p186 + 1 <= p135)) OR (F (G ((p183 + p184 + p185 + p186 + 1 <= p135))) AND F (G ((p77 + p76 + p75 + p74 <= p350 + p351 + p352 + p353)))))))",
"processed_size": 171,
"rewrites": 26
},
"result":
{
"edges": 3434,
"markings": 1452,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"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": 1729
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 3,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 42,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 42,
"visible_transitions": 0
},
"processed": "X (G ((X (X (((p430 + p431 + p432 + p433 + 1 <= p338 + p339 + p340 + p341) R (p380 + p381 + p382 + p383 + 1 <= p188 + p189 + p190 + p191 + p192 + p193)))) AND (p70 + p71 + p72 + p73 <= p434 + p435 + p436 + p437 + p438 + p439 + p440 + p441 + p442 + p443 + p444 + p445 + p446 + p447 + p448 + p449 + p450 + p451 + p452 + p453))))",
"processed_size": 326,
"rewrites": 26
},
"result":
{
"edges": 170,
"markings": 157,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"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": 3458
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3458
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 20,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 20,
"visible_transitions": 0
},
"processed": "(p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 <= 1)",
"processed_size": 124,
"rewrites": 26
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 6,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 6,
"type": "boolean"
}
},
{
"child":
[
{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 20,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 20,
"visible_transitions": 0
},
"processed": "(p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 <= 1)",
"processed_size": 124,
"rewrites": 26
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 7,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "G ((p1 <= p174 + p175 + p176 + p177 + p178))",
"processed_size": 44,
"rewrites": 26
},
"result":
{
"edges": 37,
"markings": 37,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 7,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 46728,
"runtime": 112.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(X(F((X(F(**)) OR **))) OR G(**)) : F(G((F(**) AND (F(**) OR X(**))))) : (G(**) AND **) : X((F(**) OR **)) : (F(G(**)) AND F(G((F(**) AND (** OR X(**)))))) : X(F((G(**) OR (F(G(**)) AND F(G(**)))))) : X(G((X(X((* R *))) AND **)))"
},
"net":
{
"arcs": 9892,
"conflict_clusters": 159,
"places": 454,
"places_significant": 404,
"singleton_clusters": 0,
"transitions": 1614
},
"result":
{
"preliminary_value": "no no no yes no no no ",
"value": "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: 2068/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 14528
lola: finding significant places
lola: 454 places, 1614 transitions, 404 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: (F (X ((F (X ((1 <= p93 + p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p92 + p91 + p90 + p89 + p88 + p87 + p86 + p94 + p95 + p96 + p97 + p98 + p99))) OR (p238 + p239 + p240 + p241 + 1 <= p70 + p71 + p72 + p73)))) OR G ((p142 + p143 + p144 + p145 + p146 <= p202))) : F (G (X ((F ((p137 + p138 + p139 + p140 + p141 <= p259 + p260 + p261 + p262 + p263 + p264 + p265 + p266 + p267 + p268 + p269 + p270 + p271 + p272 + p273 + p274 + p275 + p276 + p277 + p278 + p279 + p280 + p281 + p282)) U X ((1 <= p283 + p284 + p285 + p286 + p287 + p289 + p290 + p291 + p292 + p293 + p295 + p296 + p297 + p298 + p299 + p301 + p302 + p303 + p304 + p305 + p307 + p308 + p309 + p310 + p311 + p312 + p306 + p300 + p294 + p288)))))) : (G ((p1 <= p174 + p175 + p176 + p177 + p178)) AND (p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 <= 1)) : X ((F ((p209 <= p84)) OR (1 <= p254))) : (F (X (X (G ((p183 + p184 + p185 + p186 <= p342 + p343 + p344 + p345))))) AND F (G (((p142 + p143 + p144 + p145 + p146 + 1 <= p61 + p60 + p59 + p58) U X ((1 <= p93 + p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p92 + p91 + p90 + p89 + p88 + p87 + p86 + p94 + p95 + p96 + p97 + p98 + p99)))))) : X ((F (X (F ((p350 + p351 + p352 + p353 + 1 <= p77 + p76 + p75 + p74)))) U F ((F (G ((p77 + p76 + p75 + p74 <= p350 + p351 + p352 + p353))) U G ((p183 + p184 + p185 + p186 + 1 <= p135)))))) : X (G ((X (X (NOT(((p338 + p339 + p340 + p341 <= p430 + p431 + p432 + p433) U (p188 + p189 + p190 + p191 + p192 + p193 <= p380 + p381 + p382 + p383))))) AND (p70 + p71 + p72 + p73 <= p434 + p435 + p436 + p437 + p438 + p439 + p440 + p441 + p442 + p443 + p444 + p445 + p446 + p447 + p448 + p449 + p450 + p451 + p452 + p453))))
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:428
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 494 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (F ((X (F ((1 <= p93 + p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p92 + p91 + p90 + p89 + p88 + p87 + p86 + p94 + p95 + p96 + p97 + p98 + p99))) OR (p238 + p239 + p240 + p241 + 1 <= p70 + p71 + p72 + p73)))) OR G ((p142 + p143 + p144 + p145 + p146 <= p202)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 494 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((p142 + p143 + p144 + p145 + p146 <= p202))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((p142 + p143 + p144 + p145 + p146 <= p202))
lola: processed formula length: 46
lola: 26 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 490 markings, 763 edges
lola: ========================================
lola: subprocess 1 will run for 576 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((X (F ((1 <= p93 + p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p92 + p91 + p90 + p89 + p88 + p87 + p86 + p94 + p95 + p96 + p97 + p98 + p99))) OR (p238 + p239 + p240 + p241 + 1 <= p70 + p71 + p72 + p73))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((X (F ((1 <= p93 + p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p92 + p91 + p90 + p89 + p88 + p87 + p86 + p94 + p95 + p96 + p97 + p98 + p99))) OR (p238 + p239 + p240 + p241 + 1 <= p70 + p71 + p72 + p73))))
lola: processed formula length: 236
lola: 26 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: 59340 markings, 112546 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 576 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((F ((1 <= p283 + p284 + p285 + p286 + p287 + p289 + p290 + p291 + p292 + p293 + p295 + p296 + p297 + p298 + p299 + p301 + p302 + p303 + p304 + p305 + p307 + p308 + p309 + p310 + p311 + p312 + p306 + p300 + p294 + p288)) AND (F ((p137 + p138 + p139 + p140 + p141 <= p259 + p260 + p261 + p262 + p263 + p264 + p265 + p266 + p267 + p268 + p269 + p270 + p271 + p272 + p273 + p274 + p275 + p276 + p27... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((F ((1 <= p283 + p284 + p285 + p286 + p287 + p289 + p290 + p291 + p292 + p293 + p295 + p296 + p297 + p298 + p299 + p301 + p302 + p303 + p304 + p305 + p307 + p308 + p309 + p310 + p311 + p312 + p306 + p300 + p294 + p288)) AND (F ((p137 + p138 + p139 + p140 + p141 <= p259 + p260 + p261 + p262 + p263 + p264 + p265 + p266 + p267 + p268 + p269 + p270 + p271 + p272 + p273 + p274 + p275 + p276 + p27... (shortened)
lola: processed formula length: 664
lola: 26 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: 38 markings, 39 edges
lola: ========================================
lola: subprocess 2 will run for 691 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((F ((p209 <= p84)) OR (1 <= p254)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((F ((p209 <= p84)) OR (1 <= p254)))
lola: processed formula length: 38
lola: 26 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 7 markings, 6 edges
lola: ========================================
lola: subprocess 3 will run for 864 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (G ((p183 + p184 + p185 + p186 <= p342 + p343 + p344 + p345))) AND F (G ((F ((1 <= p93 + p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p92 + p91 + p90 + p89 + p88 + p87 + p86 + p94 + p95 + p96 + p97 + p98 + p99)) AND ((p142 + p143 + p144 + p145 + p146 + 1 <= p61 + p60 + p59 + p58) OR X ((1 <= p93 + p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p92... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 864 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((p183 + p184 + p185 + p186 <= p342 + p343 + p344 + p345)))
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 ((p183 + p184 + p185 + p186 <= p342 + p343 + p344 + p345)))
lola: processed formula length: 64
lola: 26 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 681
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: 13028 markings, 39262 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 4 will run for 1152 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((G ((p183 + p184 + p185 + p186 + 1 <= p135)) OR (F (G ((p183 + p184 + p185 + p186 + 1 <= p135))) AND F (G ((p77 + p76 + p75 + p74 <= p350 + p351 + p352 + p353)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((G ((p183 + p184 + p185 + p186 + 1 <= p135)) OR (F (G ((p183 + p184 + p185 + p186 + 1 <= p135))) AND F (G ((p77 + p76 + p75 + p74 <= p350 + p351 + p352 + p353)))))))
lola: processed formula length: 171
lola: 26 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: 1452 markings, 3434 edges
lola: ========================================
lola: subprocess 5 will run for 1729 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((X (X (((p430 + p431 + p432 + p433 + 1 <= p338 + p339 + p340 + p341) R (p380 + p381 + p382 + p383 + 1 <= p188 + p189 + p190 + p191 + p192 + p193)))) AND (p70 + p71 + p72 + p73 <= p434 + p435 + p436 + p437 + p438 + p439 + p440 + p441 + p442 + p443 + p444 + p445 + p446 + p447 + p448 + p449 + p450 + p451 + p452 + p453))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((X (X (((p430 + p431 + p432 + p433 + 1 <= p338 + p339 + p340 + p341) R (p380 + p381 + p382 + p383 + 1 <= p188 + p189 + p190 + p191 + p192 + p193)))) AND (p70 + p71 + p72 + p73 <= p434 + p435 + p436 + p437 + p438 + p439 + p440 + p441 + p442 + p443 + p444 + p445 + p446 + p447 + p448 + p449 + p450 + p451 + p452 + p453))))
lola: processed formula length: 326
lola: 26 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: 157 markings, 170 edges
lola: ========================================
lola: subprocess 6 will run for 3458 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G ((p1 <= p174 + p175 + p176 + p177 + p178)) AND (p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 <= 1))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 3458 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 <= 1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 <= 1)
lola: processed formula length: 124
lola: 26 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (G ((p1 <= p174 + p175 + p176 + p177 + p178)) AND (p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 <= 1))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: (p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 <= 1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 <= 1)
lola: processed formula length: 124
lola: 26 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: G ((p1 <= p174 + p175 + p176 + p177 + p178))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((p1 <= p174 + p175 + p176 + p177 + p178))
lola: processed formula length: 44
lola: 26 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 37 markings, 37 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no yes no no no
lola:
preliminary result: no no no yes no no no
lola: memory consumption: 46728 KB
lola: time consumption: 112 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-S06J04T04"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itslola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
# 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 itslola"
echo " Input is PolyORBLF-COL-S06J04T04, 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 r176-tajo-158987871800361"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-COL-S06J04T04.tgz
mv PolyORBLF-COL-S06J04T04 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 '
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 ;