About the Execution of 2020-gold for BridgeAndVehicles-COL-V20P20N20
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
4299.432 | 3600000.00 | 401693.00 | 138.40 | FFTFFFFTTTFFFFTF | 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-162038176700025.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-COL-V20P20N20, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r037-tajo-162038176700025
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 428K
-rw-r--r-- 1 mcc users 19K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 138K May 10 09:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 14K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 84K 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 3.9K Mar 28 15:46 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 28 15:46 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 28 15:46 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 15:46 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Mar 23 02:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 23 02:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.4K Mar 22 11:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 22 11:08 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Mar 22 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_pt
-rw-r--r-- 1 mcc users 10 May 5 16:51 instance
-rw-r--r-- 1 mcc users 5 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 40K 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-COL-V20P20N20-00
FORMULA_NAME BridgeAndVehicles-COL-V20P20N20-01
FORMULA_NAME BridgeAndVehicles-COL-V20P20N20-02
FORMULA_NAME BridgeAndVehicles-COL-V20P20N20-03
FORMULA_NAME BridgeAndVehicles-COL-V20P20N20-04
FORMULA_NAME BridgeAndVehicles-COL-V20P20N20-05
FORMULA_NAME BridgeAndVehicles-COL-V20P20N20-06
FORMULA_NAME BridgeAndVehicles-COL-V20P20N20-07
FORMULA_NAME BridgeAndVehicles-COL-V20P20N20-08
FORMULA_NAME BridgeAndVehicles-COL-V20P20N20-09
FORMULA_NAME BridgeAndVehicles-COL-V20P20N20-10
FORMULA_NAME BridgeAndVehicles-COL-V20P20N20-11
FORMULA_NAME BridgeAndVehicles-COL-V20P20N20-12
FORMULA_NAME BridgeAndVehicles-COL-V20P20N20-13
FORMULA_NAME BridgeAndVehicles-COL-V20P20N20-14
FORMULA_NAME BridgeAndVehicles-COL-V20P20N20-15
=== Now, execution of the tool begins
BK_START 1620925086137
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-13 16:58:07] [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 16:58:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 16:58:07] [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.
[2021-05-13 16:58:08] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 632 ms
[2021-05-13 16:58:08] [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,
[2021-05-13 16:58:08] [INFO ] Imported 15 HL places and 11 HL transitions for a total of 78 PT places and 37258.0 transition bindings in 21 ms.
[2021-05-13 16:58:08] [INFO ] Computed order based on color domains.
[2021-05-13 16:58:08] [INFO ] Unfolded HLPN to a Petri net with 78 places and 968 transitions in 20 ms.
[2021-05-13 16:58:08] [INFO ] Unfolded HLPN properties in 1 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 57 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 575 resets, run finished after 459 ms. (steps per millisecond=217 ) properties seen :[0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 0, 1]
[2021-05-13 16:58:09] [INFO ] Flow matrix only has 170 transitions (discarded 798 similar events)
// Phase 1: matrix 170 rows 78 cols
[2021-05-13 16:58:09] [INFO ] Computed 7 place invariants in 10 ms
[2021-05-13 16:58:09] [INFO ] [Real]Absence check using 7 positive place invariants in 18 ms returned sat
[2021-05-13 16:58:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 16:58:09] [INFO ] [Real]Absence check using state equation in 75 ms returned sat
[2021-05-13 16:58:09] [INFO ] State equation strengthened by 42 read => feed constraints.
[2021-05-13 16:58:09] [INFO ] [Real]Added 42 Read/Feed constraints in 12 ms returned sat
[2021-05-13 16:58:09] [INFO ] Deduced a trap composed of 6 places in 225 ms
[2021-05-13 16:58:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 268 ms
[2021-05-13 16:58:09] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 16:58:09] [INFO ] [Nat]Absence check using 7 positive place invariants in 10 ms returned sat
[2021-05-13 16:58:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 16:58:09] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2021-05-13 16:58:09] [INFO ] [Nat]Added 42 Read/Feed constraints in 12 ms returned sat
[2021-05-13 16:58:09] [INFO ] Deduced a trap composed of 24 places in 94 ms
[2021-05-13 16:58:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 113 ms
[2021-05-13 16:58:09] [INFO ] Computed and/alt/rep : 965/22439/167 causal constraints in 61 ms.
[2021-05-13 16:58:13] [INFO ] Added : 164 causal constraints over 35 iterations in 3319 ms. Result :sat
[2021-05-13 16:58:13] [INFO ] [Real]Absence check using 7 positive place invariants in 6 ms returned unsat
[2021-05-13 16:58:13] [INFO ] [Real]Absence check using 7 positive place invariants in 6 ms returned unsat
[2021-05-13 16:58:13] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2021-05-13 16:58:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 16:58:13] [INFO ] [Real]Absence check using state equation in 70 ms returned sat
[2021-05-13 16:58:13] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 16:58:13] [INFO ] [Nat]Absence check using 7 positive place invariants in 6 ms returned sat
[2021-05-13 16:58:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 16:58:13] [INFO ] [Nat]Absence check using state equation in 62 ms returned sat
[2021-05-13 16:58:13] [INFO ] [Nat]Added 42 Read/Feed constraints in 15 ms returned sat
[2021-05-13 16:58:13] [INFO ] Deduced a trap composed of 24 places in 123 ms
[2021-05-13 16:58:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 137 ms
[2021-05-13 16:58:13] [INFO ] Computed and/alt/rep : 965/22439/167 causal constraints in 42 ms.
[2021-05-13 16:58:16] [INFO ] Added : 150 causal constraints over 31 iterations in 2836 ms. Result :sat
[2021-05-13 16:58:16] [INFO ] [Real]Absence check using 7 positive place invariants in 8 ms returned unsat
[2021-05-13 16:58:16] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned unsat
Successfully simplified 4 atomic propositions for a total of 5 simplifications.
[2021-05-13 16:58:16] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2021-05-13 16:58:16] [INFO ] Flatten gal took : 133 ms
FORMULA BridgeAndVehicles-COL-V20P20N20-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V20P20N20-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V20P20N20-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V20P20N20-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-13 16:58:16] [INFO ] Applying decomposition
[2021-05-13 16:58:16] [INFO ] Flatten gal took : 102 ms
[2021-05-13 16:58:16] [INFO ] Decomposing Gal with order
[2021-05-13 16:58:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-13 16:58:17] [INFO ] Removed a total of 5350 redundant transitions.
[2021-05-13 16:58:17] [INFO ] Flatten gal took : 262 ms
[2021-05-13 16:58:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 25 ms.
[2021-05-13 16:58:17] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2021-05-13 16:58:17] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 13 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ BridgeAndVehicles-COL-V20P20N20 @ 3570 seconds
FORMULA BridgeAndVehicles-COL-V20P20N20-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA BridgeAndVehicles-COL-V20P20N20-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA BridgeAndVehicles-COL-V20P20N20-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA BridgeAndVehicles-COL-V20P20N20-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA BridgeAndVehicles-COL-V20P20N20-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA BridgeAndVehicles-COL-V20P20N20-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA BridgeAndVehicles-COL-V20P20N20-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA BridgeAndVehicles-COL-V20P20N20-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA BridgeAndVehicles-COL-V20P20N20-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA BridgeAndVehicles-COL-V20P20N20-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA BridgeAndVehicles-COL-V20P20N20-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA BridgeAndVehicles-COL-V20P20N20-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3193
rslt: Output for LTLCardinality @ BridgeAndVehicles-COL-V20P20N20
{
"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 16:58:17 2021
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 293
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 293
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(p0 <= p25)",
"processed_size": 11,
"rewrites": 67
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 0,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 319
},
"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": 4,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "G (((X (F ((p0 <= p25))) OR (1 <= p48)) AND X ((1 <= p48))))",
"processed_size": 60,
"rewrites": 67
},
"result":
{
"edges": 169,
"markings": 169,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"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": 319
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 319
},
"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": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G ((1 <= p51 + p52))",
"processed_size": 20,
"rewrites": 67
},
"result":
{
"edges": 169,
"markings": 169,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 351
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X ((F ((1 <= p51 + p52)) AND (3 <= p22)))",
"processed_size": 41,
"rewrites": 67
},
"result":
{
"edges": 169,
"markings": 169,
"produced_by": "LTL model checker",
"value": false
},
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 1,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 351
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 351
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "G (F (((3 <= p22) AND (p25 <= p48))))",
"processed_size": 37,
"rewrites": 67
},
"result":
{
"edges": 59100491,
"markings": 12789883,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "fairness",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 377
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"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 (F ((1 <= p47)))",
"processed_size": 18,
"rewrites": 67
},
"result":
{
"edges": 399423,
"markings": 123244,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 2,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 377
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 3,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 2,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "F ((X (G ((p25 + 1 <= p23))) AND G (((F ((p76 + p77 + 1 <= p24)) AND (p23 <= p25)) OR (p76 + p77 + 1 <= p24)))))",
"processed_size": 112,
"rewrites": 67
},
"result":
{
"edges": 169,
"markings": 169,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 14
},
"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": 425
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 1,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "X ((X ((p25 <= 0)) U G ((1 <= p25))))",
"processed_size": 37,
"rewrites": 67
},
"result":
{
"edges": 255,
"markings": 255,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"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": 485
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"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 (F ((p48 <= 2))))",
"processed_size": 22,
"rewrites": 67
},
"result":
{
"edges": 11,
"markings": 9,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 566
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 566
},
"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 ((p24 <= 1)))",
"processed_size": 18,
"rewrites": 67
},
"result":
{
"edges": 99161677,
"markings": 16215659,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 6,
"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": 641
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"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 (G ((p0 <= 1)))",
"processed_size": 17,
"rewrites": 67
},
"result":
{
"edges": 169,
"markings": 169,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 6,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 641
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 1,
"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 (G (((p50 + 1 <= p47))))",
"processed_size": 26,
"rewrites": 67
},
"result":
{
"edges": 169,
"markings": 169,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 801
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(3 <= p49)",
"processed_size": 10,
"rewrites": 69
},
"result":
{
"edges": 3121737,
"markings": 1448647,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 21
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1064
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(2 <= p0)",
"processed_size": 9,
"rewrites": 69
},
"result":
{
"edges": 168,
"markings": 169,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 44
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1596
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G (F ((G ((p48 + 1 <= p25)) AND (p25 <= 0))))",
"processed_size": 45,
"rewrites": 67
},
"result":
{
"edges": 170,
"markings": 170,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 10,
"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": 3193
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 2,
"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": "F (G ((F ((p49 + 1 <= p23)) OR (p47 + 1 <= p53 + p54))))",
"processed_size": 56,
"rewrites": 67
},
"result":
{
"edges": 173,
"markings": 171,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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": 40208,
"runtime": 377.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(G(((X(F(**)) OR **) AND X(**))) OR **) : (X((F(**) AND **)) OR (G(**) AND X(F((F(**) AND **))))) : (G(F(**)) AND X(F(**))) : F(G((F(*) OR *))) : F((X(G(*)) AND G(((F(**) AND *) OR *)))) : X((X(*) U G(**))) : F(*) : X(X(F(*))) : F(**) : (G(F(*)) AND ((X(**) U **) AND X(G(**)))) : X(G(**)) : G(F((G(*) AND *)))"
},
"net":
{
"arcs": 7350,
"conflict_clusters": 5,
"places": 78,
"places_significant": 71,
"singleton_clusters": 0,
"transitions": 968
},
"result":
{
"preliminary_value": "no no yes no no no yes yes no no no no ",
"value": "no no yes no no no yes yes no no no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 1046/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 2496
lola: finding significant places
lola: 78 places, 968 transitions, 71 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 (((F (X ((p0 <= p25))) OR (1 <= p48)) AND X ((1 <= p48)))) OR (p0 <= p25)) : (G ((1 <= p51 + p52)) U X ((F ((1 <= p51 + p52)) AND (3 <= p22)))) : (G (F (X (X (((3 <= p22) AND (p25 <= p48)))))) AND NOT(G (NOT(X ((1 <= p47)))))) : F (NOT(F ((G ((p23 <= p49)) AND (p53 + p54 <= p47))))) : F ((NOT(X (F ((p23 <= p25)))) AND NOT(F (((NOT(F ((p76 + p77 + 1 <= p24))) OR (p25 + 1 <= p23)) AND (p24 <= p76 + p77)))))) : (NOT(X (X ((1 <= p25)))) U X (G ((1 <= p25)))) : NOT(G ((3 <= p49))) : F (X (NOT(G (X (G ((3 <= p48))))))) : F (F (((p50 <= p47) U (p0 <= 1)))) : ((G (NOT(G ((2 <= p24)))) AND (X (((p0 <= 1) OR (p23 <= p48))) U (1 <= p24))) AND X (G ((p0 <= 1)))) : G (X (((p50 + 1 <= p47)))) : G (X (F (X (NOT(G ((F (((0 <= 0) U F ((p25 <= p48)))) OR (1 <= p25))))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:431
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: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:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:315
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:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:410
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:350
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k: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: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 293 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G (((X (F ((p0 <= p25))) OR (1 <= p48)) AND X ((1 <= p48)))) OR (p0 <= p25))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 293 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p0 <= p25)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p0 <= p25)
lola: processed formula length: 11
lola: 67 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 319 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((X (F ((p0 <= p25))) OR (1 <= p48)) AND X ((1 <= p48))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((X (F ((p0 <= p25))) OR (1 <= p48)) AND X ((1 <= p48))))
lola: processed formula length: 60
lola: 67 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: 169 markings, 169 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 319 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X ((F ((1 <= p51 + p52)) AND (3 <= p22))) OR (G ((1 <= p51 + p52)) AND X (F ((F ((1 <= p51 + p52)) AND (3 <= p22))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 319 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((1 <= p51 + p52))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((1 <= p51 + p52))
lola: processed formula length: 20
lola: 67 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, 169 edges
lola: ========================================
lola: subprocess 2 will run for 351 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((F ((1 <= p51 + p52)) AND (3 <= p22)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((F ((1 <= p51 + p52)) AND (3 <= p22)))
lola: processed formula length: 41
lola: 67 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: 169 markings, 169 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 351 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G (F (((3 <= p22) AND (p25 <= p48)))) AND X (F ((1 <= p47))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 351 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F (((3 <= p22) AND (p25 <= 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 (((3 <= p22) AND (p25 <= p48))))
lola: processed formula length: 37
lola: 67 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: 566227 markings, 1872578 edges, 113245 markings/sec, 0 secs
lola: 1170805 markings, 3928643 edges, 120916 markings/sec, 5 secs
lola: 1794993 markings, 6191580 edges, 124838 markings/sec, 10 secs
lola: 2438232 markings, 8551732 edges, 128648 markings/sec, 15 secs
lola: 2878973 markings, 10792528 edges, 88148 markings/sec, 20 secs
lola: 3368552 markings, 13230050 edges, 97916 markings/sec, 25 secs
lola: 3836461 markings, 15497665 edges, 93582 markings/sec, 30 secs
lola: 4365268 markings, 18084637 edges, 105761 markings/sec, 35 secs
lola: 4899625 markings, 20709895 edges, 106871 markings/sec, 40 secs
lola: 5446507 markings, 23359653 edges, 109376 markings/sec, 45 secs
lola: 5971012 markings, 25886523 edges, 104901 markings/sec, 50 secs
lola: 6454642 markings, 28189685 edges, 96726 markings/sec, 55 secs
lola: 6926837 markings, 30413721 edges, 94439 markings/sec, 60 secs
lola: 7488523 markings, 33225330 edges, 112337 markings/sec, 65 secs
lola: 8080937 markings, 36124618 edges, 118483 markings/sec, 70 secs
lola: 8619546 markings, 38630634 edges, 107722 markings/sec, 75 secs
lola: 9198763 markings, 41580264 edges, 115843 markings/sec, 80 secs
lola: 9785509 markings, 44446585 edges, 117349 markings/sec, 85 secs
lola: 10346144 markings, 47104162 edges, 112127 markings/sec, 90 secs
lola: 10961411 markings, 50252773 edges, 123053 markings/sec, 95 secs
lola: 11505394 markings, 52778278 edges, 108797 markings/sec, 100 secs
lola: 12124485 markings, 56021541 edges, 123818 markings/sec, 105 secs
lola: 12686795 markings, 58684353 edges, 112462 markings/sec, 110 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: 12789883 markings, 59100491 edges
lola: ========================================
lola: subprocess 3 will run for 377 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((1 <= p47)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((1 <= p47)))
lola: processed formula length: 18
lola: 67 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 123244 markings, 399423 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 3 will run for 377 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((X (G ((p25 + 1 <= p23))) AND G (((F ((p76 + p77 + 1 <= p24)) AND (p23 <= p25)) OR (p76 + p77 + 1 <= p24)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((X (G ((p25 + 1 <= p23))) AND G (((F ((p76 + p77 + 1 <= p24)) AND (p23 <= p25)) OR (p76 + p77 + 1 <= p24)))))
lola: processed formula length: 112
lola: 67 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 14 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 169 markings, 169 edges
lola: ========================================
lola: subprocess 4 will run for 425 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X ((p25 <= 0)) U G ((1 <= p25))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X ((p25 <= 0)) U G ((1 <= p25))))
lola: processed formula length: 37
lola: 67 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 7 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 255 markings, 255 edges
lola: ========================================
lola: subprocess 5 will run for 485 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (F ((p48 <= 2))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (F ((p48 <= 2))))
lola: processed formula length: 22
lola: 67 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: 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 6 will run for 566 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G (F ((p24 <= 1))) AND ((X (((p0 <= 1) OR (p23 <= p48))) U (1 <= p24)) AND X (G ((p0 <= 1)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 566 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((p24 <= 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 ((p24 <= 1)))
lola: processed formula length: 18
lola: 67 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: 495581 markings, 2637523 edges, 99116 markings/sec, 0 secs
lola: 962182 markings, 5312192 edges, 93320 markings/sec, 5 secs
lola: 1409987 markings, 7832969 edges, 89561 markings/sec, 10 secs
lola: 1824824 markings, 10256910 edges, 82967 markings/sec, 15 secs
lola: 2239560 markings, 12733787 edges, 82947 markings/sec, 20 secs
lola: 2628357 markings, 15010877 edges, 77759 markings/sec, 25 secs
lola: 3058264 markings, 17490512 edges, 85981 markings/sec, 30 secs
lola: 3433119 markings, 19824089 edges, 74971 markings/sec, 35 secs
lola: 3832385 markings, 22124369 edges, 79853 markings/sec, 40 secs
lola: 4244586 markings, 24697047 edges, 82440 markings/sec, 45 secs
lola: 4666860 markings, 27143294 edges, 84455 markings/sec, 50 secs
lola: 5085496 markings, 29789408 edges, 83727 markings/sec, 55 secs
lola: 5536537 markings, 32383511 edges, 90208 markings/sec, 60 secs
lola: 5932814 markings, 34939495 edges, 79255 markings/sec, 65 secs
lola: 6405834 markings, 37790891 edges, 94604 markings/sec, 70 secs
lola: 6819596 markings, 40308618 edges, 82752 markings/sec, 75 secs
lola: 7235175 markings, 42966298 edges, 83116 markings/sec, 80 secs
lola: 7643175 markings, 45356147 edges, 81600 markings/sec, 85 secs
lola: 8002345 markings, 47576783 edges, 71834 markings/sec, 90 secs
lola: 8347128 markings, 49822254 edges, 68957 markings/sec, 95 secs
lola: 8783653 markings, 52538711 edges, 87305 markings/sec, 100 secs
lola: 9219019 markings, 55038863 edges, 87073 markings/sec, 105 secs
lola: 9620541 markings, 57709058 edges, 80304 markings/sec, 110 secs
lola: 10049159 markings, 60464582 edges, 85724 markings/sec, 115 secs
lola: 10475191 markings, 62977871 edges, 85206 markings/sec, 120 secs
lola: 10861963 markings, 65324686 edges, 77354 markings/sec, 125 secs
lola: 11202412 markings, 67601972 edges, 68090 markings/sec, 130 secs
lola: 11600868 markings, 70216420 edges, 79691 markings/sec, 135 secs
lola: 12054645 markings, 72967788 edges, 90755 markings/sec, 140 secs
lola: 12477487 markings, 75417311 edges, 84568 markings/sec, 145 secs
lola: 12885781 markings, 78180219 edges, 81659 markings/sec, 150 secs
lola: 13290478 markings, 80841082 edges, 80939 markings/sec, 155 secs
lola: 13753780 markings, 83770986 edges, 92660 markings/sec, 160 secs
lola: 14186911 markings, 86211385 edges, 86626 markings/sec, 165 secs
lola: 14633306 markings, 89153388 edges, 89279 markings/sec, 170 secs
lola: 15040993 markings, 91895192 edges, 81537 markings/sec, 175 secs
lola: 15466032 markings, 94704728 edges, 85008 markings/sec, 180 secs
lola: 15947175 markings, 97671010 edges, 96229 markings/sec, 185 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: 16215659 markings, 99161677 edges
lola: ========================================
lola: subprocess 7 will run for 641 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((p0 <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((p0 <= 1)))
lola: processed formula length: 17
lola: 67 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: 169 markings, 169 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 7 will run for 641 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G (((p50 + 1 <= p47))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G (((p50 + 1 <= p47))))
lola: processed formula length: 26
lola: 67 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: 169 markings, 169 edges
lola: ========================================
lola: subprocess 8 will run for 801 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((p49 <= 2))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: (3 <= p49)
lola: processed formula length: 10
lola: 69 rewrites
lola: closed formula file LTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: 496836 markings, 1041174 edges, 99367 markings/sec, 0 secs
lola: 1089073 markings, 2332140 edges, 118447 markings/sec, 5 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1448647 markings, 3121737 edges
lola: ========================================
lola: subprocess 9 will run for 1064 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((p0 <= 1))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (2 <= p0)
lola: processed formula length: 9
lola: 69 rewrites
lola: closed formula file LTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 169 markings, 168 edges
lola: ========================================
lola: subprocess 10 will run for 1596 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((G ((p48 + 1 <= p25)) AND (p25 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((G ((p48 + 1 <= p25)) AND (p25 <= 0))))
lola: processed formula length: 45
lola: 67 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: 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: 170 markings, 170 edges
lola: ========================================
lola: subprocess 11 will run for 3193 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((F ((p49 + 1 <= p23)) OR (p47 + 1 <= p53 + p54))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((F ((p49 + 1 <= p23)) OR (p47 + 1 <= p53 + p54))))
lola: processed formula length: 56
lola: 67 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: 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: 171 markings, 173 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no yes no no no yes yes no no no no
lola:
preliminary result: no no yes no no no yes yes no no no no
lola: memory consumption: 40208 KB
lola: time consumption: 377 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-V20P20N20"
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-COL-V20P20N20, 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-162038176700025"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BridgeAndVehicles-COL-V20P20N20.tgz
mv BridgeAndVehicles-COL-V20P20N20 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 '
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 ;