About the Execution of 2020-gold for QuasiCertifProtocol-COL-02
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 4276.172 | 3600000.00 | 14620.00 | 91.40 | FTFTFFFFFFTTFTTF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2021-input.r189-tajo-162089432400006.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
....................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2020
Input is QuasiCertifProtocol-COL-02, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r189-tajo-162089432400006
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 376K
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 109K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.3K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 72K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Mar 28 16:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 28 16:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 28 16:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 28 16:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 27 09:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 27 09:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 25 13:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 25 13:07 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 22 08:13 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 08:13 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_pt
-rw-r--r-- 1 mcc users 3 May 5 16:51 instance
-rw-r--r-- 1 mcc users 5 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 34K May 5 16:51 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME QuasiCertifProtocol-COL-02-00
FORMULA_NAME QuasiCertifProtocol-COL-02-01
FORMULA_NAME QuasiCertifProtocol-COL-02-02
FORMULA_NAME QuasiCertifProtocol-COL-02-03
FORMULA_NAME QuasiCertifProtocol-COL-02-04
FORMULA_NAME QuasiCertifProtocol-COL-02-05
FORMULA_NAME QuasiCertifProtocol-COL-02-06
FORMULA_NAME QuasiCertifProtocol-COL-02-07
FORMULA_NAME QuasiCertifProtocol-COL-02-08
FORMULA_NAME QuasiCertifProtocol-COL-02-09
FORMULA_NAME QuasiCertifProtocol-COL-02-10
FORMULA_NAME QuasiCertifProtocol-COL-02-11
FORMULA_NAME QuasiCertifProtocol-COL-02-12
FORMULA_NAME QuasiCertifProtocol-COL-02-13
FORMULA_NAME QuasiCertifProtocol-COL-02-14
FORMULA_NAME QuasiCertifProtocol-COL-02-15
=== Now, execution of the tool begins
BK_START 1621408745531
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-19 07:19:07] [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]
[2021-05-19 07:19:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-19 07:19:07] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
SLF4J: Failed to load class "org.slf4j.impl.StaticLoggerBinder".
SLF4J: Defaulting to no-operation (NOP) logger implementation
SLF4J: See http://www.slf4j.org/codes.html#StaticLoggerBinder for further details.
[2021-05-19 07:19:08] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 527 ms
[2021-05-19 07:19:08] [INFO ] sort/places :
tsidxtsid->n9,n8,n7,
Dot->malicious_reservoir,CstopAbort,SstopAbort,AstopAbort,a5,a4,a3,a2,a1,Astart,AstopOK,
tsid->n6,n5,n4,n3,n2,n1,c1,Cstart,Sstart,s2,s3,s4,s5,s6,SstopOK,CstopOK,
[2021-05-19 07:19:08] [INFO ] Imported 30 HL places and 26 HL transitions for a total of 86 PT places and 56.0 transition bindings in 25 ms.
[2021-05-19 07:19:08] [INFO ] Computed order based on color domains.
[2021-05-19 07:19:08] [INFO ] Unfolded HLPN to a Petri net with 86 places and 56 transitions in 8 ms.
[2021-05-19 07:19:08] [INFO ] Unfolded HLPN properties in 0 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 24 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 16412 resets, run finished after 269 ms. (steps per millisecond=371 ) properties seen :[1, 1, 1, 1, 0, 1, 1, 0, 0, 1, 0, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 1, 0, 0, 1, 0, 0, 0, 1, 1, 1, 1]
// Phase 1: matrix 56 rows 86 cols
[2021-05-19 07:19:08] [INFO ] Computed 31 place invariants in 6 ms
[2021-05-19 07:19:08] [INFO ] [Real]Absence check using 7 positive place invariants in 20 ms returned sat
[2021-05-19 07:19:08] [INFO ] [Real]Absence check using 7 positive and 24 generalized place invariants in 8 ms returned sat
[2021-05-19 07:19:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 07:19:08] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2021-05-19 07:19:08] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints in 7 ms.
[2021-05-19 07:19:08] [INFO ] Added : 14 causal constraints over 3 iterations in 34 ms. Result :sat
[2021-05-19 07:19:08] [INFO ] [Real]Absence check using 7 positive place invariants in 8 ms returned sat
[2021-05-19 07:19:08] [INFO ] [Real]Absence check using 7 positive and 24 generalized place invariants in 8 ms returned sat
[2021-05-19 07:19:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 07:19:08] [INFO ] [Real]Absence check using state equation in 38 ms returned unsat
[2021-05-19 07:19:08] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2021-05-19 07:19:08] [INFO ] [Real]Absence check using 7 positive and 24 generalized place invariants in 5 ms returned sat
[2021-05-19 07:19:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 07:19:08] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2021-05-19 07:19:08] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 07:19:08] [INFO ] [Nat]Absence check using 7 positive place invariants in 10 ms returned sat
[2021-05-19 07:19:08] [INFO ] [Nat]Absence check using 7 positive and 24 generalized place invariants in 5 ms returned sat
[2021-05-19 07:19:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 07:19:08] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2021-05-19 07:19:08] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints in 8 ms.
[2021-05-19 07:19:08] [INFO ] Added : 23 causal constraints over 5 iterations in 49 ms. Result :sat
[2021-05-19 07:19:08] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2021-05-19 07:19:08] [INFO ] [Real]Absence check using 7 positive and 24 generalized place invariants in 4 ms returned sat
[2021-05-19 07:19:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 07:19:09] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2021-05-19 07:19:09] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints in 4 ms.
[2021-05-19 07:19:09] [INFO ] Added : 22 causal constraints over 5 iterations in 29 ms. Result :sat
[2021-05-19 07:19:09] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2021-05-19 07:19:09] [INFO ] [Real]Absence check using 7 positive and 24 generalized place invariants in 6 ms returned sat
[2021-05-19 07:19:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 07:19:09] [INFO ] [Real]Absence check using state equation in 58 ms returned sat
[2021-05-19 07:19:09] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints in 5 ms.
[2021-05-19 07:19:09] [INFO ] Added : 23 causal constraints over 5 iterations in 35 ms. Result :sat
[2021-05-19 07:19:09] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2021-05-19 07:19:09] [INFO ] [Real]Absence check using 7 positive and 24 generalized place invariants in 7 ms returned sat
[2021-05-19 07:19:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 07:19:09] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2021-05-19 07:19:09] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints in 4 ms.
[2021-05-19 07:19:09] [INFO ] Added : 19 causal constraints over 4 iterations in 28 ms. Result :sat
[2021-05-19 07:19:09] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2021-05-19 07:19:09] [INFO ] [Real]Absence check using 7 positive and 24 generalized place invariants in 5 ms returned sat
[2021-05-19 07:19:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 07:19:09] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2021-05-19 07:19:09] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints in 3 ms.
[2021-05-19 07:19:09] [INFO ] Added : 11 causal constraints over 3 iterations in 22 ms. Result :sat
[2021-05-19 07:19:09] [INFO ] [Real]Absence check using 7 positive place invariants in 11 ms returned sat
[2021-05-19 07:19:09] [INFO ] [Real]Absence check using 7 positive and 24 generalized place invariants in 7 ms returned sat
[2021-05-19 07:19:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 07:19:09] [INFO ] [Real]Absence check using state equation in 37 ms returned unsat
[2021-05-19 07:19:09] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2021-05-19 07:19:09] [INFO ] [Real]Absence check using 7 positive and 24 generalized place invariants in 7 ms returned sat
[2021-05-19 07:19:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 07:19:09] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2021-05-19 07:19:09] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints in 3 ms.
[2021-05-19 07:19:09] [INFO ] Added : 14 causal constraints over 3 iterations in 19 ms. Result :sat
[2021-05-19 07:19:09] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2021-05-19 07:19:09] [INFO ] [Real]Absence check using 7 positive and 24 generalized place invariants in 5 ms returned sat
[2021-05-19 07:19:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 07:19:09] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2021-05-19 07:19:09] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints in 13 ms.
[2021-05-19 07:19:09] [INFO ] Added : 25 causal constraints over 5 iterations in 39 ms. Result :sat
[2021-05-19 07:19:09] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2021-05-19 07:19:09] [INFO ] [Real]Absence check using 7 positive and 24 generalized place invariants in 4 ms returned sat
[2021-05-19 07:19:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 07:19:09] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2021-05-19 07:19:09] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints in 17 ms.
[2021-05-19 07:19:09] [INFO ] Added : 24 causal constraints over 5 iterations in 56 ms. Result :sat
[2021-05-19 07:19:09] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2021-05-19 07:19:09] [INFO ] [Real]Absence check using 7 positive and 24 generalized place invariants in 5 ms returned sat
[2021-05-19 07:19:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 07:19:09] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2021-05-19 07:19:09] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints in 4 ms.
[2021-05-19 07:19:09] [INFO ] Added : 21 causal constraints over 5 iterations in 27 ms. Result :sat
[2021-05-19 07:19:09] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2021-05-19 07:19:09] [INFO ] [Real]Absence check using 7 positive and 24 generalized place invariants in 4 ms returned sat
[2021-05-19 07:19:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 07:19:09] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2021-05-19 07:19:09] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints in 4 ms.
[2021-05-19 07:19:09] [INFO ] Added : 22 causal constraints over 5 iterations in 28 ms. Result :sat
[2021-05-19 07:19:10] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2021-05-19 07:19:10] [INFO ] [Real]Absence check using 7 positive and 24 generalized place invariants in 4 ms returned sat
[2021-05-19 07:19:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 07:19:10] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2021-05-19 07:19:10] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints in 4 ms.
[2021-05-19 07:19:10] [INFO ] Added : 22 causal constraints over 5 iterations in 29 ms. Result :sat
Successfully simplified 2 atomic propositions for a total of 2 simplifications.
[2021-05-19 07:19:10] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2021-05-19 07:19:10] [INFO ] Flatten gal took : 34 ms
FORMULA QuasiCertifProtocol-COL-02-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-02-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-02-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-19 07:19:10] [INFO ] Applying decomposition
[2021-05-19 07:19:10] [INFO ] Flatten gal took : 13 ms
[2021-05-19 07:19:10] [INFO ] Decomposing Gal with order
[2021-05-19 07:19:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-19 07:19:10] [INFO ] Removed a total of 48 redundant transitions.
[2021-05-19 07:19:10] [INFO ] Flatten gal took : 38 ms
[2021-05-19 07:19:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 18 labels/synchronizations in 3 ms.
[2021-05-19 07:19:10] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2021-05-19 07:19:10] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 1 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ QuasiCertifProtocol-COL-02 @ 3570 seconds
FORMULA QuasiCertifProtocol-COL-02-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA QuasiCertifProtocol-COL-02-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA QuasiCertifProtocol-COL-02-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA QuasiCertifProtocol-COL-02-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA QuasiCertifProtocol-COL-02-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA QuasiCertifProtocol-COL-02-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA QuasiCertifProtocol-COL-02-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA QuasiCertifProtocol-COL-02-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA QuasiCertifProtocol-COL-02-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA QuasiCertifProtocol-COL-02-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA QuasiCertifProtocol-COL-02-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA QuasiCertifProtocol-COL-02-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA QuasiCertifProtocol-COL-02-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3566
rslt: Output for LTLFireability @ QuasiCertifProtocol-COL-02
{
"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": "Wed May 19 07:19:10 2021
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 4,
"U": 1,
"X": 2,
"aconj": 3,
"adisj": 2,
"aneg": 4,
"comp": 15,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 15,
"taut": 0,
"tconj": 4,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 11,
"visible_transitions": 0
},
"processed": "(((1 <= p65) OR (1 <= p64) OR (1 <= p66)) U ((F (G ((1 <= p80))) AND G ((X (G ((X ((((p35 <= 0) OR (p62 <= 0)) AND ((p36 <= 0) OR (p63 <= 0)) AND ((p34 <= 0) OR (p61 <= 0)))) AND ((p65 <= 0) AND ((p64 <= 0) AND (p66 <= 0)))))) OR G ((1 <= p80))))) OR (1 <= p79)))",
"processed_size": 268,
"rewrites": 100
},
"result":
{
"edges": 39,
"markings": 39,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 98
},
"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": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 1,
"aneg": 1,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "F (G ((X (((p71 <= 0) AND (p70 <= 0) AND (p72 <= 0))) OR (p79 <= 0))))",
"processed_size": 70,
"rewrites": 100
},
"result":
{
"edges": 3142,
"markings": 1040,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 1,
"X": 1,
"aconj": 5,
"adisj": 5,
"aneg": 2,
"comp": 17,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 17,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 9,
"visible_transitions": 0
},
"processed": "((G ((((p0 <= 0) OR (p70 <= 0)) AND ((p0 <= 0) OR (p71 <= 0)) AND ((p0 <= 0) OR (p72 <= 0)))) R X (((((1 <= p0) AND (1 <= p70)) OR ((1 <= p0) AND (1 <= p71)) OR ((1 <= p0) AND (1 <= p72))) AND ((p43 <= 0) OR (p44 <= 0) OR (p45 <= 0) OR (p80 <= 0))))) U (1 <= p77))",
"processed_size": 272,
"rewrites": 100
},
"result":
{
"edges": 31,
"markings": 31,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 8
},
"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": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 1,
"X": 2,
"aconj": 3,
"adisj": 1,
"aneg": 0,
"comp": 9,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 2,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "X (G ((((((1 <= p48) AND (1 <= p57)) OR ((1 <= p46) AND (1 <= p55)) OR ((1 <= p47) AND (1 <= p56))) U X (F ((1 <= p79)))) AND (G ((1 <= p79)) AND (1 <= p81)))))",
"processed_size": 162,
"rewrites": 100
},
"result":
{
"edges": 31,
"markings": 31,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"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": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 7,
"adisj": 5,
"aneg": 2,
"comp": 18,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 18,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 16,
"visible_transitions": 0
},
"processed": "G (F ((X (((((p42 <= 0) OR (p60 <= 0)) AND ((p41 <= 0) OR (p59 <= 0)) AND ((p40 <= 0) OR (p58 <= 0))) R (((1 <= p48) AND (1 <= p57)) OR ((1 <= p46) AND (1 <= p55)) OR ((1 <= p47) AND (1 <= p56))))) AND (((1 <= p0) AND (1 <= p66)) OR ((1 <= p0) AND (1 <= p64)) OR ((1 <= p0) AND (1 <= p65))))))",
"processed_size": 300,
"rewrites": 100
},
"result":
{
"edges": 33,
"markings": 33,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"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": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 3,
"adisj": 1,
"aneg": 0,
"comp": 9,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 2,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "X ((((1 <= p81) OR (G ((((1 <= p0) AND (1 <= p50)) OR ((1 <= p0) AND (1 <= p51)) OR ((1 <= p0) AND (1 <= p49)))) AND F ((1 <= p81)))) AND (1 <= p76)))",
"processed_size": 152,
"rewrites": 100
},
"result":
{
"edges": 31,
"markings": 31,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"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": 509
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 3,
"aconj": 3,
"adisj": 1,
"aneg": 1,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X (X (X (G ((((p0 <= 0) OR (p62 <= 0)) AND ((p0 <= 0) OR (p63 <= 0)) AND ((p0 <= 0) OR (p61 <= 0)))))))",
"processed_size": 106,
"rewrites": 100
},
"result":
{
"edges": 31,
"markings": 31,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"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": 594
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 0,
"aneg": 0,
"comp": 12,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 12,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "F (G ((F (((1 <= p31) AND (1 <= p32) AND (1 <= p33) AND (1 <= p76))) AND (((1 <= p43) AND (1 <= p44) AND (1 <= p45) AND (1 <= p80)) OR ((1 <= p31) AND (1 <= p32) AND (1 <= p33) AND (1 <= p76))))))",
"processed_size": 196,
"rewrites": 100
},
"result":
{
"edges": 10,
"markings": 9,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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": 713
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 4,
"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": "X (((p43 <= 0) OR (p44 <= 0) OR (p45 <= 0) OR (p80 <= 0)))",
"processed_size": 61,
"rewrites": 100
},
"result":
{
"edges": 4,
"markings": 5,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"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": true
},
"task":
{
"compoundnumber": 7,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 1,
"aneg": 0,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "F (G ((G ((((1 <= p42) AND (1 <= p60)) OR ((1 <= p41) AND (1 <= p59)) OR ((1 <= p40) AND (1 <= p58)))) AND (1 <= p79))))",
"processed_size": 122,
"rewrites": 100
},
"result":
{
"edges": 30,
"markings": 29,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 8,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 1,
"aneg": 1,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "(((p48 <= 0) OR (p57 <= 0)) AND ((p46 <= 0) OR (p55 <= 0)) AND ((p47 <= 0) OR (p56 <= 0)))",
"processed_size": 93,
"rewrites": 102
},
"result":
{
"edges": 3,
"markings": 4,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 7
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1189
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 2,
"X": 0,
"aconj": 7,
"adisj": 5,
"aneg": 0,
"comp": 20,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 20,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "((F ((p76 <= 0)) OR (G ((((1 <= p0) AND (1 <= p55)) OR ((1 <= p0) AND (1 <= p56)) OR ((1 <= p0) AND (1 <= p57)))) AND F ((p76 <= 0)))) U ((((1 <= p0) AND (1 <= p70)) OR ((1 <= p0) AND (1 <= p71)) OR ((1 <= p0) AND (1 <= p72))) U (((p0 <= 0) OR (p55 <= 0)) AND ((p0 <= 0) OR (p56 <= 0)) AND ((p0 <= 0) OR (p57 <= 0)))))",
"processed_size": 325,
"rewrites": 100
},
"result":
{
"edges": 74,
"markings": 59,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 7
},
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1783
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 0,
"aconj": 6,
"adisj": 2,
"aneg": 1,
"comp": 12,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 12,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 10,
"visible_transitions": 0
},
"processed": "G (F ((G (F ((((1 <= p42) AND (1 <= p60)) OR ((1 <= p41) AND (1 <= p59)) OR ((1 <= p40) AND (1 <= p58))))) OR (((p0 <= 0) OR (p50 <= 0)) AND ((p0 <= 0) OR (p51 <= 0)) AND ((p0 <= 0) OR (p49 <= 0))))))",
"processed_size": 205,
"rewrites": 100
},
"result":
{
"edges": 5155,
"markings": 1707,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3567
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3567
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 1,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "(((1 <= p35) AND (1 <= p62)) OR ((1 <= p36) AND (1 <= p63)) OR ((1 <= p34) AND (1 <= p61)))",
"processed_size": 93,
"rewrites": 102
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 10
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 12,
"type": "boolean"
}
},
{
"child":
[
{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 1,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "(((1 <= p35) AND (1 <= p62)) OR ((1 <= p36) AND (1 <= p63)) OR ((1 <= p34) AND (1 <= p61)))",
"processed_size": 93,
"rewrites": 102
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 10
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},
{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 1,
"aneg": 0,
"comp": 12,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 12,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 12,
"visible_transitions": 0
},
"processed": "G (F ((((1 <= p6) AND (1 <= p9) AND (1 <= p12) AND (1 <= p51)) OR ((1 <= p5) AND (1 <= p8) AND (1 <= p11) AND (1 <= p50)) OR ((1 <= p4) AND (1 <= p7) AND (1 <= p10) AND (1 <= p49)))))",
"processed_size": 185,
"rewrites": 100
},
"result":
{
"edges": 8,
"markings": 8,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "fairness",
"workflow": "product automaton"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 13,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 47028,
"runtime": 3.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(** U ((F(G(**)) AND G((X(G((X(*) AND (* AND (* AND *))))) OR G(**)))) OR **)) : F(G((X(*) OR **))) : ((G(*) R X(*)) U **) : ((F(**) OR (G(**) AND F(**))) U (** U **)) : X(G(((** U X(F(**))) AND (G(**) AND **)))) : G(F((X((* R *)) AND **))) : (F(*) AND G(F(**))) : X(((** OR (G(**) AND F(**))) AND **)) : F(**) : X(X(X(G(*)))) : G(F((G(F(**)) OR *))) : (X(*) OR F(G((F(**) AND (** OR **))))) : (X(G(*)) AND F(G((G(**) AND **))))"
},
"net":
{
"arcs": 223,
"conflict_clusters": 20,
"places": 86,
"places_significant": 55,
"singleton_clusters": 0,
"transitions": 56
},
"result":
{
"preliminary_value": "no yes no yes no no no no yes no yes yes no ",
"value": "no yes no yes no no no no yes no yes yes 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: 142/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 2752
lola: finding significant places
lola: 86 places, 56 transitions, 55 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: (((1 <= p65) OR (1 <= p64) OR (1 <= p66)) U (G ((X (NOT(F ((((X ((((1 <= p35) AND (1 <= p62)) OR ((1 <= p36) AND (1 <= p63)) OR ((1 <= p34) AND (1 <= p61)))) OR (1 <= p65)) OR (1 <= p64)) OR (1 <= p66))))) U G ((1 <= p80)))) OR (1 <= p79))) : ((1 <= 0) U X (F (G ((NOT(X (((1 <= p71) OR (1 <= p70) OR (1 <= p72)))) OR (p79 <= 0)))))) : (NOT((F ((((1 <= p0) AND (1 <= p70)) OR ((1 <= p0) AND (1 <= p71)) OR ((1 <= p0) AND (1 <= p72)))) U X (((((p0 <= 0) OR (p70 <= 0)) AND ((p0 <= 0) OR (p71 <= 0)) AND ((p0 <= 0) OR (p72 <= 0))) OR ((1 <= p43) AND (1 <= p44) AND (1 <= p45) AND (1 <= p80)))))) U (1 <= p77)) : ((G ((((1 <= p0) AND (1 <= p55)) OR ((1 <= p0) AND (1 <= p56)) OR ((1 <= p0) AND (1 <= p57)))) U (((1 <= p31) AND (1 <= p32) AND (1 <= p33) AND (1 <= p76)) U F ((p76 <= 0)))) U ((((1 <= p0) AND (1 <= p70)) OR ((1 <= p0) AND (1 <= p71)) OR ((1 <= p0) AND (1 <= p72))) U (((p0 <= 0) OR (p55 <= 0)) AND ((p0 <= 0) OR (p56 <= 0)) AND ((p0 <= 0) OR (p57 <= 0))))) : X (G (((((((1 <= p48) AND (1 <= p57)) OR ((1 <= p46) AND (1 <= p55)) OR ((1 <= p47) AND (1 <= p56))) U X (F ((1 <= p79)))) AND G ((1 <= p79))) AND (1 <= p81)))) : NOT(F (NOT(X (F ((NOT(X (((((1 <= p42) AND (1 <= p60)) OR ((1 <= p41) AND (1 <= p59)) OR ((1 <= p40) AND (1 <= p58))) U (((p48 <= 0) OR (p57 <= 0)) AND ((p46 <= 0) OR (p55 <= 0)) AND ((p47 <= 0) OR (p56 <= 0)))))) AND (((1 <= p0) AND (1 <= p66)) OR ((1 <= p0) AND (1 <= p64)) OR ((1 <= p0) AND (1 <= p65))))))))) : (NOT(G ((((1 <= p35) AND (1 <= p62)) OR ((1 <= p36) AND (1 <= p63)) OR ((1 <= p34) AND (1 <= p61))))) AND (X ((((((1 <= p81) U (((1 <= p35) AND (1 <= p62)) OR ((1 <= p36) AND (1 <= p63)) OR ((1 <= p34) AND (1 <= p61)))) OR ((1 <= p35) AND (1 <= p62))) OR ((1 <= p36) AND (1 <= p63))) OR ((1 <= p34) AND (1 <= p61)))) U G (F ((((1 <= p6) AND (1 <= p9) AND (1 <= p12) AND (1 <= p51)) OR ((1 <= p5) AND (1 <= p8) AND (1 <= p11) AND (1 <= p50)) OR ((1 <= p4) AND (1 <= p7) AND (1 <= p10) AND (1 <= p49))))))) : X (((G ((((1 <= p0) AND (1 <= p50)) OR ((1 <= p0) AND (1 <= p51)) OR ((1 <= p0) AND (1 <= p49)))) U (1 <= p81)) AND (1 <= p76))) : F ((((1 <= p48) AND (1 <= p57)) OR ((1 <= p46) AND (1 <= p55)) OR ((1 <= p47) AND (1 <= p56)))) : NOT(X (F (NOT(X (G (NOT(X ((((1 <= p0) AND (1 <= p62)) OR ((1 <= p0) AND (1 <= p63)) OR ((1 <= p0) AND (1 <= p61))))))))))) : G (NOT(G (X ((X (F (X (X (NOT(G (F ((((1 <= p42) AND (1 <= p60)) OR ((1 <= p41) AND (1 <= p59)) OR ((1 <= p40) AND (1 <= p58)))))))))) AND (((1 <= p0) AND (1 <= p50)) OR ((1 <= p0) AND (1 <= p51)) OR ((1 <= p0) AND (1 <= p49)))))))) : (NOT(X (((1 <= p43) AND (1 <= p44) AND (1 <= p45) AND (1 <= p80)))) OR F (X (G ((((1 <= p43) AND (1 <= p44) AND (1 <= p45) AND (1 <= p80)) U ((1 <= p31) AND (1 <= p32) AND (1 <= p33) AND (1 <= p76))))))) : (NOT(X (((1 <= p79) U ((((1 <= p42) AND (1 <= p60)) OR ((1 <= p41) AND (1 <= p59)) OR ((1 <= p40) AND (1 <= p58))) U F (((1 <= p37) AND (1 <= p38) AND (1 <= p39) AND (1 <= p78))))))) AND F (G ((G ((((1 <= p42) AND (1 <= p60)) OR ((1 <= p41) AND (1 <= p59)) OR ((1 <= p40) AND (1 <= p58)))) AND (1 <= p79)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:332
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:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:341
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:300
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:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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:300
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:425
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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: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:347
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
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:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p65) OR (1 <= p64) OR (1 <= p66)) U ((F (G ((1 <= p80))) AND G ((X (G ((X ((((p35 <= 0) OR (p62 <= 0)) AND ((p36 <= 0) OR (p63 <= 0)) AND ((p34 <= 0) OR (p61 <= 0)))) AND ((p65 <= 0) AND ((p64 <= 0) AND (p66 <= 0)))))) OR G ((1 <= p80))))) OR (1 <= p79)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (((1 <= p65) OR (1 <= p64) OR (1 <= p66)) U ((F (G ((1 <= p80))) AND G ((X (G ((X ((((p35 <= 0) OR (p62 <= 0)) AND ((p36 <= 0) OR (p63 <= 0)) AND ((p34 <= 0) OR (p61 <= 0)))) AND ((p65 <= 0) AND ((p64 <= 0) AND (p66 <= 0)))))) OR G ((1 <= p80))))) OR (1 <= p79)))
lola: processed formula length: 268
lola: 100 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 98 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: 39 markings, 39 edges
lola: ========================================
lola: subprocess 1 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((X (((p71 <= 0) AND (p70 <= 0) AND (p72 <= 0))) OR (p79 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((X (((p71 <= 0) AND (p70 <= 0) AND (p72 <= 0))) OR (p79 <= 0))))
lola: processed formula length: 70
lola: 100 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: 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: 1040 markings, 3142 edges
lola: ========================================
lola: subprocess 2 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((G ((((p0 <= 0) OR (p70 <= 0)) AND ((p0 <= 0) OR (p71 <= 0)) AND ((p0 <= 0) OR (p72 <= 0)))) R X (((((1 <= p0) AND (1 <= p70)) OR ((1 <= p0) AND (1 <= p71)) OR ((1 <= p0) AND (1 <= p72))) AND ((p43 <= 0) OR (p44 <= 0) OR (p45 <= 0) OR (p80 <= 0))))) U (1 <= p77))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((G ((((p0 <= 0) OR (p70 <= 0)) AND ((p0 <= 0) OR (p71 <= 0)) AND ((p0 <= 0) OR (p72 <= 0)))) R X (((((1 <= p0) AND (1 <= p70)) OR ((1 <= p0) AND (1 <= p71)) OR ((1 <= p0) AND (1 <= p72))) AND ((p43 <= 0) OR (p44 <= 0) OR (p45 <= 0) OR (p80 <= 0))))) U (1 <= p77))
lola: processed formula length: 272
lola: 100 rewrites
lola: closed formula file LTLFireability.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: 31 markings, 31 edges
lola: ========================================
lola: subprocess 3 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((((((1 <= p48) AND (1 <= p57)) OR ((1 <= p46) AND (1 <= p55)) OR ((1 <= p47) AND (1 <= p56))) U X (F ((1 <= p79)))) AND (G ((1 <= p79)) AND (1 <= p81)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((((((1 <= p48) AND (1 <= p57)) OR ((1 <= p46) AND (1 <= p55)) OR ((1 <= p47) AND (1 <= p56))) U X (F ((1 <= p79)))) AND (G ((1 <= p79)) AND (1 <= p81)))))
lola: processed formula length: 162
lola: 100 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: 31 markings, 31 edges
lola: ========================================
lola: subprocess 4 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((X (((((p42 <= 0) OR (p60 <= 0)) AND ((p41 <= 0) OR (p59 <= 0)) AND ((p40 <= 0) OR (p58 <= 0))) R (((1 <= p48) AND (1 <= p57)) OR ((1 <= p46) AND (1 <= p55)) OR ((1 <= p47) AND (1 <= p56))))) AND (((1 <= p0) AND (1 <= p66)) OR ((1 <= p0) AND (1 <= p64)) OR ((1 <= p0) AND (1 <= p65))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((X (((((p42 <= 0) OR (p60 <= 0)) AND ((p41 <= 0) OR (p59 <= 0)) AND ((p40 <= 0) OR (p58 <= 0))) R (((1 <= p48) AND (1 <= p57)) OR ((1 <= p46) AND (1 <= p55)) OR ((1 <= p47) AND (1 <= p56))))) AND (((1 <= p0) AND (1 <= p66)) OR ((1 <= p0) AND (1 <= p64)) OR ((1 <= p0) AND (1 <= p65))))))
lola: processed formula length: 300
lola: 100 rewrites
lola: closed formula file LTLFireability.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: 33 markings, 33 edges
lola: ========================================
lola: subprocess 5 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((((1 <= p81) OR (G ((((1 <= p0) AND (1 <= p50)) OR ((1 <= p0) AND (1 <= p51)) OR ((1 <= p0) AND (1 <= p49)))) AND F ((1 <= p81)))) AND (1 <= p76)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((((1 <= p81) OR (G ((((1 <= p0) AND (1 <= p50)) OR ((1 <= p0) AND (1 <= p51)) OR ((1 <= p0) AND (1 <= p49)))) AND F ((1 <= p81)))) AND (1 <= p76)))
lola: processed formula length: 152
lola: 100 rewrites
lola: closed formula file LTLFireability.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: 31 markings, 31 edges
lola: ========================================
lola: subprocess 6 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (X (G ((((p0 <= 0) OR (p62 <= 0)) AND ((p0 <= 0) OR (p63 <= 0)) AND ((p0 <= 0) OR (p61 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (X (G ((((p0 <= 0) OR (p62 <= 0)) AND ((p0 <= 0) OR (p63 <= 0)) AND ((p0 <= 0) OR (p61 <= 0)))))))
lola: processed formula length: 106
lola: 100 rewrites
lola: closed formula file LTLFireability.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: 31 markings, 31 edges
lola: ========================================
lola: subprocess 7 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (((p43 <= 0) OR (p44 <= 0) OR (p45 <= 0) OR (p80 <= 0))) OR F (G ((F (((1 <= p31) AND (1 <= p32) AND (1 <= p33) AND (1 <= p76))) AND (((1 <= p43) AND (1 <= p44) AND (1 <= p45) AND (1 <= p80)) OR ((1 <= p31) AND (1 <= p32) AND (1 <= p33) AND (1 <= p76)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((F (((1 <= p31) AND (1 <= p32) AND (1 <= p33) AND (1 <= p76))) AND (((1 <= p43) AND (1 <= p44) AND (1 <= p45) AND (1 <= p80)) OR ((1 <= p31) AND (1 <= p32) AND (1 <= p33) AND (1 <= p76))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((F (((1 <= p31) AND (1 <= p32) AND (1 <= p33) AND (1 <= p76))) AND (((1 <= p43) AND (1 <= p44) AND (1 <= p45) AND (1 <= p80)) OR ((1 <= p31) AND (1 <= p32) AND (1 <= p33) AND (1 <= p76))))))
lola: processed formula length: 196
lola: 100 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: 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: 9 markings, 10 edges
lola: ========================================
lola: subprocess 8 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((p43 <= 0) OR (p44 <= 0) OR (p45 <= 0) OR (p80 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((p43 <= 0) OR (p44 <= 0) OR (p45 <= 0) OR (p80 <= 0)))
lola: processed formula length: 61
lola: 100 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 5 markings, 4 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 8 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (G (((p37 <= 0) OR (p38 <= 0) OR (p39 <= 0) OR (p78 <= 0)))) AND F (G ((G ((((1 <= p42) AND (1 <= p60)) OR ((1 <= p41) AND (1 <= p59)) OR ((1 <= p40) AND (1 <= p58)))) AND (1 <= p79)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((G ((((1 <= p42) AND (1 <= p60)) OR ((1 <= p41) AND (1 <= p59)) OR ((1 <= p40) AND (1 <= p58)))) AND (1 <= p79))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((G ((((1 <= p42) AND (1 <= p60)) OR ((1 <= p41) AND (1 <= p59)) OR ((1 <= p40) AND (1 <= p58)))) AND (1 <= p79))))
lola: processed formula length: 122
lola: 100 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: 29 markings, 30 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 9 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((((1 <= p48) AND (1 <= p57)) OR ((1 <= p46) AND (1 <= p55)) OR ((1 <= p47) AND (1 <= p56))))
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: (((p48 <= 0) OR (p57 <= 0)) AND ((p46 <= 0) OR (p55 <= 0)) AND ((p47 <= 0) OR (p56 <= 0)))
lola: processed formula length: 93
lola: 102 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: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 4 markings, 3 edges
lola: ========================================
lola: subprocess 10 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((F ((p76 <= 0)) OR (G ((((1 <= p0) AND (1 <= p55)) OR ((1 <= p0) AND (1 <= p56)) OR ((1 <= p0) AND (1 <= p57)))) AND F ((p76 <= 0)))) U ((((1 <= p0) AND (1 <= p70)) OR ((1 <= p0) AND (1 <= p71)) OR ((1 <= p0) AND (1 <= p72))) U (((p0 <= 0) OR (p55 <= 0)) AND ((p0 <= 0) OR (p56 <= 0)) AND ((p0 <= 0) OR (p57 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((F ((p76 <= 0)) OR (G ((((1 <= p0) AND (1 <= p55)) OR ((1 <= p0) AND (1 <= p56)) OR ((1 <= p0) AND (1 <= p57)))) AND F ((p76 <= 0)))) U ((((1 <= p0) AND (1 <= p70)) OR ((1 <= p0) AND (1 <= p71)) OR ((1 <= p0) AND (1 <= p72))) U (((p0 <= 0) OR (p55 <= 0)) AND ((p0 <= 0) OR (p56 <= 0)) AND ((p0 <= 0) OR (p57 <= 0)))))
lola: processed formula length: 325
lola: 100 rewrites
lola: closed formula file LTLFireability.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: 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 59 markings, 74 edges
lola: ========================================
lola: subprocess 11 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((G (F ((((1 <= p42) AND (1 <= p60)) OR ((1 <= p41) AND (1 <= p59)) OR ((1 <= p40) AND (1 <= p58))))) OR (((p0 <= 0) OR (p50 <= 0)) AND ((p0 <= 0) OR (p51 <= 0)) AND ((p0 <= 0) OR (p49 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((G (F ((((1 <= p42) AND (1 <= p60)) OR ((1 <= p41) AND (1 <= p59)) OR ((1 <= p40) AND (1 <= p58))))) OR (((p0 <= 0) OR (p50 <= 0)) AND ((p0 <= 0) OR (p51 <= 0)) AND ((p0 <= 0) OR (p49 <= 0))))))
lola: processed formula length: 205
lola: 100 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: 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1707 markings, 5155 edges
lola: ========================================
lola: subprocess 12 will run for 3567 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F ((((p35 <= 0) OR (p62 <= 0)) AND ((p36 <= 0) OR (p63 <= 0)) AND ((p34 <= 0) OR (p61 <= 0)))) AND G (F ((((1 <= p6) AND (1 <= p9) AND (1 <= p12) AND (1 <= p51)) OR ((1 <= p5) AND (1 <= p8) AND (1 <= p11) AND (1 <= p50)) OR ((1 <= p4) AND (1 <= p7) AND (1 <= p10) AND (1 <= p49))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 3567 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((((p35 <= 0) OR (p62 <= 0)) AND ((p36 <= 0) OR (p63 <= 0)) AND ((p34 <= 0) OR (p61 <= 0))))
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: (((1 <= p35) AND (1 <= p62)) OR ((1 <= p36) AND (1 <= p63)) OR ((1 <= p34) AND (1 <= p61)))
lola: processed formula length: 93
lola: 102 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: 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: ...considering subproblem: (F ((((p35 <= 0) OR (p62 <= 0)) AND ((p36 <= 0) OR (p63 <= 0)) AND ((p34 <= 0) OR (p61 <= 0)))) AND G (F ((((1 <= p6) AND (1 <= p9) AND (1 <= p12) AND (1 <= p51)) OR ((1 <= p5) AND (1 <= p8) AND (1 <= p11) AND (1 <= p50)) OR ((1 <= p4) AND (1 <= p7) AND (1 <= p10) AND (1 <= p49))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: F ((((p35 <= 0) OR (p62 <= 0)) AND ((p36 <= 0) OR (p63 <= 0)) AND ((p34 <= 0) OR (p61 <= 0))))
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: (((1 <= p35) AND (1 <= p62)) OR ((1 <= p36) AND (1 <= p63)) OR ((1 <= p34) AND (1 <= p61)))
lola: processed formula length: 93
lola: 102 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: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: G (F ((((1 <= p6) AND (1 <= p9) AND (1 <= p12) AND (1 <= p51)) OR ((1 <= p5) AND (1 <= p8) AND (1 <= p11) AND (1 <= p50)) OR ((1 <= p4) AND (1 <= p7) AND (1 <= p10) AND (1 <= p49)))))
lola: ========================================
lola: SUBTASK
lola: checking fairness
lola: fairness not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((((1 <= p6) AND (1 <= p9) AND (1 <= p12) AND (1 <= p51)) OR ((1 <= p5) AND (1 <= p8) AND (1 <= p11) AND (1 <= p50)) OR ((1 <= p4) AND (1 <= p7) AND (1 <= p10) AND (1 <= p49)))))
lola: processed formula length: 185
lola: 100 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: ========================================
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: 8 markings, 8 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes no yes no no no no yes no yes yes no
lola:
preliminary result: no yes no yes no no no no yes no yes yes no
lola: memory consumption: 47028 KB
lola: time consumption: 3 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="QuasiCertifProtocol-COL-02"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2020"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool gold2020"
echo " Input is QuasiCertifProtocol-COL-02, 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 r189-tajo-162089432400006"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/QuasiCertifProtocol-COL-02.tgz
mv QuasiCertifProtocol-COL-02 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 ;