fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r178-tajo-158987882400449
Last Updated
Jun 28, 2020

About the Execution of ITS-LoLa for Diffusion2D-PT-D10N200

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15772.590 3600000.00 644675.00 10789.60 F?FFFFFFFFTTFFFT normal

Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2020-input.r178-tajo-158987882400449.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 Diffusion2D-PT-D10N200, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-tajo-158987882400449
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 448K
-rw-r--r-- 1 mcc users 3.6K Mar 31 06:32 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 31 06:32 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Mar 29 22:53 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 29 22:53 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.8K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Apr 8 14:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 8 14:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.7K Mar 28 14:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 28 14:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Mar 27 07:31 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 27 07:31 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 28 14:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 28 14:50 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 8 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 255K Mar 24 05:37 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1591221264156

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 21:54:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-03 21:54:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 21:54:26] [INFO ] Load time of PNML (sax parser for PT used): 70 ms
[2020-06-03 21:54:26] [INFO ] Transformed 100 places.
[2020-06-03 21:54:26] [INFO ] Transformed 684 transitions.
[2020-06-03 21:54:26] [INFO ] Parsed PT model containing 100 places and 684 transitions in 114 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 16 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100148 steps, including 0 resets, run finished after 36 ms. (steps per millisecond=2781 ) properties seen :[1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 684 rows 100 cols
[2020-06-03 21:54:26] [INFO ] Computed 1 place invariants in 11 ms
[2020-06-03 21:54:26] [INFO ] [Real]Absence check using 1 positive place invariants in 8 ms returned unsat
[2020-06-03 21:54:26] [INFO ] [Real]Absence check using 1 positive place invariants in 10 ms returned unsat
Successfully simplified 2 atomic propositions for a total of 3 simplifications.
[2020-06-03 21:54:26] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2020-06-03 21:54:26] [INFO ] Flatten gal took : 63 ms
FORMULA Diffusion2D-PT-D10N200-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Diffusion2D-PT-D10N200-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Diffusion2D-PT-D10N200-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 21:54:26] [INFO ] Flatten gal took : 26 ms
[2020-06-03 21:54:26] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2020-06-03 21:54:26] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 5 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ Diffusion2D-PT-D10N200 @ 3570 seconds

FORMULA Diffusion2D-PT-D10N200-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Diffusion2D-PT-D10N200-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Diffusion2D-PT-D10N200-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Diffusion2D-PT-D10N200-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Diffusion2D-PT-D10N200-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Diffusion2D-PT-D10N200-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Diffusion2D-PT-D10N200-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Diffusion2D-PT-D10N200-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Diffusion2D-PT-D10N200-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Diffusion2D-PT-D10N200-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Diffusion2D-PT-D10N200-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Diffusion2D-PT-D10N200-01 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Diffusion2D-PT-D10N200-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2955
rslt: Output for LTLCardinality @ Diffusion2D-PT-D10N200

{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2020",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=LTLCardinality.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Wed Jun 3 21:54:26 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 3,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "X (X (F ((G ((F ((p86 <= 0)) AND (p35 + 1 <= p93))) OR (p59 + 1 <= p90)))))",
"processed_size": 75,
"rewrites": 79
},
"result":
{
"edges": 5,
"markings": 5,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 299
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 3,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 2,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "X ((X (G ((F ((p76 <= p68)) AND (X (F ((p84 <= 2))) OR (p76 <= p68))))) AND (p99 + 1 <= p54)))",
"processed_size": 94,
"rewrites": 79
},
"result":
{
"edges": 5,
"markings": 5,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 329
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "G ((2 <= p30))",
"processed_size": 14,
"rewrites": 79
},
"result":
{
"edges": 10,
"markings": 10,
"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": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 365
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 1,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 4,
"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": 6,
"visible_transitions": 0
},
"processed": "G (((p93 <= p56) AND (X ((F ((3 <= p68)) U (1 <= p58))) OR (p67 <= p35))))",
"processed_size": 74,
"rewrites": 79
},
"result":
{
"edges": 21,
"markings": 16,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 3,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 365
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 1,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 4,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "(X (F ((p64 + 1 <= p34))) U (((p79 <= p88) R (p56 <= 2)) AND G (((p50 + 1 <= p41) OR (p88 + 1 <= p79)))))",
"processed_size": 106,
"rewrites": 79
},
"result":
{
"edges": 5,
"markings": 5,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 11
},
"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": 411
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 3,
"U": 0,
"X": 3,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X (X ((F (G ((2 <= p7))) AND G (((p35 <= p93) OR X (G ((2 <= p7))))))))",
"processed_size": 71,
"rewrites": 79
},
"result":
{
"edges": 131480,
"markings": 39251,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 470
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 1,
"X": 3,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X ((X ((p81 <= p30)) U (G ((3 <= p63)) AND X ((p30 + 1 <= p81)))))",
"processed_size": 66,
"rewrites": 79
},
"result":
{
"edges": 9,
"markings": 8,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 9
},
"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": 548
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 1,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X (G (((p25 + 1 <= p86) AND (p90 <= 2))))",
"processed_size": 41,
"rewrites": 79
},
"result":
{
"edges": 5,
"markings": 5,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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": 658
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 1,
"U": 1,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 11,
"taut": 0,
"tconj": 3,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "X (F ((((2 <= p79) U (p57 <= p27)) OR ((G ((F ((3 <= p74)) AND ((2 <= p79) AND (p57 <= p27)))) AND F ((p57 <= p27))) OR (p20 <= p33)))))",
"processed_size": 136,
"rewrites": 79
},
"result":
{
"edges": 8,
"markings": 9,
"produced_by": "LTL model checker",
"value": true
},
"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": 823
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 3,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X (G ((F ((p70 + 1 <= p95)) OR (G ((p1 + 1 <= p67)) AND F ((p70 + 1 <= p95))))))",
"processed_size": 80,
"rewrites": 79
},
"result":
{
"edges": 5,
"markings": 5,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 9,
"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": 1097
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1097
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(p40 <= p67)",
"processed_size": 12,
"rewrites": 81
},
"result":
{
"edges": 5,
"markings": 5,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 26
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1646
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"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 (((p4 <= 2) R (3 <= p55)))",
"processed_size": 28,
"rewrites": 79
},
"result":
{
"edges": 5,
"markings": 5,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 11,
"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": 10,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1646
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 2,
"X": 3,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X (((((1 <= p58) U X ((1 <= p58))) AND F ((p18 <= 0))) U X ((p38 <= p66))))",
"processed_size": 75,
"rewrites": 79
},
"result":
{
"edges": 392,
"markings": 192,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 10
},
"compoundnumber": 11,
"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": 3292
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3292
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(p17 + 1 <= p69)",
"processed_size": 16,
"rewrites": 79
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 12,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 12,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(p17 + 1 <= p69)",
"processed_size": 16,
"rewrites": 79
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 14,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "F (G ((((p69 <= p17) OR (3 <= p4)) AND (p4 <= p18))))",
"processed_size": 54,
"rewrites": 79
},
"result":
{
"edges": 8364,
"markings": 4710,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 14,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 3664,
"runtime": 615.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "X((G(**) OR (X(F(**)) AND **))) : X(X(F((G((F(*) AND *)) OR *)))) : X((X(G((F(**) AND (X(F(*)) OR **)))) AND **)) : (G((** AND (X((F(**) U **)) OR **))) OR (G(**) AND F(G((** AND (X((F(**) U **)) OR **)))))) : (X(F(*)) U ((* R *) AND G(*))) : X(X((F(G(**)) AND G((** OR X(G(**))))))) : X((X(**) U (G(*) AND X(*)))) : X(G(*)) : X(F(((** U **) OR ((G((F(**) AND (** AND **))) AND F(**)) OR **)))) : (F(G(**)) OR **) : X(G((F(*) OR (G(*) AND F(*))))) : (F(**) OR X((* R *))) : X((((** U X(**)) AND F(*)) U X(**)))"
},
"net":
{
"arcs": 1368,
"conflict_clusters": 100,
"places": 100,
"places_significant": 99,
"singleton_clusters": 0,
"transitions": 684
},
"result":
{
"preliminary_value": "unknown no no no no no no no yes no no no yes ",
"value": "unknown no no no no no no no yes no no no yes "
},
"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: 784/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 3200
lola: finding significant places
lola: 100 places, 684 transitions, 99 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from LTLCardinality.xml
lola: X ((G ((p72 <= 2)) OR (X (F ((3 <= p72))) AND (3 <= p72)))) : NOT(G (X ((F (X ((G ((1 <= p86)) OR (p93 <= p35)))) AND X ((p90 <= p59)))))) : X ((X (G ((X (F (NOT(G ((3 <= p84))))) U (p76 <= p68)))) AND (p99 + 1 <= p54))) : (G ((2 <= p30)) U G (((p93 <= p56) AND (X ((F ((3 <= p68)) U (1 <= p58))) OR (p67 <= p35))))) : (NOT(X (G ((p34 <= p64)))) U (NOT(((p88 + 1 <= p79) U (3 <= p56))) AND NOT(F (((p41 <= p50) AND (p79 <= p88)))))) : X (G ((X ((p35 <= p93)) U X (G (X ((2 <= p7))))))) : (X (X ((p81 <= p30))) U X ((NOT(F ((p63 <= 2))) AND NOT(X ((p81 <= p30)))))) : NOT((X ((X (X ((3 <= p90))) U (0 <= 0))) U X (((p86 <= p25) OR (3 <= p90))))) : F (X (((G (((F ((3 <= p74)) AND (2 <= p79)) AND (p57 <= p27))) U ((2 <= p79) U (p57 <= p27))) OR (p20 <= p33)))) : (NOT(X (X (G (NOT(G ((((p69 <= p17) OR (3 <= p4)) AND (p4 <= p18)))))))) OR (p17 + 1 <= p69)) : G ((G (NOT(F (X ((p67 <= p1))))) U NOT(X (G ((p95 <= p70)))))) : (F ((p67 + 1 <= p40)) OR NOT(X (((3 <= p4) U (p55 <= 2))))) : X (((((1 <= p58) U X ((1 <= p58))) AND F (NOT(G ((1 <= p18))))) U X ((p38 <= p66))))
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:525
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
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:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:431
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:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
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:410
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:166
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:169
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:251
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:356
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:350
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:410
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((G ((p72 <= 2)) OR (X (F ((3 <= p72))) AND (3 <= p72))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((G ((p72 <= 2)) OR (X (F ((3 <= p72))) AND (3 <= p72))))
lola: processed formula length: 59
lola: 79 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 7 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 1201763 markings, 4555131 edges, 240353 markings/sec, 0 secs
lola: 2452897 markings, 9310940 edges, 250227 markings/sec, 5 secs
lola: 3689449 markings, 14011727 edges, 247310 markings/sec, 10 secs
lola: 4912655 markings, 18663014 edges, 244641 markings/sec, 15 secs
lola: 6196910 markings, 23538848 edges, 256851 markings/sec, 20 secs
lola: 7471089 markings, 28371460 edges, 254836 markings/sec, 25 secs
lola: 8710788 markings, 33075458 edges, 247940 markings/sec, 30 secs
lola: 9914565 markings, 37643727 edges, 240755 markings/sec, 35 secs
lola: 11039448 markings, 41908801 edges, 224977 markings/sec, 40 secs
lola: 12224337 markings, 46359782 edges, 236978 markings/sec, 45 secs
lola: 13377890 markings, 50733219 edges, 230711 markings/sec, 50 secs
lola: 14528889 markings, 55096090 edges, 230200 markings/sec, 55 secs
lola: 15747253 markings, 59717142 edges, 243673 markings/sec, 60 secs
lola: 16955319 markings, 64297063 edges, 241613 markings/sec, 65 secs
lola: 18063549 markings, 68500422 edges, 221646 markings/sec, 70 secs
lola: 19166187 markings, 72680645 edges, 220528 markings/sec, 75 secs
lola: 20330914 markings, 77096872 edges, 232945 markings/sec, 80 secs
lola: 21518515 markings, 81531299 edges, 237520 markings/sec, 85 secs
lola: 22592698 markings, 85429176 edges, 214837 markings/sec, 90 secs
lola: 23609938 markings, 89137631 edges, 203448 markings/sec, 95 secs
lola: 24710001 markings, 93145370 edges, 220013 markings/sec, 100 secs
lola: 25825474 markings, 97159280 edges, 223095 markings/sec, 105 secs
lola: 26949835 markings, 101169396 edges, 224872 markings/sec, 110 secs
lola: 28084115 markings, 105219795 edges, 226856 markings/sec, 115 secs
lola: 29184318 markings, 109190752 edges, 220041 markings/sec, 120 secs
lola: 30196545 markings, 112800964 edges, 202445 markings/sec, 125 secs
lola: 31237212 markings, 116527290 edges, 208133 markings/sec, 130 secs
lola: 32301090 markings, 120336371 edges, 212776 markings/sec, 135 secs
lola: 33361462 markings, 124111055 edges, 212074 markings/sec, 140 secs
lola: 34363328 markings, 127657325 edges, 200373 markings/sec, 145 secs
lola: 35393412 markings, 131285458 edges, 206017 markings/sec, 150 secs
lola: 36507355 markings, 135267621 edges, 222789 markings/sec, 155 secs
lola: 37611578 markings, 139212768 edges, 220845 markings/sec, 160 secs
lola: 38642571 markings, 142871164 edges, 206199 markings/sec, 165 secs
lola: 39663840 markings, 146484649 edges, 204254 markings/sec, 170 secs
lola: 40694397 markings, 150137063 edges, 206111 markings/sec, 175 secs
lola: 41768460 markings, 153887974 edges, 214813 markings/sec, 180 secs
lola: 42876694 markings, 157842602 edges, 221647 markings/sec, 185 secs
lola: 43975775 markings, 161736604 edges, 219816 markings/sec, 190 secs
lola: 45070158 markings, 165617447 edges, 218877 markings/sec, 195 secs
lola: 46149852 markings, 169407448 edges, 215939 markings/sec, 200 secs
lola: 47239714 markings, 173263125 edges, 217972 markings/sec, 205 secs
lola: 48333762 markings, 177128555 edges, 218810 markings/sec, 210 secs
lola: 49414770 markings, 180920355 edges, 216202 markings/sec, 215 secs
lola: 50504747 markings, 184790975 edges, 217995 markings/sec, 220 secs
lola: 51597630 markings, 188673221 edges, 218577 markings/sec, 225 secs
lola: 52689957 markings, 192556088 edges, 218465 markings/sec, 230 secs
lola: 53772015 markings, 196389248 edges, 216412 markings/sec, 235 secs
lola: 54861303 markings, 200238473 edges, 217858 markings/sec, 240 secs
lola: 55957297 markings, 204115168 edges, 219199 markings/sec, 245 secs
lola: 57033788 markings, 207910746 edges, 215298 markings/sec, 250 secs
lola: 57991460 markings, 211321633 edges, 191534 markings/sec, 255 secs
lola: 58753869 markings, 214038288 edges, 152482 markings/sec, 260 secs
lola: 59644305 markings, 217172944 edges, 178087 markings/sec, 265 secs
lola: local time limit reached - aborting
lola:
preliminary result: unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 1 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (F ((G ((F ((p86 <= 0)) AND (p35 + 1 <= p93))) OR (p59 + 1 <= p90)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (F ((G ((F ((p86 <= 0)) AND (p35 + 1 <= p93))) OR (p59 + 1 <= p90)))))
lola: processed formula length: 75
lola: 79 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 5 markings, 5 edges
lola: ========================================
lola: subprocess 2 will run for 299 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X (G ((F ((p76 <= p68)) AND (X (F ((p84 <= 2))) OR (p76 <= p68))))) AND (p99 + 1 <= p54)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X (G ((F ((p76 <= p68)) AND (X (F ((p84 <= 2))) OR (p76 <= p68))))) AND (p99 + 1 <= p54)))
lola: processed formula length: 94
lola: 79 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 7 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 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: 5 markings, 5 edges
lola: ========================================
lola: subprocess 3 will run for 329 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G (((p93 <= p56) AND (X ((F ((3 <= p68)) U (1 <= p58))) OR (p67 <= p35)))) OR (G ((2 <= p30)) AND F (G (((p93 <= p56) AND (X ((F ((3 <= p68)) U (1 <= p58))) OR (p67 <= p35)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 329 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((2 <= p30))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((2 <= p30))
lola: processed formula length: 14
lola: 79 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 10 markings, 10 edges
lola: ========================================
lola: subprocess 4 will run for 365 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((p93 <= p56) AND (X ((F ((3 <= p68)) U (1 <= p58))) OR (p67 <= p35))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((p93 <= p56) AND (X ((F ((3 <= p68)) U (1 <= p58))) OR (p67 <= p35))))
lola: processed formula length: 74
lola: 79 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 16 markings, 21 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 4 will run for 365 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (F ((p64 + 1 <= p34))) U (((p79 <= p88) R (p56 <= 2)) AND G (((p50 + 1 <= p41) OR (p88 + 1 <= p79)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (X (F ((p64 + 1 <= p34))) U (((p79 <= p88) R (p56 <= 2)) AND G (((p50 + 1 <= p41) OR (p88 + 1 <= p79)))))
lola: processed formula length: 106
lola: 79 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 11 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: 5 markings, 5 edges
lola: ========================================
lola: subprocess 5 will run for 411 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X ((F (G ((2 <= p7))) AND G (((p35 <= p93) OR X (G ((2 <= p7))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X ((F (G ((2 <= p7))) AND G (((p35 <= p93) OR X (G ((2 <= p7))))))))
lola: processed formula length: 71
lola: 79 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 7 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 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: 39251 markings, 131480 edges
lola: ========================================
lola: subprocess 6 will run for 470 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X ((p81 <= p30)) U (G ((3 <= p63)) AND X ((p30 + 1 <= p81)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X ((p81 <= p30)) U (G ((3 <= p63)) AND X ((p30 + 1 <= p81)))))
lola: processed formula length: 66
lola: 79 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 9 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: 8 markings, 9 edges
lola: ========================================
lola: subprocess 7 will run for 548 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G (((p25 + 1 <= p86) AND (p90 <= 2))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G (((p25 + 1 <= p86) AND (p90 <= 2))))
lola: processed formula length: 41
lola: 79 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 5 markings, 5 edges
lola: ========================================
lola: subprocess 8 will run for 658 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((((2 <= p79) U (p57 <= p27)) OR ((G ((F ((3 <= p74)) AND ((2 <= p79) AND (p57 <= p27)))) AND F ((p57 <= p27))) OR (p20 <= p33)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((((2 <= p79) U (p57 <= p27)) OR ((G ((F ((3 <= p74)) AND ((2 <= p79) AND (p57 <= p27)))) AND F ((p57 <= p27))) OR (p20 <= p33)))))
lola: processed formula length: 136
lola: 79 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 7 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 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: 9 markings, 8 edges
lola: ========================================
lola: subprocess 9 will run for 823 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((F ((p70 + 1 <= p95)) OR (G ((p1 + 1 <= p67)) AND F ((p70 + 1 <= p95))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((F ((p70 + 1 <= p95)) OR (G ((p1 + 1 <= p67)) AND F ((p70 + 1 <= p95))))))
lola: processed formula length: 80
lola: 79 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 5 markings, 5 edges
lola: ========================================
lola: subprocess 10 will run for 1097 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F ((p67 + 1 <= p40)) OR X (((p4 <= 2) R (3 <= p55))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 1097 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((p67 + 1 <= p40))
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: (p40 <= p67)
lola: processed formula length: 12
lola: 81 rewrites
lola: closed formula file LTLCardinality.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: 5 markings, 5 edges
lola: ========================================
lola: subprocess 11 will run for 1646 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((p4 <= 2) R (3 <= p55)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((p4 <= 2) R (3 <= p55)))
lola: processed formula length: 28
lola: 79 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 5 markings, 5 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 11 will run for 1646 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((((1 <= p58) U X ((1 <= p58))) AND F ((p18 <= 0))) U X ((p38 <= p66))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((((1 <= p58) U X ((1 <= p58))) AND F ((p18 <= 0))) U X ((p38 <= p66))))
lola: processed formula length: 75
lola: 79 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 10 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 192 markings, 392 edges
lola: ========================================
lola: subprocess 12 will run for 3292 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (G ((((p69 <= p17) OR (3 <= p4)) AND (p4 <= p18)))) OR (p17 + 1 <= p69))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 3292 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p17 + 1 <= p69)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p17 + 1 <= p69)
lola: processed formula length: 16
lola: 79 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: X ((G ((p72 <= 2)) OR (X (F ((3 <= p72))) AND (3 <= p72))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((G ((p72 <= 2)) OR (X (F ((3 <= p72))) AND (3 <= p72))))
lola: processed formula length: 59
lola: 79 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 7 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 1194234 markings, 4525604 edges, 238847 markings/sec, 0 secs
lola: 2349572 markings, 8916161 edges, 231068 markings/sec, 5 secs
lola: 3544578 markings, 13460390 edges, 239001 markings/sec, 10 secs
lola: 4653256 markings, 17676909 edges, 221736 markings/sec, 15 secs
lola: 5841380 markings, 22186210 edges, 237625 markings/sec, 20 secs
lola: 7126696 markings, 27066331 edges, 257063 markings/sec, 25 secs
lola: 8369070 markings, 31781091 edges, 248475 markings/sec, 30 secs
lola: 9485996 markings, 36017911 edges, 223385 markings/sec, 35 secs
lola: 10627223 markings, 40347792 edges, 228245 markings/sec, 40 secs
lola: 11857328 markings, 44969047 edges, 246021 markings/sec, 45 secs
lola: 13107384 markings, 49707526 edges, 250011 markings/sec, 50 secs
lola: 14338087 markings, 54375675 edges, 246141 markings/sec, 55 secs
lola: 15550355 markings, 58969751 edges, 242454 markings/sec, 60 secs
lola: 16763745 markings, 63570025 edges, 242678 markings/sec, 65 secs
lola: 17923960 markings, 67970904 edges, 232043 markings/sec, 70 secs
lola: 19049709 markings, 72239564 edges, 225150 markings/sec, 75 secs
lola: 20180553 markings, 76526327 edges, 226169 markings/sec, 80 secs
lola: 21292507 markings, 80708810 edges, 222391 markings/sec, 85 secs
lola: 22353723 markings, 84555955 edges, 212243 markings/sec, 90 secs
lola: 23513762 markings, 88782486 edges, 232008 markings/sec, 95 secs
lola: 24608142 markings, 92777139 edges, 218876 markings/sec, 100 secs
lola: 25643633 markings, 96500552 edges, 207098 markings/sec, 105 secs
lola: 26739657 markings, 100404818 edges, 219205 markings/sec, 110 secs
lola: 27866235 markings, 104437671 edges, 225316 markings/sec, 115 secs
lola: 28942070 markings, 108322492 edges, 215167 markings/sec, 120 secs
lola: 29933780 markings, 111857696 edges, 198342 markings/sec, 125 secs
lola: 30976879 markings, 115596379 edges, 208620 markings/sec, 130 secs
lola: 32110042 markings, 119653296 edges, 226633 markings/sec, 135 secs
lola: 33242320 markings, 123686582 edges, 226456 markings/sec, 140 secs
lola: 34365275 markings, 127663394 edges, 224591 markings/sec, 145 secs
lola: 35471313 markings, 131565691 edges, 221208 markings/sec, 150 secs
lola: 36597325 markings, 135590995 edges, 225202 markings/sec, 155 secs
lola: 37710934 markings, 139558054 edges, 222722 markings/sec, 160 secs
lola: 38827727 markings, 143535699 edges, 223359 markings/sec, 165 secs
lola: 39934863 markings, 147451656 edges, 221427 markings/sec, 170 secs
lola: 41034540 markings, 151321292 edges, 219935 markings/sec, 175 secs
lola: 42023268 markings, 154802757 edges, 197746 markings/sec, 180 secs
lola: 43044974 markings, 158424029 edges, 204341 markings/sec, 185 secs
lola: 44151163 markings, 162345871 edges, 221238 markings/sec, 190 secs
lola: 45259117 markings, 166286667 edges, 221591 markings/sec, 195 secs
lola: 46342872 markings, 170080068 edges, 216751 markings/sec, 200 secs
lola: 47446459 markings, 173988869 edges, 220717 markings/sec, 205 secs
lola: 48558752 markings, 177937286 edges, 222459 markings/sec, 210 secs
lola: 49636418 markings, 181672691 edges, 215533 markings/sec, 215 secs
lola: 50752250 markings, 185673834 edges, 223166 markings/sec, 220 secs
lola: 51846257 markings, 189545152 edges, 218801 markings/sec, 225 secs
lola: 52949380 markings, 193453051 edges, 220625 markings/sec, 230 secs
lola: 54053141 markings, 197379261 edges, 220752 markings/sec, 235 secs
lola: 55161794 markings, 201297897 edges, 221731 markings/sec, 240 secs
lola: 56261838 markings, 205201491 edges, 220009 markings/sec, 245 secs
lola: 57240056 markings, 208650203 edges, 195644 markings/sec, 250 secs
lola: 58112080 markings, 211758579 edges, 174405 markings/sec, 255 secs
lola: 58977360 markings, 214810385 edges, 173056 markings/sec, 260 secs
lola: 59993965 markings, 218441190 edges, 203321 markings/sec, 265 secs
lola: 60848882 markings, 221494850 edges, 170983 markings/sec, 270 secs
lola: 61749613 markings, 224678981 edges, 180146 markings/sec, 275 secs
lola: 62628847 markings, 227771900 edges, 175847 markings/sec, 280 secs
lola: 63636959 markings, 231327792 edges, 201622 markings/sec, 285 secs
lola: 64571996 markings, 234622691 edges, 187007 markings/sec, 290 secs
lola: 65306416 markings, 237207970 edges, 146884 markings/sec, 295 secs
lola: 66139920 markings, 240175628 edges, 166701 markings/sec, 300 secs
lola: 66947567 markings, 243017412 edges, 161529 markings/sec, 305 secs
lola: 67873928 markings, 246269857 edges, 185272 markings/sec, 310 secs
lola: 68674364 markings, 249087649 edges, 160087 markings/sec, 315 secs
lola: 69449219 markings, 251833295 edges, 154971 markings/sec, 320 secs
lola: 70257635 markings, 254690312 edges, 161683 markings/sec, 325 secs
lola: 70323092 markings, 254930055 edges, 13091 markings/sec, 330 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: (F (G ((((p69 <= p17) OR (3 <= p4)) AND (p4 <= p18)))) OR (p17 + 1 <= p69))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: (p17 + 1 <= p69)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p17 + 1 <= p69)
lola: processed formula length: 16
lola: 79 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: F (G ((((p69 <= p17) OR (3 <= p4)) AND (p4 <= p18))))
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 ((((p69 <= p17) OR (3 <= p4)) AND (p4 <= p18))))
lola: processed formula length: 54
lola: 79 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 4710 markings, 8364 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: unknown no no no no no no no yes no no no yes
lola:
preliminary result: unknown no no no no no no no yes no no no yes
lola: memory consumption: 3664 KB
lola: time consumption: 615 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.json
rslt: finished

--------------------
content from stderr:

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Diffusion2D-PT-D10N200"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itslola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itslola"
echo " Input is Diffusion2D-PT-D10N200, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r178-tajo-158987882400449"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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