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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 3.3K Mar 31 06:33 CTLCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 31 06:33 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Mar 29 22:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 29 22:54 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 4.0K Apr 8 14:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 8 14:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 28 14:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 28 14:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Mar 27 07:31 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K 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 1.2M 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-D20N100-00
FORMULA_NAME Diffusion2D-PT-D20N100-01
FORMULA_NAME Diffusion2D-PT-D20N100-02
FORMULA_NAME Diffusion2D-PT-D20N100-03
FORMULA_NAME Diffusion2D-PT-D20N100-04
FORMULA_NAME Diffusion2D-PT-D20N100-05
FORMULA_NAME Diffusion2D-PT-D20N100-06
FORMULA_NAME Diffusion2D-PT-D20N100-07
FORMULA_NAME Diffusion2D-PT-D20N100-08
FORMULA_NAME Diffusion2D-PT-D20N100-09
FORMULA_NAME Diffusion2D-PT-D20N100-10
FORMULA_NAME Diffusion2D-PT-D20N100-11
FORMULA_NAME Diffusion2D-PT-D20N100-12
FORMULA_NAME Diffusion2D-PT-D20N100-13
FORMULA_NAME Diffusion2D-PT-D20N100-14
FORMULA_NAME Diffusion2D-PT-D20N100-15

=== Now, execution of the tool begins

BK_START 1591221995036

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 22:06:36] [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 22:06:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 22:06:36] [INFO ] Load time of PNML (sax parser for PT used): 123 ms
[2020-06-03 22:06:36] [INFO ] Transformed 400 places.
[2020-06-03 22:06:36] [INFO ] Transformed 2964 transitions.
[2020-06-03 22:06:36] [INFO ] Parsed PT model containing 400 places and 2964 transitions in 168 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 34 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100060 steps, including 0 resets, run finished after 50 ms. (steps per millisecond=2001 ) properties seen :[1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 0, 0, 0, 0, 1, 1, 1, 0, 0, 1, 1, 1, 1, 0, 0, 1, 1, 0, 1, 1]
// Phase 1: matrix 2964 rows 400 cols
[2020-06-03 22:06:37] [INFO ] Computed 1 place invariants in 32 ms
[2020-06-03 22:06:37] [INFO ] [Real]Absence check using 1 positive place invariants in 17 ms returned sat
[2020-06-03 22:06:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 22:06:38] [INFO ] [Real]Absence check using state equation in 1246 ms returned sat
[2020-06-03 22:06:38] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints in 239 ms.
[2020-06-03 22:06:39] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 22:06:39] [INFO ] [Nat]Absence check using 1 positive place invariants in 23 ms returned sat
[2020-06-03 22:06:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 22:06:40] [INFO ] [Nat]Absence check using state equation in 1511 ms returned sat
[2020-06-03 22:06:41] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints in 184 ms.
[2020-06-03 22:06:59] [INFO ] Added : 475 causal constraints over 95 iterations in 18373 ms. Result :(error "Failed to check-sat")
[2020-06-03 22:06:59] [INFO ] [Real]Absence check using 1 positive place invariants in 10 ms returned sat
[2020-06-03 22:06:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 22:07:00] [INFO ] [Real]Absence check using state equation in 1439 ms returned sat
[2020-06-03 22:07:01] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints in 130 ms.
[2020-06-03 22:07:01] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 22:07:01] [INFO ] [Nat]Absence check using 1 positive place invariants in 19 ms returned sat
[2020-06-03 22:07:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 22:07:03] [INFO ] [Nat]Absence check using state equation in 1500 ms returned sat
[2020-06-03 22:07:03] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints in 184 ms.
[2020-06-03 22:07:21] [INFO ] Added : 470 causal constraints over 94 iterations in 18394 ms. Result :(error "Failed to check-sat")
[2020-06-03 22:07:21] [INFO ] [Real]Absence check using 1 positive place invariants in 5 ms returned unsat
[2020-06-03 22:07:21] [INFO ] [Real]Absence check using 1 positive place invariants in 10 ms returned sat
[2020-06-03 22:07:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 22:07:23] [INFO ] [Real]Absence check using state equation in 1504 ms returned sat
[2020-06-03 22:07:23] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints in 235 ms.
[2020-06-03 22:07:23] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 22:07:24] [INFO ] [Nat]Absence check using 1 positive place invariants in 18 ms returned sat
[2020-06-03 22:07:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 22:07:25] [INFO ] [Nat]Absence check using state equation in 1245 ms returned sat
[2020-06-03 22:07:25] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints in 188 ms.
[2020-06-03 22:07:44] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (=> (> t565 0) (or (and (> t405 0) (< o405 o565)) (and (> t412 0) (< o412 o565)) (and (> t419 0) (< o419 o565)) (and (> t556 0) (< o556 o565)) (and (> t571 0) (< o571 o565)) (and (> t708 0) (< o708 o565)) (and (> t715 0) (< o715 o565)) (and (> t722 0) (< o722 o565))))") while checking expression at index 3
[2020-06-03 22:07:44] [INFO ] [Real]Absence check using 1 positive place invariants in 12 ms returned sat
[2020-06-03 22:07:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 22:07:45] [INFO ] [Real]Absence check using state equation in 1437 ms returned sat
[2020-06-03 22:07:45] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 22:07:45] [INFO ] [Nat]Absence check using 1 positive place invariants in 17 ms returned sat
[2020-06-03 22:07:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 22:07:47] [INFO ] [Nat]Absence check using state equation in 1452 ms returned sat
[2020-06-03 22:07:47] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints in 218 ms.
[2020-06-03 22:08:05] [INFO ] Added : 450 causal constraints over 90 iterations in 18435 ms. Result :unknown
[2020-06-03 22:08:05] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned unsat
[2020-06-03 22:08:05] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned unsat
[2020-06-03 22:08:05] [INFO ] [Real]Absence check using 1 positive place invariants in 6 ms returned unsat
[2020-06-03 22:08:05] [INFO ] [Real]Absence check using 1 positive place invariants in 9 ms returned sat
[2020-06-03 22:08:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 22:08:07] [INFO ] [Real]Absence check using state equation in 1412 ms returned sat
[2020-06-03 22:08:07] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 22:08:07] [INFO ] [Nat]Absence check using 1 positive place invariants in 20 ms returned sat
[2020-06-03 22:08:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 22:08:08] [INFO ] [Nat]Absence check using state equation in 1339 ms returned sat
[2020-06-03 22:08:08] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints in 203 ms.
[2020-06-03 22:08:27] [INFO ] Added : 460 causal constraints over 92 iterations in 18579 ms. Result :(error "Failed to check-sat")
[2020-06-03 22:08:27] [INFO ] [Real]Absence check using 1 positive place invariants in 10 ms returned sat
[2020-06-03 22:08:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 22:08:28] [INFO ] [Real]Absence check using state equation in 1493 ms returned sat
[2020-06-03 22:08:29] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 22:08:29] [INFO ] [Nat]Absence check using 1 positive place invariants in 33 ms returned sat
[2020-06-03 22:08:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 22:08:31] [INFO ] [Nat]Absence check using state equation in 2788 ms returned sat
[2020-06-03 22:08:32] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints in 250 ms.
[2020-06-03 22:08:49] [INFO ] Added : 420 causal constraints over 84 iterations in 17046 ms. Result :(error "Solver has unexpectedly terminated")
[2020-06-03 22:08:49] [INFO ] [Real]Absence check using 1 positive place invariants in 11 ms returned sat
[2020-06-03 22:08:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 22:08:50] [INFO ] [Real]Absence check using state equation in 1361 ms returned sat
[2020-06-03 22:08:50] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints in 163 ms.
[2020-06-03 22:08:51] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 22:08:51] [INFO ] [Nat]Absence check using 1 positive place invariants in 26 ms returned sat
[2020-06-03 22:08:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 22:08:52] [INFO ] [Nat]Absence check using state equation in 1667 ms returned sat
[2020-06-03 22:08:53] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints in 179 ms.
[2020-06-03 22:09:11] [INFO ] Added : 455 causal constraints over 91 iterations in 18236 ms. Result :unknown
[2020-06-03 22:09:11] [INFO ] [Real]Absence check using 1 positive place invariants in 8 ms returned sat
[2020-06-03 22:09:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 22:09:12] [INFO ] [Real]Absence check using state equation in 1427 ms returned sat
[2020-06-03 22:09:12] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 22:09:12] [INFO ] [Nat]Absence check using 1 positive place invariants in 28 ms returned sat
[2020-06-03 22:09:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 22:09:14] [INFO ] [Nat]Absence check using state equation in 1632 ms returned sat
[2020-06-03 22:09:14] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints in 233 ms.
[2020-06-03 22:09:32] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (=> (> t413 0) (or (and (> t251 0) (< o251 o413)) (and (> t258 0) (< o258 o413)) (and (> t265 0) (< o265 o413)) (and (> t402 0) (< o402 o413)) (and (> t417 0) (< o417 o413)) (and (> t554 0) (< o554 o413)) (and (> t561 0) (< o561 o413)) (and (> t568 0) (< o568 o413))))") while checking expression at index 11
[2020-06-03 22:09:32] [INFO ] [Real]Absence check using 1 positive place invariants in 10 ms returned sat
[2020-06-03 22:09:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 22:09:34] [INFO ] [Real]Absence check using state equation in 1450 ms returned sat
[2020-06-03 22:09:34] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 22:09:34] [INFO ] [Nat]Absence check using 1 positive place invariants in 27 ms returned sat
[2020-06-03 22:09:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 22:09:35] [INFO ] [Nat]Absence check using state equation in 1335 ms returned sat
[2020-06-03 22:09:35] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints in 187 ms.
[2020-06-03 22:09:54] [INFO ] Added : 455 causal constraints over 91 iterations in 18573 ms. Result :(error "Failed to check-sat")
Successfully simplified 4 atomic propositions for a total of 4 simplifications.
[2020-06-03 22:09:54] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2020-06-03 22:09:55] [INFO ] Flatten gal took : 278 ms
FORMULA Diffusion2D-PT-D20N100-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Diffusion2D-PT-D20N100-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Diffusion2D-PT-D20N100-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 22:09:55] [INFO ] Flatten gal took : 109 ms
[2020-06-03 22:09:55] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2020-06-03 22:09:55] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 33 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ Diffusion2D-PT-D20N100 @ 3570 seconds

FORMULA Diffusion2D-PT-D20N100-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

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

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

FORMULA Diffusion2D-PT-D20N100-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Diffusion2D-PT-D20N100-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Diffusion2D-PT-D20N100-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA Diffusion2D-PT-D20N100-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

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

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

FORMULA Diffusion2D-PT-D20N100-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3559
rslt: Output for LTLCardinality @ Diffusion2D-PT-D20N100

{
"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 22:09:55 2020
",
"timelimit": 3570
},
"child":
[

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"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": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(p10 <= 1)",
"processed_size": 10,
"rewrites": 112
},
"result":
{
"edges": 3,
"markings": 3,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 10
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 296
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X ((X ((p172 <= 2)) AND (p90 <= p84)))",
"processed_size": 38,
"rewrites": 110
},
"result":
{
"edges": 144,
"markings": 78,
"produced_by": "LTL model checker",
"value": true
},
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 0,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 296
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 5,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 5,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 11,
"taut": 0,
"tconj": 3,
"tdisj": 3,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X (F ((G (((p86 <= 0) AND (G ((p86 <= 0)) OR G (F ((p140 <= p226)))))) OR (((p226 + 1 <= p140) OR (p221 <= 1)) AND ((p86 <= 0) AND (G ((p86 <= 0)) OR G (F ((p140 <= p226)))))))))",
"processed_size": 179,
"rewrites": 110
},
"result":
{
"edges": 220550,
"markings": 54765,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 58
},
"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": 323
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 4,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "F (G (((((p164 + 1 <= p234) R (p379 <= p288)) AND X ((p365 + 1 <= p227))) R (p234 <= p164))))",
"processed_size": 93,
"rewrites": 110
},
"result":
{
"edges": 437,
"markings": 423,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"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": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 3,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 2,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X (X ((X (G ((2 <= p68))) OR (F ((3 <= p163)) AND ((p163 <= 2) AND (p281 <= p130))))))",
"processed_size": 86,
"rewrites": 110
},
"result":
{
"edges": 408,
"markings": 408,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 9
},
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 395
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 3,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"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 (X ((X (G ((p60 <= 1))) R (p348 + 1 <= p50))))",
"processed_size": 48,
"rewrites": 110
},
"result":
{
"edges": 407,
"markings": 407,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"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": 445
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"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": "(p227 + 1 <= p57)",
"processed_size": 17,
"rewrites": 112
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 5,
"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": 508
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"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": 2,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "F ((X ((p227 + 1 <= p57)) AND ((p355 + 1 <= p14) AND (p227 + 1 <= p57))))",
"processed_size": 73,
"rewrites": 110
},
"result":
{
"edges": 407,
"markings": 407,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"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": 508
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 3,
"aconj": 0,
"adisj": 0,
"aneg": 3,
"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 (F ((X ((G ((p18 + 1 <= p104)) OR (p317 + 1 <= p169))) AND (p143 <= 1)))) AND (p169 <= p317)))",
"processed_size": 100,
"rewrites": 110
},
"result":
{
"edges": 408,
"markings": 408,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 8
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 593
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 2,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "X ((G ((3 <= p55)) AND ((3 <= p55) AND (F ((p340 <= p67)) OR (p206 <= p101)))))",
"processed_size": 79,
"rewrites": 110
},
"result":
{
"edges": 407,
"markings": 407,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"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": 712
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "F ((X ((p237 <= 0)) AND (p166 + 1 <= p338)))",
"processed_size": 44,
"rewrites": 110
},
"result":
{
"edges": 814,
"markings": 813,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"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": 890
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "F (G ((1 <= p395)))",
"processed_size": 19,
"rewrites": 110
},
"result":
{
"edges": 5,
"markings": 4,
"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": "stabilization",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1187
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G (F ((p354 <= p399)))",
"processed_size": 22,
"rewrites": 110
},
"result":
{
"edges": 2146,
"markings": 868,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 10,
"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": 1781
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G (F ((p395 <= p170)))",
"processed_size": 22,
"rewrites": 110
},
"result":
{
"edges": 13915,
"markings": 7330,
"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": "fairness",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3562
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 3,
"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": "G (F ((G ((p330 <= 1)) OR ((p56 + 1 <= p193) AND (p330 <= 1)))))",
"processed_size": 64,
"rewrites": 110
},
"result":
{
"edges": 688163,
"markings": 235972,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"error": null,
"memory": 40340,
"runtime": 11.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "((F(**) AND G(**)) OR X((X(*) AND **))) : X(F((G((* AND (G(*) OR G(F(**))))) OR (* AND (* AND (G(*) OR G(F(**)))))))) : G(F(**)) : G(F((G(*) OR (* AND *)))) : F(G((((* R *) AND X(*)) R *))) : F(G(**)) : X(X((X(G(**)) OR (F(**) AND (** AND **))))) : X(X((X(G(*)) R *))) : (F((X(*) AND (* AND *))) AND F(**)) : X((X(F((X((G(*) OR *)) AND *))) AND **)) : G(F(**)) : X((G(**) AND (** AND (F(**) OR **)))) : F((X(*) AND *))"
},
"net":
{
"arcs": 5928,
"conflict_clusters": 400,
"places": 400,
"places_significant": 399,
"singleton_clusters": 0,
"transitions": 2964
},
"result":
{
"preliminary_value": "yes no no no no no no no no no no no no ",
"value": "yes no no no no no no no no no no no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 3364/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 12800
lola: finding significant places
lola: 400 places, 2964 transitions, 399 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: ((F ((2 <= p10)) AND G ((p90 <= p84))) OR (X (NOT(X ((3 <= p172)))) AND X ((p90 <= p84)))) : X (NOT(G ((((p140 <= p226) AND (2 <= p221)) U (NOT(G (F ((p140 <= p226)))) U (1 <= p86)))))) : ((F ((p76 <= p168)) OR (p287 <= p8)) U G (F (X ((p354 <= p399))))) : G (F (NOT(G (((p193 <= p56) U (2 <= p330)))))) : F (X (F (G (NOT(((((p234 <= p164) U (p288 + 1 <= p379)) OR X ((p227 <= p365))) U (p164 + 1 <= p234))))))) : X (((0 <= 0) U G ((1 <= p395)))) : (G (X (X (X ((2 <= p68))))) OR X (X (((F ((3 <= p163)) AND (p163 <= 2)) AND (p281 <= p130))))) : X (X (NOT((((0 <= 0) U X ((2 <= p60))) U (p50 <= p348))))) : (F (NOT(G (((X ((p57 <= p227)) OR (p14 <= p355)) OR (p57 <= p227))))) AND F ((p57 <= p227))) : X ((NOT(G (X ((X ((F ((p104 <= p18)) AND (p169 <= p317))) OR (2 <= p143))))) AND (p169 <= p317))) : NOT(F (NOT(X ((F (X ((2 <= p280))) U X (F ((p395 <= p170)))))))) : X (((G ((3 <= p55)) AND (3 <= p55)) AND (F ((p340 <= p67)) OR (p206 <= p101)))) : NOT(G ((X ((1 <= p237)) OR (p338 <= p166))))
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:525
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:428
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:425
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:318
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:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:528
lola: rewrite Frontend/Parser/formula_rewrite.k:528
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:338
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:329
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:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:329
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:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((F ((2 <= p10)) AND G ((p90 <= p84))) OR X ((X ((p172 <= 2)) AND (p90 <= p84))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((2 <= p10))
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: (p10 <= 1)
lola: processed formula length: 10
lola: 112 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: 3 markings, 3 edges
lola: ========================================
lola: subprocess 1 will run for 296 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X ((p172 <= 2)) AND (p90 <= p84)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X ((p172 <= 2)) AND (p90 <= p84)))
lola: processed formula length: 38
lola: 110 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 78 markings, 144 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 1 will run for 296 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((G (((p86 <= 0) AND (G ((p86 <= 0)) OR G (F ((p140 <= p226)))))) OR (((p226 + 1 <= p140) OR (p221 <= 1)) AND ((p86 <= 0) AND (G ((p86 <= 0)) OR G (F ((p140 <= p226)))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((G (((p86 <= 0) AND (G ((p86 <= 0)) OR G (F ((p140 <= p226)))))) OR (((p226 + 1 <= p140) OR (p221 <= 1)) AND ((p86 <= 0) AND (G ((p86 <= 0)) OR G (F ((p140 <= p226)))))))))
lola: processed formula length: 179
lola: 110 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 58 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: 54765 markings, 220550 edges
lola: ========================================
lola: subprocess 2 will run for 323 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((((p164 + 1 <= p234) R (p379 <= p288)) AND X ((p365 + 1 <= p227))) R (p234 <= p164))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G (((((p164 + 1 <= p234) R (p379 <= p288)) AND X ((p365 + 1 <= p227))) R (p234 <= p164))))
lola: processed formula length: 93
lola: 110 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: add low 2080
lola: add low 2085
lola: add low 2090
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: 423 markings, 437 edges
lola: ========================================
lola: subprocess 3 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X ((X (G ((2 <= p68))) OR (F ((3 <= p163)) AND ((p163 <= 2) AND (p281 <= p130))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X ((X (G ((2 <= p68))) OR (F ((3 <= p163)) AND ((p163 <= 2) AND (p281 <= p130))))))
lola: processed formula length: 86
lola: 110 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: 408 markings, 408 edges
lola: ========================================
lola: subprocess 4 will run for 395 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X ((X (G ((p60 <= 1))) R (p348 + 1 <= p50))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X ((X (G ((p60 <= 1))) R (p348 + 1 <= p50))))
lola: processed formula length: 48
lola: 110 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: 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: 407 markings, 407 edges
lola: subprocess 5 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F ((X ((p227 + 1 <= p57)) AND ((p355 + 1 <= p14) AND (p227 + 1 <= p57)))) AND F ((p57 <= p227)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((p57 <= p227))
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: (p227 + 1 <= p57)
lola: processed formula length: 17
lola: 112 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: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================
lola: ========================================
lola: subprocess 6 will run for 508 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((X ((p227 + 1 <= p57)) AND ((p355 + 1 <= p14) AND (p227 + 1 <= p57))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((X ((p227 + 1 <= p57)) AND ((p355 + 1 <= p14) AND (p227 + 1 <= p57))))
lola: processed formula length: 73
lola: 110 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 407 markings, 407 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 6 will run for 508 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X (F ((X ((G ((p18 + 1 <= p104)) OR (p317 + 1 <= p169))) AND (p143 <= 1)))) AND (p169 <= p317)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X (F ((X ((G ((p18 + 1 <= p104)) OR (p317 + 1 <= p169))) AND (p143 <= 1)))) AND (p169 <= p317)))
lola: processed formula length: 100
lola: 110 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 8 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 408 markings, 408 edges
lola: ========================================
lola: subprocess 7 will run for 593 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((G ((3 <= p55)) AND ((3 <= p55) AND (F ((p340 <= p67)) OR (p206 <= p101)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((G ((3 <= p55)) AND ((3 <= p55) AND (F ((p340 <= p67)) OR (p206 <= p101)))))
lola: processed formula length: 79
lola: 110 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: 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: 407 markings, 407 edges
lola: ========================================
lola: subprocess 8 will run for 712 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((X ((p237 <= 0)) AND (p166 + 1 <= p338)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((X ((p237 <= 0)) AND (p166 + 1 <= p338)))
lola: processed formula length: 44
lola: 110 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 813 markings, 814 edges
lola: ========================================
lola: subprocess 9 will run for 890 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((1 <= p395)))
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 ((1 <= p395)))
lola: processed formula length: 19
lola: 110 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: add low 100
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: 4 markings, 5 edges
lola: ========================================
lola: subprocess 10 will run for 1187 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((p354 <= p399)))
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 ((p354 <= p399)))
lola: processed formula length: 22
lola: 110 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: 868 markings, 2146 edges
lola: ========================================
lola: subprocess 11 will run for 1781 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((p395 <= p170)))
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 ((p395 <= p170)))
lola: processed formula length: 22
lola: 110 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: 7330 markings, 13915 edges
lola: ========================================
lola: subprocess 12 will run for 3562 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((G ((p330 <= 1)) OR ((p56 + 1 <= p193) AND (p330 <= 1)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((G ((p330 <= 1)) OR ((p56 + 1 <= p193) AND (p330 <= 1)))))
lola: processed formula length: 64
lola: 110 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: 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: 235972 markings, 688163 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no no no no no no no no no no no no
lola:
preliminary result: yes no no no no no no no no no no no no
lola: memory consumption: 40340 KB
lola: time consumption: 11 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-D20N100"
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-D20N100, 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-158987882400473"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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