About the Execution of ITS-LoLa for GPPP-PT-C0100N0000100000
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
15790.640 | 3600000.00 | 1551469.00 | 17111.10 | FFFFT?FFFFFFFFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2020-input.r170-smll-158987816000522.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is GPPP-PT-C0100N0000100000, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r170-smll-158987816000522
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 200K
-rw-r--r-- 1 mcc users 3.4K Apr 4 20:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Apr 4 20:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Apr 4 09:15 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 4 09:15 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.7K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 8 14:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 8 14:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Apr 3 21:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Apr 3 21:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.9K Apr 3 13:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 3 13:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 4 01:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 4 01:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 17 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 1 Mar 24 05:37 large_marking
-rw-r--r-- 1 mcc users 21K 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 GPPP-PT-C0100N0000100000-00
FORMULA_NAME GPPP-PT-C0100N0000100000-01
FORMULA_NAME GPPP-PT-C0100N0000100000-02
FORMULA_NAME GPPP-PT-C0100N0000100000-03
FORMULA_NAME GPPP-PT-C0100N0000100000-04
FORMULA_NAME GPPP-PT-C0100N0000100000-05
FORMULA_NAME GPPP-PT-C0100N0000100000-06
FORMULA_NAME GPPP-PT-C0100N0000100000-07
FORMULA_NAME GPPP-PT-C0100N0000100000-08
FORMULA_NAME GPPP-PT-C0100N0000100000-09
FORMULA_NAME GPPP-PT-C0100N0000100000-10
FORMULA_NAME GPPP-PT-C0100N0000100000-11
FORMULA_NAME GPPP-PT-C0100N0000100000-12
FORMULA_NAME GPPP-PT-C0100N0000100000-13
FORMULA_NAME GPPP-PT-C0100N0000100000-14
FORMULA_NAME GPPP-PT-C0100N0000100000-15
=== Now, execution of the tool begins
BK_START 1591482804101
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-06 22:33:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-06 22:33:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-06 22:33:27] [INFO ] Load time of PNML (sax parser for PT used): 65 ms
[2020-06-06 22:33:27] [INFO ] Transformed 33 places.
[2020-06-06 22:33:27] [INFO ] Transformed 22 transitions.
[2020-06-06 22:33:27] [INFO ] Parsed PT model containing 33 places and 22 transitions in 138 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 29 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100131 steps, including 34 resets, run finished after 118 ms. (steps per millisecond=848 ) properties seen :[1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 22 rows 33 cols
[2020-06-06 22:33:27] [INFO ] Computed 12 place invariants in 9 ms
[2020-06-06 22:33:27] [INFO ] [Real]Absence check using 6 positive place invariants in 19 ms returned sat
[2020-06-06 22:33:27] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 6 ms returned sat
[2020-06-06 22:33:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-06 22:33:27] [INFO ] [Real]Absence check using state equation in 39 ms returned unsat
[2020-06-06 22:33:27] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2020-06-06 22:33:27] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 5 ms returned sat
[2020-06-06 22:33:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-06 22:33:27] [INFO ] [Real]Absence check using state equation in 32 ms returned unsat
[2020-06-06 22:33:27] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2020-06-06 22:33:27] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 5 ms returned unsat
[2020-06-06 22:33:27] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2020-06-06 22:33:27] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 5 ms returned sat
[2020-06-06 22:33:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-06 22:33:27] [INFO ] [Real]Absence check using state equation in 25 ms returned unsat
[2020-06-06 22:33:27] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2020-06-06 22:33:27] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 4 ms returned sat
[2020-06-06 22:33:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-06 22:33:27] [INFO ] [Real]Absence check using state equation in 21 ms returned unsat
Successfully simplified 5 atomic propositions for a total of 5 simplifications.
[2020-06-06 22:33:28] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2020-06-06 22:33:28] [INFO ] Flatten gal took : 53 ms
FORMULA GPPP-PT-C0100N0000100000-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0100N0000100000-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0100N0000100000-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0100N0000100000-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0100N0000100000-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-06 22:33:28] [INFO ] Flatten gal took : 15 ms
[2020-06-06 22:33:28] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 5 ms.
[2020-06-06 22:33:28] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 2 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ GPPP-PT-C0100N0000100000 @ 3570 seconds
check_solution: Constraint R2 = 0 is above its equality of -400000
check_solution: Constraint R3 = 0 is above its equality of -200000
check_solution: Constraint R4 = 0 is above its equality of -300
check_solution: Constraint R5 = 0 is above its equality of -200000
check_solution: Constraint R7 = 0 is above its equality of -100000
check_solution: Constraint R25 = 0 is above its equality of -1
check_solution: Constraint R30 = 0 is above its equality of -200
check_solution: Constraint R32 = -1 is above its equality of -700
Seriously low accuracy found ||*|| = 400000 (rel. error 1)
check_solution: Constraint R2 = 0 is above its equality of -400000
check_solution: Constraint R3 = 0 is above its equality of -200000
check_solution: Constraint R4 = 0 is above its equality of -300
check_solution: Constraint R5 = 0 is above its equality of -200000
check_solution: Constraint R7 = 0 is above its equality of -100000
check_solution: Constraint R25 = 0 is above its equality of -1
check_solution: Constraint R30 = 0 is above its equality of -200
check_solution: Constraint R32 = -1 is above its equality of -700
Seriously low accuracy found ||*|| = 400000 (rel. error 1)
FORMULA GPPP-PT-C0100N0000100000-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA GPPP-PT-C0100N0000100000-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA GPPP-PT-C0100N0000100000-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA GPPP-PT-C0100N0000100000-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA GPPP-PT-C0100N0000100000-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA GPPP-PT-C0100N0000100000-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA GPPP-PT-C0100N0000100000-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA GPPP-PT-C0100N0000100000-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA GPPP-PT-C0100N0000100000-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA GPPP-PT-C0100N0000100000-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA GPPP-PT-C0100N0000100000-05 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2042
rslt: Output for LTLFireability @ GPPP-PT-C0100N0000100000
{
"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=LTLFireability.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Sat Jun 6 22:33:29 2020
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 311
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 1,
"X": 1,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 4,
"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 (G ((((p7 <= 1) U (2 <= p7)) AND ((p9 <= 0) OR (p10 <= 0)))))",
"processed_size": 64,
"rewrites": 68
},
"result":
{
"edges": 1234,
"markings": 1234,
"produced_by": "LTL model checker",
"value": false
},
"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": 342
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 4,
"aconj": 2,
"adisj": 0,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X (X ((X (X (((1 <= p21) U ((1 <= p9) AND (1 <= p10))))) OR ((1 <= p9) AND (1 <= p10)))))",
"processed_size": 89,
"rewrites": 68
},
"result":
{
"edges": 2810,
"markings": 2810,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"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": 385
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X (G (((1 <= p11) AND (1 <= p12) AND (700 <= p31))))",
"processed_size": 52,
"rewrites": 68
},
"result":
{
"edges": 2810,
"markings": 2810,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 440
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 440
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"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": 2,
"visible_transitions": 0
},
"processed": "((p9 <= 0) OR (p13 <= 0))",
"processed_size": 26,
"rewrites": 68
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 4,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 513
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"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": 2,
"visible_transitions": 0
},
"processed": "((p9 <= 0) OR (p10 <= 0))",
"processed_size": 26,
"rewrites": 70
},
"result":
{
"edges": 2401,
"markings": 2401,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 4
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 616
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"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 (G ((p7 <= 1)))",
"processed_size": 17,
"rewrites": 68
},
"result":
{
"edges": 2810,
"markings": 2810,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 4,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 513
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "G ((F (G ((2 <= p7))) AND X ((2 <= p7))))",
"processed_size": 41,
"rewrites": 68
},
"result":
{
"edges": 2810,
"markings": 2810,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"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": 616
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 616
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"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": "((1 <= p14))",
"processed_size": 12,
"rewrites": 68
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 6,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 770
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 3,
"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 (((p4 <= 1) OR (p15 <= 0) OR (p28 <= 0)))",
"processed_size": 45,
"rewrites": 68
},
"result":
{
"edges": 2208,
"markings": 2208,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1026
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 2,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 2,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X ((X (((1 <= p15) AND (300 <= p27))) AND ((1 <= p15) AND (300 <= p27))))",
"processed_size": 73,
"rewrites": 68
},
"result":
{
"edges": 2810,
"markings": 2810,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 6,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 770
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"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": 2,
"visible_transitions": 0
},
"processed": "F (G (((p5 <= 0) OR (p6 <= 0))))",
"processed_size": 33,
"rewrites": 68
},
"result":
{
"edges": 414,
"markings": 413,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1026
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "F (G (((p3 <= 0) OR (p23 <= 0) OR (p20 <= 0))))",
"processed_size": 49,
"rewrites": 68
},
"result":
{
"edges": 3025,
"markings": 2930,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1540
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 0,
"aneg": 3,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "G (F ((((p21 <= 0) OR (p19 <= 0) OR (p22 <= 0)) AND (F ((p16 <= 0)) OR G (((p21 <= 0) OR (p19 <= 0) OR (p22 <= 0)))))))",
"processed_size": 123,
"rewrites": 68
},
"result":
{
"edges": 3340,
"markings": 3081,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 9,
"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": 3080
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 1,
"X": 0,
"aconj": 5,
"adisj": 0,
"aneg": 0,
"comp": 15,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 15,
"taut": 0,
"tconj": 4,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "F ((G ((F (((1 <= p9) AND (1 <= p13))) AND (((((1 <= p0) AND (1 <= p2) AND (1 <= p12) AND (1 <= p32)) U G (((1 <= p11) AND (1 <= p12) AND (700 <= p31)))) OR ((1 <= p9) AND (1 <= p13))) AND ((1 <= p9) AND (1 <= p13))))) AND ((1 <= p9) AND (1 <= p13))))",
"processed_size": 251,
"rewrites": 68
},
"result":
{
"edges": 2812,
"markings": 2812,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 14
},
"compoundnumber": 10,
"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": 3424,
"runtime": 1528.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "G(F((* AND (F(*) OR G(*))))) : X(G(((** U **) AND **))) : F((G((F(**) AND (((** U G(**)) OR **) AND **))) AND (** AND **))) : X(X(G((F(G(*)) AND *)))) : X(X((X(X((** U **))) OR **))) : F(G(*)) : X(G(**)) : (X(G(*)) OR (F(*) AND **)) : F(G(*)) : G((F(G(**)) AND X(**))) : (X((X(**) AND (** AND **))) OR ((G(*) AND X(F((X(**) AND (** AND **))))) OR **))"
},
"net":
{
"arcs": 83,
"conflict_clusters": 14,
"places": 33,
"places_significant": 21,
"singleton_clusters": 0,
"transitions": 22
},
"result":
{
"preliminary_value": "no no no unknown no no no no no no no ",
"value": "no no no unknown no no no no no no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 55/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 1056
lola: finding significant places
lola: 33 places, 22 transitions, 21 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 LTLFireability.xml
lola: LP says that atomic proposition is always true: (1 <= p1)
lola: NOT(F (G (F (X (G ((G ((1 <= p16)) U ((1 <= p21) AND (1 <= p19) AND (1 <= p22))))))))) : G (X ((((p7 <= 1) U (2 <= p7)) AND ((p9 <= 0) OR (p10 <= 0))))) : F ((((G (((((1 <= p0) AND (1 <= p2) AND (1 <= p12) AND (1 <= p32)) U G (((1 <= p11) AND (1 <= p12) AND (700 <= p31)))) U ((1 <= p9) AND (1 <= p13)))) AND G (((1 <= p9) AND (1 <= p13)))) AND (1 <= p9)) AND (1 <= p13))) : X (NOT(F (X (((F ((X (((1 <= p18) AND (1 <= p19))) U ((1 <= p18) AND (1 <= p19)))) U G (F (((1 <= p8) AND (200 <= p29))))) OR ((1 <= p8) AND (200 <= p29))))))) : X (X ((X (X (((1 <= p21) U ((1 <= p9) AND (1 <= p10))))) OR ((1 <= p9) AND (1 <= p10))))) : G (X (X (X (NOT(X (G (F (X (X (((1 <= p3) AND (1 <= p23) AND (1 <= p20)))))))))))) : X (G (((1 <= p11) AND (1 <= p12) AND (700 <= p31)))) : (NOT(F (X (F ((2 <= p7))))) OR (NOT(G (((p9 <= 0) OR (p10 <= 0)))) AND ((p9 <= 0) OR (p13 <= 0)))) : F (X (NOT(F (((1 <= p5) AND (1 <= p6)))))) : G ((G (F (G (X (X ((2 <= p7)))))) AND X ((2 <= p7)))) : ((NOT(F (((2 <= p4) AND (1 <= p15) AND (1 <= p28)))) U X (((X (((1 <= p15) AND (300 <= p27))) AND (1 <= p15)) AND (300 <= p27)))) OR ((1 <= p14)))
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
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:353
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:425
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:318
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:297
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: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:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
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:329
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:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 311 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((((p7 <= 1) U (2 <= p7)) AND ((p9 <= 0) OR (p10 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((((p7 <= 1) U (2 <= p7)) AND ((p9 <= 0) OR (p10 <= 0)))))
lola: processed formula length: 64
lola: 68 rewrites
lola: closed formula file LTLFireability.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: 1234 markings, 1234 edges
lola: ========================================
lola: subprocess 1 will run for 342 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (G ((F (G (((p8 <= 0) OR (p29 <= 199)))) AND ((p8 <= 0) OR (p29 <= 199))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (G ((F (G (((p8 <= 0) OR (p29 <= 199)))) AND ((p8 <= 0) OR (p29 <= 199))))))
lola: processed formula length: 83
lola: 68 rewrites
lola: closed formula file LTLFireability.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: 857899 markings, 5413767 edges, 171580 markings/sec, 0 secs
lola: 1589547 markings, 10313195 edges, 146330 markings/sec, 5 secs
lola: 2369946 markings, 15555374 edges, 156080 markings/sec, 10 secs
lola: 3145355 markings, 20764266 edges, 155082 markings/sec, 15 secs
lola: 3899204 markings, 25903052 edges, 150770 markings/sec, 20 secs
lola: 4645641 markings, 30978391 edges, 149287 markings/sec, 25 secs
lola: 5392067 markings, 35990114 edges, 149285 markings/sec, 30 secs
lola: 6116300 markings, 40926676 edges, 144847 markings/sec, 35 secs
lola: 6845189 markings, 45887270 edges, 145778 markings/sec, 40 secs
lola: 7522277 markings, 50497165 edges, 135418 markings/sec, 45 secs
lola: 8264618 markings, 55551853 edges, 148468 markings/sec, 50 secs
lola: 8980112 markings, 60483489 edges, 143099 markings/sec, 55 secs
lola: 9696090 markings, 65374245 edges, 143196 markings/sec, 60 secs
lola: 10364135 markings, 69920527 edges, 133609 markings/sec, 65 secs
lola: 11103714 markings, 74957795 edges, 147916 markings/sec, 70 secs
lola: 11840432 markings, 79973869 edges, 147344 markings/sec, 75 secs
lola: 12555269 markings, 84917279 edges, 142967 markings/sec, 80 secs
lola: 13286709 markings, 89902863 edges, 146288 markings/sec, 85 secs
lola: 14024120 markings, 94923809 edges, 147482 markings/sec, 90 secs
lola: 14746919 markings, 99866720 edges, 144560 markings/sec, 95 secs
lola: 15460338 markings, 104779859 edges, 142684 markings/sec, 100 secs
lola: 16195780 markings, 109787315 edges, 147088 markings/sec, 105 secs
lola: 16903365 markings, 114682784 edges, 141517 markings/sec, 110 secs
lola: 17627675 markings, 119612806 edges, 144862 markings/sec, 115 secs
lola: 18343054 markings, 124486190 edges, 143076 markings/sec, 120 secs
lola: 19029067 markings, 129229338 edges, 137203 markings/sec, 125 secs
lola: 19745352 markings, 134108670 edges, 143257 markings/sec, 130 secs
lola: 20433879 markings, 138868078 edges, 137705 markings/sec, 135 secs
lola: 21144231 markings, 143704701 edges, 142070 markings/sec, 140 secs
lola: 21837146 markings, 148483387 edges, 138583 markings/sec, 145 secs
lola: 22543921 markings, 153309059 edges, 141355 markings/sec, 150 secs
lola: 23252648 markings, 158135030 edges, 141745 markings/sec, 155 secs
lola: 23941563 markings, 162897658 edges, 137783 markings/sec, 160 secs
lola: 24652882 markings, 167741427 edges, 142264 markings/sec, 165 secs
lola: 25337415 markings, 172475367 edges, 136907 markings/sec, 170 secs
lola: 26049400 markings, 177323107 edges, 142397 markings/sec, 175 secs
lola: 26730897 markings, 182042039 edges, 136299 markings/sec, 180 secs
lola: 27434157 markings, 186828724 edges, 140652 markings/sec, 185 secs
lola: 28122879 markings, 191589785 edges, 137744 markings/sec, 190 secs
lola: 28806219 markings, 196313794 edges, 136668 markings/sec, 195 secs
lola: 29517236 markings, 201154962 edges, 142203 markings/sec, 200 secs
lola: 30192690 markings, 205828089 edges, 135091 markings/sec, 205 secs
lola: 30914390 markings, 210740013 edges, 144340 markings/sec, 210 secs
lola: 31595563 markings, 215454194 edges, 136235 markings/sec, 215 secs
lola: 32324592 markings, 220417918 edges, 145806 markings/sec, 220 secs
lola: 33003938 markings, 225121821 edges, 135869 markings/sec, 225 secs
lola: 33732953 markings, 230083313 edges, 145803 markings/sec, 230 secs
lola: 34421524 markings, 234843479 edges, 137714 markings/sec, 235 secs
lola: 35110624 markings, 239615970 edges, 137820 markings/sec, 240 secs
lola: 35839464 markings, 244576545 edges, 145768 markings/sec, 245 secs
lola: 36516986 markings, 249262540 edges, 135504 markings/sec, 250 secs
lola: 37253181 markings, 254280339 edges, 147239 markings/sec, 255 secs
lola: 37934323 markings, 258987774 edges, 136228 markings/sec, 260 secs
lola: 38650638 markings, 263866661 edges, 143263 markings/sec, 265 secs
lola: 39311986 markings, 268440523 edges, 132270 markings/sec, 270 secs
lola: 39995698 markings, 273167709 edges, 136742 markings/sec, 275 secs
lola: 40733137 markings, 278190875 edges, 147488 markings/sec, 280 secs
lola: 41411496 markings, 282885427 edges, 135672 markings/sec, 285 secs
lola: 42062913 markings, 287390179 edges, 130283 markings/sec, 290 secs
lola: 42790075 markings, 292343003 edges, 145432 markings/sec, 295 secs
lola: 43472327 markings, 297061116 edges, 136450 markings/sec, 300 secs
lola: 44210719 markings, 302089782 edges, 147678 markings/sec, 305 secs
lola: 44908931 markings, 306920411 edges, 139642 markings/sec, 310 secs
lola: 45598756 markings, 311692075 edges, 137965 markings/sec, 315 secs
lola: 46338284 markings, 316729743 edges, 147906 markings/sec, 320 secs
lola: 47023238 markings, 321469174 edges, 136991 markings/sec, 325 secs
lola: 47729942 markings, 326325730 edges, 141341 markings/sec, 330 secs
lola: 48451259 markings, 331266325 edges, 144263 markings/sec, 335 secs
lola: local time limit reached - aborting
lola:
preliminary result: unknown no unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola: memory consumption: 6819072 KB
lola: time consumption: 490 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLFireability.json
lola: closed JSON file LTLFireability.json
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 2 will run for 342 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X ((X (X (((1 <= p21) U ((1 <= p9) AND (1 <= p10))))) OR ((1 <= p9) AND (1 <= p10)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X ((X (X (((1 <= p21) U ((1 <= p9) AND (1 <= p10))))) OR ((1 <= p9) AND (1 <= p10)))))
lola: processed formula length: 89
lola: 68 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 2810 markings, 2810 edges
lola: ========================================
lola: subprocess 3 will run for 385 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G (((1 <= p11) AND (1 <= p12) AND (700 <= p31))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G (((1 <= p11) AND (1 <= p12) AND (700 <= p31))))
lola: processed formula length: 52
lola: 68 rewrites
lola: closed formula file LTLFireability.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: 2810 markings, 2810 edges
lola: ========================================
lola: subprocess 4 will run for 440 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (G ((p7 <= 1))) OR (F (((1 <= p9) AND (1 <= p10))) AND ((p9 <= 0) OR (p13 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 440 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p9 <= 0) OR (p13 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p9 <= 0) OR (p13 <= 0))
lola: processed formula length: 26
lola: 68 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 5 will run for 513 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((1 <= p9) AND (1 <= p10)))
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: ((p9 <= 0) OR (p10 <= 0))
lola: processed formula length: 26
lola: 70 rewrites
lola: closed formula file LTLFireability.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: 2401 markings, 2401 edges
lola: ========================================
lola: subprocess 6 will run for 616 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((p7 <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((p7 <= 1)))
lola: processed formula length: 17
lola: 68 rewrites
lola: closed formula file LTLFireability.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: 2810 markings, 2810 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 5 will run for 513 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((F (G ((2 <= p7))) AND X ((2 <= p7))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((F (G ((2 <= p7))) AND X ((2 <= p7))))
lola: processed formula length: 41
lola: 68 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 2810 markings, 2810 edges
lola: ========================================
lola: subprocess 6 will run for 616 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X ((X (((1 <= p15) AND (300 <= p27))) AND ((1 <= p15) AND (300 <= p27)))) OR ((G (((p4 <= 1) OR (p15 <= 0) OR (p28 <= 0))) AND X (F ((X (((1 <= p15) AND (300 <= p27))) AND ((1 <= p15) AND (300 <= p27)))))) OR ((1 <= p14))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 616 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p14))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p14))
lola: processed formula length: 12
lola: 68 rewrites
lola: closed formula file LTLFireability.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 7 will run for 770 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((p4 <= 1) OR (p15 <= 0) OR (p28 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((p4 <= 1) OR (p15 <= 0) OR (p28 <= 0)))
lola: processed formula length: 45
lola: 68 rewrites
lola: closed formula file LTLFireability.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: 2208 markings, 2208 edges
lola: ========================================
lola: subprocess 8 will run for 1026 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X (((1 <= p15) AND (300 <= p27))) AND ((1 <= p15) AND (300 <= p27))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X (((1 <= p15) AND (300 <= p27))) AND ((1 <= p15) AND (300 <= p27))))
lola: processed formula length: 73
lola: 68 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 2810 markings, 2810 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 7 will run for 770 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((p5 <= 0) OR (p6 <= 0))))
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 (((p5 <= 0) OR (p6 <= 0))))
lola: processed formula length: 33
lola: 68 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: add low 1
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: 413 markings, 414 edges
lola: ========================================
lola: subprocess 8 will run for 1026 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((p3 <= 0) OR (p23 <= 0) OR (p20 <= 0))))
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 (((p3 <= 0) OR (p23 <= 0) OR (p20 <= 0))))
lola: processed formula length: 49
lola: 68 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: add low 1
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: 2930 markings, 3025 edges
lola: ========================================
lola: subprocess 9 will run for 1540 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((((p21 <= 0) OR (p19 <= 0) OR (p22 <= 0)) AND (F ((p16 <= 0)) OR G (((p21 <= 0) OR (p19 <= 0) OR (p22 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((((p21 <= 0) OR (p19 <= 0) OR (p22 <= 0)) AND (F ((p16 <= 0)) OR G (((p21 <= 0) OR (p19 <= 0) OR (p22 <= 0)))))))
lola: processed formula length: 123
lola: 68 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 3081 markings, 3340 edges
lola: ========================================
lola: subprocess 10 will run for 3080 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((G ((F (((1 <= p9) AND (1 <= p13))) AND (((((1 <= p0) AND (1 <= p2) AND (1 <= p12) AND (1 <= p32)) U G (((1 <= p11) AND (1 <= p12) AND (700 <= p31)))) OR ((1 <= p9) AND (1 <= p13))) AND ((1 <= p9) AND (1 <= p13))))) AND ((1 <= p9) AND (1 <= p13))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((G ((F (((1 <= p9) AND (1 <= p13))) AND (((((1 <= p0) AND (1 <= p2) AND (1 <= p12) AND (1 <= p32)) U G (((1 <= p11) AND (1 <= p12) AND (700 <= p31)))) OR ((1 <= p9) AND (1 <= p13))) AND ((1 <= p9) AND (1 <= p13))))) AND ((1 <= p9) AND (1 <= p13))))
lola: processed formula length: 251
lola: 68 rewrites
lola: closed formula file LTLFireability.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: 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: 2812 markings, 2812 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: X (X (G ((F (G (((p8 <= 0) OR (p29 <= 199)))) AND ((p8 <= 0) OR (p29 <= 199))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (G ((F (G (((p8 <= 0) OR (p29 <= 199)))) AND ((p8 <= 0) OR (p29 <= 199))))))
lola: processed formula length: 83
lola: 68 rewrites
lola: closed formula file LTLFireability.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: 797854 markings, 5054355 edges, 159571 markings/sec, 0 secs
lola: 1598032 markings, 10375530 edges, 160036 markings/sec, 5 secs
lola: 2375621 markings, 15597351 edges, 155518 markings/sec, 10 secs
lola: 3149030 markings, 20788377 edges, 154682 markings/sec, 15 secs
lola: 3899621 markings, 25905010 edges, 150118 markings/sec, 20 secs
lola: 4655462 markings, 31036775 edges, 151168 markings/sec, 25 secs
lola: 5413061 markings, 36139548 edges, 151520 markings/sec, 30 secs
lola: 6156358 markings, 41205034 edges, 148659 markings/sec, 35 secs
lola: 6896395 markings, 46245657 edges, 148007 markings/sec, 40 secs
lola: 7635999 markings, 51282872 edges, 147921 markings/sec, 45 secs
lola: 8374443 markings, 56312177 edges, 147689 markings/sec, 50 secs
lola: 9111110 markings, 61327912 edges, 147333 markings/sec, 55 secs
lola: 9834473 markings, 66317141 edges, 144673 markings/sec, 60 secs
lola: 10566156 markings, 71314365 edges, 146337 markings/sec, 65 secs
lola: 11302655 markings, 76334703 edges, 147300 markings/sec, 70 secs
lola: 12041651 markings, 81368587 edges, 147799 markings/sec, 75 secs
lola: 12772922 markings, 86345547 edges, 146254 markings/sec, 80 secs
lola: 13484085 markings, 91268484 edges, 142233 markings/sec, 85 secs
lola: 14218475 markings, 96267763 edges, 146878 markings/sec, 90 secs
lola: 14952269 markings, 101265718 edges, 146759 markings/sec, 95 secs
lola: 15659928 markings, 106160387 edges, 141532 markings/sec, 100 secs
lola: 16389545 markings, 111127124 edges, 145923 markings/sec, 105 secs
lola: 17120511 markings, 116104719 edges, 146193 markings/sec, 110 secs
lola: 17824574 markings, 120975483 edges, 140813 markings/sec, 115 secs
lola: 18556819 markings, 125963063 edges, 146449 markings/sec, 120 secs
lola: 19265840 markings, 130866935 edges, 141804 markings/sec, 125 secs
lola: 19990324 markings, 135805536 edges, 144897 markings/sec, 130 secs
lola: 20717669 markings, 140754967 edges, 145469 markings/sec, 135 secs
lola: 21419818 markings, 145612733 edges, 140430 markings/sec, 140 secs
lola: 22144805 markings, 150548001 edges, 144997 markings/sec, 145 secs
lola: 22848890 markings, 155417072 edges, 140817 markings/sec, 150 secs
lola: 23573717 markings, 160358338 edges, 144965 markings/sec, 155 secs
lola: 24273295 markings, 165196620 edges, 139916 markings/sec, 160 secs
lola: 24999551 markings, 170138508 edges, 145251 markings/sec, 165 secs
lola: 25698793 markings, 174976013 edges, 139848 markings/sec, 170 secs
lola: 26422701 markings, 179907457 edges, 144782 markings/sec, 175 secs
lola: 27115945 markings, 184702218 edges, 138649 markings/sec, 180 secs
lola: 27845808 markings, 189670438 edges, 145973 markings/sec, 185 secs
lola: 28536165 markings, 194446053 edges, 138071 markings/sec, 190 secs
lola: 29267515 markings, 199429518 edges, 146270 markings/sec, 195 secs
lola: 29953433 markings, 204173599 edges, 137184 markings/sec, 200 secs
lola: 30668222 markings, 209042872 edges, 142958 markings/sec, 205 secs
lola: 31361665 markings, 213836077 edges, 138689 markings/sec, 210 secs
lola: 32023167 markings, 218333591 edges, 132300 markings/sec, 215 secs
lola: 32712832 markings, 223103669 edges, 137933 markings/sec, 220 secs
lola: 33389029 markings, 227782418 edges, 135239 markings/sec, 225 secs
lola: 34112180 markings, 232704246 edges, 144630 markings/sec, 230 secs
lola: 34784452 markings, 237356095 edges, 134454 markings/sec, 235 secs
lola: 35513876 markings, 242321605 edges, 145885 markings/sec, 240 secs
lola: 36191094 markings, 247008701 edges, 135444 markings/sec, 245 secs
lola: 36886790 markings, 251758105 edges, 139139 markings/sec, 250 secs
lola: 37582630 markings, 256555017 edges, 139168 markings/sec, 255 secs
lola: 38255739 markings, 261212633 edges, 134622 markings/sec, 260 secs
lola: 38994607 markings, 266245824 edges, 147774 markings/sec, 265 secs
lola: 39675759 markings, 270955511 edges, 136230 markings/sec, 270 secs
lola: 40389162 markings, 275812321 edges, 142681 markings/sec, 275 secs
lola: 41090044 markings, 280660466 edges, 140176 markings/sec, 280 secs
lola: 41757264 markings, 285275411 edges, 133444 markings/sec, 285 secs
lola: 42482749 markings, 290215051 edges, 145097 markings/sec, 290 secs
lola: 43155232 markings, 294867808 edges, 134497 markings/sec, 295 secs
lola: 43826203 markings, 299511056 edges, 134194 markings/sec, 300 secs
lola: 44550724 markings, 304442054 edges, 144904 markings/sec, 305 secs
lola: 45221603 markings, 309083552 edges, 134176 markings/sec, 310 secs
lola: 45934956 markings, 313940418 edges, 142671 markings/sec, 315 secs
lola: 46630018 markings, 318748068 edges, 139012 markings/sec, 320 secs
lola: 47302803 markings, 323404808 edges, 134557 markings/sec, 325 secs
lola: 48026441 markings, 328328944 edges, 144728 markings/sec, 330 secs
lola: 48712690 markings, 333076939 edges, 137250 markings/sec, 335 secs
lola: 49392657 markings, 337778533 edges, 135993 markings/sec, 340 secs
lola: 50119726 markings, 342729674 edges, 145414 markings/sec, 345 secs
lola: 50805932 markings, 347478325 edges, 137241 markings/sec, 350 secs
lola: 51499071 markings, 352271536 edges, 138628 markings/sec, 355 secs
lola: 52231355 markings, 357258197 edges, 146457 markings/sec, 360 secs
lola: 52916960 markings, 362005733 edges, 137121 markings/sec, 365 secs
lola: 53615101 markings, 366834204 edges, 139628 markings/sec, 370 secs
lola: 54346238 markings, 371811537 edges, 146227 markings/sec, 375 secs
lola: 55028557 markings, 376529872 edges, 136464 markings/sec, 380 secs
lola: 55727953 markings, 381364117 edges, 139879 markings/sec, 385 secs
lola: 56456551 markings, 386330975 edges, 145720 markings/sec, 390 secs
lola: 57136278 markings, 391031233 edges, 135945 markings/sec, 395 secs
lola: 57837398 markings, 395871823 edges, 140224 markings/sec, 400 secs
lola: 58564162 markings, 400833605 edges, 145353 markings/sec, 405 secs
lola: 59241160 markings, 405512755 edges, 135400 markings/sec, 410 secs
lola: 59937082 markings, 410327324 edges, 139184 markings/sec, 415 secs
lola: 60656664 markings, 415226534 edges, 143916 markings/sec, 420 secs
lola: 61327850 markings, 419870680 edges, 134237 markings/sec, 425 secs
lola: 62008690 markings, 424578151 edges, 136168 markings/sec, 430 secs
lola: 62729184 markings, 429485384 edges, 144099 markings/sec, 435 secs
lola: 63375551 markings, 433954788 edges, 129273 markings/sec, 440 secs
lola: 64056069 markings, 438664860 edges, 136104 markings/sec, 445 secs
lola: 64775462 markings, 443560279 edges, 143879 markings/sec, 450 secs
lola: 65469122 markings, 448359674 edges, 138732 markings/sec, 455 secs
lola: 66145367 markings, 453037053 edges, 135249 markings/sec, 460 secs
lola: 66861667 markings, 457915567 edges, 143260 markings/sec, 465 secs
lola: 67511969 markings, 462411228 edges, 130060 markings/sec, 470 secs
lola: 68185990 markings, 467075851 edges, 134804 markings/sec, 475 secs
lola: 68875611 markings, 471843942 edges, 137924 markings/sec, 480 secs
lola: 69592637 markings, 476730620 edges, 143405 markings/sec, 485 secs
lola: 70277598 markings, 481464451 edges, 136992 markings/sec, 490 secs
lola: 70960854 markings, 486192806 edges, 136651 markings/sec, 495 secs
lola: 71683594 markings, 491111737 edges, 144548 markings/sec, 500 secs
lola: 72383707 markings, 495954077 edges, 140023 markings/sec, 505 secs
lola: 73060714 markings, 500642193 edges, 135401 markings/sec, 510 secs
lola: 73776298 markings, 505508818 edges, 143117 markings/sec, 515 secs
lola: 74475197 markings, 510343255 edges, 139780 markings/sec, 520 secs
lola: 75145429 markings, 514980616 edges, 134046 markings/sec, 525 secs
lola: 75824142 markings, 519677245 edges, 135743 markings/sec, 530 secs
lola: 76552177 markings, 524632015 edges, 145607 markings/sec, 535 secs
lola: 77258081 markings, 529517142 edges, 141181 markings/sec, 540 secs
lola: 77945704 markings, 534271506 edges, 137525 markings/sec, 545 secs
lola: 78669664 markings, 539204875 edges, 144792 markings/sec, 550 secs
lola: 79373690 markings, 544076516 edges, 140805 markings/sec, 555 secs
lola: 80058982 markings, 548811339 edges, 137058 markings/sec, 560 secs
lola: 80741931 markings, 553537956 edges, 136590 markings/sec, 565 secs
lola: 81462086 markings, 558438670 edges, 144031 markings/sec, 570 secs
lola: 82150633 markings, 563201516 edges, 137709 markings/sec, 575 secs
lola: 82791860 markings, 567639943 edges, 128245 markings/sec, 580 secs
lola: 83392245 markings, 571792144 edges, 120077 markings/sec, 585 secs
lola: 84071108 markings, 576408743 edges, 135773 markings/sec, 590 secs
lola: 84761272 markings, 581181775 edges, 138033 markings/sec, 595 secs
lola: 85422868 markings, 585758406 edges, 132319 markings/sec, 600 secs
lola: 86104108 markings, 590473424 edges, 136248 markings/sec, 605 secs
lola: 86797038 markings, 595186489 edges, 138586 markings/sec, 610 secs
lola: 87485193 markings, 599946823 edges, 137631 markings/sec, 615 secs
lola: 88173686 markings, 604709814 edges, 137699 markings/sec, 620 secs
lola: 88896838 markings, 609631675 edges, 144630 markings/sec, 625 secs
lola: 89596681 markings, 614473362 edges, 139969 markings/sec, 630 secs
lola: 90294534 markings, 619300484 edges, 139571 markings/sec, 635 secs
lola: 90987688 markings, 624100418 edges, 138631 markings/sec, 640 secs
lola: 91706374 markings, 628989376 edges, 143737 markings/sec, 645 secs
lola: 92404928 markings, 633820330 edges, 139711 markings/sec, 650 secs
lola: 93095084 markings, 638596537 edges, 138031 markings/sec, 655 secs
lola: 93768968 markings, 643255889 edges, 134777 markings/sec, 660 secs
lola: 94450727 markings, 647897359 edges, 136352 markings/sec, 665 secs
lola: 95123053 markings, 652545273 edges, 134465 markings/sec, 670 secs
lola: 95790601 markings, 657162522 edges, 133510 markings/sec, 675 secs
lola: 96462651 markings, 661811516 edges, 134410 markings/sec, 680 secs
lola: 97183593 markings, 666724361 edges, 144188 markings/sec, 685 secs
lola: 97873227 markings, 671492053 edges, 137927 markings/sec, 690 secs
lola: 98559290 markings, 676234991 edges, 137213 markings/sec, 695 secs
lola: 99220737 markings, 680811211 edges, 132289 markings/sec, 700 secs
lola: 99951467 markings, 685790239 edges, 146146 markings/sec, 705 secs
lola: 100647283 markings, 690604735 edges, 139163 markings/sec, 710 secs
lola: 101341870 markings, 695407546 edges, 138917 markings/sec, 715 secs
lola: 102027677 markings, 700148303 edges, 137161 markings/sec, 720 secs
lola: 102763205 markings, 705158493 edges, 147106 markings/sec, 725 secs
lola: 103458636 markings, 709971946 edges, 139086 markings/sec, 730 secs
lola: 104154981 markings, 714790445 edges, 139269 markings/sec, 735 secs
lola: 104840084 markings, 719525766 edges, 137021 markings/sec, 740 secs
lola: 105578640 markings, 724556287 edges, 147711 markings/sec, 745 secs
lola: 106272801 markings, 729357445 edges, 138832 markings/sec, 750 secs
lola: 106968926 markings, 734173339 edges, 139225 markings/sec, 755 secs
lola: 107654227 markings, 738915342 edges, 137060 markings/sec, 760 secs
lola: 108394218 markings, 743955697 edges, 147998 markings/sec, 765 secs
lola: 109090116 markings, 748767185 edges, 139180 markings/sec, 770 secs
lola: 109787870 markings, 753594540 edges, 139551 markings/sec, 775 secs
lola: 110470370 markings, 758319851 edges, 136500 markings/sec, 780 secs
lola: 111204056 markings, 763313747 edges, 146737 markings/sec, 785 secs
lola: 111902751 markings, 768146031 edges, 139739 markings/sec, 790 secs
lola: 112601969 markings, 772983610 edges, 139844 markings/sec, 795 secs
lola: 113288471 markings, 777729458 edges, 137300 markings/sec, 800 secs
lola: 114001504 markings, 782639771 edges, 142607 markings/sec, 805 secs
lola: 114720913 markings, 787562209 edges, 143882 markings/sec, 810 secs
lola: 115409254 markings, 792323307 edges, 137668 markings/sec, 815 secs
lola: 116086283 markings, 797025822 edges, 135406 markings/sec, 820 secs
lola: 116666821 markings, 801025491 edges, 116108 markings/sec, 825 secs
lola: 117219658 markings, 804766480 edges, 110567 markings/sec, 830 secs
lola: 117824085 markings, 808949940 edges, 120885 markings/sec, 835 secs
lola: 118491500 markings, 813566812 edges, 133483 markings/sec, 840 secs
lola: 119156851 markings, 818171138 edges, 133070 markings/sec, 845 secs
lola: 119827489 markings, 822806576 edges, 134128 markings/sec, 850 secs
lola: 120535863 markings, 827627277 edges, 141675 markings/sec, 855 secs
lola: 121192628 markings, 832171154 edges, 131353 markings/sec, 860 secs
lola: 121835497 markings, 836619698 edges, 128574 markings/sec, 865 secs
lola: 122487490 markings, 841127284 edges, 130399 markings/sec, 870 secs
lola: 123189335 markings, 845904152 edges, 140369 markings/sec, 875 secs
lola: 123793345 markings, 850086112 edges, 120802 markings/sec, 880 secs
lola: 124413238 markings, 854372207 edges, 123979 markings/sec, 885 secs
lola: 125085272 markings, 859020980 edges, 134407 markings/sec, 890 secs
lola: 125739431 markings, 863546430 edges, 130832 markings/sec, 895 secs
lola: 126454422 markings, 868410946 edges, 142998 markings/sec, 900 secs
lola: 127115961 markings, 872987703 edges, 132308 markings/sec, 905 secs
lola: 127757537 markings, 877427044 edges, 128315 markings/sec, 910 secs
lola: 128409362 markings, 881933622 edges, 130365 markings/sec, 915 secs
lola: 129056006 markings, 886412063 edges, 129329 markings/sec, 920 secs
lola: 129744325 markings, 891091247 edges, 137664 markings/sec, 925 secs
lola: 130391884 markings, 895569820 edges, 129512 markings/sec, 930 secs
lola: 131040024 markings, 900056544 edges, 129628 markings/sec, 935 secs
lola: 131688401 markings, 904537852 edges, 129675 markings/sec, 940 secs
lola: 132341724 markings, 909057191 edges, 130665 markings/sec, 945 secs
lola: 133021825 markings, 913684610 edges, 136020 markings/sec, 950 secs
lola: 133664343 markings, 918127479 edges, 128504 markings/sec, 955 secs
lola: 134313690 markings, 922623434 edges, 129869 markings/sec, 960 secs
lola: 134954509 markings, 927051233 edges, 128164 markings/sec, 965 secs
lola: 135609311 markings, 931582469 edges, 130960 markings/sec, 970 secs
lola: 136286435 markings, 936187107 edges, 135425 markings/sec, 975 secs
lola: 136923738 markings, 940599100 edges, 127461 markings/sec, 980 secs
lola: 137577235 markings, 945118033 edges, 130699 markings/sec, 985 secs
lola: 138215518 markings, 949534510 edges, 127657 markings/sec, 990 secs
lola: 138873329 markings, 954085427 edges, 131562 markings/sec, 995 secs
lola: 139553807 markings, 958709788 edges, 136096 markings/sec, 1000 secs
lola: 140196341 markings, 963158060 edges, 128507 markings/sec, 1005 secs
lola: 140849061 markings, 967670389 edges, 130544 markings/sec, 1010 secs
lola: 141497185 markings, 972153387 edges, 129625 markings/sec, 1015 secs
lola: 142164013 markings, 976764928 edges, 133366 markings/sec, 1020 secs
lola: 142846207 markings, 981409786 edges, 136439 markings/sec, 1025 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: no no no unknown no no no no no no no
lola:
preliminary result: no no no unknown no no no no no no no
lola: memory consumption: 3424 KB
lola: time consumption: 1528 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLFireability.json
lola: closed JSON file LTLFireability.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="GPPP-PT-C0100N0000100000"
export BK_EXAMINATION="LTLFireability"
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 GPPP-PT-C0100N0000100000, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r170-smll-158987816000522"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/GPPP-PT-C0100N0000100000.tgz
mv GPPP-PT-C0100N0000100000 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;