About the Execution of ITS-LoLa for PolyORBLF-PT-S06J04T06
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
15742.300 | 3600000.00 | 380726.00 | 176.80 | FFTFFFFFFTFFTFFT | 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-158987872000513.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-PT-S06J04T06, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r176-tajo-158987872000513
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 15K Apr 12 05:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 51K Apr 12 05:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 30K Apr 11 05:17 CTLFireability.txt
-rw-r--r-- 1 mcc users 106K Apr 11 05:17 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 13K Apr 14 12:46 LTLCardinality.txt
-rw-r--r-- 1 mcc users 51K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Apr 14 12:46 LTLFireability.txt
-rw-r--r-- 1 mcc users 29K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.0K Apr 10 12:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 29K Apr 10 12:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 339K Apr 9 18:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.1M Apr 9 18:08 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.7K Apr 10 22:22 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.4K Apr 10 22:22 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 10 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 15M 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-PT-S06J04T06-00
FORMULA_NAME PolyORBLF-PT-S06J04T06-01
FORMULA_NAME PolyORBLF-PT-S06J04T06-02
FORMULA_NAME PolyORBLF-PT-S06J04T06-03
FORMULA_NAME PolyORBLF-PT-S06J04T06-04
FORMULA_NAME PolyORBLF-PT-S06J04T06-05
FORMULA_NAME PolyORBLF-PT-S06J04T06-06
FORMULA_NAME PolyORBLF-PT-S06J04T06-07
FORMULA_NAME PolyORBLF-PT-S06J04T06-08
FORMULA_NAME PolyORBLF-PT-S06J04T06-09
FORMULA_NAME PolyORBLF-PT-S06J04T06-10
FORMULA_NAME PolyORBLF-PT-S06J04T06-11
FORMULA_NAME PolyORBLF-PT-S06J04T06-12
FORMULA_NAME PolyORBLF-PT-S06J04T06-13
FORMULA_NAME PolyORBLF-PT-S06J04T06-14
FORMULA_NAME PolyORBLF-PT-S06J04T06-15
=== Now, execution of the tool begins
BK_START 1591160125470
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 04:55:26] [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 04:55:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 04:55:27] [INFO ] Load time of PNML (sax parser for PT used): 453 ms
[2020-06-03 04:55:27] [INFO ] Transformed 632 places.
[2020-06-03 04:55:27] [INFO ] Transformed 10500 transitions.
[2020-06-03 04:55:27] [INFO ] Parsed PT model containing 632 places and 10500 transitions in 549 ms.
Ensure Unique test removed 8070 transitions
Reduce redundant transitions removed 8070 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 90 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 687 resets, run finished after 773 ms. (steps per millisecond=129 ) properties seen :[1, 1, 1, 1, 0, 0, 0, 0, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 0]
[2020-06-03 04:55:28] [INFO ] Flow matrix only has 2394 transitions (discarded 36 similar events)
// Phase 1: matrix 2394 rows 632 cols
[2020-06-03 04:55:28] [INFO ] Computed 54 place invariants in 125 ms
[2020-06-03 04:55:28] [INFO ] [Real]Absence check using 17 positive place invariants in 23 ms returned unsat
[2020-06-03 04:55:28] [INFO ] [Real]Absence check using 17 positive place invariants in 21 ms returned unsat
[2020-06-03 04:55:28] [INFO ] [Real]Absence check using 17 positive place invariants in 22 ms returned sat
[2020-06-03 04:55:28] [INFO ] [Real]Absence check using 17 positive and 37 generalized place invariants in 49 ms returned unsat
[2020-06-03 04:55:28] [INFO ] [Real]Absence check using 17 positive place invariants in 15 ms returned unsat
[2020-06-03 04:55:29] [INFO ] [Real]Absence check using 17 positive place invariants in 14 ms returned unsat
[2020-06-03 04:55:29] [INFO ] [Real]Absence check using 17 positive place invariants in 12 ms returned unsat
[2020-06-03 04:55:29] [INFO ] [Real]Absence check using 17 positive place invariants in 5 ms returned unsat
[2020-06-03 04:55:29] [INFO ] [Real]Absence check using 17 positive place invariants in 18 ms returned sat
[2020-06-03 04:55:29] [INFO ] [Real]Absence check using 17 positive and 37 generalized place invariants in 16 ms returned unsat
[2020-06-03 04:55:29] [INFO ] [Real]Absence check using 17 positive place invariants in 14 ms returned unsat
[2020-06-03 04:55:29] [INFO ] [Real]Absence check using 17 positive place invariants in 15 ms returned unsat
[2020-06-03 04:55:29] [INFO ] [Real]Absence check using 17 positive place invariants in 20 ms returned sat
[2020-06-03 04:55:29] [INFO ] [Real]Absence check using 17 positive and 37 generalized place invariants in 62 ms returned sat
[2020-06-03 04:55:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 04:55:36] [INFO ] [Real]Absence check using state equation in 6853 ms returned sat
[2020-06-03 04:55:36] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 04:55:36] [INFO ] [Nat]Absence check using 17 positive place invariants in 90 ms returned sat
[2020-06-03 04:55:36] [INFO ] [Nat]Absence check using 17 positive and 37 generalized place invariants in 85 ms returned unsat
[2020-06-03 04:55:36] [INFO ] [Real]Absence check using 17 positive place invariants in 7 ms returned unsat
[2020-06-03 04:55:37] [INFO ] [Real]Absence check using 17 positive place invariants in 19 ms returned unsat
Successfully simplified 13 atomic propositions for a total of 15 simplifications.
[2020-06-03 04:55:37] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2020-06-03 04:55:37] [INFO ] Flatten gal took : 401 ms
FORMULA PolyORBLF-PT-S06J04T06-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J04T06-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J04T06-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J04T06-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 04:55:38] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-06-03 04:55:38] [INFO ] Flatten gal took : 167 ms
[2020-06-03 04:55:38] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA PolyORBLF-PT-S06J04T06-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J04T06-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 04:55:38] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 4 ms.
[2020-06-03 04:55:38] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 50 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ PolyORBLF-PT-S06J04T06 @ 3570 seconds
check_solution: Variable C2 = -0.275752782822 is below its lower bound 0
check_solution: Variable C638 = -0.00206401944161 is below its lower bound 0
check_solution: Variable C956 = -0.93210887909 is below its lower bound 0
check_solution: Variable C1274 = -0.0480086803436 is below its lower bound 0
check_solution: Variable C1592 = -4.06130599976 is below its lower bound 0
check_solution: Variable C1910 = -0.454561471939 is below its lower bound 0
check_solution: Variable C2546 = -1.06843662262 is below its lower bound 0
check_solution: Variable C2864 = -1.60336208344 is below its lower bound 0
check_solution: Constraint R3 = 4.67245700087e-310 is above its equality of -1
check_solution: Constraint R6 = 6.57182096586e-311 is above its equality of -9
Seriously low accuracy found ||*|| = 10 (rel. error 4.06131)
FORMULA PolyORBLF-PT-S06J04T06-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PolyORBLF-PT-S06J04T06-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PolyORBLF-PT-S06J04T06-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PolyORBLF-PT-S06J04T06-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PolyORBLF-PT-S06J04T06-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PolyORBLF-PT-S06J04T06-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PolyORBLF-PT-S06J04T06-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PolyORBLF-PT-S06J04T06-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PolyORBLF-PT-S06J04T06-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PolyORBLF-PT-S06J04T06-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3217
rslt: Output for LTLCardinality @ PolyORBLF-PT-S06J04T06
{
"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 04:55:38 2020
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 3,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 134,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 127,
"visible_transitions": 0
},
"processed": "X (((((p149 + p252 + p72 + p310 + p587 + p73 + 1 <= p20) OR (1 <= p148 + p153 + p167 + p192 + p207 + p218 + p235 + p249 + p258 + p265 + p279 + p286 + p293 + p324 + p327 + p365 + p71 + p419 + p469 + p470 + p471 + p481 + p506 + p68 + p538 + p539 + p571 + p56 + p620 + p623 + p627 + p631 + p34 + p37 + p43 + p83)) R ((p114 + p121 + p125 + p131 + p169 + p171 + p181 + p191 + p266 + p275 + p285 + p297 + p300 + p335 + p338 + p349 + p362 + p396 + p400 + p418 + p466 + p478 + p529 + p533 + p548 + p589 + p590 + p603 + p605 + p616 + p617 + p625 + p15 + p27 + p32 + p89 + 1 <= p3 + p8 + p111 + p129 + p133 + p137 + p156 + p160 + p206 + p232 + p268 + p278 + p291 + p292 + p317 + p329 + p366 + p375 + p385 + p435 + p480 + p488 + p490 + p516 + p66 + p534 + p549 + p564 + p565 + p579 + p586 + p23 + p30 + p44 + p85 + p91) R (p149 + p252 + p72 + p310 + p587 + p73 + 1 <= p20))) U (p113 + p177 + p241 + p429 + p526 + p22 + 1 <= p146 + p213 + p352 + p427 + p588 + p262)))",
"processed_size": 956,
"rewrites": 54
},
"result":
{
"edges": 263,
"markings": 263,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"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": 360
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 360
},
"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": 7,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "(p93 <= p136 + p152 + p403 + p440 + p551 + p35)",
"processed_size": 47,
"rewrites": 54
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 1,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 405
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 10,
"visible_transitions": 0
},
"processed": "X (F ((p128 + p209 + p263 + p323 + p505 + 1 <= p140 + p168 + p273 + p407 + p432)))",
"processed_size": 82,
"rewrites": 54
},
"result":
{
"edges": 759372,
"markings": 358571,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 1,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 404
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 404
},
"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": 12,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 12,
"visible_transitions": 0
},
"processed": "G ((p150 + p243 + p77 + p319 + p345 + p621 <= p2 + p135 + p216 + p277 + p521 + p629))",
"processed_size": 85,
"rewrites": 54
},
"result":
{
"edges": 213,
"markings": 213,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 2,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 462
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 4,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 4,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 141,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 67,
"visible_transitions": 0
},
"processed": "G (((G ((p306 + 1 <= p148 + p153 + p167 + p192 + p207 + p218 + p235 + p249 + p258 + p265 + p279 + p286 + p293 + p324 + p327 + p365 + p71 + p419 + p469 + p470 + p471 + p481 + p506 + p68 + p538 + p539 + p571 + p56 + p620 + p623 + p627 + p631 + p34 + p37 + p43 + p83)) R (p306 + 1 <= p148 + p153 + p167 + p192 + p207 + p218 + p235 + p249 + p258 + p265 + p279 + p286 + p293 + p324 + p327 + p365 + p71 + p419 + p469 + p470 + p471 + p481 + p506 + p68 + p538 + p539 + p571 + p56 + p620 + p623 + p627 + p631 + p34 + p37 + p43 + p83)) OR G ((X ((p306 + 1 <= p148 + p153 + p167 + p192 + p207 + p218 + p235 + p249 + p258 + p265 + p279 + p286 + p293 + p324 + p327 + p365 + p71 + p419 + p469 + p470 + p471 + p481 + p506 + p68 + p538 + p539 + p571 + p56 + p620 + p623 + p627 + p631 + p34 + p37 + p43 + p83)) AND G ((p1 + p4 + p118 + p194 + p208 + p231 + p256 + p270 + p274 + p308 + p357 + p382 + p388 + p390 + p393 + p416 + p467 + p468 + p475 + p484 + p485 + p502 + p514 + p550 + p607 + p618 + p14 + p17 + p38 + p94 <= 1))))))",
"processed_size": 1012,
"rewrites": 54
},
"result":
{
"edges": 263,
"markings": 263,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 28
},
"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": 539
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 1,
"U": 0,
"X": 2,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 0,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "X (F ((X (G ((F ((1 <= p47)) OR ((p78 <= p284) AND (p410 <= p96))))) OR F ((p410 <= p96)))))",
"processed_size": 92,
"rewrites": 54
},
"result":
{
"edges": 6,
"markings": 7,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 647
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 2,
"U": 0,
"X": 4,
"aconj": 0,
"adisj": 0,
"aneg": 3,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (X (X (X (G ((F ((p353 + 1 <= p35)) AND (F ((p35 <= p353)) OR G (F ((p353 + 1 <= p35))))))))))",
"processed_size": 96,
"rewrites": 54
},
"result":
{
"edges": 263,
"markings": 263,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 8
},
"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": 809
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (X (G ((F ((p168 + 1 <= p426)) AND (p168 + 1 <= p426)))))",
"processed_size": 59,
"rewrites": 54
},
"result":
{
"edges": 263,
"markings": 263,
"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": 1078
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "F ((F (G ((p52 + 1 <= p93))) AND (p397 <= p585)))",
"processed_size": 49,
"rewrites": 54
},
"result":
{
"edges": 37,
"markings": 37,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1618
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 1,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 14,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 13,
"visible_transitions": 0
},
"processed": "(F ((3 <= p592)) U ((p592 <= 2) AND (p198 + p283 + p358 + p483 + p562 + p19 + 1 <= p112 + p143 + p188 + p210 + p546 + p558)))",
"processed_size": 125,
"rewrites": 54
},
"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"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3236
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3236
},
"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": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(p594 <= 0)",
"processed_size": 11,
"rewrites": 54
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 9,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 9,
"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": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(p594 <= 0)",
"processed_size": 11,
"rewrites": 54
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 10,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"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": "F ((G ((p594 <= 0)) OR (p331 + 1 <= p434)))",
"processed_size": 43,
"rewrites": 54
},
"result":
{
"edges": 298735,
"markings": 162109,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 11,
"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": 10,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 132004,
"runtime": 353.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "X(((* R (* R *)) U **)) : (X(F(**)) AND **) : (X((X(X(F(**))) AND ((** U **) OR **))) AND G(**)) : G(((G(*) R *) OR G((X(*) AND G(*))))) : (F(**) U **) : X(F((X(G((F(**) OR **))) OR F(**)))) : (F((G(*) OR *)) AND **) : X(X(X(X(G((F(*) AND (F(*) OR G(F(*))))))))) : F((F(G(*)) AND **)) : X(X(G((F(*) AND **))))"
},
"net":
{
"arcs": 14880,
"conflict_clusters": 233,
"places": 632,
"places_significant": 578,
"singleton_clusters": 0,
"transitions": 2430
},
"result":
{
"preliminary_value": "no no no no no yes no no no no ",
"value": "no no no no no yes no no no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 3062/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 20224
lola: finding significant places
lola: 632 places, 2430 transitions, 578 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: X ((NOT((((p20 <= p149 + p252 + p72 + p310 + p587 + p73) AND (p148 + p153 + p167 + p192 + p207 + p218 + p235 + p249 + p258 + p265 + p279 + p286 + p293 + p324 + p327 + p365 + p71 + p419 + p469 + p470 + p471 + p481 + p506 + p68 + p538 + p539 + p571 + p56 + p620 + p623 + p627 + p631 + p34 + p37 + p43 + p83 <= 0)) U ((p3 + p8 + p111 + p129 + p133 + p137 + p156 + p160 + p206 + p232 + p268 + p278 + p291 + p292 + p317 + p329 + p366 + p375 + p385 + p435 + p480 + p488 + p490 + p516 + p66 + p534 + p549 + p564 + p565 + p579 + p586 + p23 + p30 + p44 + p85 + p91 <= p114 + p121 + p125 + p131 + p169 + p171 + p181 + p191 + p266 + p275 + p285 + p297 + p300 + p335 + p338 + p349 + p362 + p396 + p400 + p418 + p466 + p478 + p529 + p533 + p548 + p589 + p590 + p603 + p605 + p616 + p617 + p625 + p15 + p27 + p32 + p89) U (p20 <= p149 + p252 + p72 + p310 + p587 + p73)))) U (p113 + p177 + p241 + p429 + p526 + p22 + 1 <= p146 + p213 + p352 + p427 + p588 + p262))) : (X (F ((p128 + p209 + p263 + p323 + p505 + 1 <= p140 + p168 + p273 + p407 + p432))) AND (p93 <= p136 + p152 + p403 + p440 + p551 + p35)) : ((X (X (X (F ((p150 + p243 + p77 + p319 + p345 + p621 <= p2 + p135 + p216 + p277 + p521 + p629))))) AND X ((((p80 + p130 + p204 + p341 + p402 + p492 <= p114 + p121 + p125 + p131 + p169 + p171 + p181 + p191 + p266 + p275 + p285 + p297 + p300 + p335 + p338 + p349 + p362 + p396 + p400 + p418 + p466 + p478 + p529 + p533 + p548 + p589 + p590 + p603 + p605 + p616 + p617 + p625 + p15 + p27 + p32 + p89) U (p189 + p260 + p326 + p386 + p460 + p624 <= p101 + p145 + p225 + p381 + p498 + p11)) OR (p253 <= p522)))) AND G ((p150 + p243 + p77 + p319 + p345 + p621 <= p2 + p135 + p216 + p277 + p521 + p629))) : G ((NOT((F ((p148 + p153 + p167 + p192 + p207 + p218 + p235 + p249 + p258 + p265 + p279 + p286 + p293 + p324 + p327 + p365 + p71 + p419 + p469 + p470 + p471 + p481 + p506 + p68 + p538 + p539 + p571 + p56 + p620 + p623 + p627 + p631 + p34 + p37 + p43 + p83 <= p306)) U (p148 + p153 + p167 + p192 + p207 + p218 + p235 + p249 + p258 + p265 + p279 + p286 + p293 + p324 + p327 + p365 + p71 + p419 + p469 + p470 + p471 + p481 + p506 + p68 + p538 + p539 + p571 + p56 + p620 + p623 + p627 + p631 + p34 + p37 + p43 + p83 <= p306))) OR NOT(F ((X ((p148 + p153 + p167 + p192 + p207 + p218 + p235 + p249 + p258 + p265 + p279 + p286 + p293 + p324 + p327 + p365 + p71 + p419 + p469 + p470 + p471 + p481 + p506 + p68 + p538 + p539 + p571 + p56 + p620 + p623 + p627 + p631 + p34 + p37 + p43 + p83 <= p306)) OR F ((2 <= p1 + p4 + p118 + p194 + p208 + p231 + p256 + p270 + p274 + p308 + p357 + p382 + p388 + p390 + p393 + p416 + p467 + p468 + p475 + p484 + p485 + p502 + p514 + p550 + p607 + p618 + p14 + p17 + p38 + p94))))))) : (F ((3 <= p592)) U ((p592 <= 2) AND (p198 + p283 + p358 + p483 + p562 + p19 + 1 <= p112 + p143 + p188 + p210 + p546 + p558))) : F (X ((G (X ((F ((1 <= p47)) OR ((p78 <= p284) AND (p410 <= p96))))) OR F (((1 <= p47) U (p410 <= p96)))))) : (NOT(G ((F ((1 <= p594)) AND (p434 <= p331)))) AND (p594 <= 0)) : X (G (X (X (NOT(X (F ((G ((p353 + 1 <= p35)) U G ((p35 <= p353)))))))))) : F (((0 <= 0) U (X (NOT(G (X (F ((p93 <= p52)))))) AND (p397 <= p585)))) : G (X (X (G ((NOT(G ((p426 <= p168))) AND (p168 + 1 <= p426))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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: rewrite Frontend/Parser/formula_rewrite.k:525
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:100
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((((p149 + p252 + p72 + p310 + p587 + p73 + 1 <= p20) OR (1 <= p148 + p153 + p167 + p192 + p207 + p218 + p235 + p249 + p258 + p265 + p279 + p286 + p293 + p324 + p327 + p365 + p71 + p419 + p469 + p470 + p471 + p481 + p506 + p68 + p538 + p539 + p571 + p56 + p620 + p623 + p627 + p631 + p34 + p37 + p43 + p83)) R ((p114 + p121 + p125 + p131 + p169 + p171 + p181 + p191 + p266 + p275 + p285 + p297 + ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((((p149 + p252 + p72 + p310 + p587 + p73 + 1 <= p20) OR (1 <= p148 + p153 + p167 + p192 + p207 + p218 + p235 + p249 + p258 + p265 + p279 + p286 + p293 + p324 + p327 + p365 + p71 + p419 + p469 + p470 + p471 + p481 + p506 + p68 + p538 + p539 + p571 + p56 + p620 + p623 + p627 + p631 + p34 + p37 + p43 + p83)) R ((p114 + p121 + p125 + p131 + p169 + p171 + p181 + p191 + p266 + p275 + p285 + p297 + ... (shortened)
lola: processed formula length: 956
lola: 54 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: 263 markings, 263 edges
lola: ========================================
lola: subprocess 1 will run for 360 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (F ((p128 + p209 + p263 + p323 + p505 + 1 <= p140 + p168 + p273 + p407 + p432))) AND (p93 <= p136 + p152 + p403 + p440 + p551 + p35))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 360 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p93 <= p136 + p152 + p403 + p440 + p551 + p35)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p93 <= p136 + p152 + p403 + p440 + p551 + p35)
lola: processed formula length: 47
lola: 54 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 405 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((p128 + p209 + p263 + p323 + p505 + 1 <= p140 + p168 + p273 + p407 + p432)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((p128 + p209 + p263 + p323 + p505 + 1 <= p140 + p168 + p273 + p407 + p432)))
lola: processed formula length: 82
lola: 54 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: 358571 markings, 759372 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 404 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X ((X (X (F ((p150 + p243 + p77 + p319 + p345 + p621 <= p2 + p135 + p216 + p277 + p521 + p629)))) AND (((p80 + p130 + p204 + p341 + p402 + p492 <= p114 + p121 + p125 + p131 + p169 + p171 + p181 + p191 + p266 + p275 + p285 + p297 + p300 + p335 + p338 + p349 + p362 + p396 + p400 + p418 + p466 + p478 + p529 + p533 + p548 + p589 + p590 + p603 + p605 + p616 + p617 + p625 + p15 + p27 + p32 + p89) U (p1... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 404 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((p150 + p243 + p77 + p319 + p345 + p621 <= p2 + p135 + p216 + p277 + p521 + p629))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((p150 + p243 + p77 + p319 + p345 + p621 <= p2 + p135 + p216 + p277 + p521 + p629))
lola: processed formula length: 85
lola: 54 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: 213 markings, 213 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 3 will run for 462 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((G ((p306 + 1 <= p148 + p153 + p167 + p192 + p207 + p218 + p235 + p249 + p258 + p265 + p279 + p286 + p293 + p324 + p327 + p365 + p71 + p419 + p469 + p470 + p471 + p481 + p506 + p68 + p538 + p539 + p571 + p56 + p620 + p623 + p627 + p631 + p34 + p37 + p43 + p83)) R (p306 + 1 <= p148 + p153 + p167 + p192 + p207 + p218 + p235 + p249 + p258 + p265 + p279 + p286 + p293 + p324 + p327 + p365 + p71 + p... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((G ((p306 + 1 <= p148 + p153 + p167 + p192 + p207 + p218 + p235 + p249 + p258 + p265 + p279 + p286 + p293 + p324 + p327 + p365 + p71 + p419 + p469 + p470 + p471 + p481 + p506 + p68 + p538 + p539 + p571 + p56 + p620 + p623 + p627 + p631 + p34 + p37 + p43 + p83)) R (p306 + 1 <= p148 + p153 + p167 + p192 + p207 + p218 + p235 + p249 + p258 + p265 + p279 + p286 + p293 + p324 + p327 + p365 + p71 + p... (shortened)
lola: processed formula length: 1012
lola: 54 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 28 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: 263 markings, 263 edges
lola: ========================================
lola: subprocess 4 will run for 539 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((X (G ((F ((1 <= p47)) OR ((p78 <= p284) AND (p410 <= p96))))) OR F ((p410 <= p96)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((X (G ((F ((1 <= p47)) OR ((p78 <= p284) AND (p410 <= p96))))) OR F ((p410 <= p96)))))
lola: processed formula length: 92
lola: 54 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: 7 markings, 6 edges
lola: ========================================
lola: subprocess 5 will run for 647 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (X (X (G ((F ((p353 + 1 <= p35)) AND (F ((p35 <= p353)) OR G (F ((p353 + 1 <= p35))))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (X (X (G ((F ((p353 + 1 <= p35)) AND (F ((p35 <= p353)) OR G (F ((p353 + 1 <= p35))))))))))
lola: processed formula length: 96
lola: 54 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 8 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 263 markings, 263 edges
lola: ========================================
lola: subprocess 6 will run for 809 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (G ((F ((p168 + 1 <= p426)) AND (p168 + 1 <= p426)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (G ((F ((p168 + 1 <= p426)) AND (p168 + 1 <= p426)))))
lola: processed formula length: 59
lola: 54 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: 263 markings, 263 edges
lola: ========================================
lola: subprocess 7 will run for 1078 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((F (G ((p52 + 1 <= p93))) AND (p397 <= p585)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((F (G ((p52 + 1 <= p93))) AND (p397 <= p585)))
lola: processed formula length: 49
lola: 54 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 37 markings, 37 edges
lola: ========================================
lola: subprocess 8 will run for 1618 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F ((3 <= p592)) U ((p592 <= 2) AND (p198 + p283 + p358 + p483 + p562 + p19 + 1 <= p112 + p143 + p188 + p210 + p546 + p558)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (F ((3 <= p592)) U ((p592 <= 2) AND (p198 + p283 + p358 + p483 + p562 + p19 + 1 <= p112 + p143 + p188 + p210 + p546 + p558)))
lola: processed formula length: 125
lola: 54 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: subprocess 9 will run for 3236 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F ((G ((p594 <= 0)) OR (p331 + 1 <= p434))) AND (p594 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 3236 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p594 <= 0)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p594 <= 0)
lola: processed formula length: 11
lola: 54 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: (F ((G ((p594 <= 0)) OR (p331 + 1 <= p434))) AND (p594 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: (p594 <= 0)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p594 <= 0)
lola: processed formula length: 11
lola: 54 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: F ((G ((p594 <= 0)) OR (p331 + 1 <= p434)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((G ((p594 <= 0)) OR (p331 + 1 <= p434)))
lola: processed formula length: 43
lola: 54 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: 39230 markings, 71743 edges, 7846 markings/sec, 0 secs
lola: 82024 markings, 151169 edges, 8559 markings/sec, 5 secs
lola: 122917 markings, 226518 edges, 8179 markings/sec, 10 secs
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 162109 markings, 298735 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no no yes no no no no
lola:
preliminary result: no no no no no yes no no no no
lola: memory consumption: 132004 KB
lola: time consumption: 353 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-PT-S06J04T06"
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-PT-S06J04T06, 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-158987872000513"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-PT-S06J04T06.tgz
mv PolyORBLF-PT-S06J04T06 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 ;