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.r211-tajo-159033477800666.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 ShieldPPPt-PT-020A, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r211-tajo-159033477800666
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 308K
-rw-r--r-- 1 mcc users 3.7K May 14 01:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K May 14 01:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 13 19:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 13 19:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 14 10:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 14 10:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 14 10:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 14 10:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 20:42 NewModel
-rw-r--r-- 1 mcc users 3.7K May 13 14:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K May 13 14:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 13 08:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K May 13 08:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 13 16:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 13 16:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 20:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 12 20:42 instance
-rw-r--r-- 1 mcc users 6 May 12 20:42 iscolored
-rw-r--r-- 1 mcc users 134K May 12 20:42 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 ShieldPPPt-PT-020A-00
FORMULA_NAME ShieldPPPt-PT-020A-01
FORMULA_NAME ShieldPPPt-PT-020A-02
FORMULA_NAME ShieldPPPt-PT-020A-03
FORMULA_NAME ShieldPPPt-PT-020A-04
FORMULA_NAME ShieldPPPt-PT-020A-05
FORMULA_NAME ShieldPPPt-PT-020A-06
FORMULA_NAME ShieldPPPt-PT-020A-07
FORMULA_NAME ShieldPPPt-PT-020A-08
FORMULA_NAME ShieldPPPt-PT-020A-09
FORMULA_NAME ShieldPPPt-PT-020A-10
FORMULA_NAME ShieldPPPt-PT-020A-11
FORMULA_NAME ShieldPPPt-PT-020A-12
FORMULA_NAME ShieldPPPt-PT-020A-13
FORMULA_NAME ShieldPPPt-PT-020A-14
FORMULA_NAME ShieldPPPt-PT-020A-15

=== Now, execution of the tool begins

BK_START 1591320269509

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-05 01:24:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-05 01:24:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-05 01:24:31] [INFO ] Load time of PNML (sax parser for PT used): 74 ms
[2020-06-05 01:24:31] [INFO ] Transformed 503 places.
[2020-06-05 01:24:31] [INFO ] Transformed 363 transitions.
[2020-06-05 01:24:31] [INFO ] Found NUPN structural information;
[2020-06-05 01:24:31] [INFO ] Parsed PT model containing 503 places and 363 transitions in 118 ms.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 25 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 645 ms. (steps per millisecond=155 ) properties seen :[1, 0, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1]
// Phase 1: matrix 362 rows 503 cols
[2020-06-05 01:24:32] [INFO ] Computed 221 place invariants in 32 ms
[2020-06-05 01:24:32] [INFO ] [Real]Absence check using 221 positive place invariants in 117 ms returned sat
[2020-06-05 01:24:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 01:24:33] [INFO ] [Real]Absence check using state equation in 529 ms returned sat
[2020-06-05 01:24:33] [INFO ] Computed and/alt/rep : 361/1119/361 causal constraints in 30 ms.
[2020-06-05 01:24:33] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 01:24:33] [INFO ] [Nat]Absence check using 221 positive place invariants in 84 ms returned sat
[2020-06-05 01:24:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 01:24:33] [INFO ] [Nat]Absence check using state equation in 397 ms returned sat
[2020-06-05 01:24:34] [INFO ] Computed and/alt/rep : 361/1119/361 causal constraints in 28 ms.
[2020-06-05 01:24:36] [INFO ] Added : 348 causal constraints over 70 iterations in 2318 ms. Result :sat
[2020-06-05 01:24:36] [INFO ] [Real]Absence check using 221 positive place invariants in 99 ms returned sat
[2020-06-05 01:24:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 01:24:37] [INFO ] [Real]Absence check using state equation in 547 ms returned sat
[2020-06-05 01:24:37] [INFO ] Computed and/alt/rep : 361/1119/361 causal constraints in 28 ms.
[2020-06-05 01:24:37] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 01:24:37] [INFO ] [Nat]Absence check using 221 positive place invariants in 79 ms returned sat
[2020-06-05 01:24:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 01:24:37] [INFO ] [Nat]Absence check using state equation in 470 ms returned sat
[2020-06-05 01:24:37] [INFO ] Computed and/alt/rep : 361/1119/361 causal constraints in 34 ms.
[2020-06-05 01:24:39] [INFO ] Added : 343 causal constraints over 69 iterations in 2113 ms. Result :sat
[2020-06-05 01:24:40] [INFO ] [Real]Absence check using 221 positive place invariants in 100 ms returned sat
[2020-06-05 01:24:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 01:24:40] [INFO ] [Real]Absence check using state equation in 563 ms returned sat
[2020-06-05 01:24:40] [INFO ] Computed and/alt/rep : 361/1119/361 causal constraints in 17 ms.
[2020-06-05 01:24:40] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 01:24:41] [INFO ] [Nat]Absence check using 221 positive place invariants in 74 ms returned sat
[2020-06-05 01:24:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 01:24:41] [INFO ] [Nat]Absence check using state equation in 396 ms returned sat
[2020-06-05 01:24:41] [INFO ] Computed and/alt/rep : 361/1119/361 causal constraints in 25 ms.
[2020-06-05 01:24:43] [INFO ] Added : 344 causal constraints over 69 iterations in 1720 ms. Result :sat
[2020-06-05 01:24:43] [INFO ] [Real]Absence check using 221 positive place invariants in 70 ms returned sat
[2020-06-05 01:24:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 01:24:43] [INFO ] [Real]Absence check using state equation in 432 ms returned sat
[2020-06-05 01:24:43] [INFO ] Computed and/alt/rep : 361/1119/361 causal constraints in 35 ms.
[2020-06-05 01:24:43] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 01:24:44] [INFO ] [Nat]Absence check using 221 positive place invariants in 72 ms returned sat
[2020-06-05 01:24:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 01:24:44] [INFO ] [Nat]Absence check using state equation in 419 ms returned sat
[2020-06-05 01:24:44] [INFO ] Computed and/alt/rep : 361/1119/361 causal constraints in 35 ms.
[2020-06-05 01:24:46] [INFO ] Added : 355 causal constraints over 73 iterations in 2421 ms. Result :sat
[2020-06-05 01:24:47] [INFO ] [Real]Absence check using 221 positive place invariants in 104 ms returned sat
[2020-06-05 01:24:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 01:24:47] [INFO ] [Real]Absence check using state equation in 568 ms returned sat
[2020-06-05 01:24:47] [INFO ] Computed and/alt/rep : 361/1119/361 causal constraints in 21 ms.
[2020-06-05 01:24:47] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 01:24:47] [INFO ] [Nat]Absence check using 221 positive place invariants in 103 ms returned sat
[2020-06-05 01:24:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 01:24:48] [INFO ] [Nat]Absence check using state equation in 571 ms returned sat
[2020-06-05 01:24:48] [INFO ] Computed and/alt/rep : 361/1119/361 causal constraints in 40 ms.
[2020-06-05 01:24:50] [INFO ] Added : 358 causal constraints over 72 iterations in 2358 ms. Result :sat
[2020-06-05 01:24:51] [INFO ] [Real]Absence check using 221 positive place invariants in 74 ms returned sat
[2020-06-05 01:24:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 01:24:51] [INFO ] [Real]Absence check using state equation in 456 ms returned sat
[2020-06-05 01:24:51] [INFO ] Computed and/alt/rep : 361/1119/361 causal constraints in 27 ms.
[2020-06-05 01:24:51] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 01:24:51] [INFO ] [Nat]Absence check using 221 positive place invariants in 99 ms returned sat
[2020-06-05 01:24:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 01:24:52] [INFO ] [Nat]Absence check using state equation in 445 ms returned sat
[2020-06-05 01:24:52] [INFO ] Computed and/alt/rep : 361/1119/361 causal constraints in 29 ms.
[2020-06-05 01:24:54] [INFO ] Added : 355 causal constraints over 71 iterations in 1973 ms. Result :sat
[2020-06-05 01:24:54] [INFO ] [Real]Absence check using 221 positive place invariants in 134 ms returned sat
[2020-06-05 01:24:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 01:24:55] [INFO ] [Real]Absence check using state equation in 457 ms returned sat
[2020-06-05 01:24:55] [INFO ] Computed and/alt/rep : 361/1119/361 causal constraints in 33 ms.
[2020-06-05 01:24:55] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 01:24:55] [INFO ] [Nat]Absence check using 221 positive place invariants in 338 ms returned sat
[2020-06-05 01:24:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 01:24:56] [INFO ] [Nat]Absence check using state equation in 797 ms returned sat
[2020-06-05 01:24:56] [INFO ] Computed and/alt/rep : 361/1119/361 causal constraints in 26 ms.
[2020-06-05 01:24:59] [INFO ] Added : 359 causal constraints over 74 iterations in 2731 ms. Result :sat
[2020-06-05 01:24:59] [INFO ] [Real]Absence check using 221 positive place invariants in 76 ms returned sat
[2020-06-05 01:24:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 01:24:59] [INFO ] [Real]Absence check using state equation in 426 ms returned sat
[2020-06-05 01:24:59] [INFO ] Computed and/alt/rep : 361/1119/361 causal constraints in 20 ms.
[2020-06-05 01:24:59] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 01:25:00] [INFO ] [Nat]Absence check using 221 positive place invariants in 108 ms returned sat
[2020-06-05 01:25:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 01:25:00] [INFO ] [Nat]Absence check using state equation in 591 ms returned sat
[2020-06-05 01:25:00] [INFO ] Computed and/alt/rep : 361/1119/361 causal constraints in 19 ms.
[2020-06-05 01:25:03] [INFO ] Added : 351 causal constraints over 73 iterations in 2547 ms. Result :sat
[2020-06-05 01:25:03] [INFO ] [Real]Absence check using 221 positive place invariants in 104 ms returned sat
[2020-06-05 01:25:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 01:25:04] [INFO ] [Real]Absence check using state equation in 563 ms returned sat
[2020-06-05 01:25:04] [INFO ] Computed and/alt/rep : 361/1119/361 causal constraints in 39 ms.
[2020-06-05 01:25:04] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 01:25:04] [INFO ] [Nat]Absence check using 221 positive place invariants in 93 ms returned sat
[2020-06-05 01:25:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 01:25:05] [INFO ] [Nat]Absence check using state equation in 627 ms returned sat
[2020-06-05 01:25:05] [INFO ] Computed and/alt/rep : 361/1119/361 causal constraints in 14 ms.
[2020-06-05 01:25:08] [INFO ] Added : 352 causal constraints over 71 iterations in 3027 ms. Result :sat
[2020-06-05 01:25:08] [INFO ] [Real]Absence check using 221 positive place invariants in 115 ms returned sat
[2020-06-05 01:25:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 01:25:08] [INFO ] [Real]Absence check using state equation in 485 ms returned sat
[2020-06-05 01:25:08] [INFO ] Computed and/alt/rep : 361/1119/361 causal constraints in 22 ms.
[2020-06-05 01:25:08] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 01:25:09] [INFO ] [Nat]Absence check using 221 positive place invariants in 197 ms returned sat
[2020-06-05 01:25:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 01:25:09] [INFO ] [Nat]Absence check using state equation in 622 ms returned sat
[2020-06-05 01:25:09] [INFO ] Computed and/alt/rep : 361/1119/361 causal constraints in 24 ms.
[2020-06-05 01:25:11] [INFO ] Added : 349 causal constraints over 71 iterations in 1933 ms. Result :sat
[2020-06-05 01:25:12] [INFO ] [Real]Absence check using 221 positive place invariants in 72 ms returned sat
[2020-06-05 01:25:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 01:25:12] [INFO ] [Real]Absence check using state equation in 450 ms returned sat
[2020-06-05 01:25:12] [INFO ] Computed and/alt/rep : 361/1119/361 causal constraints in 15 ms.
[2020-06-05 01:25:12] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 01:25:12] [INFO ] [Nat]Absence check using 221 positive place invariants in 77 ms returned sat
[2020-06-05 01:25:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 01:25:13] [INFO ] [Nat]Absence check using state equation in 457 ms returned sat
[2020-06-05 01:25:13] [INFO ] Computed and/alt/rep : 361/1119/361 causal constraints in 30 ms.
[2020-06-05 01:25:15] [INFO ] Added : 356 causal constraints over 73 iterations in 2251 ms. Result :sat
[2020-06-05 01:25:15] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2020-06-05 01:25:15] [INFO ] Flatten gal took : 122 ms
FORMULA ShieldPPPt-PT-020A-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-020A-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-020A-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-020A-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-05 01:25:15] [INFO ] Applying decomposition
[2020-06-05 01:25:15] [INFO ] Flatten gal took : 52 ms
[2020-06-05 01:25:15] [INFO ] Decomposing Gal with order
[2020-06-05 01:25:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-06-05 01:25:15] [INFO ] Removed a total of 120 redundant transitions.
[2020-06-05 01:25:16] [INFO ] Flatten gal took : 70 ms
[2020-06-05 01:25:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 15 ms.
[2020-06-05 01:25:16] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2020-06-05 01:25:16] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 5 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ ShieldPPPt-PT-020A @ 3570 seconds

FORMULA ShieldPPPt-PT-020A-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-020A-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-020A-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-020A-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-020A-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-020A-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-020A-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-020A-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-020A-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-020A-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-020A-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-020A-00 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2433
rslt: Output for LTLFireability @ ShieldPPPt-PT-020A

{
"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=LTLFireability.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Fri Jun 5 01:25:16 2020
",
"timelimit": 3570
},
"child":
[

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 296
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 1,
"X": 0,
"aconj": 2,
"adisj": 0,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "(F (((1 <= p12) AND (1 <= p14) AND (1 <= p157) AND (1 <= p159))) U ((1 <= p12) AND (1 <= p14)))",
"processed_size": 95,
"rewrites": 69
},
"result":
{
"edges": 8,
"markings": 8,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 1,
"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": 326
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"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 (((1 <= p157) AND (1 <= p159)))",
"processed_size": 33,
"rewrites": 69
},
"result":
{
"edges": 329,
"markings": 329,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 1,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 326
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 3,
"U": 1,
"X": 3,
"aconj": 5,
"adisj": 0,
"aneg": 2,
"comp": 10,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 1,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "X (G ((G (F ((X (((p433 <= 0) OR (p450 <= 0))) AND (F (((1 <= p381) AND (1 <= p396))) OR X (G (((p433 <= 0) OR (p450 <= 0)))))))) OR (((1 <= p433) AND (1 <= p450)) U ((1 <= p61) AND (1 <= p71))))))",
"processed_size": 199,
"rewrites": 69
},
"result":
{
"edges": 708409,
"markings": 380139,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 14
},
"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": 362
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 362
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 2,
"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 (((p404 <= 0) OR (p423 <= 0))))",
"processed_size": 37,
"rewrites": 69
},
"result":
{
"edges": 28152690,
"markings": 27208331,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "fairness",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 3,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 383
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 2,
"X": 2,
"aconj": 3,
"adisj": 2,
"aneg": 2,
"comp": 9,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 9,
"visible_transitions": 0
},
"processed": "((((p358 <= 0) OR (p375 <= 0)) U ((1 <= p305) AND (1 <= p322))) U X ((G (((p337 <= 0) OR ((1 <= p63) AND (1 <= p77)) OR (p339 <= 0))) OR X (((p174 <= 0))))))",
"processed_size": 160,
"rewrites": 69
},
"result":
{
"edges": 5,
"markings": 6,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 16
},
"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": 438
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 438
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 2,
"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": "((p341 <= 0) OR (p352 <= 0))",
"processed_size": 29,
"rewrites": 71
},
"result":
{
"edges": 8,
"markings": 8,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 6
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 511
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 2,
"U": 0,
"X": 2,
"aconj": 2,
"adisj": 1,
"aneg": 1,
"comp": 6,
"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 (G (((p254 <= 0) OR (p273 <= 0)))) OR (G (((1 <= p292) AND (1 <= p294))) AND ((p292 <= 0) OR (p294 <= 0)))))",
"processed_size": 116,
"rewrites": 69
},
"result":
{
"edges": 329,
"markings": 329,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 5,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 511
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 1,
"X": 2,
"aconj": 3,
"adisj": 2,
"aneg": 1,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X ((F ((X (((1 <= p315) AND (1 <= p349))) OR ((1 <= p24)))) U (((1 <= p24)) OR ((1 <= p315) AND (1 <= p349)))))",
"processed_size": 112,
"rewrites": 69
},
"result":
{
"edges": 198,
"markings": 198,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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": 613
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 3,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "X (X (X (F (((1 <= p220))))))",
"processed_size": 29,
"rewrites": 69
},
"result":
{
"edges": 527,
"markings": 527,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 7,
"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": 767
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 0,
"U": 2,
"X": 1,
"aconj": 4,
"adisj": 0,
"aneg": 0,
"comp": 6,
"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": 5,
"visible_transitions": 0
},
"processed": "((((1 <= p351)) U ((1 <= p67) AND (1 <= p69))) U X (F ((F (((1 <= p462) AND (1 <= p464))) AND ((1 <= p351))))))",
"processed_size": 111,
"rewrites": 69
},
"result":
{
"edges": 393,
"markings": 393,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"compoundnumber": 8,
"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": 1023
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"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 (((1 <= p329) AND (1 <= p348))))",
"processed_size": 37,
"rewrites": 69
},
"result":
{
"edges": 8,
"markings": 8,
"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": "fairness",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1534
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 0,
"aconj": 4,
"adisj": 0,
"aneg": 4,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "F (G (((G (F (((p267 <= 0) OR (p269 <= 0)))) OR (((p6 <= 0)) OR ((p21 <= 0)))) AND ((p457 <= 0) OR (p459 <= 0)))))",
"processed_size": 116,
"rewrites": 69
},
"result":
{
"edges": 11771,
"markings": 10520,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 10,
"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": 3069
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3069
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 2,
"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": "F (G (((p213 <= 0) OR (p227 <= 0))))",
"processed_size": 37,
"rewrites": 69
},
"result":
{
"edges": 8760,
"markings": 8564,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 11,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 3628,
"runtime": 1137.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "X((** OR G(*))) : (X(**) OR ((X(G(**)) U **) AND (F(**) U **))) : X(G((G(F((X(*) AND (F(**) OR X(G(*)))))) OR (** U **)))) : (G(F(*)) AND X(F(*))) : F(G(((G(F(*)) OR (* OR *)) AND *))) : (F(G(*)) AND G((F(**) OR G(*)))) : ((** U **) U X((G(*) OR X(*)))) : (X((X(G(*)) OR (G(**) AND **))) OR F(**)) : X((F((X(**) OR *)) U **)) : X(X(X(F(**)))) : G(F(**)) : ((** U **) U X(F((F(**) AND **))))"
},
"net":
{
"arcs": 1444,
"conflict_clusters": 223,
"places": 503,
"places_significant": 282,
"singleton_clusters": 0,
"transitions": 362
},
"result":
{
"preliminary_value": "unknown no no no no no yes no no no no no ",
"value": "unknown no no no no no yes 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: 865/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 16096
lola: finding significant places
lola: 503 places, 362 transitions, 282 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 LTLFireability.xml
lola: LP says that atomic proposition is always true: (p87 <= 1)
lola: LP says that atomic proposition is always true: (p89 <= 1)
lola: LP says that atomic proposition is always true: (p153 <= 1)
lola: LP says that atomic proposition is always true: (p176 <= 1)
lola: LP says that atomic proposition is always true: (p53 <= 1)
lola: LP says that atomic proposition is always true: (p76 <= 1)
lola: LP says that atomic proposition is always true: (p153 <= 1)
lola: LP says that atomic proposition is always true: (p176 <= 1)
lola: LP says that atomic proposition is always true: (p157 <= 1)
lola: LP says that atomic proposition is always true: (p159 <= 1)
lola: LP says that atomic proposition is always true: (p12 <= 1)
lola: LP says that atomic proposition is always true: (p14 <= 1)
lola: LP says that atomic proposition is always true: (p454 <= 1)
lola: LP says that atomic proposition is always true: (p473 <= 1)
lola: LP says that atomic proposition is always true: (p12 <= 1)
lola: LP says that atomic proposition is always true: (p14 <= 1)
lola: LP says that atomic proposition is always true: (p157 <= 1)
lola: LP says that atomic proposition is always true: (p159 <= 1)
lola: LP says that atomic proposition is always true: (p12 <= 1)
lola: LP says that atomic proposition is always true: (p14 <= 1)
lola: LP says that atomic proposition is always true: (p381 <= 1)
lola: LP says that atomic proposition is always true: (p396 <= 1)
lola: LP says that atomic proposition is always true: (p433 <= 1)
lola: LP says that atomic proposition is always true: (p450 <= 1)
lola: LP says that atomic proposition is always true: (p433 <= 1)
lola: LP says that atomic proposition is always true: (p450 <= 1)
lola: LP says that atomic proposition is always true: (p61 <= 1)
lola: LP says that atomic proposition is always true: (p71 <= 1)
lola: LP says that atomic proposition is always true: (p176 <= 1)
lola: LP says that atomic proposition is always true: (p404 <= 1)
lola: LP says that atomic proposition is always true: (p423 <= 1)
lola: LP says that atomic proposition is always true: (p404 <= 1)
lola: LP says that atomic proposition is always true: (p423 <= 1)
lola: LP says that atomic proposition is always true: (p117 <= 1)
lola: LP says that atomic proposition is always true: (p119 <= 1)
lola: LP says that atomic proposition is always true: (p6 <= 1)
lola: LP says that atomic proposition is always true: (p21 <= 1)
lola: LP says that atomic proposition is always true: (p267 <= 1)
lola: LP says that atomic proposition is always true: (p269 <= 1)
lola: LP says that atomic proposition is always true: (p6 <= 1)
lola: LP says that atomic proposition is always true: (p21 <= 1)
lola: LP says that atomic proposition is always true: (p457 <= 1)
lola: LP says that atomic proposition is always true: (p459 <= 1)
lola: LP says that atomic proposition is always true: (p55 <= 1)
lola: LP says that atomic proposition is always true: (p72 <= 1)
lola: LP says that atomic proposition is always true: (p213 <= 1)
lola: LP says that atomic proposition is always true: (p227 <= 1)
lola: LP says that atomic proposition is always true: (p358 <= 1)
lola: LP says that atomic proposition is always true: (p375 <= 1)
lola: LP says that atomic proposition is always true: (p305 <= 1)
lola: LP says that atomic proposition is always true: (p322 <= 1)
lola: LP says that atomic proposition is always true: (p63 <= 1)
lola: LP says that atomic proposition is always true: (p77 <= 1)
lola: LP says that atomic proposition is always true: (p337 <= 1)
lola: LP says that atomic proposition is always true: (p339 <= 1)
lola: LP says that atomic proposition is always true: (p174 <= 1)
lola: LP says that atomic proposition is always true: (p254 <= 1)
lola: LP says that atomic proposition is always true: (p273 <= 1)
lola: LP says that atomic proposition is always true: (p292 <= 1)
lola: LP says that atomic proposition is always true: (p294 <= 1)
lola: LP says that atomic proposition is always true: (p292 <= 1)
lola: LP says that atomic proposition is always true: (p294 <= 1)
lola: LP says that atomic proposition is always true: (p341 <= 1)
lola: LP says that atomic proposition is always true: (p352 <= 1)
lola: LP says that atomic proposition is always true: (p315 <= 1)
lola: LP says that atomic proposition is always true: (p349 <= 1)
lola: LP says that atomic proposition is always true: (p24 <= 1)
lola: LP says that atomic proposition is always true: (p24 <= 1)
lola: LP says that atomic proposition is always true: (p315 <= 1)
lola: LP says that atomic proposition is always true: (p349 <= 1)
lola: LP says that atomic proposition is always true: (p220 <= 1)
lola: LP says that atomic proposition is always true: (p329 <= 1)
lola: LP says that atomic proposition is always true: (p348 <= 1)
lola: LP says that atomic proposition is always true: (p351 <= 1)
lola: LP says that atomic proposition is always true: (p67 <= 1)
lola: LP says that atomic proposition is always true: (p69 <= 1)
lola: LP says that atomic proposition is always true: (p462 <= 1)
lola: LP says that atomic proposition is always true: (p464 <= 1)
lola: LP says that atomic proposition is always true: (p351 <= 1)
lola: (X ((((1 <= p87) AND (1 <= p89)) OR ((1 <= p153) AND (1 <= p176)))) OR NOT(X (F (((1 <= p53) AND (1 <= p76) AND (1 <= p153) AND (1 <= p176)))))) : (X (((1 <= p157) AND (1 <= p159))) OR ((X (G (((1 <= p12) AND (1 <= p14)))) U ((1 <= p454) AND (1 <= p473))) AND (F (((1 <= p12) AND (1 <= p14) AND (1 <= p157) AND (1 <= p159))) U ((1 <= p12) AND (1 <= p14))))) : G (X ((G (F (NOT((NOT(F (((1 <= p381) AND (1 <= p396)))) U X (((1 <= p433) AND (1 <= p450))))))) OR (((1 <= p433) AND (1 <= p450)) U ((1 <= p61) AND (1 <= p71)))))) : (NOT(F ((X ((F (((1 <= p176))) U ((1 <= p404) AND (1 <= p423)))) U G (((1 <= p404) AND (1 <= p423)))))) AND NOT(X (G (((1 <= p117) AND (1 <= p119)))))) : (((1 <= p6) AND (1 <= p21)) U NOT(G (F ((((F (G (((1 <= p267) AND (1 <= p269)))) AND ((1 <= p6))) AND ((1 <= p21))) OR ((1 <= p457) AND (1 <= p459))))))) : G ((F (((1 <= p55) AND (1 <= p72))) U NOT(F (((1 <= p213) AND (1 <= p227)))))) : ((((p358 <= 0) OR (p375 <= 0)) U ((1 <= p305) AND (1 <= p322))) U X ((NOT(F (((1 <= p337) AND ((p63 <= 0) OR (p77 <= 0)) AND (1 <= p339)))) OR NOT(X (((1 <= p174))))))) : ((NOT(X (F (X (((1 <= p254) AND (1 <= p273)))))) OR X ((G (((1 <= p292) AND (1 <= p294))) AND ((p292 <= 0) OR (p294 <= 0))))) OR F (((1 <= p341) AND (1 <= p352)))) : X ((F (NOT(G ((NOT(X (((1 <= p315) AND (1 <= p349)))) AND ((p24 <= 0)))))) U (((1 <= p24)) OR ((1 <= p315) AND (1 <= p349))))) : NOT(X (NOT(X (X (F (((1 <= p220)))))))) : G (F (((1 <= p329) AND (1 <= p348)))) : ((((1 <= p351)) U ((1 <= p67) AND (1 <= p69))) U X (F ((F (((1 <= p462) AND (1 <= p464))) AND ((1 <= p351))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:528
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:356
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:434
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:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:315
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:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:374
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:528
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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:300
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 296 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((((1 <= p87) AND (1 <= p89)) OR ((1 <= p153) AND (1 <= p176))) OR G (((p53 <= 0) OR (p76 <= 0) OR (p153 <= 0) OR (p176 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((((1 <= p87) AND (1 <= p89)) OR ((1 <= p153) AND (1 <= p176))) OR G (((p53 <= 0) OR (p76 <= 0) OR (p153 <= 0) OR (p176 <= 0)))))
lola: processed formula length: 136
lola: 69 rewrites
lola: closed formula file LTLFireability.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: 622078 markings, 1664001 edges, 124416 markings/sec, 0 secs
lola: 1139540 markings, 3175211 edges, 103492 markings/sec, 5 secs
lola: 1645052 markings, 4702260 edges, 101102 markings/sec, 10 secs
lola: 2122817 markings, 6172686 edges, 95553 markings/sec, 15 secs
lola: 2552873 markings, 7528750 edges, 86011 markings/sec, 20 secs
lola: 2979595 markings, 8885700 edges, 85344 markings/sec, 25 secs
lola: 3420287 markings, 10294153 edges, 88138 markings/sec, 30 secs
lola: 3844920 markings, 11669854 edges, 84927 markings/sec, 35 secs
lola: 4264356 markings, 13043099 edges, 83887 markings/sec, 40 secs
lola: 4682662 markings, 14421248 edges, 83661 markings/sec, 45 secs
lola: 5090632 markings, 15757144 edges, 81594 markings/sec, 50 secs
lola: 5498623 markings, 17110761 edges, 81598 markings/sec, 55 secs
lola: 5892007 markings, 18412916 edges, 78677 markings/sec, 60 secs
lola: 6276956 markings, 19704133 edges, 76990 markings/sec, 65 secs
lola: 6659880 markings, 20981522 edges, 76585 markings/sec, 70 secs
lola: 7056651 markings, 22313398 edges, 79354 markings/sec, 75 secs
lola: 7449126 markings, 23644848 edges, 78495 markings/sec, 80 secs
lola: 7828288 markings, 24939993 edges, 75832 markings/sec, 85 secs
lola: 8195775 markings, 26194748 edges, 73497 markings/sec, 90 secs
lola: 8556799 markings, 27429481 edges, 72205 markings/sec, 95 secs
lola: 8923965 markings, 28685691 edges, 73433 markings/sec, 100 secs
lola: 9290282 markings, 29954015 edges, 73263 markings/sec, 105 secs
lola: 9655783 markings, 31208832 edges, 73100 markings/sec, 110 secs
lola: 10047531 markings, 32359995 edges, 78350 markings/sec, 115 secs
lola: 10422274 markings, 33427195 edges, 74949 markings/sec, 120 secs
lola: 10796383 markings, 34547111 edges, 74822 markings/sec, 125 secs
lola: 11193519 markings, 35728900 edges, 79427 markings/sec, 130 secs
lola: 11589097 markings, 36923056 edges, 79116 markings/sec, 135 secs
lola: 11985581 markings, 38151018 edges, 79297 markings/sec, 140 secs
lola: 12277456 markings, 39071519 edges, 58375 markings/sec, 145 secs
lola: 12599320 markings, 40084279 edges, 64373 markings/sec, 150 secs
lola: 12970779 markings, 41260041 edges, 74292 markings/sec, 155 secs
lola: 13346607 markings, 42473459 edges, 75166 markings/sec, 160 secs
lola: 13742208 markings, 43771054 edges, 79120 markings/sec, 165 secs
lola: 14129705 markings, 45018037 edges, 77499 markings/sec, 170 secs
lola: 14516463 markings, 46288657 edges, 77352 markings/sec, 175 secs
lola: 14902039 markings, 47561692 edges, 77115 markings/sec, 180 secs
lola: 15290869 markings, 48861429 edges, 77766 markings/sec, 185 secs
lola: 15664621 markings, 50099039 edges, 74750 markings/sec, 190 secs
lola: 16043515 markings, 51369383 edges, 75779 markings/sec, 195 secs
lola: 16432451 markings, 52675731 edges, 77787 markings/sec, 200 secs
lola: 16827951 markings, 54006098 edges, 79100 markings/sec, 205 secs
lola: 17196773 markings, 55250535 edges, 73764 markings/sec, 210 secs
lola: 17570655 markings, 56512426 edges, 74776 markings/sec, 215 secs
lola: 17959211 markings, 57839701 edges, 77711 markings/sec, 220 secs
lola: 18329165 markings, 59110910 edges, 73991 markings/sec, 225 secs
lola: 18719303 markings, 60452634 edges, 78028 markings/sec, 230 secs
lola: 19108787 markings, 61802743 edges, 77897 markings/sec, 235 secs
lola: 19498539 markings, 63147585 edges, 77950 markings/sec, 240 secs
lola: 19886032 markings, 64487083 edges, 77499 markings/sec, 245 secs
lola: 20277204 markings, 65835970 edges, 78234 markings/sec, 250 secs
lola: 20663882 markings, 67185905 edges, 77336 markings/sec, 255 secs
lola: 21048602 markings, 68525808 edges, 76944 markings/sec, 260 secs
lola: 21434721 markings, 69879637 edges, 77224 markings/sec, 265 secs
lola: 21818542 markings, 71225054 edges, 76764 markings/sec, 270 secs
lola: 22202909 markings, 72569308 edges, 76873 markings/sec, 275 secs
lola: 22588228 markings, 73923084 edges, 77064 markings/sec, 280 secs
lola: 22971937 markings, 75274339 edges, 76742 markings/sec, 285 secs
lola: 23354566 markings, 76629036 edges, 76526 markings/sec, 290 secs
lola: local time limit reached - aborting
lola:
preliminary result: unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola: memory consumption: 9725132 KB
lola: time consumption: 304 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLFireability.json
lola: closed JSON file LTLFireability.json
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 1 will run for 296 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (((1 <= p157) AND (1 <= p159))) OR ((X (G (((1 <= p12) AND (1 <= p14)))) U ((1 <= p454) AND (1 <= p473))) AND (F (((1 <= p12) AND (1 <= p14) AND (1 <= p157) AND (1 <= p159))) U ((1 <= p12) AND (1 <= p14)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 296 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (((1 <= p12) AND (1 <= p14) AND (1 <= p157) AND (1 <= p159))) U ((1 <= p12) AND (1 <= p14)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (F (((1 <= p12) AND (1 <= p14) AND (1 <= p157) AND (1 <= p159))) U ((1 <= p12) AND (1 <= p14)))
lola: processed formula length: 95
lola: 69 rewrites
lola: closed formula file LTLFireability.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: 8 markings, 8 edges
lola: ========================================
lola: subprocess 2 will run for 326 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((1 <= p157) AND (1 <= p159)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((1 <= p157) AND (1 <= p159)))
lola: processed formula length: 33
lola: 69 rewrites
lola: closed formula file LTLFireability.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: 329 markings, 329 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 326 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((G (F ((X (((p433 <= 0) OR (p450 <= 0))) AND (F (((1 <= p381) AND (1 <= p396))) OR X (G (((p433 <= 0) OR (p450 <= 0)))))))) OR (((1 <= p433) AND (1 <= p450)) U ((1 <= p61) AND (1 <= p71))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((G (F ((X (((p433 <= 0) OR (p450 <= 0))) AND (F (((1 <= p381) AND (1 <= p396))) OR X (G (((p433 <= 0) OR (p450 <= 0)))))))) OR (((1 <= p433) AND (1 <= p450)) U ((1 <= p61) AND (1 <= p71))))))
lola: processed formula length: 199
lola: 69 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 14 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: add low 65
lola: add low 183
lola: add low 192
lola: add low 65
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: 380139 markings, 708409 edges
lola: ========================================
lola: subprocess 3 will run for 362 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G (F (((p404 <= 0) OR (p423 <= 0)))) AND X (F (((p117 <= 0) OR (p119 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 362 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F (((p404 <= 0) OR (p423 <= 0))))
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 (((p404 <= 0) OR (p423 <= 0))))
lola: processed formula length: 37
lola: 69 rewrites
lola: closed formula file LTLFireability.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: 792152 markings, 797886 edges, 158430 markings/sec, 0 secs
lola: 1562199 markings, 1577037 edges, 154009 markings/sec, 5 secs
lola: 2320736 markings, 2346108 edges, 151707 markings/sec, 10 secs
lola: 3077607 markings, 3114908 edges, 151374 markings/sec, 15 secs
lola: 3831869 markings, 3885750 edges, 150852 markings/sec, 20 secs
lola: 4585081 markings, 4657648 edges, 150642 markings/sec, 25 secs
lola: 5325584 markings, 5417791 edges, 148101 markings/sec, 30 secs
lola: 6013812 markings, 6122677 edges, 137646 markings/sec, 35 secs
lola: 6703260 markings, 6831021 edges, 137890 markings/sec, 40 secs
lola: 7414826 markings, 7562666 edges, 142313 markings/sec, 45 secs
lola: 8138649 markings, 8310000 edges, 144765 markings/sec, 50 secs
lola: 8855991 markings, 9047122 edges, 143468 markings/sec, 55 secs
lola: 9569597 markings, 9782766 edges, 142721 markings/sec, 60 secs
lola: 10283423 markings, 10519293 edges, 142765 markings/sec, 65 secs
lola: 10989958 markings, 11245317 edges, 141307 markings/sec, 70 secs
lola: 11719334 markings, 12002295 edges, 145875 markings/sec, 75 secs
lola: 12439821 markings, 12754762 edges, 144097 markings/sec, 80 secs
lola: 13151964 markings, 13490580 edges, 142429 markings/sec, 85 secs
lola: 13860197 markings, 14222420 edges, 141647 markings/sec, 90 secs
lola: 14573622 markings, 14962333 edges, 142685 markings/sec, 95 secs
lola: 15287670 markings, 15705102 edges, 142810 markings/sec, 100 secs
lola: 16008063 markings, 16460696 edges, 144079 markings/sec, 105 secs
lola: 16711409 markings, 17191487 edges, 140669 markings/sec, 110 secs
lola: 17426179 markings, 17944841 edges, 142954 markings/sec, 115 secs
lola: 18116814 markings, 18655103 edges, 138127 markings/sec, 120 secs
lola: 18815921 markings, 19380493 edges, 139821 markings/sec, 125 secs
lola: 19526539 markings, 20123611 edges, 142124 markings/sec, 130 secs
lola: 20221679 markings, 20846899 edges, 139028 markings/sec, 135 secs
lola: 20903152 markings, 21562446 edges, 136295 markings/sec, 140 secs
lola: 21542490 markings, 22222473 edges, 127868 markings/sec, 145 secs
lola: 22182516 markings, 22884558 edges, 128005 markings/sec, 150 secs
lola: 22859054 markings, 23597678 edges, 135308 markings/sec, 155 secs
lola: 23529193 markings, 24301563 edges, 134028 markings/sec, 160 secs
lola: 24211772 markings, 25014518 edges, 136516 markings/sec, 165 secs
lola: 24900793 markings, 25745123 edges, 137804 markings/sec, 170 secs
lola: 25538734 markings, 26424264 edges, 127588 markings/sec, 175 secs
lola: 26200106 markings, 27113132 edges, 132274 markings/sec, 180 secs
lola: 26825615 markings, 27760308 edges, 125102 markings/sec, 185 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: 27208331 markings, 28152690 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 4 will run for 383 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((((p358 <= 0) OR (p375 <= 0)) U ((1 <= p305) AND (1 <= p322))) U X ((G (((p337 <= 0) OR ((1 <= p63) AND (1 <= p77)) OR (p339 <= 0))) OR X (((p174 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((((p358 <= 0) OR (p375 <= 0)) U ((1 <= p305) AND (1 <= p322))) U X ((G (((p337 <= 0) OR ((1 <= p63) AND (1 <= p77)) OR (p339 <= 0))) OR X (((p174 <= 0))))))
lola: processed formula length: 160
lola: 69 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 16 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: 6 markings, 5 edges
lola: ========================================
lola: subprocess 5 will run for 438 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X ((X (G (((p254 <= 0) OR (p273 <= 0)))) OR (G (((1 <= p292) AND (1 <= p294))) AND ((p292 <= 0) OR (p294 <= 0))))) OR F (((1 <= p341) AND (1 <= p352))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 438 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((1 <= p341) AND (1 <= p352)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((p341 <= 0) OR (p352 <= 0))
lola: processed formula length: 29
lola: 71 rewrites
lola: closed formula file LTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 8 markings, 8 edges
lola: ========================================
lola: subprocess 6 will run for 511 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X (G (((p254 <= 0) OR (p273 <= 0)))) OR (G (((1 <= p292) AND (1 <= p294))) AND ((p292 <= 0) OR (p294 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X (G (((p254 <= 0) OR (p273 <= 0)))) OR (G (((1 <= p292) AND (1 <= p294))) AND ((p292 <= 0) OR (p294 <= 0)))))
lola: processed formula length: 116
lola: 69 rewrites
lola: closed formula file LTLFireability.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: 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: 329 markings, 329 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 6 will run for 511 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((F ((X (((1 <= p315) AND (1 <= p349))) OR ((1 <= p24)))) U (((1 <= p24)) OR ((1 <= p315) AND (1 <= p349)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((F ((X (((1 <= p315) AND (1 <= p349))) OR ((1 <= p24)))) U (((1 <= p24)) OR ((1 <= p315) AND (1 <= p349)))))
lola: processed formula length: 112
lola: 69 rewrites
lola: closed formula file LTLFireability.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: 198 markings, 198 edges
lola: ========================================
lola: subprocess 7 will run for 613 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (X (F (((1 <= p220))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (X (F (((1 <= p220))))))
lola: processed formula length: 29
lola: 69 rewrites
lola: closed formula file LTLFireability.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: 527 markings, 527 edges
lola: ========================================
lola: subprocess 8 will run for 767 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((((1 <= p351)) U ((1 <= p67) AND (1 <= p69))) U X (F ((F (((1 <= p462) AND (1 <= p464))) AND ((1 <= p351))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((((1 <= p351)) U ((1 <= p67) AND (1 <= p69))) U X (F ((F (((1 <= p462) AND (1 <= p464))) AND ((1 <= p351))))))
lola: processed formula length: 111
lola: 69 rewrites
lola: closed formula file LTLFireability.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: 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: 393 markings, 393 edges
lola: ========================================
lola: subprocess 9 will run for 1023 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F (((1 <= p329) AND (1 <= p348))))
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 (((1 <= p329) AND (1 <= p348))))
lola: processed formula length: 37
lola: 69 rewrites
lola: closed formula file LTLFireability.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: 8 markings, 8 edges
lola: ========================================
lola: subprocess 10 will run for 1534 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((G (F (((p267 <= 0) OR (p269 <= 0)))) OR (((p6 <= 0)) OR ((p21 <= 0)))) AND ((p457 <= 0) OR (p459 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G (((G (F (((p267 <= 0) OR (p269 <= 0)))) OR (((p6 <= 0)) OR ((p21 <= 0)))) AND ((p457 <= 0) OR (p459 <= 0)))))
lola: processed formula length: 116
lola: 69 rewrites
lola: closed formula file LTLFireability.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: 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: 10520 markings, 11771 edges
lola: ========================================
lola: subprocess 11 will run for 3069 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (G (((p213 <= 0) OR (p227 <= 0)))) AND G ((F (((1 <= p55) AND (1 <= p72))) OR G (((p213 <= 0) OR (p227 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 3069 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((p213 <= 0) OR (p227 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G (((p213 <= 0) OR (p227 <= 0))))
lola: processed formula length: 37
lola: 69 rewrites
lola: closed formula file LTLFireability.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: 8564 markings, 8760 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: X (((((1 <= p87) AND (1 <= p89)) OR ((1 <= p153) AND (1 <= p176))) OR G (((p53 <= 0) OR (p76 <= 0) OR (p153 <= 0) OR (p176 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((((1 <= p87) AND (1 <= p89)) OR ((1 <= p153) AND (1 <= p176))) OR G (((p53 <= 0) OR (p76 <= 0) OR (p153 <= 0) OR (p176 <= 0)))))
lola: processed formula length: 136
lola: 69 rewrites
lola: closed formula file LTLFireability.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: 588448 markings, 1566710 edges, 117690 markings/sec, 0 secs
lola: 1162731 markings, 3246154 edges, 114857 markings/sec, 5 secs
lola: 1682141 markings, 4819546 edges, 103882 markings/sec, 10 secs
lola: 2164324 markings, 6304401 edges, 96437 markings/sec, 15 secs
lola: 2646078 markings, 7814547 edges, 96351 markings/sec, 20 secs
lola: 3129768 markings, 9364158 edges, 96738 markings/sec, 25 secs
lola: 3603056 markings, 10888480 edges, 94658 markings/sec, 30 secs
lola: 4049433 markings, 12341253 edges, 89275 markings/sec, 35 secs
lola: 4474667 markings, 13736414 edges, 85047 markings/sec, 40 secs
lola: 4913207 markings, 15180119 edges, 87708 markings/sec, 45 secs
lola: 5343538 markings, 16595104 edges, 86066 markings/sec, 50 secs
lola: 5784527 markings, 18046373 edges, 88198 markings/sec, 55 secs
lola: 6227505 markings, 19539900 edges, 88596 markings/sec, 60 secs
lola: 6670353 markings, 21017810 edges, 88570 markings/sec, 65 secs
lola: 7113563 markings, 22500651 edges, 88642 markings/sec, 70 secs
lola: 7548901 markings, 23985145 edges, 87068 markings/sec, 75 secs
lola: 7981445 markings, 25459335 edges, 86509 markings/sec, 80 secs
lola: 8411620 markings, 26933482 edges, 86035 markings/sec, 85 secs
lola: 8838615 markings, 28390702 edges, 85399 markings/sec, 90 secs
lola: 9190887 markings, 29611315 edges, 70454 markings/sec, 95 secs
lola: 9494361 markings, 30653747 edges, 60695 markings/sec, 100 secs
lola: 9793970 markings, 31688819 edges, 59922 markings/sec, 105 secs
lola: 10208152 markings, 32814139 edges, 82836 markings/sec, 110 secs
lola: 10610512 markings, 33989744 edges, 80472 markings/sec, 115 secs
lola: 11027734 markings, 35236298 edges, 83444 markings/sec, 120 secs
lola: 11452306 markings, 36524733 edges, 84914 markings/sec, 125 secs
lola: 11881583 markings, 37829153 edges, 85855 markings/sec, 130 secs
lola: 12281545 markings, 39084508 edges, 79992 markings/sec, 135 secs
lola: 12683013 markings, 40344015 edges, 80294 markings/sec, 140 secs
lola: 13091371 markings, 41650062 edges, 81672 markings/sec, 145 secs
lola: 13477886 markings, 42902274 edges, 77303 markings/sec, 150 secs
lola: 13869732 markings, 44183292 edges, 78369 markings/sec, 155 secs
lola: 14288569 markings, 45536992 edges, 83767 markings/sec, 160 secs
lola: 14697252 markings, 46882372 edges, 81737 markings/sec, 165 secs
lola: 15107127 markings, 48243353 edges, 81975 markings/sec, 170 secs
lola: 15515619 markings, 49605502 edges, 81698 markings/sec, 175 secs
lola: 15926096 markings, 50978452 edges, 82095 markings/sec, 180 secs
lola: 16330080 markings, 52333339 edges, 80797 markings/sec, 185 secs
lola: 16728999 markings, 53671854 edges, 79784 markings/sec, 190 secs
lola: 17126001 markings, 55009543 edges, 79400 markings/sec, 195 secs
lola: 17516468 markings, 56331002 edges, 78093 markings/sec, 200 secs
lola: 17915463 markings, 57690683 edges, 79799 markings/sec, 205 secs
lola: 18299036 markings, 59008708 edges, 76715 markings/sec, 210 secs
lola: 18684899 markings, 60336212 edges, 77173 markings/sec, 215 secs
lola: 19080814 markings, 61704503 edges, 79183 markings/sec, 220 secs
lola: 19476033 markings, 63070011 edges, 79044 markings/sec, 225 secs
lola: 19863267 markings, 64409109 edges, 77447 markings/sec, 230 secs
lola: 20257924 markings, 65769850 edges, 78931 markings/sec, 235 secs
lola: 20649474 markings, 67135335 edges, 78310 markings/sec, 240 secs
lola: 21040597 markings, 68497604 edges, 78225 markings/sec, 245 secs
lola: 21432255 markings, 69870833 edges, 78332 markings/sec, 250 secs
lola: 21821305 markings, 71234731 edges, 77810 markings/sec, 255 secs
lola: 22193845 markings, 72537328 edges, 74508 markings/sec, 260 secs
lola: 22557073 markings, 73813315 edges, 72646 markings/sec, 265 secs
lola: 22932686 markings, 75135824 edges, 75123 markings/sec, 270 secs
lola: 23313781 markings, 76487405 edges, 76219 markings/sec, 275 secs
lola: 23690770 markings, 77820041 edges, 75398 markings/sec, 280 secs
lola: 24061197 markings, 79142560 edges, 74085 markings/sec, 285 secs
lola: 24435667 markings, 80474741 edges, 74894 markings/sec, 290 secs
lola: 24809029 markings, 81807007 edges, 74672 markings/sec, 295 secs
lola: 25158819 markings, 83048885 edges, 69958 markings/sec, 300 secs
lola: 25517577 markings, 84335751 edges, 71752 markings/sec, 305 secs
lola: 25893310 markings, 85675715 edges, 75147 markings/sec, 310 secs
lola: 26272794 markings, 87042603 edges, 75897 markings/sec, 315 secs
lola: 26645441 markings, 88381304 edges, 74529 markings/sec, 320 secs
lola: 27017403 markings, 89720173 edges, 74392 markings/sec, 325 secs
lola: 27387637 markings, 91050210 edges, 74047 markings/sec, 330 secs
lola: 27799596 markings, 92238164 edges, 82392 markings/sec, 335 secs
lola: 28175946 markings, 93328053 edges, 75270 markings/sec, 340 secs
lola: 28651260 markings, 94625042 edges, 95063 markings/sec, 345 secs
lola: 29102969 markings, 95944364 edges, 90342 markings/sec, 350 secs
lola: 29544090 markings, 97259783 edges, 88224 markings/sec, 355 secs
lola: 29983484 markings, 98568292 edges, 87879 markings/sec, 360 secs
lola: 30404161 markings, 99876264 edges, 84135 markings/sec, 365 secs
lola: 30827967 markings, 101214820 edges, 84761 markings/sec, 370 secs
lola: 31236188 markings, 102511131 edges, 81644 markings/sec, 375 secs
lola: 31591472 markings, 103737278 edges, 71057 markings/sec, 380 secs
lola: 31944682 markings, 105015103 edges, 70642 markings/sec, 385 secs
lola: 32311603 markings, 106335493 edges, 73384 markings/sec, 390 secs
lola: 32702107 markings, 107627163 edges, 78101 markings/sec, 395 secs
lola: 33062376 markings, 108937089 edges, 72054 markings/sec, 400 secs
lola: 33436829 markings, 110187754 edges, 74891 markings/sec, 405 secs
lola: 33844972 markings, 111503819 edges, 81629 markings/sec, 410 secs
lola: 34243929 markings, 112799283 edges, 79791 markings/sec, 415 secs
lola: 34639285 markings, 114102922 edges, 79071 markings/sec, 420 secs
lola: 35034674 markings, 115412900 edges, 79078 markings/sec, 425 secs
lola: 35434107 markings, 116742626 edges, 79887 markings/sec, 430 secs
lola: 35807660 markings, 118061671 edges, 74711 markings/sec, 435 secs
lola: 36178676 markings, 119406278 edges, 74203 markings/sec, 440 secs
lola: 36549899 markings, 120756305 edges, 74245 markings/sec, 445 secs
lola: 36917370 markings, 122092709 edges, 73494 markings/sec, 450 secs
lola: 37286164 markings, 123428708 edges, 73759 markings/sec, 455 secs
lola: 37673579 markings, 124702752 edges, 77483 markings/sec, 460 secs
lola: 38039910 markings, 126034049 edges, 73266 markings/sec, 465 secs
lola: 38404353 markings, 127366826 edges, 72889 markings/sec, 470 secs
lola: 38767882 markings, 128692063 edges, 72706 markings/sec, 475 secs
lola: 39045948 markings, 129708415 edges, 55613 markings/sec, 480 secs
lola: 39383626 markings, 130936026 edges, 67536 markings/sec, 485 secs
lola: 39735836 markings, 132224572 edges, 70442 markings/sec, 490 secs
lola: 40082423 markings, 133493280 edges, 69317 markings/sec, 495 secs
lola: 40431845 markings, 134766240 edges, 69884 markings/sec, 500 secs
lola: 40778884 markings, 136043228 edges, 69408 markings/sec, 505 secs
lola: 41126313 markings, 137323470 edges, 69486 markings/sec, 510 secs
lola: 41481377 markings, 138629581 edges, 71013 markings/sec, 515 secs
lola: 41831026 markings, 139922709 edges, 69930 markings/sec, 520 secs
lola: 42182691 markings, 141058763 edges, 70333 markings/sec, 525 secs
lola: 42553835 markings, 142276922 edges, 74229 markings/sec, 530 secs
lola: 42902033 markings, 143516411 edges, 69640 markings/sec, 535 secs
lola: 43245612 markings, 144787517 edges, 68716 markings/sec, 540 secs
lola: 43594194 markings, 146071117 edges, 69716 markings/sec, 545 secs
lola: 43944240 markings, 147368413 edges, 70009 markings/sec, 550 secs
lola: 44223372 markings, 148406563 edges, 55826 markings/sec, 555 secs
lola: 44518129 markings, 149502433 edges, 58951 markings/sec, 560 secs
lola: 44859014 markings, 150765455 edges, 68177 markings/sec, 565 secs
lola: 45242506 markings, 151978840 edges, 76698 markings/sec, 570 secs
lola: 45525650 markings, 152769937 edges, 56629 markings/sec, 575 secs
lola: 45744725 markings, 153409575 edges, 43815 markings/sec, 580 secs
lola: 46069504 markings, 154359223 edges, 64956 markings/sec, 585 secs
lola: 46393345 markings, 155375919 edges, 64768 markings/sec, 590 secs
lola: 46738977 markings, 156639063 edges, 69126 markings/sec, 595 secs
lola: 47046681 markings, 157784361 edges, 61541 markings/sec, 600 secs
lola: 47393803 markings, 159064473 edges, 69424 markings/sec, 605 secs
lola: 47741308 markings, 160353026 edges, 69501 markings/sec, 610 secs
lola: 48087753 markings, 161647726 edges, 69289 markings/sec, 615 secs
lola: 48424535 markings, 162901179 edges, 67356 markings/sec, 620 secs
lola: 48750030 markings, 164103889 edges, 65099 markings/sec, 625 secs
lola: 49067257 markings, 165252334 edges, 63445 markings/sec, 630 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: unknown no no no no no yes no no no no no
lola:
preliminary result: unknown no no no no no yes no no no no no
lola: memory consumption: 3628 KB
lola: time consumption: 1137 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLFireability.json
lola: closed JSON file LTLFireability.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="ShieldPPPt-PT-020A"
export BK_EXAMINATION="LTLFireability"
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 ShieldPPPt-PT-020A, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r211-tajo-159033477800666"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPt-PT-020A.tgz
mv ShieldPPPt-PT-020A execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;