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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 12M
-rw-r--r-- 1 mcc users 12K Apr 12 05:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 41K Apr 12 05:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 116K Apr 11 05:33 CTLFireability.txt
-rw-r--r-- 1 mcc users 368K Apr 11 05:33 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 7.4K Apr 14 12:46 LTLCardinality.txt
-rw-r--r-- 1 mcc users 33K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 13K Apr 14 12:46 LTLFireability.txt
-rw-r--r-- 1 mcc users 48K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 10 12:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 35K Apr 10 12:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 237K Apr 9 18:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 742K Apr 9 18:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.9K Apr 10 22:23 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.2K Apr 10 22:23 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 9.5M 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-S06J06T04-00
FORMULA_NAME PolyORBLF-PT-S06J06T04-01
FORMULA_NAME PolyORBLF-PT-S06J06T04-02
FORMULA_NAME PolyORBLF-PT-S06J06T04-03
FORMULA_NAME PolyORBLF-PT-S06J06T04-04
FORMULA_NAME PolyORBLF-PT-S06J06T04-05
FORMULA_NAME PolyORBLF-PT-S06J06T04-06
FORMULA_NAME PolyORBLF-PT-S06J06T04-07
FORMULA_NAME PolyORBLF-PT-S06J06T04-08
FORMULA_NAME PolyORBLF-PT-S06J06T04-09
FORMULA_NAME PolyORBLF-PT-S06J06T04-10
FORMULA_NAME PolyORBLF-PT-S06J06T04-11
FORMULA_NAME PolyORBLF-PT-S06J06T04-12
FORMULA_NAME PolyORBLF-PT-S06J06T04-13
FORMULA_NAME PolyORBLF-PT-S06J06T04-14
FORMULA_NAME PolyORBLF-PT-S06J06T04-15

=== Now, execution of the tool begins

BK_START 1591161189541

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 05:13:11] [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 05:13:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 05:13:11] [INFO ] Load time of PNML (sax parser for PT used): 336 ms
[2020-06-03 05:13:11] [INFO ] Transformed 506 places.
[2020-06-03 05:13:11] [INFO ] Transformed 7154 transitions.
[2020-06-03 05:13:11] [INFO ] Parsed PT model containing 506 places and 7154 transitions in 426 ms.
Ensure Unique test removed 5380 transitions
Reduce redundant transitions removed 5380 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 71 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 430 resets, run finished after 517 ms. (steps per millisecond=193 ) properties seen :[1, 1, 1, 0, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-06-03 05:13:12] [INFO ] Flow matrix only has 1750 transitions (discarded 24 similar events)
// Phase 1: matrix 1750 rows 506 cols
[2020-06-03 05:13:12] [INFO ] Computed 54 place invariants in 122 ms
[2020-06-03 05:13:12] [INFO ] [Real]Absence check using 23 positive place invariants in 27 ms returned unsat
[2020-06-03 05:13:12] [INFO ] [Real]Absence check using 23 positive place invariants in 13 ms returned unsat
[2020-06-03 05:13:12] [INFO ] [Real]Absence check using 23 positive place invariants in 18 ms returned unsat
[2020-06-03 05:13:12] [INFO ] [Real]Absence check using 23 positive place invariants in 12 ms returned unsat
[2020-06-03 05:13:12] [INFO ] [Real]Absence check using 23 positive place invariants in 6 ms returned unsat
[2020-06-03 05:13:12] [INFO ] [Real]Absence check using 23 positive place invariants in 13 ms returned unsat
[2020-06-03 05:13:13] [INFO ] [Real]Absence check using 23 positive place invariants in 20 ms returned sat
[2020-06-03 05:13:13] [INFO ] [Real]Absence check using 23 positive and 31 generalized place invariants in 36 ms returned sat
[2020-06-03 05:13:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:13:16] [INFO ] [Real]Absence check using state equation in 3531 ms returned sat
[2020-06-03 05:13:16] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:13:16] [INFO ] [Nat]Absence check using 23 positive place invariants in 27 ms returned sat
[2020-06-03 05:13:16] [INFO ] [Nat]Absence check using 23 positive and 31 generalized place invariants in 33 ms returned sat
[2020-06-03 05:13:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:13:27] [INFO ] [Nat]Absence check using state equation in 10506 ms returned sat
[2020-06-03 05:13:27] [INFO ] State equation strengthened by 116 read => feed constraints.
[2020-06-03 05:13:27] [INFO ] [Nat]Added 116 Read/Feed constraints in 486 ms returned sat
[2020-06-03 05:13:28] [INFO ] Deduced a trap composed of 110 places in 494 ms
[2020-06-03 05:13:28] [INFO ] Deduced a trap composed of 93 places in 449 ms
[2020-06-03 05:13:29] [INFO ] Deduced a trap composed of 94 places in 395 ms
[2020-06-03 05:13:30] [INFO ] Deduced a trap composed of 94 places in 483 ms
[2020-06-03 05:13:31] [INFO ] Deduced a trap composed of 78 places in 550 ms
[2020-06-03 05:13:32] [INFO ] Deduced a trap composed of 91 places in 534 ms
[2020-06-03 05:13:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 6 trap constraints in 4624 ms
Successfully simplified 7 atomic propositions for a total of 8 simplifications.
[2020-06-03 05:13:32] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2020-06-03 05:13:32] [INFO ] Flatten gal took : 255 ms
FORMULA PolyORBLF-PT-S06J06T04-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J06T04-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J06T04-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J06T04-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J06T04-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 05:13:33] [INFO ] Flatten gal took : 201 ms
[2020-06-03 05:13:33] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2020-06-03 05:13:33] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 19 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ PolyORBLF-PT-S06J06T04 @ 3570 seconds

FORMULA PolyORBLF-PT-S06J06T04-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

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

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

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

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

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

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

FORMULA PolyORBLF-PT-S06J06T04-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA PolyORBLF-PT-S06J06T04-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3165
rslt: Output for LTLCardinality @ PolyORBLF-PT-S06J06T04

{
"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 05:13:33 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 303
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 2,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 64,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 64,
"visible_transitions": 0
},
"processed": "X ((G (((p5 + p101 + p102 + p146 + p148 + p191 + p205 + p210 + p232 + p254 + p285 + p350 + p362 + p364 + p66 + p421 + p443 + p444 + p460 + p475 + p484 + p53 + p95 + p97 + 1 <= p112 + p157 + p158 + p192 + p195 + p227 + p244 + p253 + p268 + p288 + p298 + p304 + p317 + p353 + p355 + p387 + p412 + p423 + p449 + p451 + p16 + p30 + p33 + p81) OR (p2 + p110 + p172 + p222 + 1 <= p188 + p200 + p262 + p68))) OR F ((p418 + 1 <= p165 + p249 + p315 + p381 + p493 + p32 + p96))))",
"processed_size": 470,
"rewrites": 62
},
"result":
{
"edges": 50455279,
"markings": 15080200,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 316
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 9,
"visible_transitions": 0
},
"processed": "((p137 + p220 + p239 + p26 <= p117 + p306 + p356 + p415) AND (p76 <= 0))",
"processed_size": 72,
"rewrites": 63
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 1,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 351
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 10,
"visible_transitions": 0
},
"processed": "X (X ((((3 <= p122) U (1 <= p76)) OR (p137 + p220 + p239 + p26 <= p117 + p306 + p356 + p415))))",
"processed_size": 95,
"rewrites": 62
},
"result":
{
"edges": 42,
"markings": 28,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 1,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 351
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"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": "X (X ((p122 + 1 <= p17)))",
"processed_size": 25,
"rewrites": 62
},
"result":
{
"edges": 367,
"markings": 367,
"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": 395
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 2,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "X (F ((G ((F ((2 <= p150)) AND ((p438 <= p172) OR (2 <= p150)))) AND (p262 <= p240))))",
"processed_size": 86,
"rewrites": 62
},
"result":
{
"edges": 367,
"markings": 367,
"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": 452
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 452
},
"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": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G (F ((p262 + 1 <= p246)))",
"processed_size": 26,
"rewrites": 62
},
"result":
{
"edges": 28,
"markings": 28,
"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": 527
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X (F ((X ((p372 <= 0)) OR (p503 + 1 <= p354))))",
"processed_size": 47,
"rewrites": 62
},
"result":
{
"edges": 24,
"markings": 20,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 4,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 527
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 2,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "X ((F ((G ((p176 <= p240)) AND (p213 + 1 <= p17))) AND (p224 + 1 <= p184)))",
"processed_size": 75,
"rewrites": 62
},
"result":
{
"edges": 367,
"markings": 367,
"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": 633
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"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 ((p235 + 1 <= p356)) AND (p430 + 1 <= p45)))",
"processed_size": 50,
"rewrites": 62
},
"result":
{
"edges": 367,
"markings": 367,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"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": 791
},
"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": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G (F ((p337 + 1 <= p376)))",
"processed_size": 26,
"rewrites": 62
},
"result":
{
"edges": 569,
"markings": 435,
"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": "fairness",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1055
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"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 ((p237 + 1 <= p124))",
"processed_size": 22,
"rewrites": 62
},
"result":
{
"edges": 28,
"markings": 28,
"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": 1582
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "F (G (((p100 + 1 <= p55) R (p337 + 1 <= p272))))",
"processed_size": 48,
"rewrites": 62
},
"result":
{
"edges": 7517,
"markings": 3957,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 9,
"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": 3165
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "F (G ((F ((p354 <= p271 + p71 + p437 + p492)) AND (1 <= p337))))",
"processed_size": 64,
"rewrites": 62
},
"result":
{
"edges": 39,
"markings": 38,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 10,
"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": 72316,
"runtime": 405.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "X((G(*) OR F(*))) : F(G((F(**) AND **))) : (X(X(((** U **) OR **))) AND (** AND **)) : X(X(*)) : X(F((G((F(**) AND (** OR **))) AND **))) : (G(F(*)) OR X(F((X(*) OR *)))) : F(G((* R *))) : G(F(*)) : X((F((G(**) AND *)) AND *)) : G(*) : X((G(*) AND *))"
},
"net":
{
"arcs": 10564,
"conflict_clusters": 169,
"places": 506,
"places_significant": 452,
"singleton_clusters": 0,
"transitions": 1774
},
"result":
{
"preliminary_value": "no no yes no no no no no no no no ",
"value": "no no yes no 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: 2280/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 16192
lola: finding significant places
lola: 506 places, 1774 transitions, 452 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from LTLCardinality.xml
lola: X ((NOT(F (((p112 + p157 + p158 + p192 + p195 + p227 + p244 + p253 + p268 + p288 + p298 + p304 + p317 + p353 + p355 + p387 + p412 + p423 + p449 + p451 + p16 + p30 + p33 + p81 <= p5 + p101 + p102 + p146 + p148 + p191 + p205 + p210 + p232 + p254 + p285 + p350 + p362 + p364 + p66 + p421 + p443 + p444 + p460 + p475 + p484 + p53 + p95 + p97) AND (p188 + p200 + p262 + p68 <= p2 + p110 + p172 + p222)))) OR NOT(G ((p165 + p249 + p315 + p381 + p493 + p32 + p96 <= p418))))) : X (((0 <= 0) U X (G ((F (X ((p354 <= p271 + p71 + p437 + p492))) AND X ((1 <= p337))))))) : ((X (X ((((3 <= p122) U (1 <= p76)) OR (p137 + p220 + p239 + p26 <= p117 + p306 + p356 + p415)))) AND (p137 + p220 + p239 + p26 <= p117 + p306 + p356 + p415)) AND (p76 <= 0)) : X (NOT(X ((p17 <= p122)))) : X (F ((G (((p438 <= p172) U (2 <= p150))) AND (p262 <= p240)))) : (NOT(F (G ((p246 <= p262)))) OR F (X (NOT(G ((X ((1 <= p372)) AND (p354 <= p503))))))) : G (F ((X (F ((1 <= p206))) U G (NOT(((p55 <= p100) U (p272 <= p337))))))) : G (F (G (((0 <= 0) U F (NOT(G ((p376 <= p337)))))))) : (NOT(X (G ((NOT(G ((p176 <= p240))) OR (p17 <= p213))))) AND NOT(X ((p184 <= p224)))) : G (NOT(F ((p124 <= p237)))) : NOT(X (((X ((p31 <= p88)) U F ((p356 <= p235))) OR (p45 <= p430))))
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:525
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:169
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:380
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
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:315
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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:300
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:525
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 303 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((G (((p5 + p101 + p102 + p146 + p148 + p191 + p205 + p210 + p232 + p254 + p285 + p350 + p362 + p364 + p66 + p421 + p443 + p444 + p460 + p475 + p484 + p53 + p95 + p97 + 1 <= p112 + p157 + p158 + p192 + p195 + p227 + p244 + p253 + p268 + p288 + p298 + p304 + p317 + p353 + p355 + p387 + p412 + p423 + p449 + p451 + p16 + p30 + p33 + p81) OR (p2 + p110 + p172 + p222 + 1 <= p188 + p200 + p262 + p68)... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((G (((p5 + p101 + p102 + p146 + p148 + p191 + p205 + p210 + p232 + p254 + p285 + p350 + p362 + p364 + p66 + p421 + p443 + p444 + p460 + p475 + p484 + p53 + p95 + p97 + 1 <= p112 + p157 + p158 + p192 + p195 + p227 + p244 + p253 + p268 + p288 + p298 + p304 + p317 + p353 + p355 + p387 + p412 + p423 + p449 + p451 + p16 + p30 + p33 + p81) OR (p2 + p110 + p172 + p222 + 1 <= p188 + p200 + p262 + p68)... (shortened)
lola: processed formula length: 470
lola: 62 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: 455481 markings, 1402341 edges, 91096 markings/sec, 0 secs
lola: 923815 markings, 2866774 edges, 93667 markings/sec, 5 secs
lola: 1377429 markings, 4328164 edges, 90723 markings/sec, 10 secs
lola: 1825335 markings, 5785793 edges, 89581 markings/sec, 15 secs
lola: 2253834 markings, 7249816 edges, 85700 markings/sec, 20 secs
lola: 2718882 markings, 8702410 edges, 93010 markings/sec, 25 secs
lola: 3182214 markings, 10152669 edges, 92666 markings/sec, 30 secs
lola: 3630881 markings, 11614726 edges, 89733 markings/sec, 35 secs
lola: 4061125 markings, 13067863 edges, 86049 markings/sec, 40 secs
lola: 4502595 markings, 14525429 edges, 88294 markings/sec, 45 secs
lola: 4963569 markings, 15977400 edges, 92195 markings/sec, 50 secs
lola: 5412821 markings, 17419096 edges, 89850 markings/sec, 55 secs
lola: 5835352 markings, 18875967 edges, 84506 markings/sec, 60 secs
lola: 6286951 markings, 20330684 edges, 90320 markings/sec, 65 secs
lola: 6740163 markings, 21785554 edges, 90642 markings/sec, 70 secs
lola: 7173989 markings, 23238173 edges, 86765 markings/sec, 75 secs
lola: 7602091 markings, 24684596 edges, 85620 markings/sec, 80 secs
lola: 8038938 markings, 26114695 edges, 87369 markings/sec, 85 secs
lola: 8450621 markings, 27552428 edges, 82337 markings/sec, 90 secs
lola: 8911730 markings, 28974364 edges, 92222 markings/sec, 95 secs
lola: 9351762 markings, 30385358 edges, 88006 markings/sec, 100 secs
lola: 9783210 markings, 31802143 edges, 86290 markings/sec, 105 secs
lola: 10193457 markings, 33227475 edges, 82049 markings/sec, 110 secs
lola: 10632599 markings, 34625844 edges, 87828 markings/sec, 115 secs
lola: 11060063 markings, 36035052 edges, 85493 markings/sec, 120 secs
lola: 11466742 markings, 37461324 edges, 81336 markings/sec, 125 secs
lola: 11877990 markings, 38913186 edges, 82250 markings/sec, 130 secs
lola: 12299931 markings, 40320267 edges, 84388 markings/sec, 135 secs
lola: 12652935 markings, 41596739 edges, 70601 markings/sec, 140 secs
lola: 13040952 markings, 42931515 edges, 77603 markings/sec, 145 secs
lola: 13433745 markings, 44339157 edges, 78559 markings/sec, 150 secs
lola: 13793781 markings, 45683382 edges, 72007 markings/sec, 155 secs
lola: 14160899 markings, 46971607 edges, 73424 markings/sec, 160 secs
lola: 14537811 markings, 48344199 edges, 75382 markings/sec, 165 secs
lola: 14901564 markings, 49759971 edges, 72751 markings/sec, 170 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: 15080200 markings, 50455279 edges
lola: ========================================
lola: subprocess 1 will run for 316 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (X ((((3 <= p122) U (1 <= p76)) OR (p137 + p220 + p239 + p26 <= p117 + p306 + p356 + p415)))) AND ((p137 + p220 + p239 + p26 <= p117 + p306 + p356 + p415) AND (p76 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 316 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p137 + p220 + p239 + p26 <= p117 + p306 + p356 + p415) AND (p76 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: processed formula: ((p137 + p220 + p239 + p26 <= p117 + p306 + p356 + p415) AND (p76 <= 0))
lola: processed formula length: 72
lola: 63 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 351 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X ((((3 <= p122) U (1 <= p76)) OR (p137 + p220 + p239 + p26 <= p117 + p306 + p356 + p415))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X ((((3 <= p122) U (1 <= p76)) OR (p137 + p220 + p239 + p26 <= p117 + p306 + p356 + p415))))
lola: processed formula length: 95
lola: 62 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 28 markings, 42 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 2 will run for 351 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X ((p122 + 1 <= p17)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X ((p122 + 1 <= p17)))
lola: processed formula length: 25
lola: 62 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: 367 markings, 367 edges
lola: ========================================
lola: subprocess 3 will run for 395 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((G ((F ((2 <= p150)) AND ((p438 <= p172) OR (2 <= p150)))) AND (p262 <= p240))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((G ((F ((2 <= p150)) AND ((p438 <= p172) OR (2 <= p150)))) AND (p262 <= p240))))
lola: processed formula length: 86
lola: 62 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: 367 markings, 367 edges
lola: ========================================
lola: subprocess 4 will run for 452 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G (F ((p262 + 1 <= p246))) OR X (F ((X ((p372 <= 0)) OR (p503 + 1 <= p354)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 452 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((p262 + 1 <= p246)))
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 ((p262 + 1 <= p246)))
lola: processed formula length: 26
lola: 62 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: 28 markings, 28 edges
lola: ========================================
lola: subprocess 5 will run for 527 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((X ((p372 <= 0)) OR (p503 + 1 <= p354))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((X ((p372 <= 0)) OR (p503 + 1 <= p354))))
lola: processed formula length: 47
lola: 62 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 20 markings, 24 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 5 will run for 527 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((F ((G ((p176 <= p240)) AND (p213 + 1 <= p17))) AND (p224 + 1 <= p184)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((F ((G ((p176 <= p240)) AND (p213 + 1 <= p17))) AND (p224 + 1 <= p184)))
lola: processed formula length: 75
lola: 62 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: 367 markings, 367 edges
lola: ========================================
lola: subprocess 6 will run for 633 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((G ((p235 + 1 <= p356)) AND (p430 + 1 <= p45)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((G ((p235 + 1 <= p356)) AND (p430 + 1 <= p45)))
lola: processed formula length: 50
lola: 62 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: 367 markings, 367 edges
lola: ========================================
lola: subprocess 7 will run for 791 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((p337 + 1 <= p376)))
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 ((p337 + 1 <= p376)))
lola: processed formula length: 26
lola: 62 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: 435 markings, 569 edges
lola: ========================================
lola: subprocess 8 will run for 1055 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((p237 + 1 <= p124))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((p237 + 1 <= p124))
lola: processed formula length: 22
lola: 62 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: 28 markings, 28 edges
lola: ========================================
lola: subprocess 9 will run for 1582 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((p100 + 1 <= p55) R (p337 + 1 <= p272))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G (((p100 + 1 <= p55) R (p337 + 1 <= p272))))
lola: processed formula length: 48
lola: 62 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: 3957 markings, 7517 edges
lola: ========================================
lola: subprocess 10 will run for 3165 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((F ((p354 <= p271 + p71 + p437 + p492)) AND (1 <= p337))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((F ((p354 <= p271 + p71 + p437 + p492)) AND (1 <= p337))))
lola: processed formula length: 64
lola: 62 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 38 markings, 39 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no yes no no no no no no no no
lola:
preliminary result: no no yes no no no no no no no no
lola: memory consumption: 72316 KB
lola: time consumption: 405 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-S06J06T04"
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-S06J06T04, 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-158987872000529"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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