fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r037-tajo-162038176900109
Last Updated
Jun 28, 2021

About the Execution of 2020-gold for BridgeAndVehicles-PT-V20P20N50

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
4338.632 3600000.00 941347.00 283.40 FFFTFTFFTFTFFTTT normal

Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2021-input.r037-tajo-162038176900109.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2021-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 gold2020
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 r037-tajo-162038176900109
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 9.0M
-rw-r--r-- 1 mcc users 57K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 285K May 10 09:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 1.2M May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 4.5M May 10 09:42 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 6.2K Mar 28 15:46 LTLCardinality.txt
-rw-r--r-- 1 mcc users 32K Mar 28 15:46 LTLCardinality.xml
-rw-r--r-- 1 mcc users 97K Mar 28 15:46 LTLFireability.txt
-rw-r--r-- 1 mcc users 301K Mar 28 15:46 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.5K Mar 23 02:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 23 02:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 28K Mar 22 11:10 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K Mar 22 11:10 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.7K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.7K Mar 22 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 10 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 2.5M May 5 16:51 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 1620930375310

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-13 18:26:16] [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]
[2021-05-13 18:26:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 18:26:17] [INFO ] Load time of PNML (sax parser for PT used): 143 ms
[2021-05-13 18:26:17] [INFO ] Transformed 108 places.
[2021-05-13 18:26:17] [INFO ] Transformed 2228 transitions.
[2021-05-13 18:26:17] [INFO ] Parsed PT model containing 108 places and 2228 transitions in 197 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 61 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 578 resets, run finished after 775 ms. (steps per millisecond=129 ) properties seen :[1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 0, 1, 0, 0, 1, 0, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 1, 1]
[2021-05-13 18:26:18] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
// Phase 1: matrix 290 rows 108 cols
[2021-05-13 18:26:18] [INFO ] Computed 7 place invariants in 13 ms
[2021-05-13 18:26:18] [INFO ] [Real]Absence check using 7 positive place invariants in 22 ms returned sat
[2021-05-13 18:26:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 18:26:18] [INFO ] [Real]Absence check using state equation in 192 ms returned sat
[2021-05-13 18:26:18] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 18:26:18] [INFO ] [Nat]Absence check using 7 positive place invariants in 12 ms returned sat
[2021-05-13 18:26:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 18:26:18] [INFO ] [Nat]Absence check using state equation in 149 ms returned sat
[2021-05-13 18:26:18] [INFO ] State equation strengthened by 102 read => feed constraints.
[2021-05-13 18:26:18] [INFO ] [Nat]Added 102 Read/Feed constraints in 71 ms returned sat
[2021-05-13 18:26:19] [INFO ] Computed and/alt/rep : 2225/114389/287 causal constraints in 224 ms.
[2021-05-13 18:26:30] [INFO ] Added : 213 causal constraints over 43 iterations in 11228 ms. Result :sat
[2021-05-13 18:26:30] [INFO ] Deduced a trap composed of 56 places in 561 ms
[2021-05-13 18:26:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 902 ms
[2021-05-13 18:26:30] [INFO ] [Real]Absence check using 7 positive place invariants in 22 ms returned unsat
[2021-05-13 18:26:31] [INFO ] [Real]Absence check using 7 positive place invariants in 55 ms returned unsat
[2021-05-13 18:26:31] [INFO ] [Real]Absence check using 7 positive place invariants in 53 ms returned sat
[2021-05-13 18:26:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 18:26:32] [INFO ] [Real]Absence check using state equation in 976 ms returned sat
[2021-05-13 18:26:32] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 18:26:32] [INFO ] [Nat]Absence check using 7 positive place invariants in 22 ms returned sat
[2021-05-13 18:26:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 18:26:32] [INFO ] [Nat]Absence check using state equation in 142 ms returned sat
[2021-05-13 18:26:32] [INFO ] [Nat]Added 102 Read/Feed constraints in 39 ms returned sat
[2021-05-13 18:26:32] [INFO ] Deduced a trap composed of 5 places in 267 ms
[2021-05-13 18:26:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 299 ms
[2021-05-13 18:26:32] [INFO ] Computed and/alt/rep : 2225/114389/287 causal constraints in 122 ms.
[2021-05-13 18:26:49] [INFO ] Added : 284 causal constraints over 58 iterations in 16526 ms. Result :sat
[2021-05-13 18:26:49] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned unsat
[2021-05-13 18:26:49] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned unsat
[2021-05-13 18:26:49] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned unsat
[2021-05-13 18:26:49] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned unsat
[2021-05-13 18:26:49] [INFO ] [Real]Absence check using 7 positive place invariants in 6 ms returned unsat
[2021-05-13 18:26:49] [INFO ] [Real]Absence check using 7 positive place invariants in 6 ms returned unsat
Successfully simplified 8 atomic propositions for a total of 9 simplifications.
[2021-05-13 18:26:49] [INFO ] Initial state reduction rules for CTL removed 8 formulas.
[2021-05-13 18:26:49] [INFO ] Flatten gal took : 172 ms
FORMULA BridgeAndVehicles-PT-V20P20N50-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V20P20N50-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V20P20N50-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V20P20N50-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V20P20N50-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V20P20N50-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V20P20N50-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V20P20N50-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-13 18:26:49] [INFO ] Flatten gal took : 117 ms
[2021-05-13 18:26:49] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2021-05-13 18:26:49] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 20 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ BridgeAndVehicles-PT-V20P20N50 @ 3570 seconds

FORMULA BridgeAndVehicles-PT-V20P20N50-00 FALSE 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 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

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

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

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

FORMULA BridgeAndVehicles-PT-V20P20N50-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2691
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": "Thu May 13 18:26:50 2021
",
"timelimit": 3570
},
"child":
[

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 440
},
"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": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "G ((p26 + p27 + 1 <= p53 + p54))",
"processed_size": 32,
"rewrites": 40
},
"result":
{
"edges": 168,
"markings": 168,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 0,
"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": 503
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 2,
"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": "X (X (F ((p25 <= p23))))",
"processed_size": 24,
"rewrites": 40
},
"result":
{
"edges": 168,
"markings": 168,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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": false
},
"task":
{
"compoundnumber": 0,
"type": "boolean"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 684
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "G (F ((p55 <= 1)))",
"processed_size": 18,
"rewrites": 40
},
"result":
{
"edges": 168,
"markings": 168,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "fairness",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 855
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "F (G ((3 <= p49)))",
"processed_size": 18,
"rewrites": 40
},
"result":
{
"edges": 170,
"markings": 169,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1139
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 0,
"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": 3,
"visible_transitions": 0
},
"processed": "F (G ((G (F ((p49 + 1 <= p52))) OR (p56 <= p49))))",
"processed_size": 50,
"rewrites": 40
},
"result":
{
"edges": 209983754,
"markings": 31477165,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 5,
"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": 1346
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "G (((p53 + p54 <= p26 + p27) OR (1 <= p23)))",
"processed_size": 45,
"rewrites": 40
},
"result":
{
"edges": 168,
"markings": 168,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 6,
"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": 2691
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2691
},
"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": "G (F ((2 <= p23)))",
"processed_size": 18,
"rewrites": 40
},
"result":
{
"edges": 168,
"markings": 168,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "fairness",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 7,
"type": "boolean"
}
},

{
"child":
[

{
"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": "G (F ((2 <= p23)))",
"processed_size": 18,
"rewrites": 40
},
"result":
{
"edges": 168,
"markings": 168,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "fairness",
"workflow": "product automaton"
}
},

{
"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": "G (F ((1 <= p0)))",
"processed_size": 17,
"rewrites": 40
},
"result":
{
"edges": 168,
"markings": 168,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "fairness",
"workflow": "product automaton"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 8,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 81464,
"runtime": 879.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(X(X(F(**))) OR G(**)) : G(F(*)) : F(G((G(F(*)) OR **))) : G(**) : F(G(*)) : (G(F(**)) OR G(F(**))) : G((X(*) OR G(*))) : F(G((F(**) AND (X(F(**)) OR **))))"
},
"net":
{
"arcs": 17190,
"conflict_clusters": 5,
"places": 108,
"places_significant": 101,
"singleton_clusters": 0,
"transitions": 2228
},
"result":
{
"preliminary_value": "no no yes no no no no yes ",
"value": "no no yes no no no no yes "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 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 (X (((1 <= p55) U F ((p25 <= p23))))) OR G ((p26 + p27 + 1 <= p53 + p54))) : F (G (NOT(G ((2 <= p55))))) : F (((p52 + 1 <= p50 + p51) U G (X ((G (NOT(X (G ((p52 <= p49))))) OR (p56 <= p49)))))) : G (((p53 + p54 <= p26 + p27) OR (1 <= p23))) : NOT(G (X (((F (X (F ((3 <= p49)))) U (0 <= 0)) U X (F ((p49 <= 2))))))) : (G (F ((1 <= p0))) OR G ((F ((G ((1 <= p0)) AND (p22 <= p35))) U F ((2 <= p23))))) : NOT(F ((X ((((p55 <= p0) OR (1 <= p54)))) AND ((p55 <= p0) U F ((p55 <= p0)))))) : G (G (X (F (G ((X (F ((p23 <= 1))) U (p52 <= p49)))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:434
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:347
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:166
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 440 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (X (F ((p25 <= p23)))) OR G ((p26 + p27 + 1 <= p53 + p54)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 440 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((p26 + p27 + 1 <= p53 + p54))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((p26 + p27 + 1 <= p53 + p54))
lola: processed formula length: 32
lola: 40 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 1 will run for 503 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (F ((p25 <= p23))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (F ((p25 <= p23))))
lola: processed formula length: 24
lola: 40 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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 503 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((X ((((p0 + 1 <= p55) AND (p54 <= 0)))) OR G ((p0 + 1 <= p55))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((X ((((p0 + 1 <= p55) AND (p54 <= 0)))) OR G ((p0 + 1 <= p55))))
lola: processed formula length: 67
lola: 40 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 168 markings, 168 edges
lola: ========================================
lola: subprocess 2 will run for 587 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((F ((p52 <= p49)) AND (X (F ((p23 <= 1))) OR (p52 <= p49)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((F ((p52 <= p49)) AND (X (F ((p23 <= 1))) OR (p52 <= p49)))))
lola: processed formula length: 67
lola: 40 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: 768768 markings, 2607052 edges, 153754 markings/sec, 0 secs
lola: 1556494 markings, 5385505 edges, 157545 markings/sec, 5 secs
lola: 2328857 markings, 8239980 edges, 154473 markings/sec, 10 secs
lola: 3079105 markings, 11007473 edges, 150050 markings/sec, 15 secs
lola: 3830228 markings, 13831554 edges, 150225 markings/sec, 20 secs
lola: 4568530 markings, 16695970 edges, 147660 markings/sec, 25 secs
lola: 5296486 markings, 19582766 edges, 145591 markings/sec, 30 secs
lola: 6018765 markings, 22315068 edges, 144456 markings/sec, 35 secs
lola: 6733520 markings, 25094066 edges, 142951 markings/sec, 40 secs
lola: 7426989 markings, 27942402 edges, 138694 markings/sec, 45 secs
lola: 8165838 markings, 30667955 edges, 147770 markings/sec, 50 secs
lola: 8828885 markings, 33539806 edges, 132609 markings/sec, 55 secs
lola: 9555880 markings, 36257912 edges, 145399 markings/sec, 60 secs
lola: 10161395 markings, 38823948 edges, 121103 markings/sec, 65 secs
lola: 10823538 markings, 41549093 edges, 132429 markings/sec, 70 secs
lola: 11496560 markings, 44062737 edges, 134604 markings/sec, 75 secs
lola: 12136172 markings, 46892001 edges, 127922 markings/sec, 80 secs
lola: 12850370 markings, 49714637 edges, 142840 markings/sec, 85 secs
lola: 13521132 markings, 52344541 edges, 134152 markings/sec, 90 secs
lola: 14150320 markings, 55133622 edges, 125838 markings/sec, 95 secs
lola: 14859018 markings, 57975587 edges, 141740 markings/sec, 100 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: 15109658 markings, 58860499 edges
lola: ========================================
lola: subprocess 3 will run for 684 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((p55 <= 1)))
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 ((p55 <= 1)))
lola: processed formula length: 18
lola: 40 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 4 will run for 855 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((3 <= p49)))
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 ((3 <= p49)))
lola: processed formula length: 18
lola: 40 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: 169 markings, 170 edges
lola: ========================================
lola: subprocess 5 will run for 1139 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((G (F ((p49 + 1 <= p52))) OR (p56 <= p49))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((G (F ((p49 + 1 <= p52))) OR (p56 <= p49))))
lola: processed formula length: 50
lola: 40 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: 170071 markings, 868379 edges, 34014 markings/sec, 0 secs
lola: 350572 markings, 2044498 edges, 36100 markings/sec, 5 secs
lola: 535278 markings, 3192823 edges, 36941 markings/sec, 10 secs
lola: 709543 markings, 4275255 edges, 34853 markings/sec, 15 secs
lola: 956400 markings, 6072448 edges, 49371 markings/sec, 20 secs
lola: 1143718 markings, 7272526 edges, 37464 markings/sec, 25 secs
lola: 1381033 markings, 8943594 edges, 47463 markings/sec, 30 secs
lola: 1634564 markings, 10732385 edges, 50706 markings/sec, 35 secs
lola: 1774135 markings, 11401011 edges, 27914 markings/sec, 40 secs
lola: 2051079 markings, 13563119 edges, 55389 markings/sec, 45 secs
lola: 2294732 markings, 15376055 edges, 48731 markings/sec, 50 secs
lola: 2428988 markings, 15967115 edges, 26851 markings/sec, 55 secs
lola: 2652192 markings, 17582393 edges, 44641 markings/sec, 60 secs
lola: 2937117 markings, 19791187 edges, 56985 markings/sec, 65 secs
lola: 3130996 markings, 20992332 edges, 38776 markings/sec, 70 secs
lola: 3252502 markings, 21592329 edges, 24301 markings/sec, 75 secs
lola: 3468580 markings, 23085722 edges, 43216 markings/sec, 80 secs
lola: 3787734 markings, 25694491 edges, 63831 markings/sec, 85 secs
lola: 4031441 markings, 27380545 edges, 48741 markings/sec, 90 secs
lola: 4181307 markings, 28066648 edges, 29973 markings/sec, 95 secs
lola: 4331679 markings, 28934692 edges, 30074 markings/sec, 100 secs
lola: 4595326 markings, 31004835 edges, 52729 markings/sec, 105 secs
lola: 4915119 markings, 33513720 edges, 63959 markings/sec, 110 secs
lola: 5132781 markings, 34873772 edges, 43532 markings/sec, 115 secs
lola: 5281706 markings, 35566432 edges, 29785 markings/sec, 120 secs
lola: 5420030 markings, 36293223 edges, 27665 markings/sec, 125 secs
lola: 5615287 markings, 37689211 edges, 39051 markings/sec, 130 secs
lola: 5945907 markings, 40398346 edges, 66124 markings/sec, 135 secs
lola: 6252644 markings, 42793537 edges, 61347 markings/sec, 140 secs
lola: 6435529 markings, 43735184 edges, 36577 markings/sec, 145 secs
lola: 6597212 markings, 44532902 edges, 32337 markings/sec, 150 secs
lola: 6756415 markings, 45408264 edges, 31841 markings/sec, 155 secs
lola: 6924692 markings, 46662796 edges, 33655 markings/sec, 160 secs
lola: 7229781 markings, 49010646 edges, 61018 markings/sec, 165 secs
lola: 7557207 markings, 51651704 edges, 65485 markings/sec, 170 secs
lola: 7792928 markings, 53121105 edges, 47144 markings/sec, 175 secs
lola: 7965033 markings, 53894650 edges, 34421 markings/sec, 180 secs
lola: 8126269 markings, 54753051 edges, 32247 markings/sec, 185 secs
lola: 8275886 markings, 55546207 edges, 29923 markings/sec, 190 secs
lola: 8447284 markings, 56802346 edges, 34280 markings/sec, 195 secs
lola: 8752945 markings, 59331169 edges, 61132 markings/sec, 200 secs
lola: 9079694 markings, 61923980 edges, 65350 markings/sec, 205 secs
lola: 9361128 markings, 63986171 edges, 56287 markings/sec, 210 secs
lola: 9539652 markings, 64719239 edges, 35705 markings/sec, 215 secs
lola: 9714133 markings, 65587690 edges, 34896 markings/sec, 220 secs
lola: 9869635 markings, 66457254 edges, 31100 markings/sec, 225 secs
lola: 10035846 markings, 67437726 edges, 33242 markings/sec, 230 secs
lola: 10200169 markings, 68664671 edges, 32865 markings/sec, 235 secs
lola: 10488588 markings, 70902954 edges, 57684 markings/sec, 240 secs
lola: 10819965 markings, 73598875 edges, 66275 markings/sec, 245 secs
lola: 11133254 markings, 76047034 edges, 62658 markings/sec, 250 secs
lola: 11297739 markings, 76684241 edges, 32897 markings/sec, 255 secs
lola: 11455194 markings, 77405077 edges, 31491 markings/sec, 260 secs
lola: 11614510 markings, 78221954 edges, 31863 markings/sec, 265 secs
lola: 11768102 markings, 79090340 edges, 30718 markings/sec, 270 secs
lola: 11904296 markings, 79878919 edges, 27239 markings/sec, 275 secs
lola: 12092636 markings, 81110357 edges, 37668 markings/sec, 280 secs
lola: 12291598 markings, 82536889 edges, 39792 markings/sec, 285 secs
lola: 12623215 markings, 85354674 edges, 66323 markings/sec, 290 secs
lola: 12950163 markings, 88019448 edges, 65390 markings/sec, 295 secs
lola: 13235930 markings, 90095643 edges, 57153 markings/sec, 300 secs
lola: 13429019 markings, 90857819 edges, 38618 markings/sec, 305 secs
lola: 13613468 markings, 91741927 edges, 36890 markings/sec, 310 secs
lola: 13797260 markings, 92713407 edges, 36758 markings/sec, 315 secs
lola: 13964476 markings, 93667326 edges, 33443 markings/sec, 320 secs
lola: 14126483 markings, 94578235 edges, 32401 markings/sec, 325 secs
lola: 14287747 markings, 95710297 edges, 32253 markings/sec, 330 secs
lola: 14460832 markings, 97056752 edges, 34617 markings/sec, 335 secs
lola: 14768233 markings, 99483065 edges, 61480 markings/sec, 340 secs
lola: 15095013 markings, 102121154 edges, 65356 markings/sec, 345 secs
lola: 15413684 markings, 104607688 edges, 63734 markings/sec, 350 secs
lola: 15636044 markings, 105747893 edges, 44472 markings/sec, 355 secs
lola: 15836158 markings, 106623145 edges, 40023 markings/sec, 360 secs
lola: 16025538 markings, 107556761 edges, 37876 markings/sec, 365 secs
lola: 16209660 markings, 108553679 edges, 36824 markings/sec, 370 secs
lola: 16376659 markings, 109522850 edges, 33400 markings/sec, 375 secs
lola: 16516663 markings, 110361136 edges, 28001 markings/sec, 380 secs
lola: 16701179 markings, 111493793 edges, 36903 markings/sec, 385 secs
lola: 16868701 markings, 112754292 edges, 33504 markings/sec, 390 secs
lola: 17044510 markings, 113953275 edges, 35162 markings/sec, 395 secs
lola: 17338309 markings, 116523009 edges, 58760 markings/sec, 400 secs
lola: 17651660 markings, 119083927 edges, 62670 markings/sec, 405 secs
lola: 17967825 markings, 121588443 edges, 63233 markings/sec, 410 secs
lola: 18180218 markings, 122740983 edges, 42479 markings/sec, 415 secs
lola: 18366313 markings, 123521127 edges, 37219 markings/sec, 420 secs
lola: 18558717 markings, 124424578 edges, 38481 markings/sec, 425 secs
lola: 18754580 markings, 125429701 edges, 39173 markings/sec, 430 secs
lola: 18935580 markings, 126444583 edges, 36200 markings/sec, 435 secs
lola: 19107117 markings, 127449883 edges, 34307 markings/sec, 440 secs
lola: 19254610 markings, 128320689 edges, 29499 markings/sec, 445 secs
lola: 19430511 markings, 129417616 edges, 35180 markings/sec, 450 secs
lola: 19584377 markings, 130540328 edges, 30773 markings/sec, 455 secs
lola: 19732576 markings, 131664890 edges, 29640 markings/sec, 460 secs
lola: 20011762 markings, 133850281 edges, 55837 markings/sec, 465 secs
lola: 20323492 markings, 136338978 edges, 62346 markings/sec, 470 secs
lola: 20657703 markings, 139114082 edges, 66842 markings/sec, 475 secs
lola: 20956460 markings, 141258837 edges, 59751 markings/sec, 480 secs
lola: 21159781 markings, 142017154 edges, 40664 markings/sec, 485 secs
lola: 21365144 markings, 142933200 edges, 41073 markings/sec, 490 secs
lola: 21571891 markings, 143937454 edges, 41349 markings/sec, 495 secs
lola: 21768230 markings, 144978453 edges, 39268 markings/sec, 500 secs
lola: 21951515 markings, 146021565 edges, 36657 markings/sec, 505 secs
lola: 22124441 markings, 147044405 edges, 34585 markings/sec, 510 secs
lola: 22275706 markings, 147962640 edges, 30253 markings/sec, 515 secs
lola: 22457466 markings, 149063086 edges, 36352 markings/sec, 520 secs
lola: 22618688 markings, 150180334 edges, 32244 markings/sec, 525 secs
lola: 22785121 markings, 151437082 edges, 33287 markings/sec, 530 secs
lola: 23028089 markings, 153254506 edges, 48594 markings/sec, 535 secs
lola: 23357792 markings, 155989729 edges, 65941 markings/sec, 540 secs
lola: 23685527 markings, 158690825 edges, 65547 markings/sec, 545 secs
lola: 23996506 markings, 161211038 edges, 62196 markings/sec, 550 secs
lola: 24215728 markings, 162382234 edges, 43844 markings/sec, 555 secs
lola: 24404730 markings, 163162283 edges, 37800 markings/sec, 560 secs
lola: 24612037 markings, 164096343 edges, 41461 markings/sec, 565 secs
lola: 24816843 markings, 165106627 edges, 40961 markings/sec, 570 secs
lola: 25021549 markings, 166176238 edges, 40941 markings/sec, 575 secs
lola: 25219235 markings, 167278317 edges, 39537 markings/sec, 580 secs
lola: 25395347 markings, 168323338 edges, 35222 markings/sec, 585 secs
lola: 25563604 markings, 169333976 edges, 33651 markings/sec, 590 secs
lola: 25721333 markings, 170222204 edges, 31546 markings/sec, 595 secs
lola: 25892128 markings, 171373783 edges, 34159 markings/sec, 600 secs
lola: 26061635 markings, 172613653 edges, 33901 markings/sec, 605 secs
lola: 26231083 markings, 173889205 edges, 33890 markings/sec, 610 secs
lola: 26466497 markings, 175559603 edges, 47083 markings/sec, 615 secs
lola: 26795458 markings, 178277158 edges, 65792 markings/sec, 620 secs
lola: 27124886 markings, 181057270 edges, 65886 markings/sec, 625 secs
lola: 27449957 markings, 183596172 edges, 65014 markings/sec, 630 secs
lola: 27711044 markings, 185131386 edges, 52217 markings/sec, 635 secs
lola: 27923789 markings, 186003596 edges, 42549 markings/sec, 640 secs
lola: 28140383 markings, 186964133 edges, 43319 markings/sec, 645 secs
lola: 28344981 markings, 187958845 edges, 40920 markings/sec, 650 secs
lola: 28550773 markings, 189021132 edges, 41158 markings/sec, 655 secs
lola: 28760423 markings, 190152412 edges, 41930 markings/sec, 660 secs
lola: 28948990 markings, 191241964 edges, 37713 markings/sec, 665 secs
lola: 29132615 markings, 192332556 edges, 36725 markings/sec, 670 secs
lola: 29292582 markings, 193326654 edges, 31993 markings/sec, 675 secs
lola: 29435574 markings, 194208354 edges, 28598 markings/sec, 680 secs
lola: 29622191 markings, 195352294 edges, 37323 markings/sec, 685 secs
lola: 29767631 markings, 196381016 edges, 29088 markings/sec, 690 secs
lola: 29919886 markings, 197503872 edges, 30451 markings/sec, 695 secs
lola: 30087164 markings, 198743290 edges, 33456 markings/sec, 700 secs
lola: 30362978 markings, 201001463 edges, 55163 markings/sec, 705 secs
lola: 30676825 markings, 203507627 edges, 62769 markings/sec, 710 secs
lola: 30987582 markings, 206138740 edges, 62151 markings/sec, 715 secs
lola: 31288117 markings, 208521267 edges, 60107 markings/sec, 720 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: 31477165 markings, 209983754 edges
lola: ========================================
lola: subprocess 6 will run for 1346 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((p53 + p54 <= p26 + p27) OR (1 <= p23)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((p53 + p54 <= p26 + p27) OR (1 <= p23)))
lola: processed formula length: 45
lola: 40 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 7 will run for 2691 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G (F ((1 <= p0))) OR G (F ((2 <= p23))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 2691 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((2 <= p23)))
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 ((2 <= p23)))
lola: processed formula length: 18
lola: 40 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: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (G (F ((1 <= p0))) OR G (F ((2 <= p23))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: G (F ((2 <= p23)))
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 ((2 <= p23)))
lola: processed formula length: 18
lola: 40 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: ========================================
lola: ...considering subproblem: G (F ((1 <= p0)))
lola: ========================================
lola: SUBTASK
lola: checking fairness
lola: fairness not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((1 <= p0)))
lola: processed formula length: 17
lola: 40 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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: RESULT
lola:
SUMMARY: no no yes no no no no yes
lola:
preliminary result: no no yes no no no no yes
lola: ========================================
lola: memory consumption: 81464 KB
lola: time consumption: 879 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="gold2020"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# 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 gold2020"
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 r037-tajo-162038176900109"
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 ;