fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r182-oct2-158987913700345
Last Updated
Jun 28, 2020

About the Execution of ITS-LoLa for BridgeAndVehicles-PT-V20P20N50

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15746.630 3600000.00 457551.00 206.60 FFFTTTFTTFFTFFTF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2020-input.r182-oct2-158987913700345.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2020-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is BridgeAndVehicles-PT-V20P20N50, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r182-oct2-158987913700345
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.0M
-rw-r--r-- 1 mcc users 8.3K Mar 26 02:26 CTLCardinality.txt
-rw-r--r-- 1 mcc users 33K Mar 26 02:26 CTLCardinality.xml
-rw-r--r-- 1 mcc users 125K Mar 25 21:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 369K Mar 25 21:05 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 8.9K Apr 8 14:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 40K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 100K Apr 8 14:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 309K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.0K Mar 25 17:25 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 30K Mar 25 17:25 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 128K Mar 25 12:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 374K Mar 25 12:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.7K Mar 25 17:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.5K Mar 25 17:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 10 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 2.5M Mar 24 05:37 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1591144696660

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 00:38:19] [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 00:38:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 00:38:19] [INFO ] Load time of PNML (sax parser for PT used): 196 ms
[2020-06-03 00:38:19] [INFO ] Transformed 108 places.
[2020-06-03 00:38:19] [INFO ] Transformed 2228 transitions.
[2020-06-03 00:38:19] [INFO ] Parsed PT model containing 108 places and 2228 transitions in 268 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 52 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 578 resets, run finished after 806 ms. (steps per millisecond=124 ) properties seen :[1, 1, 1, 1, 1, 0, 1, 0, 0, 0, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 0, 0]
[2020-06-03 00:38:20] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
// Phase 1: matrix 290 rows 108 cols
[2020-06-03 00:38:20] [INFO ] Computed 7 place invariants in 12 ms
[2020-06-03 00:38:20] [INFO ] [Real]Absence check using 7 positive place invariants in 16 ms returned unsat
[2020-06-03 00:38:20] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned unsat
[2020-06-03 00:38:20] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned unsat
[2020-06-03 00:38:20] [INFO ] [Real]Absence check using 7 positive place invariants in 45 ms returned unsat
[2020-06-03 00:38:20] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned unsat
[2020-06-03 00:38:20] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2020-06-03 00:38:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 00:38:21] [INFO ] [Real]Absence check using state equation in 155 ms returned sat
[2020-06-03 00:38:21] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 00:38:21] [INFO ] [Nat]Absence check using 7 positive place invariants in 10 ms returned sat
[2020-06-03 00:38:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 00:38:21] [INFO ] [Nat]Absence check using state equation in 160 ms returned sat
[2020-06-03 00:38:21] [INFO ] State equation strengthened by 102 read => feed constraints.
[2020-06-03 00:38:21] [INFO ] [Nat]Added 102 Read/Feed constraints in 36 ms returned sat
[2020-06-03 00:38:22] [INFO ] Computed and/alt/rep : 2225/114389/287 causal constraints in 496 ms.
[2020-06-03 00:38:27] [INFO ] Added : 203 causal constraints over 41 iterations in 6196 ms. Result :sat
[2020-06-03 00:38:27] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned unsat
[2020-06-03 00:38:27] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2020-06-03 00:38:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 00:38:27] [INFO ] [Real]Absence check using state equation in 69 ms returned sat
[2020-06-03 00:38:27] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 00:38:27] [INFO ] [Nat]Absence check using 7 positive place invariants in 7 ms returned sat
[2020-06-03 00:38:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 00:38:28] [INFO ] [Nat]Absence check using state equation in 346 ms returned sat
[2020-06-03 00:38:28] [INFO ] [Nat]Added 102 Read/Feed constraints in 35 ms returned sat
[2020-06-03 00:38:28] [INFO ] Computed and/alt/rep : 2225/114389/287 causal constraints in 221 ms.
[2020-06-03 00:38:41] [INFO ] Added : 255 causal constraints over 51 iterations in 13369 ms. Result :sat
[2020-06-03 00:38:42] [INFO ] Deduced a trap composed of 5 places in 339 ms
[2020-06-03 00:38:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 652 ms
[2020-06-03 00:38:42] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned unsat
[2020-06-03 00:38:42] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2020-06-03 00:38:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 00:38:42] [INFO ] [Real]Absence check using state equation in 83 ms returned sat
[2020-06-03 00:38:42] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 00:38:42] [INFO ] [Nat]Absence check using 7 positive place invariants in 6 ms returned sat
[2020-06-03 00:38:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 00:38:42] [INFO ] [Nat]Absence check using state equation in 84 ms returned sat
[2020-06-03 00:38:42] [INFO ] [Nat]Added 102 Read/Feed constraints in 25 ms returned sat
[2020-06-03 00:38:42] [INFO ] Computed and/alt/rep : 2225/114389/287 causal constraints in 98 ms.
[2020-06-03 00:38:58] [INFO ] Added : 265 causal constraints over 53 iterations in 15577 ms. Result :sat
Successfully simplified 7 atomic propositions for a total of 8 simplifications.
[2020-06-03 00:38:58] [INFO ] Initial state reduction rules for CTL removed 9 formulas.
[2020-06-03 00:38:58] [INFO ] Flatten gal took : 164 ms
FORMULA BridgeAndVehicles-PT-V20P20N50-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V20P20N50-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V20P20N50-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V20P20N50-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V20P20N50-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V20P20N50-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V20P20N50-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V20P20N50-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V20P20N50-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 00:38:58] [INFO ] Flatten gal took : 100 ms
[2020-06-03 00:38:58] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 5 ms.
[2020-06-03 00:38:58] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 14 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ BridgeAndVehicles-PT-V20P20N50 @ 3570 seconds

FORMULA BridgeAndVehicles-PT-V20P20N50-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-PT-V20P20N50-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-PT-V20P20N50-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-PT-V20P20N50-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-PT-V20P20N50-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-PT-V20P20N50-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-PT-V20P20N50-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3177
rslt: Output for LTLCardinality @ BridgeAndVehicles-PT-V20P20N50

{
"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 00:38:59 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 503
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"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": 3,
"visible_transitions": 0
},
"processed": "X ((G (((1 <= p50 + p51) OR (G ((1 <= p50 + p51)) AND F ((1 <= p50 + p51))))) AND (2 <= p56)))",
"processed_size": 94,
"rewrites": 29
},
"result":
{
"edges": 169,
"markings": 169,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 587
},
"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": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "G ((p22 <= p50 + p51))",
"processed_size": 22,
"rewrites": 29
},
"result":
{
"edges": 168,
"markings": 168,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 705
},
"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": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "F (G ((p22 <= p50 + p51)))",
"processed_size": 26,
"rewrites": 29
},
"result":
{
"edges": 138909581,
"markings": 17329742,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 1,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 657
},
"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": "(p52 + 1 <= p56)",
"processed_size": 16,
"rewrites": 31
},
"result":
{
"edges": 9553880,
"markings": 3222685,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 42
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 2,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 795
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "G ((X ((p49 + 1 <= p67)) OR (p56 + 1 <= p52)))",
"processed_size": 46,
"rewrites": 29
},
"result":
{
"edges": 168,
"markings": 168,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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": 1060
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X ((p25 <= p22))",
"processed_size": 16,
"rewrites": 29
},
"result":
{
"edges": 168,
"markings": 168,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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": 1590
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 2,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "F ((X ((p51 + 1 <= p91)) AND ((p91 <= p51) AND F ((2 <= p0)))))",
"processed_size": 63,
"rewrites": 29
},
"result":
{
"edges": 168,
"markings": 168,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3180
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G (((p49 <= p26) AND F (((p49 <= 0) R F ((p49 <= 0))))))",
"processed_size": 56,
"rewrites": 29
},
"result":
{
"edges": 847219,
"markings": 133868,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 6,
"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": 81824,
"runtime": 393.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "X((G((** OR (G(**) AND F(**)))) AND **)) : (X(G(**)) OR ((G(**) AND F(G(**))) OR F(G(**)))) : (F(**) OR X(G(**))) : G((** AND F((* R F(*))))) : G((X(*) OR **)) : X(*) : F((X(*) AND (** AND F(**))))"
},
"net":
{
"arcs": 17190,
"conflict_clusters": 5,
"places": 108,
"places_significant": 101,
"singleton_clusters": 0,
"transitions": 2228
},
"result":
{
"preliminary_value": "no yes yes no no no no ",
"value": "no yes yes 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: 2336/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 3456
lola: finding significant places
lola: 108 places, 2228 transitions, 101 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 (((1 <= 0) U (G ((G ((1 <= p50 + p51)) U (1 <= p50 + p51))) AND (2 <= p56)))) : ((G ((p22 <= p50 + p51)) U G (X ((p50 + p51 <= p53 + p54)))) OR F (X (G ((p22 <= p50 + p51))))) : (F (((1 <= p52) U (p56 <= p52))) OR G (X ((p46 <= p25)))) : G ((G ((p49 <= p26)) AND X (G (X (X (G (F (NOT(((1 <= p49) U G ((1 <= p49)))))))))))) : G ((NOT(X ((p67 <= p49))) OR (p56 + 1 <= p52))) : NOT(X ((p22 + 1 <= p25))) : F (((NOT(X ((p91 <= p51))) AND (p91 <= p51)) AND F ((2 <= p0))))
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:338
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:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 503 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((G (((1 <= p50 + p51) OR (G ((1 <= p50 + p51)) AND F ((1 <= p50 + p51))))) AND (2 <= p56)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((G (((1 <= p50 + p51) OR (G ((1 <= p50 + p51)) AND F ((1 <= p50 + p51))))) AND (2 <= p56)))
lola: processed formula length: 94
lola: 29 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: 169 markings, 169 edges
lola: ========================================
lola: subprocess 1 will run for 587 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (G ((p50 + p51 <= p53 + p54))) OR ((G ((p22 <= p50 + p51)) AND F (G ((p50 + p51 <= p53 + p54)))) OR F (G ((p22 <= p50 + p51)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 587 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((p22 <= p50 + p51))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((p22 <= p50 + p51))
lola: processed formula length: 22
lola: 29 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: 168 markings, 168 edges
lola: ========================================
lola: subprocess 2 will run for 705 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((p22 <= p50 + p51)))
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 ((p22 <= p50 + p51)))
lola: processed formula length: 26
lola: 29 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: 446074 markings, 3203438 edges, 89215 markings/sec, 0 secs
lola: 852154 markings, 6204368 edges, 81216 markings/sec, 5 secs
lola: 1262732 markings, 9283035 edges, 82116 markings/sec, 10 secs
lola: 1660051 markings, 12300497 edges, 79464 markings/sec, 15 secs
lola: 2058486 markings, 15386319 edges, 79687 markings/sec, 20 secs
lola: 2461677 markings, 18514971 edges, 80638 markings/sec, 25 secs
lola: 2862589 markings, 21580227 edges, 80182 markings/sec, 30 secs
lola: 3253451 markings, 24640739 edges, 78172 markings/sec, 35 secs
lola: 3656980 markings, 27810953 edges, 80706 markings/sec, 40 secs
lola: 4037881 markings, 30763107 edges, 76180 markings/sec, 45 secs
lola: 4439822 markings, 33963047 edges, 80388 markings/sec, 50 secs
lola: 4824321 markings, 36994878 edges, 76900 markings/sec, 55 secs
lola: 5215664 markings, 40014248 edges, 78269 markings/sec, 60 secs
lola: 5606271 markings, 43228435 edges, 78121 markings/sec, 65 secs
lola: 5974563 markings, 45997927 edges, 73658 markings/sec, 70 secs
lola: 6366001 markings, 49257001 edges, 78288 markings/sec, 75 secs
lola: 6743277 markings, 52320669 edges, 75455 markings/sec, 80 secs
lola: 7093589 markings, 54963484 edges, 70062 markings/sec, 85 secs
lola: 7477906 markings, 58128630 edges, 76863 markings/sec, 90 secs
lola: 7870882 markings, 61421567 edges, 78595 markings/sec, 95 secs
lola: 8200584 markings, 64021390 edges, 65940 markings/sec, 100 secs
lola: 8562705 markings, 66707386 edges, 72424 markings/sec, 105 secs
lola: 8918475 markings, 69869502 edges, 71154 markings/sec, 110 secs
lola: 9296756 markings, 72986702 edges, 75656 markings/sec, 115 secs
lola: 9622415 markings, 75551842 edges, 65132 markings/sec, 120 secs
lola: 9974879 markings, 78121377 edges, 70493 markings/sec, 125 secs
lola: 10329170 markings, 81292117 edges, 70858 markings/sec, 130 secs
lola: 10709763 markings, 84581536 edges, 76119 markings/sec, 135 secs
lola: 11038799 markings, 87191359 edges, 65807 markings/sec, 140 secs
lola: 11348789 markings, 89535849 edges, 61998 markings/sec, 145 secs
lola: 11719507 markings, 92485993 edges, 74144 markings/sec, 150 secs
lola: 12069813 markings, 95617615 edges, 70061 markings/sec, 155 secs
lola: 12445880 markings, 98864039 edges, 75213 markings/sec, 160 secs
lola: 12770761 markings, 101441914 edges, 64976 markings/sec, 165 secs
lola: 13062321 markings, 103684610 edges, 58312 markings/sec, 170 secs
lola: 13420348 markings, 106390424 edges, 71605 markings/sec, 175 secs
lola: 13767703 markings, 109532823 edges, 69471 markings/sec, 180 secs
lola: 14127461 markings, 112729877 edges, 71952 markings/sec, 185 secs
lola: 14515292 markings, 115933066 edges, 77566 markings/sec, 190 secs
lola: 14806678 markings, 118258888 edges, 58277 markings/sec, 195 secs
lola: 15086910 markings, 120362205 edges, 56046 markings/sec, 200 secs
lola: 15444970 markings, 123165879 edges, 71612 markings/sec, 205 secs
lola: 15775547 markings, 126161411 edges, 66115 markings/sec, 210 secs
lola: 16117850 markings, 129220352 edges, 68461 markings/sec, 215 secs
lola: 16495101 markings, 132497113 edges, 75450 markings/sec, 220 secs
lola: 16819024 markings, 135080790 edges, 64785 markings/sec, 225 secs
lola: 17106713 markings, 137327947 edges, 57538 markings/sec, 230 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 17329742 markings, 138909581 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 2 will run for 657 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F ((p56 <= p52)) OR X (G ((p46 <= p25))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 657 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((p56 <= p52))
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: (p52 + 1 <= p56)
lola: processed formula length: 16
lola: 31 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: 144113 markings, 346345 edges, 28823 markings/sec, 0 secs
lola: 290518 markings, 729498 edges, 29281 markings/sec, 5 secs
lola: 458823 markings, 1174697 edges, 33661 markings/sec, 10 secs
lola: 596891 markings, 1553269 edges, 27614 markings/sec, 15 secs
lola: 748192 markings, 1981714 edges, 30260 markings/sec, 20 secs
lola: 884858 markings, 2397914 edges, 27333 markings/sec, 25 secs
lola: 1020241 markings, 2795914 edges, 27077 markings/sec, 30 secs
lola: 1173697 markings, 3214668 edges, 30691 markings/sec, 35 secs
lola: 1313841 markings, 3679639 edges, 28029 markings/sec, 40 secs
lola: 1462057 markings, 4086706 edges, 29643 markings/sec, 45 secs
lola: 1639203 markings, 4629319 edges, 35429 markings/sec, 50 secs
lola: 1759033 markings, 4987550 edges, 23966 markings/sec, 55 secs
lola: 1916194 markings, 5508784 edges, 31432 markings/sec, 60 secs
lola: 2062602 markings, 5904623 edges, 29282 markings/sec, 65 secs
lola: 2212474 markings, 6436487 edges, 29974 markings/sec, 70 secs
lola: 2377604 markings, 6869915 edges, 33026 markings/sec, 75 secs
lola: 2518378 markings, 7351307 edges, 28155 markings/sec, 80 secs
lola: 2668210 markings, 7872770 edges, 29966 markings/sec, 85 secs
lola: 2826845 markings, 8278044 edges, 31727 markings/sec, 90 secs
lola: 2976270 markings, 8801789 edges, 29885 markings/sec, 95 secs
lola: 3125619 markings, 9326778 edges, 29870 markings/sec, 100 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 3222685 markings, 9553880 edges
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: subprocess 3 will run for 795 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((X ((p49 + 1 <= p67)) OR (p56 + 1 <= p52)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((X ((p49 + 1 <= p67)) OR (p56 + 1 <= p52)))
lola: processed formula length: 46
lola: 29 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: 168 markings, 168 edges
lola: ========================================
lola: subprocess 4 will run for 1060 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((p25 <= p22))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((p25 <= p22))
lola: processed formula length: 16
lola: 29 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: 168 markings, 168 edges
lola: ========================================
lola: subprocess 5 will run for 1590 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((X ((p51 + 1 <= p91)) AND ((p91 <= p51) AND F ((2 <= p0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((X ((p51 + 1 <= p91)) AND ((p91 <= p51) AND F ((2 <= p0)))))
lola: processed formula length: 63
lola: 29 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: 168 markings, 168 edges
lola: ========================================
lola: subprocess 6 will run for 3180 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((p49 <= p26) AND F (((p49 <= 0) R F ((p49 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((p49 <= p26) AND F (((p49 <= 0) R F ((p49 <= 0))))))
lola: processed formula length: 56
lola: 29 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: 133868 markings, 847219 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes yes no no no no
lola:
preliminary result: no yes yes no no no no
lola: memory consumption: 81824 KB
lola: time consumption: 393 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="BridgeAndVehicles-PT-V20P20N50"
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 BridgeAndVehicles-PT-V20P20N50, 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 r182-oct2-158987913700345"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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