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

About the Execution of 2020-gold for PolyORBLF-PT-S06J06T08

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
4380.735 3600000.00 334780.00 187.60 TTTFFFFFTFTTFFFF normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fko/mcc2021-input.r170-oct2-162089287200177.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2021-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2020
Input is PolyORBLF-PT-S06J06T08, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r170-oct2-162089287200177
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 26M
-rw-r--r-- 1 mcc users 71K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 297K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 1.2M May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 5.1M May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 14K Mar 28 16:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 48K Mar 28 16:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Mar 28 16:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 39K Mar 28 16:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Mar 27 09:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 44K Mar 27 09:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 21K Mar 25 12:17 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K Mar 25 12:17 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.6K Mar 22 08:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.8K Mar 22 09:17 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 10 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 20M May 5 16:51 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME PolyORBLF-PT-S06J06T08-00
FORMULA_NAME PolyORBLF-PT-S06J06T08-01
FORMULA_NAME PolyORBLF-PT-S06J06T08-02
FORMULA_NAME PolyORBLF-PT-S06J06T08-03
FORMULA_NAME PolyORBLF-PT-S06J06T08-04
FORMULA_NAME PolyORBLF-PT-S06J06T08-05
FORMULA_NAME PolyORBLF-PT-S06J06T08-06
FORMULA_NAME PolyORBLF-PT-S06J06T08-07
FORMULA_NAME PolyORBLF-PT-S06J06T08-08
FORMULA_NAME PolyORBLF-PT-S06J06T08-09
FORMULA_NAME PolyORBLF-PT-S06J06T08-10
FORMULA_NAME PolyORBLF-PT-S06J06T08-11
FORMULA_NAME PolyORBLF-PT-S06J06T08-12
FORMULA_NAME PolyORBLF-PT-S06J06T08-13
FORMULA_NAME PolyORBLF-PT-S06J06T08-14
FORMULA_NAME PolyORBLF-PT-S06J06T08-15

=== Now, execution of the tool begins

BK_START 1621384001741

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-19 00:26:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2021-05-19 00:26:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-19 00:26:45] [INFO ] Load time of PNML (sax parser for PT used): 803 ms
[2021-05-19 00:26:45] [INFO ] Transformed 894 places.
[2021-05-19 00:26:45] [INFO ] Transformed 14334 transitions.
[2021-05-19 00:26:45] [INFO ] Parsed PT model containing 894 places and 14334 transitions in 1057 ms.
Ensure Unique test removed 10760 transitions
Reduce redundant transitions removed 10760 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 150 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 600 resets, run finished after 1097 ms. (steps per millisecond=91 ) properties seen :[0, 0, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 0, 1, 1, 1, 1, 0, 0, 1, 0, 1, 0, 1, 1, 1]
[2021-05-19 00:26:46] [INFO ] Flow matrix only has 3526 transitions (discarded 48 similar events)
// Phase 1: matrix 3526 rows 894 cols
[2021-05-19 00:26:47] [INFO ] Computed 62 place invariants in 221 ms
[2021-05-19 00:26:47] [INFO ] [Real]Absence check using 19 positive place invariants in 33 ms returned sat
[2021-05-19 00:26:47] [INFO ] [Real]Absence check using 19 positive and 43 generalized place invariants in 40 ms returned unsat
[2021-05-19 00:26:47] [INFO ] [Real]Absence check using 19 positive place invariants in 21 ms returned sat
[2021-05-19 00:26:47] [INFO ] [Real]Absence check using 19 positive and 43 generalized place invariants in 32 ms returned unsat
[2021-05-19 00:26:47] [INFO ] [Real]Absence check using 19 positive place invariants in 21 ms returned sat
[2021-05-19 00:26:47] [INFO ] [Real]Absence check using 19 positive and 43 generalized place invariants in 35 ms returned unsat
[2021-05-19 00:26:47] [INFO ] [Real]Absence check using 19 positive place invariants in 19 ms returned sat
[2021-05-19 00:26:47] [INFO ] [Real]Absence check using 19 positive and 43 generalized place invariants in 53 ms returned unsat
[2021-05-19 00:26:47] [INFO ] [Real]Absence check using 19 positive place invariants in 14 ms returned unsat
[2021-05-19 00:26:47] [INFO ] [Real]Absence check using 19 positive place invariants in 19 ms returned sat
[2021-05-19 00:26:48] [INFO ] [Real]Absence check using 19 positive and 43 generalized place invariants in 57 ms returned sat
[2021-05-19 00:26:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 00:27:03] [INFO ] [Real]Absence check using state equation in 15026 ms returned sat
[2021-05-19 00:27:03] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 00:27:03] [INFO ] [Nat]Absence check using 19 positive place invariants in 23 ms returned sat
[2021-05-19 00:27:03] [INFO ] [Nat]Absence check using 19 positive and 43 generalized place invariants in 61 ms returned unsat
[2021-05-19 00:27:03] [INFO ] [Real]Absence check using 19 positive place invariants in 14 ms returned unsat
[2021-05-19 00:27:03] [INFO ] [Real]Absence check using 19 positive place invariants in 19 ms returned unsat
[2021-05-19 00:27:03] [INFO ] [Real]Absence check using 19 positive place invariants in 118 ms returned sat
[2021-05-19 00:27:03] [INFO ] [Real]Absence check using 19 positive and 43 generalized place invariants in 98 ms returned unsat
[2021-05-19 00:27:04] [INFO ] [Real]Absence check using 19 positive place invariants in 55 ms returned sat
[2021-05-19 00:27:04] [INFO ] [Real]Absence check using 19 positive and 43 generalized place invariants in 61 ms returned sat
[2021-05-19 00:27:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 00:27:17] [INFO ] [Real]Absence check using state equation in 13519 ms returned sat
[2021-05-19 00:27:17] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 00:27:17] [INFO ] [Nat]Absence check using 19 positive place invariants in 35 ms returned sat
[2021-05-19 00:27:18] [INFO ] [Nat]Absence check using 19 positive and 43 generalized place invariants in 154 ms returned sat
[2021-05-19 00:27:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 00:27:29] [INFO ] [Nat]Absence check using state equation in 11562 ms returned sat
[2021-05-19 00:27:29] [INFO ] State equation strengthened by 232 read => feed constraints.
[2021-05-19 00:27:30] [INFO ] [Nat]Added 232 Read/Feed constraints in 690 ms returned sat
[2021-05-19 00:27:31] [INFO ] Deduced a trap composed of 93 places in 1009 ms
[2021-05-19 00:27:34] [INFO ] Deduced a trap composed of 94 places in 2731 ms
[2021-05-19 00:27:35] [INFO ] Deduced a trap composed of 94 places in 1217 ms
[2021-05-19 00:27:37] [INFO ] Deduced a trap composed of 425 places in 1046 ms
[2021-05-19 00:27:38] [INFO ] Deduced a trap composed of 403 places in 973 ms
[2021-05-19 00:27:38] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s6 s7 s10 s19 s20 s23 s30 s33 s36 s37 s38 s39 s42 s45 s47 s48 s50 s51 s52 s56 s57 s59 s61 s62 s63 s64 s66 s67 s72 s73 s79 s80 s83 s85 s86 s88 s90 s91 s92 s93 s96 s98 s101 s102 s105 s107 s108 s109 s112 s113 s114 s115 s119 s122 s123 s125 s126 s127 s132 s136 s137 s146 s147 s148 s149 s161 s165 s166 s167 s173 s176 s185 s188 s189 s191 s194 s197 s198 s200 s204 s205 s206 s207 s208 s209 s210 s211 s212 s213 s214 s215 s216 s217 s221 s223 s224 s225 s226 s228 s232 s236 s237 s239 s241 s242 s243 s244 s247 s250 s253 s255 s259 s261 s263 s269 s270 s272 s274 s275 s276 s277 s279 s281 s285 s287 s289 s293 s296 s297 s300 s303 s305 s306 s307 s309 s310 s312 s313 s314 s319 s322 s323 s324 s325 s327 s331 s336 s337 s338 s342 s344 s345 s346 s347 s348 s349 s350 s351 s354 s355 s356 s359 s364 s368 s370 s372 s375 s376 s377 s378 s379 s384 s386 s387 s391 s392 s396 s400 s401 s402 s403 s407 s408 s410 s414 s415 s420 s421 s429 s432 s436 s437 s438 s440 s441 s443 s446 s447 s452 s453 s455 s460 s461 s464 s465 s466 s467 s468 s470 s474 s475 s476 s478 s480 s483 s484 s485 s486 s489 s493 s497 s498 s500 s501 s502 s507 s509 s510 s515 s519 s520 s521 s522 s523 s525 s526 s527 s530 s532 s534 s535 s536 s537 s540 s541 s542 s543 s547 s556 s560 s561 s562 s565 s566 s568 s569 s570 s572 s577 s578 s579 s580 s583 s584 s589 s591 s593 s594 s596 s599 s601 s605 s608 s612 s613 s614 s615 s616 s617 s619 s622 s623 s626 s632 s634 s635 s636 s637 s639 s640 s642 s644 s646 s649 s656 s657 s658 s660 s661 s670 s671 s672 s673 s674 s675 s677 s680 s681 s684 s686 s687 s688 s690 s692 s693 s702 s704 s705 s706 s711 s712 s713 s714 s717 s718 s719 s720 s722 s725 s726 s731 s733 s736 s738 s742 s743 s744 s747 s752 s753 s755 s756 s758 s760 s762 s763 s767 s769 s770 s771 s772 s777 s778 s779 s780 s784 s792 s797 s798 s800 s801 s802 s806 s810 s812 s815 s824 s827 s828 s830 s832 s833 s834 s840 s841 s843 s845 s846 s848 s851 s852 s858 s860 s861 s862 s863 s870 s873 s874 s875 s876 s877 s879 s880 s881 s883 s884 s886 s887 s888 s889 s891 s893) 0)") while checking expression at index 9
[2021-05-19 00:27:38] [INFO ] [Real]Absence check using 19 positive place invariants in 8 ms returned unsat
[2021-05-19 00:27:38] [INFO ] [Real]Absence check using 19 positive place invariants in 16 ms returned unsat
[2021-05-19 00:27:38] [INFO ] [Real]Absence check using 19 positive place invariants in 30 ms returned unsat
[2021-05-19 00:27:38] [INFO ] [Real]Absence check using 19 positive place invariants in 20 ms returned sat
[2021-05-19 00:27:38] [INFO ] [Real]Absence check using 19 positive and 43 generalized place invariants in 62 ms returned unsat
[2021-05-19 00:27:38] [INFO ] [Real]Absence check using 19 positive place invariants in 14 ms returned unsat
[2021-05-19 00:27:38] [INFO ] [Real]Absence check using 19 positive place invariants in 61 ms returned sat
[2021-05-19 00:27:39] [INFO ] [Real]Absence check using 19 positive and 43 generalized place invariants in 88 ms returned unsat
[2021-05-19 00:27:39] [INFO ] [Real]Absence check using 19 positive place invariants in 6 ms returned unsat
Successfully simplified 16 atomic propositions for a total of 18 simplifications.
[2021-05-19 00:27:39] [INFO ] Initial state reduction rules for CTL removed 8 formulas.
[2021-05-19 00:27:39] [INFO ] Flatten gal took : 474 ms
FORMULA PolyORBLF-PT-S06J06T08-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J06T08-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J06T08-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J06T08-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J06T08-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J06T08-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J06T08-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J06T08-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-19 00:27:40] [INFO ] Flatten gal took : 164 ms
[2021-05-19 00:27:40] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 18 ms.
[2021-05-19 00:27:40] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 40 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ PolyORBLF-PT-S06J06T08 @ 3570 seconds

FORMULA PolyORBLF-PT-S06J06T08-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBLF-PT-S06J06T08-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBLF-PT-S06J06T08-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBLF-PT-S06J06T08-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBLF-PT-S06J06T08-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBLF-PT-S06J06T08-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBLF-PT-S06J06T08-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBLF-PT-S06J06T08-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3320
rslt: Output for LTLCardinality @ PolyORBLF-PT-S06J06T08

{
"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 May 19 00:27:40 2021
",
"timelimit": 3570
},
"child":
[

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 421
},
"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": 56,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 56,
"visible_transitions": 0
},
"processed": "(p100 + p121 + p129 + p142 + p150 + p177 + p202 + p246 + p286 + p295 + p315 + p318 + p321 + p330 + p343 + p360 + p369 + p388 + p417 + p418 + p431 + p433 + p444 + p472 + p504 + p544 + p550 + p555 + p71 + p582 + p585 + p68 + p621 + p633 + p648 + p652 + p666 + p676 + p683 + p701 + p741 + p748 + p749 + p766 + p768 + p809 + p811 + p813 + p839 + p847 + p872 + p892 + p14 + p35 + p77 + p89 <= 2)",
"processed_size": 390,
"rewrites": 21
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 0,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 482
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 9,
"visible_transitions": 0
},
"processed": "X ((p180 <= p175 + p264 + p380 + p495 + p598 + p764 + p853 + p867))",
"processed_size": 67,
"rewrites": 21
},
"result":
{
"edges": 6,
"markings": 7,
"produced_by": "LTL model checker",
"value": true
},
"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": true
},
"task":
{
"compoundnumber": 0,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 482
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 3,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 228,
"taut": 0,
"tconj": 3,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 116,
"visible_transitions": 0
},
"processed": "G ((F ((p2 + p5 + p118 + p155 + p163 + p169 + p203 + p222 + p249 + p251 + p282 + p288 + p299 + p316 + p326 + p333 + p363 + p367 + p393 + p419 + p434 + p499 + p539 + p549 + p559 + p573 + p576 + p602 + p638 + p655 + p664 + p685 + p730 + p805 + p808 + p822 + p29 + p11 + p878 + p54 + p662 + p81 <= p6 + p7 + p102 + p137 + p146 + p176 + p189 + p205 + p214 + p225 + p247 + p250 + p263 + p269 + p272 + p310 + p319 + p324 + p345 + p354 + p421 + p436 + p440 + p465 + p466 + p478 + p493 + p497 + p526 + p534 + p556 + p572 + p594 + p626 + p634 + p637 + p66 + p673 + p675 + p677 + p680 + p686 + p693 + p731 + p743 + p784 + p792 + p59 + p830 + p848 + p881 + p886 + p887 + p37 + p96 + p98)) AND (X (F ((((p144 + p181 + p258 + p278 + p353 + p494 + p575 + p709 <= p256 + p329 + p358 + p643 + p716 + p75) OR (G ((p628 <= p479)) AND F ((p144 + p181 + p258 + p278 + p353 + p494 + p575 + p709 <= p256 + p329 + p358 + p643 + p716 + p75)))) AND G (((1 <= p502) AND (1 <= p355)))))) OR (p2 + p5 + p118 + p155 + p163 + p169 + p203 + p222 + p249 + p251 + p282 + p288 + p299 + p316 + p326 + p333 + p363 + p367 + p393 + p419 + p434 + p499 + p539 + p549 + p559 + p573 + p576 + p602 + p638 + p655 + p664 + p685 + p730 + p805 + p808 + p822 + p29 + p11 + p878 + p54 + p662 + p81 <= p6 + p7 + p102 + p137 + p146 + p176 + p189 + p205 + p214 + p225 + p247 + p250 + p263 + p269 + p272 + p310 + p319 + p324 + p345 + p354 + p421 + p436 + p440 + p465 + p466 + p478 + p493 + p497 + p526 + p534 + p556 + p572 + p594 + p626 + p634 + p637 + p66 + p673 + p675 + p677 + p680 + p686 + p693 + p731 + p743 + p784 + p792 + p59 + p830 + p848 + p881 + p886 + p887 + p37 + p96 + p98))))",
"processed_size": 1636,
"rewrites": 21
},
"result":
{
"edges": 33,
"markings": 33,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 14
},
"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": 562
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"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": "X (G ((X ((p695 <= p825)) AND (p199 <= p144))))",
"processed_size": 47,
"rewrites": 21
},
"result":
{
"edges": 38,
"markings": 38,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"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": 675
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 1,
"X": 2,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 2,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "X (((F ((p764 <= p452)) AND (p781 <= p585)) U (X ((p764 <= p452)) AND G (((3 <= p145) OR (p781 <= p585))))))",
"processed_size": 109,
"rewrites": 21
},
"result":
{
"edges": 3058,
"markings": 1009,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 10
},
"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": 843
},
"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": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G (F ((p405 <= p175)))",
"processed_size": 22,
"rewrites": 21
},
"result":
{
"edges": 9123,
"markings": 5587,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "fairness",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1124
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 15,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 15,
"visible_transitions": 0
},
"processed": "F (G ((p199 + p298 + p395 + p588 + p831 + p698 + p84 <= p201 + p339 + p352 + p488 + p554 + p729 + p849 + p16)))",
"processed_size": 111,
"rewrites": 21
},
"result":
{
"edges": 92,
"markings": 91,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1687
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 56,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 56,
"visible_transitions": 0
},
"processed": "F (G ((p119 + p136 + p149 + p165 + p188 + p208 + p209 + p212 + p228 + p253 + p259 + p270 + p296 + p323 + p327 + p336 + p344 + p391 + p401 + p410 + p420 + p452 + p455 + p484 + p510 + p522 + p530 + p541 + p562 + p570 + p579 + p601 + p617 + p636 + p684 + p687 + p688 + p705 + p711 + p713 + p742 + p755 + p777 + p810 + p824 + p828 + p851 + p861 + p889 + p45 + p19 + p33 + p36 + p80 + p83 + p91 <= 0)))",
"processed_size": 397,
"rewrites": 21
},
"result":
{
"edges": 755577,
"markings": 321120,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3321
},
"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": 14,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 14,
"visible_transitions": 0
},
"processed": "G ((p256 + p329 + p358 + p643 + p716 + p75 + 1 <= p175 + p264 + p380 + p495 + p598 + p764 + p853 + p867))",
"processed_size": 105,
"rewrites": 21
},
"result":
{
"edges": 155,
"markings": 155,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"error": null,
"memory": 125448,
"runtime": 250.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "((** OR (G(**) AND F(**))) AND X(**)) : G((F(**) AND (X(F(((** OR (G(**) AND F(**))) AND G(**)))) OR **))) : F(G(**)) : G(**) : F(G(*)) : X(G((X(**) AND **))) : G(F(**)) : X(((F(**) AND **) U (X(**) AND G(**))))"
},
"net":
{
"arcs": 21252,
"conflict_clusters": 325,
"places": 894,
"places_significant": 832,
"singleton_clusters": 0,
"transitions": 3574
},
"result":
{
"preliminary_value": "yes no no no no no no no ",
"value": "yes no no no no no no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 4468/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 28608
lola: finding significant places
lola: 894 places, 3574 transitions, 832 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: (((1 <= 0) U (G ((p100 + p121 + p129 + p142 + p150 + p177 + p202 + p246 + p286 + p295 + p315 + p318 + p321 + p330 + p343 + p360 + p369 + p388 + p417 + p418 + p431 + p433 + p444 + p472 + p504 + p544 + p550 + p555 + p71 + p582 + p585 + p68 + p621 + p633 + p648 + p652 + p666 + p676 + p683 + p701 + p741 + p748 + p749 + p766 + p768 + p809 + p811 + p813 + p839 + p847 + p872 + p892 + p14 + p35 + p77 + p89 <= 2)) U (p100 + p121 + p129 + p142 + p150 + p177 + p202 + p246 + p286 + p295 + p315 + p318 + p321 + p330 + p343 + p360 + p369 + p388 + p417 + p418 + p431 + p433 + p444 + p472 + p504 + p544 + p550 + p555 + p71 + p582 + p585 + p68 + p621 + p633 + p648 + p652 + p666 + p676 + p683 + p701 + p741 + p748 + p749 + p766 + p768 + p809 + p811 + p813 + p839 + p847 + p872 + p892 + p14 + p35 + p77 + p89 <= 2))) AND X ((p180 <= p175 + p264 + p380 + p495 + p598 + p764 + p853 + p867))) : G ((F (X (((G ((p628 <= p479)) U (p144 + p181 + p258 + p278 + p353 + p494 + p575 + p709 <= p256 + p329 + p358 + p643 + p716 + p75)) AND G (((1 <= p502) AND (1 <= p355)))))) U (p2 + p5 + p118 + p155 + p163 + p169 + p203 + p222 + p249 + p251 + p282 + p288 + p299 + p316 + p326 + p333 + p363 + p367 + p393 + p419 + p434 + p499 + p539 + p549 + p559 + p573 + p576 + p602 + p638 + p655 + p664 + p685 + p730 + p805 + p808 + p822 + p29 + p11 + p878 + p54 + p662 + p81 <= p6 + p7 + p102 + p137 + p146 + p176 + p189 + p205 + p214 + p225 + p247 + p250 + p263 + p269 + p272 + p310 + p319 + p324 + p345 + p354 + p421 + p436 + p440 + p465 + p466 + p478 + p493 + p497 + p526 + p534 + p556 + p572 + p594 + p626 + p634 + p637 + p66 + p673 + p675 + p677 + p680 + p686 + p693 + p731 + p743 + p784 + p792 + p59 + p830 + p848 + p881 + p886 + p887 + p37 + p96 + p98))) : X (F (((1 <= 0) U G ((p199 + p298 + p395 + p588 + p831 + p698 + p84 <= p201 + p339 + p352 + p488 + p554 + p729 + p849 + p16))))) : G ((p256 + p329 + p358 + p643 + p716 + p75 + 1 <= p175 + p264 + p380 + p495 + p598 + p764 + p853 + p867)) : F (NOT(X (F (X ((1 <= p119 + p136 + p149 + p165 + p188 + p208 + p209 + p212 + p228 + p253 + p259 + p270 + p296 + p323 + p327 + p336 + p344 + p391 + p401 + p410 + p420 + p452 + p455 + p484 + p510 + p522 + p530 + p541 + p562 + p570 + p579 + p601 + p617 + p636 + p684 + p687 + p688 + p705 + p711 + p713 + p742 + p755 + p777 + p810 + p824 + p828 + p851 + p861 + p889 + p45 + p19 + p33 + p36 + p80 + p83 + p91)))))) : X (G ((X ((p695 <= p825)) AND (p199 <= p144)))) : G (((1 <= 0) U F ((p405 <= p175)))) : X (((F ((p764 <= p452)) AND (p781 <= p585)) U (X ((p764 <= p452)) AND G (((3 <= p145) OR (p781 <= p585))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k: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:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 421 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p100 + p121 + p129 + p142 + p150 + p177 + p202 + p246 + p286 + p295 + p315 + p318 + p321 + p330 + p343 + p360 + p369 + p388 + p417 + p418 + p431 + p433 + p444 + p472 + p504 + p544 + p550 + p555 + p71 + p582 + p585 + p68 + p621 + p633 + p648 + p652 + p666 + p676 + p683 + p701 + p741 + p748 + p749 + p766 + p768 + p809 + p811 + p813 + p839 + p847 + p872 + p892 + p14 + p35 + p77 + p89 <= 2) OR (G (... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 421 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p100 + p121 + p129 + p142 + p150 + p177 + p202 + p246 + p286 + p295 + p315 + p318 + p321 + p330 + p343 + p360 + p369 + p388 + p417 + p418 + p431 + p433 + p444 + p472 + p504 + p544 + p550 + p555 + p71 + p582 + p585 + p68 + p621 + p633 + p648 + p652 + p666 + p676 + p683 + p701 + p741 + p748 + p749 + p766 + p768 + p809 + p811 + p813 + p839 + p847 + p872 + p892 + p14 + p35 + p77 + p89 <= 2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p100 + p121 + p129 + p142 + p150 + p177 + p202 + p246 + p286 + p295 + p315 + p318 + p321 + p330 + p343 + p360 + p369 + p388 + p417 + p418 + p431 + p433 + p444 + p472 + p504 + p544 + p550 + p555 + p71 + p582 + p585 + p68 + p621 + p633 + p648 + p652 + p666 + p676 + p683 + p701 + p741 + p748 + p749 + p766 + p768 + p809 + p811 + p813 + p839 + p847 + p872 + p892 + p14 + p35 + p77 + p89 <= 2)
lola: processed formula length: 390
lola: 21 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 1 will run for 482 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((p180 <= p175 + p264 + p380 + p495 + p598 + p764 + p853 + p867))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((p180 <= p175 + p264 + p380 + p495 + p598 + p764 + p853 + p867))
lola: processed formula length: 67
lola: 21 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: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 1 will run for 482 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((F ((p2 + p5 + p118 + p155 + p163 + p169 + p203 + p222 + p249 + p251 + p282 + p288 + p299 + p316 + p326 + p333 + p363 + p367 + p393 + p419 + p434 + p499 + p539 + p549 + p559 + p573 + p576 + p602 + p638 + p655 + p664 + p685 + p730 + p805 + p808 + p822 + p29 + p11 + p878 + p54 + p662 + p81 <= p6 + p7 + p102 + p137 + p146 + p176 + p189 + p205 + p214 + p225 + p247 + p250 + p263 + p269 + p272 + p310... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((F ((p2 + p5 + p118 + p155 + p163 + p169 + p203 + p222 + p249 + p251 + p282 + p288 + p299 + p316 + p326 + p333 + p363 + p367 + p393 + p419 + p434 + p499 + p539 + p549 + p559 + p573 + p576 + p602 + p638 + p655 + p664 + p685 + p730 + p805 + p808 + p822 + p29 + p11 + p878 + p54 + p662 + p81 <= p6 + p7 + p102 + p137 + p146 + p176 + p189 + p205 + p214 + p225 + p247 + p250 + p263 + p269 + p272 + p310... (shortened)
lola: processed formula length: 1636
lola: 21 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 14 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: 33 markings, 33 edges
lola: ========================================
lola: subprocess 2 will run for 562 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((X ((p695 <= p825)) AND (p199 <= p144))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((X ((p695 <= p825)) AND (p199 <= p144))))
lola: processed formula length: 47
lola: 21 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: 38 markings, 38 edges
lola: ========================================
lola: subprocess 3 will run for 675 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((F ((p764 <= p452)) AND (p781 <= p585)) U (X ((p764 <= p452)) AND G (((3 <= p145) OR (p781 <= p585))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((F ((p764 <= p452)) AND (p781 <= p585)) U (X ((p764 <= p452)) AND G (((3 <= p145) OR (p781 <= p585))))))
lola: processed formula length: 109
lola: 21 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 10 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: 1009 markings, 3058 edges
lola: ========================================
lola: subprocess 4 will run for 843 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((p405 <= p175)))
lola: ========================================
lola: SUBTASK
lola: checking fairness
lola: fairness not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((p405 <= p175)))
lola: processed formula length: 22
lola: 21 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: 5587 markings, 9123 edges
lola: ========================================
lola: subprocess 5 will run for 1124 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((p199 + p298 + p395 + p588 + p831 + p698 + p84 <= p201 + p339 + p352 + p488 + p554 + p729 + p849 + p16)))
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 ((p199 + p298 + p395 + p588 + p831 + p698 + p84 <= p201 + p339 + p352 + p488 + p554 + p729 + p849 + p16)))
lola: processed formula length: 111
lola: 21 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: 91 markings, 92 edges
lola: ========================================
lola: subprocess 6 will run for 1687 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((p119 + p136 + p149 + p165 + p188 + p208 + p209 + p212 + p228 + p253 + p259 + p270 + p296 + p323 + p327 + p336 + p344 + p391 + p401 + p410 + p420 + p452 + p455 + p484 + p510 + p522 + p530 + p541 + p562 + p570 + p579 + p601 + p617 + p636 + p684 + p687 + p688 + p705 + p711 + p713 + p742 + p755 + p777 + p810 + p824 + p828 + p851 + p861 + p889 + p45 + p19 + p33 + p36 + p80 + p83 + p91 <= 0)))
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 ((p119 + p136 + p149 + p165 + p188 + p208 + p209 + p212 + p228 + p253 + p259 + p270 + p296 + p323 + p327 + p336 + p344 + p391 + p401 + p410 + p420 + p452 + p455 + p484 + p510 + p522 + p530 + p541 + p562 + p570 + p579 + p601 + p617 + p636 + p684 + p687 + p688 + p705 + p711 + p713 + p742 + p755 + p777 + p810 + p824 + p828 + p851 + p861 + p889 + p45 + p19 + p33 + p36 + p80 + p83 + p91 <= 0)))
lola: processed formula length: 397
lola: 21 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: 30454 markings, 74364 edges, 6091 markings/sec, 0 secs
lola: 59875 markings, 134144 edges, 5884 markings/sec, 5 secs
lola: 89620 markings, 195183 edges, 5949 markings/sec, 10 secs
lola: 119654 markings, 257120 edges, 6007 markings/sec, 15 secs
lola: 149145 markings, 330779 edges, 5898 markings/sec, 20 secs
lola: 175750 markings, 398460 edges, 5321 markings/sec, 25 secs
lola: 205092 markings, 470582 edges, 5868 markings/sec, 30 secs
lola: 236483 markings, 550157 edges, 6278 markings/sec, 35 secs
lola: 267282 markings, 622083 edges, 6160 markings/sec, 40 secs
lola: 298533 markings, 696171 edges, 6250 markings/sec, 45 secs
lola: add low 2269
lola: add low 2174
lola: add low 1216
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: 321120 markings, 755577 edges
lola: ========================================
lola: subprocess 7 will run for 3321 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((p256 + p329 + p358 + p643 + p716 + p75 + 1 <= p175 + p264 + p380 + p495 + p598 + p764 + p853 + p867))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((p256 + p329 + p358 + p643 + p716 + p75 + 1 <= p175 + p264 + p380 + p495 + p598 + p764 + p853 + p867))
lola: processed formula length: 105
lola: 21 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: 155 markings, 155 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no no no no no no no
lola:
preliminary result: yes no no no no no no no
lola: memory consumption: 125448 KB
lola: time consumption: 250 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-S06J06T08"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="gold2020"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool gold2020"
echo " Input is PolyORBLF-PT-S06J06T08, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r170-oct2-162089287200177"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-PT-S06J06T08.tgz
mv PolyORBLF-PT-S06J06T08 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;