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-158987871900457.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-S04J04T06, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r176-tajo-158987871900457
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.1M
-rw-r--r-- 1 mcc users 9.0K Apr 12 05:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Apr 12 05:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 11 04:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Apr 11 04:59 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 12K Apr 14 12:46 LTLCardinality.txt
-rw-r--r-- 1 mcc users 47K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Apr 14 12:46 LTLFireability.txt
-rw-r--r-- 1 mcc users 31K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.6K Apr 10 12:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 29K Apr 10 12:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 46K Apr 9 17:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 147K Apr 9 17:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.8K Apr 10 22:22 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.1K 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 3.6M 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-S04J04T06-00
FORMULA_NAME PolyORBLF-PT-S04J04T06-01
FORMULA_NAME PolyORBLF-PT-S04J04T06-02
FORMULA_NAME PolyORBLF-PT-S04J04T06-03
FORMULA_NAME PolyORBLF-PT-S04J04T06-04
FORMULA_NAME PolyORBLF-PT-S04J04T06-05
FORMULA_NAME PolyORBLF-PT-S04J04T06-06
FORMULA_NAME PolyORBLF-PT-S04J04T06-07
FORMULA_NAME PolyORBLF-PT-S04J04T06-08
FORMULA_NAME PolyORBLF-PT-S04J04T06-09
FORMULA_NAME PolyORBLF-PT-S04J04T06-10
FORMULA_NAME PolyORBLF-PT-S04J04T06-11
FORMULA_NAME PolyORBLF-PT-S04J04T06-12
FORMULA_NAME PolyORBLF-PT-S04J04T06-13
FORMULA_NAME PolyORBLF-PT-S04J04T06-14
FORMULA_NAME PolyORBLF-PT-S04J04T06-15

=== Now, execution of the tool begins

BK_START 1591154689301

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 03:24:50] [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 03:24:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 03:24:51] [INFO ] Load time of PNML (sax parser for PT used): 180 ms
[2020-06-03 03:24:51] [INFO ] Transformed 554 places.
[2020-06-03 03:24:51] [INFO ] Transformed 2998 transitions.
[2020-06-03 03:24:51] [INFO ] Parsed PT model containing 554 places and 2998 transitions in 230 ms.
Ensure Unique test removed 1626 transitions
Reduce redundant transitions removed 1626 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 45 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 4 resets, run finished after 524 ms. (steps per millisecond=190 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1]
[2020-06-03 03:24:51] [INFO ] Flow matrix only has 1348 transitions (discarded 24 similar events)
// Phase 1: matrix 1348 rows 554 cols
[2020-06-03 03:24:51] [INFO ] Computed 50 place invariants in 76 ms
[2020-06-03 03:24:51] [INFO ] [Real]Absence check using 16 positive place invariants in 23 ms returned unsat
[2020-06-03 03:24:52] [INFO ] [Real]Absence check using 16 positive place invariants in 11 ms returned unsat
[2020-06-03 03:24:52] [INFO ] [Real]Absence check using 16 positive place invariants in 10 ms returned unsat
[2020-06-03 03:24:52] [INFO ] [Real]Absence check using 16 positive place invariants in 10 ms returned unsat
[2020-06-03 03:24:52] [INFO ] [Real]Absence check using 16 positive place invariants in 13 ms returned sat
[2020-06-03 03:24:52] [INFO ] [Real]Absence check using 16 positive and 34 generalized place invariants in 30 ms returned sat
[2020-06-03 03:24:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:24:54] [INFO ] [Real]Absence check using state equation in 1854 ms returned sat
[2020-06-03 03:24:54] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 03:24:54] [INFO ] [Nat]Absence check using 16 positive place invariants in 23 ms returned sat
[2020-06-03 03:24:54] [INFO ] [Nat]Absence check using 16 positive and 34 generalized place invariants in 29 ms returned unsat
[2020-06-03 03:24:54] [INFO ] [Real]Absence check using 16 positive place invariants in 14 ms returned unsat
[2020-06-03 03:24:54] [INFO ] [Real]Absence check using 16 positive place invariants in 5 ms returned unsat
[2020-06-03 03:24:54] [INFO ] [Real]Absence check using 16 positive place invariants in 16 ms returned sat
[2020-06-03 03:24:54] [INFO ] [Real]Absence check using 16 positive and 34 generalized place invariants in 40 ms returned unsat
[2020-06-03 03:24:54] [INFO ] [Real]Absence check using 16 positive place invariants in 7 ms returned unsat
[2020-06-03 03:24:54] [INFO ] [Real]Absence check using 16 positive place invariants in 19 ms returned sat
[2020-06-03 03:24:54] [INFO ] [Real]Absence check using 16 positive and 34 generalized place invariants in 45 ms returned sat
[2020-06-03 03:24:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:24:57] [INFO ] [Real]Absence check using state equation in 2659 ms returned sat
[2020-06-03 03:24:57] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 03:24:57] [INFO ] [Nat]Absence check using 16 positive place invariants in 21 ms returned sat
[2020-06-03 03:24:57] [INFO ] [Nat]Absence check using 16 positive and 34 generalized place invariants in 57 ms returned sat
[2020-06-03 03:24:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 03:25:04] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 03:25:07] [INFO ] [Nat]Absence check using state equation in 10299 ms returned unknown
[2020-06-03 03:25:08] [INFO ] [Real]Absence check using 16 positive place invariants in 6 ms returned unsat
Successfully simplified 10 atomic propositions for a total of 13 simplifications.
[2020-06-03 03:25:08] [INFO ] Initial state reduction rules for CTL removed 6 formulas.
[2020-06-03 03:25:08] [INFO ] Flatten gal took : 157 ms
FORMULA PolyORBLF-PT-S04J04T06-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J04T06-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J04T06-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J04T06-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J04T06-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J04T06-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 03:25:08] [INFO ] Flatten gal took : 92 ms
[2020-06-03 03:25:08] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2020-06-03 03:25:08] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 15 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ PolyORBLF-PT-S04J04T06 @ 3570 seconds

FORMULA PolyORBLF-PT-S04J04T06-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBLF-PT-S04J04T06-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBLF-PT-S04J04T06-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBLF-PT-S04J04T06-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBLF-PT-S04J04T06-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBLF-PT-S04J04T06-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA PolyORBLF-PT-S04J04T06-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA PolyORBLF-PT-S04J04T06-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3244
rslt: Output for LTLCardinality @ PolyORBLF-PT-S04J04T06

{
"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 03:25:08 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 336
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 1,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 85,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 56,
"visible_transitions": 0
},
"processed": "X (G ((((p191 <= p247 + p293 + p330 + p407 + p75 + p12) U (p393 + p428 + p485 + p508 + p15 <= p113 + p125 + p154 + p162 + p177 + p198 + p211 + p249 + p254 + p281 + p298 + p318 + p354 + p373 + p378 + p420 + p431 + p462 + p509 + p68 + p19 + p48 + p79 + p98)) OR (G ((p9 + p126 + p136 + p196 + p241 + p260 + p325 + p335 + p348 + p391 + p421 + p436 + p456 + p477 + p512 + p49 + p53 + p550 + p529 + p87 <= 0)) AND F ((p393 + p428 + p485 + p508 + p15 <= p113 + p125 + p154 + p162 + p177 + p198 + p211 + p249 + p254 + p281 + p298 + p318 + p354 + p373 + p378 + p420 + p431 + p462 + p509 + p68 + p19 + p48 + p79 + p98))))))",
"processed_size": 614,
"rewrites": 55
},
"result":
{
"edges": 783,
"markings": 783,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 8
},
"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": 373
},
"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 ((p149 + p174 + p320 + p93 + p95 <= p193 + p258 + p398 + p455 + p497)))",
"processed_size": 76,
"rewrites": 55
},
"result":
{
"edges": 4,
"markings": 5,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"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": 420
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 1,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 73,
"taut": 0,
"tconj": 0,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 43,
"visible_transitions": 0
},
"processed": "((F ((p114 + p250 + p263 + p319 + p515 + p99 <= p110 + p146 + p292 + p352 + p464 + p547)) OR (p129 + p141 + p144 + p156 + p179 + p195 + p244 + p289 + p322 + p353 + p371 + p392 + p396 + p432 + p444 + p73 + p479 + p500 + p521 + p549 + p31 + p56 + p47 + p51 <= p112 + p232 + p283 + p443 + p448 + p506)) U X ((X ((p112 + p232 + p283 + p443 + p448 + p506 + 1 <= p129 + p141 + p144 + p156 + p179 + p195 + p244 + p289 + p322 + p353 + p371 + p392 + p396 + p432 + p444 + p73 + p479 + p500 + p521 + p549 + p31 + p56 + p47 + p51)) OR (3 <= p11))))",
"processed_size": 536,
"rewrites": 55
},
"result":
{
"edges": 20963774,
"markings": 11399461,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 7
},
"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": 467
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 3,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 2,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "F (G ((F ((G ((p230 + 1 <= p345)) AND (p427 <= 1))) AND X ((p230 + 1 <= p345)))))",
"processed_size": 81,
"rewrites": 55
},
"result":
{
"edges": 1206,
"markings": 1205,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 545
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X (X (G (((p229 <= p80) AND F ((1 <= p115))))))",
"processed_size": 47,
"rewrites": 55
},
"result":
{
"edges": 8189711,
"markings": 2274399,
"produced_by": "LTL model checker",
"value": false
},
"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": 648
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 1,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"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": 4,
"visible_transitions": 0
},
"processed": "X (X ((F ((p514 + 1 <= p403)) AND (F ((p242 <= p442)) OR G (F ((p514 + 1 <= p403)))))))",
"processed_size": 87,
"rewrites": 55
},
"result":
{
"edges": 784,
"markings": 784,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 811
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 4,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "X ((G ((X ((1 <= p349)) AND (p485 <= p543))) OR X (X (F ((p37 + 1 <= p487))))))",
"processed_size": 79,
"rewrites": 55
},
"result":
{
"edges": 797,
"markings": 797,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 8
},
"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": 1081
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "F (G (((p313 + 1 <= p492) AND (p150 + 1 <= p4))))",
"processed_size": 49,
"rewrites": 55
},
"result":
{
"edges": 1401,
"markings": 1400,
"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": "stabilization",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1622
},
"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": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G ((p393 <= p375))",
"processed_size": 18,
"rewrites": 55
},
"result":
{
"edges": 980,
"markings": 971,
"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": 3244
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 1,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 50,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 40,
"visible_transitions": 0
},
"processed": "((F ((p104 + p157 + p253 + p311 + p385 + p487 <= p113 + p125 + p154 + p162 + p177 + p198 + p211 + p249 + p254 + p281 + p298 + p318 + p354 + p373 + p378 + p420 + p431 + p462 + p509 + p68 + p19 + p48 + p79 + p98)) AND (p419 + p542 + p499 + p88 + 1 <= p130 + p222 + p273 + p513 + p61 + p60)) U G ((p130 + p222 + p273 + p513 + p61 + p60 <= p419 + p542 + p499 + p88)))",
"processed_size": 363,
"rewrites": 55
},
"result":
{
"edges": 473,
"markings": 473,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 9,
"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": 62572,
"runtime": 326.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "X(G(((** U **) OR (G(*) AND F(**))))) : X(F(**)) : ((F(**) AND **) U G(**)) : ((F(**) OR **) U X((X(**) OR **))) : F(G((F((G(*) AND *)) AND X(*)))) : X(X(G((** AND F(**))))) : F(G(*)) : X(X((F(*) AND (F(**) OR G(F(*)))))) : X((G((X(**) AND **)) OR X(X(F(*))))) : G(**)"
},
"net":
{
"arcs": 6996,
"conflict_clusters": 209,
"places": 554,
"places_significant": 504,
"singleton_clusters": 0,
"transitions": 1372
},
"result":
{
"preliminary_value": "no yes no yes no no no no no no ",
"value": "no yes no yes 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: 1926/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 17728
lola: finding significant places
lola: 554 places, 1372 transitions, 504 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from LTLCardinality.xml
lola: G (X (G ((NOT(F ((1 <= p9 + p126 + p136 + p196 + p241 + p260 + p325 + p335 + p348 + p391 + p421 + p436 + p456 + p477 + p512 + p49 + p53 + p550 + p529 + p87))) U ((p191 <= p247 + p293 + p330 + p407 + p75 + p12) U (p393 + p428 + p485 + p508 + p15 <= p113 + p125 + p154 + p162 + p177 + p198 + p211 + p249 + p254 + p281 + p298 + p318 + p354 + p373 + p378 + p420 + p431 + p462 + p509 + p68 + p19 + p48 + p79 + p98)))))) : ((0 <= 0) U X ((p149 + p174 + p320 + p93 + p95 <= p193 + p258 + p398 + p455 + p497))) : ((F ((p104 + p157 + p253 + p311 + p385 + p487 <= p113 + p125 + p154 + p162 + p177 + p198 + p211 + p249 + p254 + p281 + p298 + p318 + p354 + p373 + p378 + p420 + p431 + p462 + p509 + p68 + p19 + p48 + p79 + p98)) AND (p419 + p542 + p499 + p88 + 1 <= p130 + p222 + p273 + p513 + p61 + p60)) U G ((p130 + p222 + p273 + p513 + p61 + p60 <= p419 + p542 + p499 + p88))) : ((F ((X ((3 <= p11)) U (p114 + p250 + p263 + p319 + p515 + p99 <= p110 + p146 + p292 + p352 + p464 + p547))) OR (p129 + p141 + p144 + p156 + p179 + p195 + p244 + p289 + p322 + p353 + p371 + p392 + p396 + p432 + p444 + p73 + p479 + p500 + p521 + p549 + p31 + p56 + p47 + p51 <= p112 + p232 + p283 + p443 + p448 + p506)) U X ((X ((p112 + p232 + p283 + p443 + p448 + p506 + 1 <= p129 + p141 + p144 + p156 + p179 + p195 + p244 + p289 + p322 + p353 + p371 + p392 + p396 + p432 + p444 + p73 + p479 + p500 + p521 + p549 + p31 + p56 + p47 + p51)) OR (3 <= p11)))) : F (X (NOT(F ((G ((F ((p345 <= p230)) OR (2 <= p427))) OR X ((p345 <= p230))))))) : G (NOT(X (NOT(X (((p229 <= p80) AND F ((1 <= p115)))))))) : NOT(G (F (((p492 <= p313) OR (p4 <= p150))))) : NOT(X (X ((NOT(((0 <= 0) U (p242 <= p442))) U G ((p403 <= p514)))))) : X ((G ((X ((1 <= p349)) AND (p485 <= p543))) OR X (X (NOT(G ((p487 <= p37))))))) : G ((p393 <= p375))
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:434
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:169
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:434
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:318
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:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:315
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:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
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:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:332
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:335
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:300
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:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 336 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((((p191 <= p247 + p293 + p330 + p407 + p75 + p12) U (p393 + p428 + p485 + p508 + p15 <= p113 + p125 + p154 + p162 + p177 + p198 + p211 + p249 + p254 + p281 + p298 + p318 + p354 + p373 + p378 + p420 + p431 + p462 + p509 + p68 + p19 + p48 + p79 + p98)) OR (G ((p9 + p126 + p136 + p196 + p241 + p260 + p325 + p335 + p348 + p391 + p421 + p436 + p456 + p477 + p512 + p49 + p53 + p550 + p529 + p87 <=... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((((p191 <= p247 + p293 + p330 + p407 + p75 + p12) U (p393 + p428 + p485 + p508 + p15 <= p113 + p125 + p154 + p162 + p177 + p198 + p211 + p249 + p254 + p281 + p298 + p318 + p354 + p373 + p378 + p420 + p431 + p462 + p509 + p68 + p19 + p48 + p79 + p98)) OR (G ((p9 + p126 + p136 + p196 + p241 + p260 + p325 + p335 + p348 + p391 + p421 + p436 + p456 + p477 + p512 + p49 + p53 + p550 + p529 + p87 <=... (shortened)
lola: processed formula length: 614
lola: 55 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: 783 markings, 783 edges
lola: ========================================
lola: subprocess 1 will run for 373 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((p149 + p174 + p320 + p93 + p95 <= p193 + p258 + p398 + p455 + p497)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((p149 + p174 + p320 + p93 + p95 <= p193 + p258 + p398 + p455 + p497)))
lola: processed formula length: 76
lola: 55 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 5 markings, 4 edges
lola: ========================================
lola: subprocess 2 will run for 420 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((F ((p114 + p250 + p263 + p319 + p515 + p99 <= p110 + p146 + p292 + p352 + p464 + p547)) OR (p129 + p141 + p144 + p156 + p179 + p195 + p244 + p289 + p322 + p353 + p371 + p392 + p396 + p432 + p444 + p73 + p479 + p500 + p521 + p549 + p31 + p56 + p47 + p51 <= p112 + p232 + p283 + p443 + p448 + p506)) U X ((X ((p112 + p232 + p283 + p443 + p448 + p506 + 1 <= p129 + p141 + p144 + p156 + p179 + p195 + p... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((F ((p114 + p250 + p263 + p319 + p515 + p99 <= p110 + p146 + p292 + p352 + p464 + p547)) OR (p129 + p141 + p144 + p156 + p179 + p195 + p244 + p289 + p322 + p353 + p371 + p392 + p396 + p432 + p444 + p73 + p479 + p500 + p521 + p549 + p31 + p56 + p47 + p51 <= p112 + p232 + p283 + p443 + p448 + p506)) U X ((X ((p112 + p232 + p283 + p443 + p448 + p506 + 1 <= p129 + p141 + p144 + p156 + p179 + p195 + p... (shortened)
lola: processed formula length: 536
lola: 55 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 7 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 621135 markings, 1165670 edges, 124227 markings/sec, 0 secs
lola: 1258709 markings, 2452473 edges, 127515 markings/sec, 5 secs
lola: 1842184 markings, 3743473 edges, 116695 markings/sec, 10 secs
lola: 2568530 markings, 4967456 edges, 145269 markings/sec, 15 secs
lola: 3273863 markings, 6187151 edges, 141067 markings/sec, 20 secs
lola: 4003415 markings, 7369094 edges, 145910 markings/sec, 25 secs
lola: 4699002 markings, 8580902 edges, 139117 markings/sec, 30 secs
lola: 5330943 markings, 9862140 edges, 126388 markings/sec, 35 secs
lola: 6012608 markings, 11080635 edges, 136333 markings/sec, 40 secs
lola: 6724656 markings, 12234006 edges, 142410 markings/sec, 45 secs
lola: 7431484 markings, 13414530 edges, 141366 markings/sec, 50 secs
lola: 8046969 markings, 14676385 edges, 123097 markings/sec, 55 secs
lola: 8737221 markings, 15878644 edges, 138050 markings/sec, 60 secs
lola: 9417974 markings, 17065666 edges, 136151 markings/sec, 65 secs
lola: 10035215 markings, 18317193 edges, 123448 markings/sec, 70 secs
lola: 10675908 markings, 19557837 edges, 128139 markings/sec, 75 secs
lola: 11307268 markings, 20811261 edges, 126272 markings/sec, 80 secs
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: 11399461 markings, 20963774 edges
lola: ========================================
lola: subprocess 3 will run for 467 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((F ((G ((p230 + 1 <= p345)) AND (p427 <= 1))) AND X ((p230 + 1 <= p345)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((F ((G ((p230 + 1 <= p345)) AND (p427 <= 1))) AND X ((p230 + 1 <= p345)))))
lola: processed formula length: 81
lola: 55 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: 1205 markings, 1206 edges
lola: ========================================
lola: subprocess 4 will run for 545 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (G (((p229 <= p80) AND F ((1 <= p115))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (G (((p229 <= p80) AND F ((1 <= p115))))))
lola: processed formula length: 47
lola: 55 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: 409937 markings, 1426406 edges, 81987 markings/sec, 0 secs
lola: 805887 markings, 2848529 edges, 79190 markings/sec, 5 secs
lola: 1191331 markings, 4245402 edges, 77089 markings/sec, 10 secs
lola: 1586740 markings, 5650688 edges, 79082 markings/sec, 15 secs
lola: 1971277 markings, 7031095 edges, 76907 markings/sec, 20 secs
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 2274399 markings, 8189711 edges
lola: ========================================
lola: subprocess 5 will run for 648 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X ((F ((p514 + 1 <= p403)) AND (F ((p242 <= p442)) OR G (F ((p514 + 1 <= p403)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X ((F ((p514 + 1 <= p403)) AND (F ((p242 <= p442)) OR G (F ((p514 + 1 <= p403)))))))
lola: processed formula length: 87
lola: 55 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: 784 markings, 784 edges
lola: ========================================
lola: subprocess 6 will run for 811 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((G ((X ((1 <= p349)) AND (p485 <= p543))) OR X (X (F ((p37 + 1 <= p487))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((G ((X ((1 <= p349)) AND (p485 <= p543))) OR X (X (F ((p37 + 1 <= p487))))))
lola: processed formula length: 79
lola: 55 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: 797 markings, 797 edges
lola: ========================================
lola: subprocess 7 will run for 1081 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((p313 + 1 <= p492) AND (p150 + 1 <= p4))))
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 (((p313 + 1 <= p492) AND (p150 + 1 <= p4))))
lola: processed formula length: 49
lola: 55 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: 1400 markings, 1401 edges
lola: ========================================
lola: subprocess 8 will run for 1622 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((p393 <= p375))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((p393 <= p375))
lola: processed formula length: 18
lola: 55 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: 971 markings, 980 edges
lola: ========================================
lola: subprocess 9 will run for 3244 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((F ((p104 + p157 + p253 + p311 + p385 + p487 <= p113 + p125 + p154 + p162 + p177 + p198 + p211 + p249 + p254 + p281 + p298 + p318 + p354 + p373 + p378 + p420 + p431 + p462 + p509 + p68 + p19 + p48 + p79 + p98)) AND (p419 + p542 + p499 + p88 + 1 <= p130 + p222 + p273 + p513 + p61 + p60)) U G ((p130 + p222 + p273 + p513 + p61 + p60 <= p419 + p542 + p499 + p88)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((F ((p104 + p157 + p253 + p311 + p385 + p487 <= p113 + p125 + p154 + p162 + p177 + p198 + p211 + p249 + p254 + p281 + p298 + p318 + p354 + p373 + p378 + p420 + p431 + p462 + p509 + p68 + p19 + p48 + p79 + p98)) AND (p419 + p542 + p499 + p88 + 1 <= p130 + p222 + p273 + p513 + p61 + p60)) U G ((p130 + p222 + p273 + p513 + p61 + p60 <= p419 + p542 + p499 + p88)))
lola: processed formula length: 363
lola: 55 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 6 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: 473 markings, 473 edges
lola: RESULT
lola:
SUMMARY: no yes no yes no no no no no no
lola:
preliminary result: no yes no yes no no no no no no
lola: ========================================
lola: memory consumption: 62572 KB
lola: time consumption: 326 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-S04J04T06"
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-S04J04T06, 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-158987871900457"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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