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-158987913500169.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-COL-V20P20N10, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r182-oct2-158987913500169
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 232K
-rw-r--r-- 1 mcc users 4.3K Mar 26 02:25 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 26 02:24 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Mar 25 20:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 25 20:56 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 3.6K Apr 8 14:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 8 14:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.4K Mar 25 17:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 25 17:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Mar 25 12:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 25 12:23 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Mar 25 17:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Mar 25 17:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 equiv_pt
-rw-r--r-- 1 mcc users 10 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 39K 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-COL-V20P20N10-00
FORMULA_NAME BridgeAndVehicles-COL-V20P20N10-01
FORMULA_NAME BridgeAndVehicles-COL-V20P20N10-02
FORMULA_NAME BridgeAndVehicles-COL-V20P20N10-03
FORMULA_NAME BridgeAndVehicles-COL-V20P20N10-04
FORMULA_NAME BridgeAndVehicles-COL-V20P20N10-05
FORMULA_NAME BridgeAndVehicles-COL-V20P20N10-06
FORMULA_NAME BridgeAndVehicles-COL-V20P20N10-07
FORMULA_NAME BridgeAndVehicles-COL-V20P20N10-08
FORMULA_NAME BridgeAndVehicles-COL-V20P20N10-09
FORMULA_NAME BridgeAndVehicles-COL-V20P20N10-10
FORMULA_NAME BridgeAndVehicles-COL-V20P20N10-11
FORMULA_NAME BridgeAndVehicles-COL-V20P20N10-12
FORMULA_NAME BridgeAndVehicles-COL-V20P20N10-13
FORMULA_NAME BridgeAndVehicles-COL-V20P20N10-14
FORMULA_NAME BridgeAndVehicles-COL-V20P20N10-15

=== Now, execution of the tool begins

BK_START 1591131169695

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-02 20:52:52] [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-02 20:52:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-02 20:52:52] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
SLF4J: Failed to load class "org.slf4j.impl.StaticLoggerBinder".
SLF4J: Defaulting to no-operation (NOP) logger implementation
SLF4J: See http://www.slf4j.org/codes.html#StaticLoggerBinder for further details.
[2020-06-02 20:52:53] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 614 ms
[2020-06-02 20:52:53] [INFO ] sort/places :
sens->CONTROLEUR,CHOIX,VIDANGE,
compteur->COMPTEUR,
Dot->CAPACITE,SORTI_A,ROUTE_A,ATTENTE_A,SUR_PONT_A,SUR_PONT_B,ATTENTE_B,ROUTE_B,SORTI_B,
voitureA->NB_ATTENTE_A,
voitureB->NB_ATTENTE_B,

[2020-06-02 20:52:53] [INFO ] Imported 15 HL places and 11 HL transitions for a total of 68 PT places and 19578.0 transition bindings in 49 ms.
[2020-06-02 20:52:53] [INFO ] Computed order based on color domains.
[2020-06-02 20:52:53] [INFO ] Unfolded HLPN to a Petri net with 68 places and 548 transitions in 55 ms.
[2020-06-02 20:52:53] [INFO ] Unfolded HLPN properties in 0 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 106 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 563 resets, run finished after 371 ms. (steps per millisecond=269 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 0, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 0, 1, 1, 0]
[2020-06-02 20:52:53] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 68 cols
[2020-06-02 20:52:53] [INFO ] Computed 7 place invariants in 7 ms
[2020-06-02 20:52:54] [INFO ] [Real]Absence check using 7 positive place invariants in 26 ms returned unsat
[2020-06-02 20:52:54] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2020-06-02 20:52:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 20:52:54] [INFO ] [Real]Absence check using state equation in 124 ms returned sat
[2020-06-02 20:52:54] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 20:52:54] [INFO ] [Nat]Absence check using 7 positive place invariants in 8 ms returned sat
[2020-06-02 20:52:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 20:52:54] [INFO ] [Nat]Absence check using state equation in 98 ms returned sat
[2020-06-02 20:52:54] [INFO ] State equation strengthened by 22 read => feed constraints.
[2020-06-02 20:52:54] [INFO ] [Nat]Added 22 Read/Feed constraints in 12 ms returned sat
[2020-06-02 20:52:54] [INFO ] Computed and/alt/rep : 545/7789/127 causal constraints in 71 ms.
[2020-06-02 20:52:55] [INFO ] Added : 109 causal constraints over 25 iterations in 1269 ms. Result :sat
[2020-06-02 20:52:55] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned unsat
[2020-06-02 20:52:55] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned unsat
[2020-06-02 20:52:55] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2020-06-02 20:52:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 20:52:56] [INFO ] [Real]Absence check using state equation in 166 ms returned sat
[2020-06-02 20:52:56] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 20:52:56] [INFO ] [Nat]Absence check using 7 positive place invariants in 7 ms returned sat
[2020-06-02 20:52:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 20:52:56] [INFO ] [Nat]Absence check using state equation in 124 ms returned sat
[2020-06-02 20:52:56] [INFO ] [Nat]Added 22 Read/Feed constraints in 21 ms returned sat
[2020-06-02 20:52:56] [INFO ] Computed and/alt/rep : 545/7789/127 causal constraints in 32 ms.
[2020-06-02 20:52:57] [INFO ] Added : 118 causal constraints over 24 iterations in 1307 ms. Result :sat
[2020-06-02 20:52:57] [INFO ] [Real]Absence check using 7 positive place invariants in 7 ms returned unsat
[2020-06-02 20:52:57] [INFO ] [Real]Absence check using 7 positive place invariants in 32 ms returned unsat
[2020-06-02 20:52:57] [INFO ] [Real]Absence check using 7 positive place invariants in 37 ms returned unsat
[2020-06-02 20:52:57] [INFO ] [Real]Absence check using 7 positive place invariants in 16 ms returned unsat
[2020-06-02 20:52:57] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned unsat
Successfully simplified 8 atomic propositions for a total of 9 simplifications.
[2020-06-02 20:52:58] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2020-06-02 20:52:58] [INFO ] Flatten gal took : 109 ms
FORMULA BridgeAndVehicles-COL-V20P20N10-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V20P20N10-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V20P20N10-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V20P20N10-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-02 20:52:58] [INFO ] Applying decomposition
[2020-06-02 20:52:58] [INFO ] Flatten gal took : 36 ms
[2020-06-02 20:52:58] [INFO ] Decomposing Gal with order
[2020-06-02 20:52:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-06-02 20:52:58] [INFO ] Removed a total of 2910 redundant transitions.
[2020-06-02 20:52:58] [INFO ] Flatten gal took : 112 ms
[2020-06-02 20:52:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 10 ms.
[2020-06-02 20:52:58] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2020-06-02 20:52:58] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 5 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ BridgeAndVehicles-COL-V20P20N10 @ 3570 seconds

FORMULA BridgeAndVehicles-COL-V20P20N10-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-COL-V20P20N10-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-COL-V20P20N10-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-COL-V20P20N10-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-COL-V20P20N10-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-COL-V20P20N10-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-COL-V20P20N10-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-COL-V20P20N10-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-COL-V20P20N10-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-COL-V20P20N10-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-COL-V20P20N10-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-COL-V20P20N10-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3304
rslt: Output for LTLCardinality @ BridgeAndVehicles-COL-V20P20N10

{
"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": "Tue Jun 2 20:52:58 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 295
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 1,
"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": 3,
"visible_transitions": 0
},
"processed": "X ((F (((p47 + 1 <= p22) OR (p23 <= 1))) AND (2 <= p23)))",
"processed_size": 58,
"rewrites": 40
},
"result":
{
"edges": 570622,
"markings": 263109,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 4
},
"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": 322
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 1,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"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": 5,
"visible_transitions": 0
},
"processed": "X (G ((X (F ((p25 <= p48))) OR ((p22 <= p47) U G ((2 <= p49))))))",
"processed_size": 65,
"rewrites": 40
},
"result":
{
"edges": 86502043,
"markings": 21582323,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 6
},
"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": 346
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 2,
"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": "X (X ((1 <= p0)))",
"processed_size": 17,
"rewrites": 40
},
"result":
{
"edges": 11,
"markings": 9,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 4
},
"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": 384
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 2,
"U": 1,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X (((p48 + 1 <= p0) U (G ((p0 <= p48)) AND (X ((1 <= p23)) OR G ((1 <= p23))))))",
"processed_size": 80,
"rewrites": 40
},
"result":
{
"edges": 179,
"markings": 179,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 19
},
"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": 432
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 2,
"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": "X (X (G ((2 <= p47))))",
"processed_size": 22,
"rewrites": 40
},
"result":
{
"edges": 179,
"markings": 179,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 494
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X ((X (F ((G ((p0 <= p24)) OR (1 <= p66 + p67)))) OR (p0 <= p24)))",
"processed_size": 66,
"rewrites": 40
},
"result":
{
"edges": 546361,
"markings": 81634,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 4
},
"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": 576
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 3,
"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": "X (X (X (F ((1 <= p49)))))",
"processed_size": 26,
"rewrites": 40
},
"result":
{
"edges": 26,
"markings": 18,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 692
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G (F ((p23 + 1 <= p22)))",
"processed_size": 24,
"rewrites": 40
},
"result":
{
"edges": 46029349,
"markings": 9342326,
"produced_by": "LTL model checker",
"value": true
},
"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"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 844
},
"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": "G (F ((p66 + p67 <= p48)))",
"processed_size": 26,
"rewrites": 40
},
"result":
{
"edges": 27464957,
"markings": 6580205,
"produced_by": "LTL model checker",
"value": true
},
"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"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1113
},
"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": "G (F ((p66 + p67 <= p49)))",
"processed_size": 26,
"rewrites": 40
},
"result":
{
"edges": 27484856,
"markings": 6561768,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "fairness",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1652
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "F (G (((p22 + 1 <= p0) AND (p66 + p67 + 1 <= p53 + p54))))",
"processed_size": 58,
"rewrites": 40
},
"result":
{
"edges": 181,
"markings": 180,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3304
},
"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 ((p47 <= p53 + p54))",
"processed_size": 22,
"rewrites": 40
},
"result":
{
"edges": 179,
"markings": 179,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"error": null,
"memory": 28504,
"runtime": 266.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "G(F(**)) : X((F(*) AND *)) : X(G((X(F(**)) OR (** U G(**))))) : X(X(**)) : G(F(**)) : F(G(*)) : X((** U (G(**) AND (X(**) OR G(**))))) : X(X(G(*))) : G(F(**)) : G(**) : X((X(F((G(**) OR **))) OR **)) : X(X(X(F(**))))"
},
"net":
{
"arcs": 4070,
"conflict_clusters": 5,
"places": 68,
"places_significant": 61,
"singleton_clusters": 0,
"transitions": 548
},
"result":
{
"preliminary_value": "yes yes yes yes yes no no no yes no yes yes ",
"value": "yes yes yes yes yes no no no yes no yes 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: 616/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 2176
lola: finding significant places
lola: 68 places, 548 transitions, 61 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: G (X (G (F ((p66 + p67 <= p49))))) : NOT(X ((G (((p22 <= p47) AND (2 <= p23))) OR (p23 <= 1)))) : G (X ((F (X (((p47 + 1 <= p22) U F ((p25 <= p48))))) OR ((p22 <= p47) U G ((2 <= p49)))))) : X (X (((1 <= 0) U (1 <= p0)))) : G ((((1 <= p49) U (0 <= 0)) U F (X ((p66 + p67 <= p48))))) : NOT(G (F (((p0 <= p22) OR (p53 + p54 <= p66 + p67))))) : X (((p48 + 1 <= p0) U (G ((p0 <= p48)) AND (X ((1 <= p23)) OR G ((1 <= p23)))))) : X (NOT(F (X ((p47 <= 1))))) : G (X ((X ((p22 <= p23)) U F ((p23 + 1 <= p22))))) : G ((p47 <= p53 + p54)) : X ((F (X ((G ((p0 <= p24)) OR (1 <= p66 + p67)))) OR ((1 <= 0) U (p0 <= p24)))) : F (X (F (X (X ((1 <= p49))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:422
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:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:166
lola: rewrite Frontend/Parser/formula_rewrite.k:356
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: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:356
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 295 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((F (((p47 + 1 <= p22) OR (p23 <= 1))) AND (2 <= p23)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((F (((p47 + 1 <= p22) OR (p23 <= 1))) AND (2 <= p23)))
lola: processed formula length: 58
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: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 263109 markings, 570622 edges
lola: ========================================
lola: subprocess 1 will run for 322 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((X (F ((p25 <= p48))) OR ((p22 <= p47) U G ((2 <= p49))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((X (F ((p25 <= p48))) OR ((p22 <= p47) U G ((2 <= p49))))))
lola: processed formula length: 65
lola: 40 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: 1161631 markings, 6166986 edges, 232326 markings/sec, 0 secs
lola: 2399267 markings, 12016462 edges, 247527 markings/sec, 5 secs
lola: 3717831 markings, 17582431 edges, 263713 markings/sec, 10 secs
lola: 5028921 markings, 23034361 edges, 262218 markings/sec, 15 secs
lola: 6401576 markings, 28300701 edges, 274531 markings/sec, 20 secs
lola: 7728709 markings, 33466913 edges, 265427 markings/sec, 25 secs
lola: 9017725 markings, 38495826 edges, 257803 markings/sec, 30 secs
lola: 10294869 markings, 43474351 edges, 255429 markings/sec, 35 secs
lola: 11543900 markings, 48422317 edges, 249806 markings/sec, 40 secs
lola: 12834731 markings, 53237352 edges, 258166 markings/sec, 45 secs
lola: 14121883 markings, 58032189 edges, 257430 markings/sec, 50 secs
lola: 15373660 markings, 62953545 edges, 250355 markings/sec, 55 secs
lola: 16626302 markings, 67706854 edges, 250528 markings/sec, 60 secs
lola: 17883053 markings, 72351069 edges, 251350 markings/sec, 65 secs
lola: 19103834 markings, 77185281 edges, 244156 markings/sec, 70 secs
lola: 20387527 markings, 81751603 edges, 256739 markings/sec, 75 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: 21582323 markings, 86502043 edges
lola: ========================================
lola: subprocess 2 will run for 346 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X ((1 <= p0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X ((1 <= p0)))
lola: processed formula length: 17
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: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 9 markings, 11 edges
lola: ========================================
lola: subprocess 3 will run for 384 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((p48 + 1 <= p0) U (G ((p0 <= p48)) AND (X ((1 <= p23)) OR G ((1 <= p23))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((p48 + 1 <= p0) U (G ((p0 <= p48)) AND (X ((1 <= p23)) OR G ((1 <= p23))))))
lola: processed formula length: 80
lola: 40 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 19 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: 179 markings, 179 edges
lola: ========================================
lola: subprocess 4 will run for 432 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (G ((2 <= p47))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (G ((2 <= p47))))
lola: processed formula length: 22
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: 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: 179 markings, 179 edges
lola: ========================================
lola: subprocess 5 will run for 494 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X (F ((G ((p0 <= p24)) OR (1 <= p66 + p67)))) OR (p0 <= p24)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X (F ((G ((p0 <= p24)) OR (1 <= p66 + p67)))) OR (p0 <= p24)))
lola: processed formula length: 66
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: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 81634 markings, 546361 edges
lola: subprocess 6 will run for 576 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (X (F ((1 <= p49)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (X (F ((1 <= p49)))))
lola: processed formula length: 26
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: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: ========================================
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 18 markings, 26 edges
lola: ========================================
lola: subprocess 7 will run for 692 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((p23 + 1 <= p22)))
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 ((p23 + 1 <= p22)))
lola: processed formula length: 24
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: 697575 markings, 2353712 edges, 139515 markings/sec, 0 secs
lola: 1375944 markings, 4762604 edges, 135674 markings/sec, 5 secs
lola: 2047671 markings, 7243644 edges, 134345 markings/sec, 10 secs
lola: 2724772 markings, 9715250 edges, 135420 markings/sec, 15 secs
lola: 3349908 markings, 12484432 edges, 125027 markings/sec, 20 secs
lola: 3867242 markings, 15131979 edges, 103467 markings/sec, 25 secs
lola: 4396960 markings, 17919314 edges, 105944 markings/sec, 30 secs
lola: 4913405 markings, 20910989 edges, 103289 markings/sec, 35 secs
lola: 5447195 markings, 23702491 edges, 106758 markings/sec, 40 secs
lola: 5973818 markings, 26809873 edges, 105325 markings/sec, 45 secs
lola: 6491107 markings, 29809195 edges, 103458 markings/sec, 50 secs
lola: 7004080 markings, 32724494 edges, 102595 markings/sec, 55 secs
lola: 7509626 markings, 35545464 edges, 101109 markings/sec, 60 secs
lola: 8022990 markings, 38402546 edges, 102673 markings/sec, 65 secs
lola: 8513600 markings, 41471995 edges, 98122 markings/sec, 70 secs
lola: 9038921 markings, 44684510 edges, 105064 markings/sec, 75 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: 9342326 markings, 46029349 edges
lola: ========================================
lola: subprocess 8 will run for 844 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((p66 + p67 <= p48)))
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 ((p66 + p67 <= p48)))
lola: processed formula length: 26
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: 906614 markings, 3589821 edges, 181323 markings/sec, 0 secs
lola: 1820478 markings, 7350557 edges, 182773 markings/sec, 5 secs
lola: 2734074 markings, 11183793 edges, 182719 markings/sec, 10 secs
lola: 3619704 markings, 14912108 edges, 177126 markings/sec, 15 secs
lola: 4515111 markings, 18694905 edges, 179081 markings/sec, 20 secs
lola: 5439571 markings, 22640899 edges, 184892 markings/sec, 25 secs
lola: 6334951 markings, 26447105 edges, 179076 markings/sec, 30 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: 6580205 markings, 27464957 edges
lola: ========================================
lola: subprocess 9 will run for 1113 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((p66 + p67 <= p49)))
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 ((p66 + p67 <= p49)))
lola: processed formula length: 26
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: 869031 markings, 3471668 edges, 173806 markings/sec, 0 secs
lola: 1777342 markings, 7203098 edges, 181662 markings/sec, 5 secs
lola: 2699432 markings, 11099032 edges, 184418 markings/sec, 10 secs
lola: 3583532 markings, 14821345 edges, 176820 markings/sec, 15 secs
lola: 4466213 markings, 18574018 edges, 176536 markings/sec, 20 secs
lola: 5342736 markings, 22298033 edges, 175305 markings/sec, 25 secs
lola: 6234027 markings, 26117959 edges, 178258 markings/sec, 30 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: 6561768 markings, 27484856 edges
lola: ========================================
lola: subprocess 10 will run for 1652 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((p22 + 1 <= p0) AND (p66 + p67 + 1 <= p53 + p54))))
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 + 1 <= p0) AND (p66 + p67 + 1 <= p53 + p54))))
lola: processed formula length: 58
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: 180 markings, 181 edges
lola: ========================================
lola: subprocess 11 will run for 3304 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((p47 <= p53 + p54))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((p47 <= p53 + p54))
lola: processed formula length: 22
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: 179 markings, 179 edges
lola: RESULT
lola:
SUMMARY: yes yes yes yes yes no no no yes no yes yes
lola:
preliminary result: yes yes yes yes yes no no no yes no yes yes
lola: ========================================
lola: memory consumption: 28504 KB
lola: time consumption: 266 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-COL-V20P20N10"
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-COL-V20P20N10, 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-158987913500169"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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