About the Execution of ITS-LoLa for GPPP-PT-C0010N0000000100
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15788.650 | 3600000.00 | 1056892.00 | 16711.90 | FF?FFFTTFFTFFTTT | 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-158987815900473.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-C0010N0000000100, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r170-smll-158987815900473
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 208K
-rw-r--r-- 1 mcc users 3.4K Apr 4 20:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K Apr 4 20:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Apr 4 09:12 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 4 09:12 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.5K Apr 8 14:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Apr 8 14:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Apr 3 21:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Apr 3 21:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.9K Apr 3 13:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 3 13:50 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-C0010N0000000100-00
FORMULA_NAME GPPP-PT-C0010N0000000100-01
FORMULA_NAME GPPP-PT-C0010N0000000100-02
FORMULA_NAME GPPP-PT-C0010N0000000100-03
FORMULA_NAME GPPP-PT-C0010N0000000100-04
FORMULA_NAME GPPP-PT-C0010N0000000100-05
FORMULA_NAME GPPP-PT-C0010N0000000100-06
FORMULA_NAME GPPP-PT-C0010N0000000100-07
FORMULA_NAME GPPP-PT-C0010N0000000100-08
FORMULA_NAME GPPP-PT-C0010N0000000100-09
FORMULA_NAME GPPP-PT-C0010N0000000100-10
FORMULA_NAME GPPP-PT-C0010N0000000100-11
FORMULA_NAME GPPP-PT-C0010N0000000100-12
FORMULA_NAME GPPP-PT-C0010N0000000100-13
FORMULA_NAME GPPP-PT-C0010N0000000100-14
FORMULA_NAME GPPP-PT-C0010N0000000100-15
=== Now, execution of the tool begins
BK_START 1591448712307
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-06 13:05:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-06 13:05:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-06 13:05:14] [INFO ] Load time of PNML (sax parser for PT used): 40 ms
[2020-06-06 13:05:14] [INFO ] Transformed 33 places.
[2020-06-06 13:05:14] [INFO ] Transformed 22 transitions.
[2020-06-06 13:05:14] [INFO ] Parsed PT model containing 33 places and 22 transitions in 89 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 20 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100040 steps, including 244 resets, run finished after 184 ms. (steps per millisecond=543 ) properties seen :[0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 0]
// Phase 1: matrix 22 rows 33 cols
[2020-06-06 13:05:14] [INFO ] Computed 12 place invariants in 7 ms
[2020-06-06 13:05:15] [INFO ] [Real]Absence check using 6 positive place invariants in 15 ms returned unsat
[2020-06-06 13:05:15] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned unsat
[2020-06-06 13:05:15] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned unsat
[2020-06-06 13:05:15] [INFO ] [Real]Absence check using 6 positive place invariants in 9 ms returned sat
[2020-06-06 13:05:15] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 5 ms returned sat
[2020-06-06 13:05:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-06 13:05:15] [INFO ] [Real]Absence check using state equation in 33 ms returned unsat
[2020-06-06 13:05:15] [INFO ] [Real]Absence check using 6 positive place invariants in 7 ms returned sat
[2020-06-06 13:05:15] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 7 ms returned sat
[2020-06-06 13:05:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-06 13:05:15] [INFO ] [Real]Absence check using state equation in 32 ms returned unsat
[2020-06-06 13:05:15] [INFO ] [Real]Absence check using 6 positive place invariants in 6 ms returned sat
[2020-06-06 13:05:15] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 5 ms returned unsat
[2020-06-06 13:05:15] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned unsat
[2020-06-06 13:05:15] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2020-06-06 13:05:15] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 4 ms returned sat
[2020-06-06 13:05:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-06 13:05:15] [INFO ] [Real]Absence check using state equation in 31 ms returned unsat
[2020-06-06 13:05:15] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2020-06-06 13:05:15] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 3 ms returned sat
[2020-06-06 13:05:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-06 13:05:15] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2020-06-06 13:05:15] [INFO ] Solution in real domain found non-integer solution.
[2020-06-06 13:05:15] [INFO ] [Nat]Absence check using 6 positive place invariants in 11 ms returned sat
[2020-06-06 13:05:15] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 3 ms returned sat
[2020-06-06 13:05:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-06 13:05:15] [INFO ] [Nat]Absence check using state equation in 38 ms returned unsat
[2020-06-06 13:05:15] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned unsat
Successfully simplified 10 atomic propositions for a total of 13 simplifications.
[2020-06-06 13:05:15] [INFO ] Initial state reduction rules for CTL removed 6 formulas.
[2020-06-06 13:05:15] [INFO ] Flatten gal took : 34 ms
FORMULA GPPP-PT-C0010N0000000100-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0010N0000000100-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0010N0000000100-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0010N0000000100-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0010N0000000100-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0010N0000000100-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-06 13:05:15] [INFO ] Flatten gal took : 10 ms
[2020-06-06 13:05:15] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2020-06-06 13:05:15] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 1 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ GPPP-PT-C0010N0000000100 @ 3570 seconds
FORMULA GPPP-PT-C0010N0000000100-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA GPPP-PT-C0010N0000000100-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA GPPP-PT-C0010N0000000100-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA GPPP-PT-C0010N0000000100-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA GPPP-PT-C0010N0000000100-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA GPPP-PT-C0010N0000000100-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA GPPP-PT-C0010N0000000100-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA GPPP-PT-C0010N0000000100-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA GPPP-PT-C0010N0000000100-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA GPPP-PT-C0010N0000000100-02 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2527
rslt: Output for LTLCardinality @ GPPP-PT-C0010N0000000100
{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2020",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=LTLCardinality.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Sat Jun 6 13:05:16 2020
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 354
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 1,
"aneg": 3,
"comp": 4,
"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": 3,
"visible_transitions": 0
},
"processed": "F ((G ((p15 + 1 <= p18)) OR (X (G (((p18 <= p15) AND (1 <= p11)))) AND (p15 + 1 <= p18))))",
"processed_size": 90,
"rewrites": 84
},
"result":
{
"edges": 290,
"markings": 290,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"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": 393
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 393
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G ((p30 <= p31))",
"processed_size": 16,
"rewrites": 84
},
"result":
{
"edges": 279,
"markings": 279,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 442
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "G (F (((p6 + 1 <= p7) AND (p15 + 1 <= p12))))",
"processed_size": 45,
"rewrites": 84
},
"result":
{
"edges": 290,
"markings": 290,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "fairness",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 1,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 442
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 442
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(p26 + 1 <= p17)",
"processed_size": 16,
"rewrites": 84
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 2,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 505
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 3,
"aconj": 0,
"adisj": 0,
"aneg": 3,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X ((X ((p18 <= p26)) AND (F ((p0 <= 0)) OR X (G ((p18 <= p26))))))",
"processed_size": 66,
"rewrites": 84
},
"result":
{
"edges": 299,
"markings": 297,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 2,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 505
},
"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": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (G ((p11 + 1 <= p14)))",
"processed_size": 24,
"rewrites": 84
},
"result":
{
"edges": 290,
"markings": 290,
"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": 590
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (((p20 <= 0) OR F ((3 <= p15))))",
"processed_size": 34,
"rewrites": 84
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 708
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 0,
"U": 0,
"X": 5,
"aconj": 0,
"adisj": 0,
"aneg": 4,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X ((X (X (X (X (F ((F ((p32 + 1 <= p12)) OR (p32 + 1 <= p12))))))) AND ((p30 + 1 <= p26) R (p32 + 1 <= p12))))",
"processed_size": 110,
"rewrites": 84
},
"result":
{
"edges": 290,
"markings": 290,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 8
},
"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": 885
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 1,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "F (G ((F ((1 <= p3)) AND (X ((G ((p10 + 1 <= p25)) OR (p17 <= 1))) OR (1 <= p3)))))",
"processed_size": 83,
"rewrites": 84
},
"result":
{
"edges": 292,
"markings": 291,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 8
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1180
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "G (F ((p8 <= 1)))",
"processed_size": 17,
"rewrites": 84
},
"result":
{
"edges": 505,
"markings": 439,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "fairness",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1770
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1770
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(1 <= p8)",
"processed_size": 9,
"rewrites": 84
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 8,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3540
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(p8 <= 0)",
"processed_size": 9,
"rewrites": 86
},
"result":
{
"edges": 46,
"markings": 46,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 3
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 8,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3540
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3540
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(p26 + 1 <= p14)",
"processed_size": 16,
"rewrites": 86
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 6
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 9,
"type": "boolean"
}
},
{
"child":
[
{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(p26 + 1 <= p14)",
"processed_size": 16,
"rewrites": 86
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 6
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
}
],
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 10,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 3916,
"runtime": 1043.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "F((G(*) OR (X(G(*)) AND *))) : G(F(*)) : (F(G(*)) AND F(**)) : (G(F(*)) AND (X(**) OR G(**))) : (X((X(*) AND (F(*) OR X(G(*))))) OR **) : X(G(*)) : (F(**) OR **) : X((* OR F(**))) : X((X(X(X(X(F((F(*) OR *)))))) AND (* R *))) : F(G((F(**) AND (X((G(*) OR **)) OR **))))"
},
"net":
{
"arcs": 83,
"conflict_clusters": 14,
"places": 33,
"places_significant": 21,
"singleton_clusters": 0,
"transitions": 22
},
"result":
{
"preliminary_value": "no no unknown no no no no yes no no ",
"value": "no no unknown no no no no yes 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 LTLCardinality.xml
lola: NOT(G ((X (F (((0 <= 0) U ((p15 + 1 <= p18) OR (p11 <= 0))))) U (p18 <= p15)))) : G (F (G (((1 <= 0) U NOT(F (G ((2 <= p8)))))))) : (NOT(F (G (X (((p14 <= p26) U F ((p0 <= p26))))))) AND F (((0 <= 0) U (p14 <= p26)))) : (F (NOT(F (G (((p7 <= p6) OR (p12 <= p15)))))) AND (X ((p9 <= p24)) OR G ((p30 <= p31)))) : (NOT(X ((G ((1 <= p0)) U X ((p26 + 1 <= p18))))) OR (p26 + 1 <= p17)) : NOT(F (X (((0 <= 0) U F ((p14 <= p11)))))) : (((p20 + 1 <= p22) U ((1 <= p8) U F ((1 <= p8)))) OR (1 <= p8)) : (NOT(X ((1 <= p20))) OR X (F ((X ((3 <= p15)) U (3 <= p15))))) : NOT(X ((X (X (G (X (X ((G ((p12 <= p32)) AND (p12 <= p32))))))) OR ((p26 <= p30) U (p12 <= p32))))) : X (G (F (G ((X ((NOT(F ((p25 <= p10))) OR (p17 <= 1))) U (1 <= p3))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:371
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:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k: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:422
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:528
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 354 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((G ((p15 + 1 <= p18)) OR (X (G (((p18 <= p15) AND (1 <= p11)))) AND (p15 + 1 <= p18))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((G ((p15 + 1 <= p18)) OR (X (G (((p18 <= p15) AND (1 <= p11)))) AND (p15 + 1 <= p18))))
lola: processed formula length: 90
lola: 84 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 290 markings, 290 edges
lola: ========================================
lola: subprocess 1 will run for 393 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G (F (((p6 + 1 <= p7) AND (p15 + 1 <= p12)))) AND (X ((p9 <= p24)) OR G ((p30 <= p31))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 393 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((p30 <= p31))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((p30 <= p31))
lola: processed formula length: 16
lola: 84 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 279 markings, 279 edges
lola: ========================================
lola: subprocess 2 will run for 442 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F (((p6 + 1 <= p7) AND (p15 + 1 <= p12))))
lola: ========================================
lola: SUBTASK
lola: checking fairness
lola: fairness not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F (((p6 + 1 <= p7) AND (p15 + 1 <= p12))))
lola: processed formula length: 45
lola: 84 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 290 markings, 290 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 442 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X ((X ((p18 <= p26)) AND (F ((p0 <= 0)) OR X (G ((p18 <= p26)))))) OR (p26 + 1 <= p17))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 442 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p26 + 1 <= p17)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p26 + 1 <= p17)
lola: processed formula length: 16
lola: 84 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 505 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X ((p18 <= p26)) AND (F ((p0 <= 0)) OR X (G ((p18 <= p26))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X ((p18 <= p26)) AND (F ((p0 <= 0)) OR X (G ((p18 <= p26))))))
lola: processed formula length: 66
lola: 84 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 7 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 297 markings, 299 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 3 will run for 505 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((p11 + 1 <= p14)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((p11 + 1 <= p14)))
lola: processed formula length: 24
lola: 84 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 290 markings, 290 edges
lola: ========================================
lola: subprocess 4 will run for 590 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((p20 <= 0) OR F ((3 <= p15))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((p20 <= 0) OR F ((3 <= p15))))
lola: processed formula length: 34
lola: 84 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 2 markings, 1 edges
lola: ========================================
lola: subprocess 5 will run for 708 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X (X (X (X (F ((F ((p32 + 1 <= p12)) OR (p32 + 1 <= p12))))))) AND ((p30 + 1 <= p26) R (p32 + 1 <= p12))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X (X (X (X (F ((F ((p32 + 1 <= p12)) OR (p32 + 1 <= p12))))))) AND ((p30 + 1 <= p26) R (p32 + 1 <= p12))))
lola: processed formula length: 110
lola: 84 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 8 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: 290 markings, 290 edges
lola: ========================================
lola: subprocess 6 will run for 885 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((F ((1 <= p3)) AND (X ((G ((p10 + 1 <= p25)) OR (p17 <= 1))) OR (1 <= p3)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((F ((1 <= p3)) AND (X ((G ((p10 + 1 <= p25)) OR (p17 <= 1))) OR (1 <= p3)))))
lola: processed formula length: 83
lola: 84 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 8 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: 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: 291 markings, 292 edges
lola: ========================================
lola: subprocess 7 will run for 1180 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((p8 <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking fairness
lola: fairness not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((p8 <= 1)))
lola: processed formula length: 17
lola: 84 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 439 markings, 505 edges
lola: ========================================
lola: subprocess 8 will run for 1770 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F ((1 <= p8)) OR (1 <= p8))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 1770 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= p8)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p8)
lola: processed formula length: 9
lola: 84 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 9 will run for 3540 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((1 <= p8))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (p8 <= 0)
lola: processed formula length: 9
lola: 86 rewrites
lola: closed formula file LTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 46 markings, 46 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 9 will run for 3540 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (G ((p26 + 1 <= p0))) AND F ((p14 <= p26)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 3540 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((p14 <= p26))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (p26 + 1 <= p14)
lola: processed formula length: 16
lola: 86 rewrites
lola: closed formula file LTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (F (G ((p26 + 1 <= p0))) AND F ((p14 <= p26)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: F ((p14 <= p26))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (p26 + 1 <= p14)
lola: processed formula length: 16
lola: 86 rewrites
lola: closed formula file LTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: F (G ((p26 + 1 <= p0)))
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 ((p26 + 1 <= p0)))
lola: processed formula length: 23
lola: 84 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: 1067739 markings, 5444746 edges, 213548 markings/sec, 0 secs
lola: 2069438 markings, 10895227 edges, 200340 markings/sec, 5 secs
lola: 2998325 markings, 16129026 edges, 185777 markings/sec, 10 secs
lola: 3933382 markings, 21399319 edges, 187011 markings/sec, 15 secs
lola: 4854212 markings, 26668412 edges, 184166 markings/sec, 20 secs
lola: 5696023 markings, 31477480 edges, 168362 markings/sec, 25 secs
lola: 6593172 markings, 36630741 edges, 179430 markings/sec, 30 secs
lola: 7496642 markings, 41839355 edges, 180694 markings/sec, 35 secs
lola: 8317418 markings, 46709115 edges, 164155 markings/sec, 40 secs
lola: 9110327 markings, 51502766 edges, 158582 markings/sec, 45 secs
lola: 9946367 markings, 56460302 edges, 167208 markings/sec, 50 secs
lola: 10843696 markings, 61617097 edges, 179466 markings/sec, 55 secs
lola: 11679329 markings, 66601814 edges, 167127 markings/sec, 60 secs
lola: 12497161 markings, 71573217 edges, 163566 markings/sec, 65 secs
lola: 13273167 markings, 76330280 edges, 155201 markings/sec, 70 secs
lola: 14066138 markings, 80966206 edges, 158594 markings/sec, 75 secs
lola: 14884649 markings, 85855048 edges, 163702 markings/sec, 80 secs
lola: 15704952 markings, 90751954 edges, 164061 markings/sec, 85 secs
lola: 16562641 markings, 95780142 edges, 171538 markings/sec, 90 secs
lola: 17451971 markings, 100811802 edges, 177866 markings/sec, 95 secs
lola: 18236199 markings, 105636185 edges, 156846 markings/sec, 100 secs
lola: 18985705 markings, 110408221 edges, 149901 markings/sec, 105 secs
lola: 19830875 markings, 115252695 edges, 169034 markings/sec, 110 secs
lola: 20626736 markings, 120033447 edges, 159172 markings/sec, 115 secs
lola: 21425695 markings, 124800243 edges, 159792 markings/sec, 120 secs
lola: 22175634 markings, 129465436 edges, 149988 markings/sec, 125 secs
lola: 22862647 markings, 133918748 edges, 137403 markings/sec, 130 secs
lola: 23616359 markings, 138590455 edges, 150742 markings/sec, 135 secs
lola: 24368153 markings, 143286975 edges, 150359 markings/sec, 140 secs
lola: 25127284 markings, 147976706 edges, 151826 markings/sec, 145 secs
lola: 25937739 markings, 152849913 edges, 162091 markings/sec, 150 secs
lola: 26767842 markings, 157857916 edges, 166021 markings/sec, 155 secs
lola: 27551205 markings, 162466720 edges, 156673 markings/sec, 160 secs
lola: 28335387 markings, 167222466 edges, 156836 markings/sec, 165 secs
lola: 29108479 markings, 171931011 edges, 154618 markings/sec, 170 secs
lola: 29844087 markings, 176518056 edges, 147122 markings/sec, 175 secs
lola: 30566666 markings, 181103176 edges, 144516 markings/sec, 180 secs
lola: 31354719 markings, 185944773 edges, 157611 markings/sec, 185 secs
lola: 32074361 markings, 190470553 edges, 143928 markings/sec, 190 secs
lola: 32802886 markings, 195058613 edges, 145705 markings/sec, 195 secs
lola: 33522287 markings, 199631130 edges, 143880 markings/sec, 200 secs
lola: 34376589 markings, 204655910 edges, 170860 markings/sec, 205 secs
lola: 35192472 markings, 209520484 edges, 163177 markings/sec, 210 secs
lola: 35992044 markings, 214322944 edges, 159914 markings/sec, 215 secs
lola: 36768151 markings, 219133437 edges, 155221 markings/sec, 220 secs
lola: 37532583 markings, 223905244 edges, 152886 markings/sec, 225 secs
lola: 38310073 markings, 228644195 edges, 155498 markings/sec, 230 secs
lola: 39062295 markings, 233370362 edges, 150444 markings/sec, 235 secs
lola: 39941440 markings, 238398811 edges, 175829 markings/sec, 240 secs
lola: 40835428 markings, 243488829 edges, 178798 markings/sec, 245 secs
lola: 41628865 markings, 248335870 edges, 158687 markings/sec, 250 secs
lola: 42335548 markings, 252729708 edges, 141337 markings/sec, 255 secs
lola: 43084284 markings, 257555909 edges, 149747 markings/sec, 260 secs
lola: 43754043 markings, 261990625 edges, 133952 markings/sec, 265 secs
lola: 44469260 markings, 266682584 edges, 143043 markings/sec, 270 secs
lola: 45347829 markings, 271568440 edges, 175714 markings/sec, 275 secs
lola: 46110022 markings, 276195072 edges, 152439 markings/sec, 280 secs
lola: 46873600 markings, 280785987 edges, 152716 markings/sec, 285 secs
lola: 47587415 markings, 285262554 edges, 142763 markings/sec, 290 secs
lola: 48287423 markings, 289700293 edges, 140002 markings/sec, 295 secs
lola: 49011966 markings, 294222932 edges, 144909 markings/sec, 300 secs
lola: 49732518 markings, 298671350 edges, 144110 markings/sec, 305 secs
lola: 50461692 markings, 303234838 edges, 145835 markings/sec, 310 secs
lola: 51088816 markings, 307449647 edges, 125425 markings/sec, 315 secs
lola: 51713388 markings, 311586154 edges, 124914 markings/sec, 320 secs
lola: 52315954 markings, 315686278 edges, 120513 markings/sec, 325 secs
lola: 53026892 markings, 320132288 edges, 142188 markings/sec, 330 secs
lola: 53691342 markings, 324419996 edges, 132890 markings/sec, 335 secs
lola: 54382022 markings, 328907661 edges, 138136 markings/sec, 340 secs
lola: 55057045 markings, 333114547 edges, 135005 markings/sec, 345 secs
lola: 55720505 markings, 337335727 edges, 132692 markings/sec, 350 secs
lola: 56429598 markings, 341819355 edges, 141819 markings/sec, 355 secs
lola: 57169417 markings, 346379944 edges, 147964 markings/sec, 360 secs
lola: 57929087 markings, 351068028 edges, 151934 markings/sec, 365 secs
lola: 58666970 markings, 355777467 edges, 147577 markings/sec, 370 secs
lola: 59537374 markings, 360795903 edges, 174081 markings/sec, 375 secs
lola: 60325853 markings, 365577773 edges, 157696 markings/sec, 380 secs
lola: 61112641 markings, 370342826 edges, 157358 markings/sec, 385 secs
lola: 61831235 markings, 374887221 edges, 143719 markings/sec, 390 secs
lola: 62559741 markings, 379480129 edges, 145701 markings/sec, 395 secs
lola: 63309187 markings, 384187257 edges, 149889 markings/sec, 400 secs
lola: 64080629 markings, 388915466 edges, 154288 markings/sec, 405 secs
lola: 64768985 markings, 393371416 edges, 137671 markings/sec, 410 secs
lola: 65458136 markings, 397810939 edges, 137830 markings/sec, 415 secs
lola: 66194022 markings, 402446804 edges, 147177 markings/sec, 420 secs
lola: 66878176 markings, 406949720 edges, 136831 markings/sec, 425 secs
lola: 67645118 markings, 411700851 edges, 153388 markings/sec, 430 secs
lola: 68398563 markings, 416465960 edges, 150689 markings/sec, 435 secs
lola: 69021164 markings, 420571755 edges, 124520 markings/sec, 440 secs
lola: 69745813 markings, 425070447 edges, 144930 markings/sec, 445 secs
lola: 70449072 markings, 429575596 edges, 140652 markings/sec, 450 secs
lola: 71087680 markings, 433820854 edges, 127722 markings/sec, 455 secs
lola: 71784351 markings, 438221862 edges, 139334 markings/sec, 460 secs
lola: 72519233 markings, 442929292 edges, 146976 markings/sec, 465 secs
lola: 73383358 markings, 447925687 edges, 172825 markings/sec, 470 secs
lola: 74184973 markings, 452760966 edges, 160323 markings/sec, 475 secs
lola: 74902712 markings, 457140044 edges, 143548 markings/sec, 480 secs
lola: 75662893 markings, 461826824 edges, 152036 markings/sec, 485 secs
lola: 76432311 markings, 466544890 edges, 153884 markings/sec, 490 secs
lola: 77157370 markings, 471078844 edges, 145012 markings/sec, 495 secs
lola: 77899440 markings, 475752563 edges, 148414 markings/sec, 500 secs
lola: 78612307 markings, 480319706 edges, 142573 markings/sec, 505 secs
lola: 79334402 markings, 484860059 edges, 144419 markings/sec, 510 secs
lola: 80068285 markings, 489392270 edges, 146777 markings/sec, 515 secs
lola: 80781039 markings, 493859199 edges, 142551 markings/sec, 520 secs
lola: 81469978 markings, 498334806 edges, 137788 markings/sec, 525 secs
lola: 82237292 markings, 503047106 edges, 153463 markings/sec, 530 secs
lola: 83105439 markings, 508025369 edges, 173629 markings/sec, 535 secs
lola: 83900697 markings, 512864054 edges, 159052 markings/sec, 540 secs
lola: 84805267 markings, 517948534 edges, 180914 markings/sec, 545 secs
lola: 85586931 markings, 522704169 edges, 156333 markings/sec, 550 secs
lola: 86333050 markings, 527374560 edges, 149224 markings/sec, 555 secs
lola: 87010433 markings, 531784824 edges, 135477 markings/sec, 560 secs
lola: 87720455 markings, 536360715 edges, 142004 markings/sec, 565 secs
lola: 88432520 markings, 541035365 edges, 142413 markings/sec, 570 secs
lola: 89061693 markings, 545392853 edges, 125835 markings/sec, 575 secs
lola: 89726652 markings, 549746541 edges, 132992 markings/sec, 580 secs
lola: 90404349 markings, 554336290 edges, 135539 markings/sec, 585 secs
lola: 91166272 markings, 558977371 edges, 152385 markings/sec, 590 secs
lola: 91999226 markings, 563786794 edges, 166591 markings/sec, 595 secs
lola: 92776720 markings, 568416896 edges, 155499 markings/sec, 600 secs
lola: 93471682 markings, 572623602 edges, 138992 markings/sec, 605 secs
lola: 94159999 markings, 576984945 edges, 137663 markings/sec, 610 secs
lola: 94839975 markings, 581348935 edges, 135995 markings/sec, 615 secs
lola: 95522001 markings, 585667806 edges, 136405 markings/sec, 620 secs
lola: 96234209 markings, 590090090 edges, 142442 markings/sec, 625 secs
lola: 96891688 markings, 594374903 edges, 131496 markings/sec, 630 secs
lola: 97600708 markings, 598778972 edges, 141804 markings/sec, 635 secs
lola: 98225405 markings, 602915385 edges, 124939 markings/sec, 640 secs
lola: 98878728 markings, 607195807 edges, 130665 markings/sec, 645 secs
lola: 99596394 markings, 611611547 edges, 143533 markings/sec, 650 secs
lola: 100253070 markings, 615884249 edges, 131335 markings/sec, 655 secs
lola: 100916029 markings, 620121074 edges, 132592 markings/sec, 660 secs
lola: 101611437 markings, 624546253 edges, 139082 markings/sec, 665 secs
lola: 102342519 markings, 629048535 edges, 146216 markings/sec, 670 secs
lola: 102950664 markings, 633195316 edges, 121629 markings/sec, 675 secs
lola: 103513448 markings, 637208066 edges, 112557 markings/sec, 680 secs
lola: 104125549 markings, 641316727 edges, 122420 markings/sec, 685 secs
lola: 104726959 markings, 645365131 edges, 120282 markings/sec, 690 secs
lola: 105300001 markings, 649261969 edges, 114608 markings/sec, 695 secs
lola: 105858970 markings, 653188235 edges, 111794 markings/sec, 700 secs
lola: 106552801 markings, 657558120 edges, 138766 markings/sec, 705 secs
lola: 107209436 markings, 661783920 edges, 131327 markings/sec, 710 secs
lola: 107856201 markings, 666019925 edges, 129353 markings/sec, 715 secs
lola: 108469598 markings, 670125911 edges, 122679 markings/sec, 720 secs
lola: 109155395 markings, 674546692 edges, 137159 markings/sec, 725 secs
lola: 109806590 markings, 678670523 edges, 130239 markings/sec, 730 secs
lola: 110426618 markings, 682705054 edges, 124006 markings/sec, 735 secs
lola: 111033803 markings, 686699381 edges, 121437 markings/sec, 740 secs
lola: 111713563 markings, 691005870 edges, 135952 markings/sec, 745 secs
lola: 112393595 markings, 695358177 edges, 136006 markings/sec, 750 secs
lola: 113061653 markings, 699729653 edges, 133612 markings/sec, 755 secs
lola: 113804193 markings, 704259111 edges, 148508 markings/sec, 760 secs
lola: 114558972 markings, 708882314 edges, 150956 markings/sec, 765 secs
lola: 115237522 markings, 713362460 edges, 135710 markings/sec, 770 secs
lola: 115800519 markings, 717227519 edges, 112599 markings/sec, 775 secs
lola: 116673441 markings, 722154758 edges, 174584 markings/sec, 780 secs
lola: 117428635 markings, 726716013 edges, 151039 markings/sec, 785 secs
lola: 118133845 markings, 730986289 edges, 141042 markings/sec, 790 secs
lola: 118853671 markings, 735493237 edges, 143965 markings/sec, 795 secs
lola: 119571620 markings, 739952925 edges, 143590 markings/sec, 800 secs
lola: 120231736 markings, 744116112 edges, 132023 markings/sec, 805 secs
lola: 120945085 markings, 748557081 edges, 142670 markings/sec, 810 secs
lola: 121627517 markings, 752820131 edges, 136486 markings/sec, 815 secs
lola: 122249718 markings, 756863996 edges, 124440 markings/sec, 820 secs
lola: 122916913 markings, 761108525 edges, 133439 markings/sec, 825 secs
lola: 123609684 markings, 765536701 edges, 138554 markings/sec, 830 secs
lola: 124257542 markings, 769790505 edges, 129572 markings/sec, 835 secs
lola: 124968544 markings, 774314922 edges, 142200 markings/sec, 840 secs
lola: 125690946 markings, 778914553 edges, 144480 markings/sec, 845 secs
lola: 126412501 markings, 783378368 edges, 144311 markings/sec, 850 secs
lola: 127077720 markings, 787706007 edges, 133044 markings/sec, 855 secs
lola: 127726265 markings, 792001299 edges, 129709 markings/sec, 860 secs
lola: 128393103 markings, 796371267 edges, 133368 markings/sec, 865 secs
lola: 129053862 markings, 800589594 edges, 132152 markings/sec, 870 secs
lola: 129768258 markings, 805163483 edges, 142879 markings/sec, 875 secs
lola: 130437615 markings, 809569468 edges, 133871 markings/sec, 880 secs
lola: 131088703 markings, 813918752 edges, 130218 markings/sec, 885 secs
lola: 131839461 markings, 818572331 edges, 150152 markings/sec, 890 secs
lola: 132527837 markings, 823022504 edges, 137675 markings/sec, 895 secs
lola: 133239495 markings, 827584230 edges, 142332 markings/sec, 900 secs
lola: 133713390 markings, 830749141 edges, 94779 markings/sec, 905 secs
lola: 134202614 markings, 834041370 edges, 97845 markings/sec, 910 secs
lola: 134892771 markings, 838322962 edges, 138031 markings/sec, 915 secs
lola: 135551541 markings, 842542433 edges, 131754 markings/sec, 920 secs
lola: 136190445 markings, 846747390 edges, 127781 markings/sec, 925 secs
lola: 136815560 markings, 850870350 edges, 125023 markings/sec, 930 secs
lola: 137419419 markings, 854948502 edges, 120772 markings/sec, 935 secs
lola: 138088367 markings, 859223189 edges, 133790 markings/sec, 940 secs
lola: 138710644 markings, 863234866 edges, 124455 markings/sec, 945 secs
lola: 139381972 markings, 867693360 edges, 134266 markings/sec, 950 secs
lola: 140176960 markings, 872353353 edges, 158998 markings/sec, 955 secs
lola: 140952461 markings, 876973497 edges, 155100 markings/sec, 960 secs
lola: 141712101 markings, 881537710 edges, 151928 markings/sec, 965 secs
lola: 142446589 markings, 886096157 edges, 146898 markings/sec, 970 secs
lola: 143158968 markings, 890575230 edges, 142476 markings/sec, 975 secs
lola: 143899328 markings, 895043099 edges, 148072 markings/sec, 980 secs
lola: 144652743 markings, 899874843 edges, 150683 markings/sec, 985 secs
lola: 144817309 markings, 900846771 edges, 32913 markings/sec, 990 secs
lola: 144823141 markings, 900886138 edges, 1166 markings/sec, 995 secs
lola: 144823951 markings, 900891850 edges, 162 markings/sec, 1000 secs
lola: 144823969 markings, 900891951 edges, 4 markings/sec, 1005 secs
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no unknown no no no no yes no no
lola:
preliminary result: no no unknown no no no no yes no no
lola: memory consumption: 3916 KB
lola: time consumption: 1043 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.json
rslt: finished
--------------------
content from stderr:
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="GPPP-PT-C0010N0000000100"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itslola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itslola"
echo " Input is GPPP-PT-C0010N0000000100, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r170-smll-158987815900473"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/GPPP-PT-C0010N0000000100.tgz
mv GPPP-PT-C0010N0000000100 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;