Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fko/mcc2021-input.r056-oct2-162038334800226.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2021-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2020
Input is CloudOpsManagement-PT-05120by02560, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r056-oct2-162038334800226
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 476K
-rw-r--r-- 1 mcc users 22K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 142K May 10 09:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 17K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 121K May 10 09:42 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.4K Mar 28 15:53 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 28 15:53 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 28 15:53 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 28 15:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.5K Mar 23 03:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 23 03:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.4K Mar 22 12:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 22 12:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Mar 22 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 13 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 17K 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 CloudOpsManagement-PT-05120by02560-00
FORMULA_NAME CloudOpsManagement-PT-05120by02560-01
FORMULA_NAME CloudOpsManagement-PT-05120by02560-02
FORMULA_NAME CloudOpsManagement-PT-05120by02560-03
FORMULA_NAME CloudOpsManagement-PT-05120by02560-04
FORMULA_NAME CloudOpsManagement-PT-05120by02560-05
FORMULA_NAME CloudOpsManagement-PT-05120by02560-06
FORMULA_NAME CloudOpsManagement-PT-05120by02560-07
FORMULA_NAME CloudOpsManagement-PT-05120by02560-08
FORMULA_NAME CloudOpsManagement-PT-05120by02560-09
FORMULA_NAME CloudOpsManagement-PT-05120by02560-10
FORMULA_NAME CloudOpsManagement-PT-05120by02560-11
FORMULA_NAME CloudOpsManagement-PT-05120by02560-12
FORMULA_NAME CloudOpsManagement-PT-05120by02560-13
FORMULA_NAME CloudOpsManagement-PT-05120by02560-14
FORMULA_NAME CloudOpsManagement-PT-05120by02560-15

=== Now, execution of the tool begins

BK_START 1620903482706

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-13 10:58:04] [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-13 10:58:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 10:58:04] [INFO ] Load time of PNML (sax parser for PT used): 22 ms
[2021-05-13 10:58:04] [INFO ] Transformed 27 places.
[2021-05-13 10:58:04] [INFO ] Transformed 29 transitions.
[2021-05-13 10:58:04] [INFO ] Parsed PT model containing 27 places and 29 transitions in 55 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 102435 steps, including 0 resets, run finished after 62 ms. (steps per millisecond=1652 ) properties seen :[1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 0, 1, 1, 1, 0, 1]
// Phase 1: matrix 29 rows 27 cols
[2021-05-13 10:58:04] [INFO ] Computed 11 place invariants in 2 ms
[2021-05-13 10:58:04] [INFO ] [Real]Absence check using 11 positive place invariants in 27 ms returned sat
[2021-05-13 10:58:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:58:04] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2021-05-13 10:58:04] [INFO ] State equation strengthened by 3 read => feed constraints.
[2021-05-13 10:58:04] [INFO ] [Real]Added 3 Read/Feed constraints in 5 ms returned sat
[2021-05-13 10:58:04] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 7 ms.
[2021-05-13 10:58:04] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:58:04] [INFO ] [Nat]Absence check using 11 positive place invariants in 34 ms returned sat
[2021-05-13 10:58:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 10:58:05] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2021-05-13 10:58:05] [INFO ] [Nat]Added 3 Read/Feed constraints in 27 ms returned sat
[2021-05-13 10:58:05] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 6 ms.
[2021-05-13 10:58:05] [INFO ] Added : 25 causal constraints over 5 iterations in 53 ms. Result :sat
[2021-05-13 10:58:05] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned unsat
[2021-05-13 10:58:05] [INFO ] [Real]Absence check using 11 positive place invariants in 14 ms returned sat
[2021-05-13 10:58:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:58:05] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2021-05-13 10:58:05] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-13 10:58:05] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 2 ms.
[2021-05-13 10:58:05] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:58:05] [INFO ] [Nat]Absence check using 11 positive place invariants in 12 ms returned sat
[2021-05-13 10:58:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 10:58:05] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2021-05-13 10:58:05] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-13 10:58:05] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 17 ms.
[2021-05-13 10:58:05] [INFO ] Added : 25 causal constraints over 6 iterations in 50 ms. Result :sat
[2021-05-13 10:58:05] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2021-05-13 10:58:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:58:05] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2021-05-13 10:58:05] [INFO ] [Real]Added 3 Read/Feed constraints in 5 ms returned sat
[2021-05-13 10:58:05] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 2 ms.
[2021-05-13 10:58:05] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:58:05] [INFO ] [Nat]Absence check using 11 positive place invariants in 15 ms returned sat
[2021-05-13 10:58:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 10:58:05] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2021-05-13 10:58:05] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
[2021-05-13 10:58:05] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 10 ms.
[2021-05-13 10:58:05] [INFO ] Added : 25 causal constraints over 6 iterations in 34 ms. Result :sat
[2021-05-13 10:58:05] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2021-05-13 10:58:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:58:05] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2021-05-13 10:58:05] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-13 10:58:05] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 2 ms.
[2021-05-13 10:58:05] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:58:05] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2021-05-13 10:58:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 10:58:05] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2021-05-13 10:58:05] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-13 10:58:05] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 5 ms.
[2021-05-13 10:58:05] [INFO ] Added : 25 causal constraints over 6 iterations in 31 ms. Result :sat
Successfully simplified 1 atomic propositions for a total of 1 simplifications.
[2021-05-13 10:58:05] [INFO ] Initial state reduction rules for CTL removed 6 formulas.
[2021-05-13 10:58:05] [INFO ] Flatten gal took : 38 ms
FORMULA CloudOpsManagement-PT-05120by02560-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudOpsManagement-PT-05120by02560-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudOpsManagement-PT-05120by02560-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudOpsManagement-PT-05120by02560-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudOpsManagement-PT-05120by02560-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudOpsManagement-PT-05120by02560-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-13 10:58:05] [INFO ] Flatten gal took : 5 ms
[2021-05-13 10:58:05] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 4 ms.
[2021-05-13 10:58:05] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 1 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ CloudOpsManagement-PT-05120by02560 @ 3570 seconds

FORMULA CloudOpsManagement-PT-05120by02560-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-05120by02560-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-05120by02560-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-05120by02560-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-05120by02560-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-05120by02560-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-05120by02560-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-05120by02560-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-05120by02560-01 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-05120by02560-02 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3127
rslt: Output for LTLFireability @ CloudOpsManagement-PT-05120by02560

{
"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": "Thu May 13 10:58:06 2021
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 0,
"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": 2,
"visible_transitions": 0
},
"processed": "X ((F (G (((p8 <= 0) OR (p9 <= 0)))) OR ((1 <= p8) AND (1 <= p9))))",
"processed_size": 68,
"rewrites": 37
},
"result":
{
"edges": 2567,
"markings": 2567,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 477
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 477
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "((1 <= p10) AND (1 <= p25))",
"processed_size": 27,
"rewrites": 38
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 3,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 557
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "G (F ((1 <= p11)))",
"processed_size": 18,
"rewrites": 37
},
"result":
{
"edges": 20486,
"markings": 20486,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 4,
"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": 668
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "F (G ((1 <= p22)))",
"processed_size": 18,
"rewrites": 37
},
"result":
{
"edges": 15367,
"markings": 15366,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 3,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 557
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 3,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X (F ((F ((1 <= p2)) AND ((1 <= p11) AND ((1 <= p12) AND (1 <= p25))))))",
"processed_size": 72,
"rewrites": 37
},
"result":
{
"edges": 2565,
"markings": 2565,
"produced_by": "LTL model checker",
"value": false
},
"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": 668
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 2,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(((1 <= p14) U X (X (F ((1 <= p14))))) U (1 <= p15))",
"processed_size": 52,
"rewrites": 37
},
"result":
{
"edges": 2565,
"markings": 2565,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"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": 835
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 835
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "((1 <= p5) AND (1 <= p7) AND (1 <= p26))",
"processed_size": 40,
"rewrites": 37
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 6,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1114
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"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 ((p11 <= 0))",
"processed_size": 14,
"rewrites": 37
},
"result":
{
"edges": 2565,
"markings": 2565,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 6,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1114
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 1,
"X": 1,
"aconj": 3,
"adisj": 0,
"aneg": 1,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "(F ((X (G (((1 <= p3) AND (1 <= p4)))) OR ((1 <= p8) AND (1 <= p25)))) U G (((p13 <= 0))))",
"processed_size": 90,
"rewrites": 37
},
"result":
{
"edges": 2568,
"markings": 2567,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1671
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 3,
"U": 1,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 2,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "G ((F ((p15 <= 0)) AND ((X (G ((1 <= p24))) U (G ((1 <= p22)) AND X ((1 <= p15)))) OR (p15 <= 0))))",
"processed_size": 99,
"rewrites": 37
},
"result":
{
"edges": 2569,
"markings": 2568,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 10
},
"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"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3342
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "F (G (((1 <= p3) AND (1 <= p4) AND (1 <= p5) AND (1 <= p7) AND (1 <= p26) AND ((p13 <= 0) OR (p17 <= 0) OR (p21 <= 0)))))",
"processed_size": 123,
"rewrites": 37
},
"result":
{
"edges": 2567,
"markings": 2566,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
}
],
"exit":
{
"error": null,
"memory": 3452,
"runtime": 443.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "X((F(G(*)) OR **)) : X(X(((X(X(G(**))) AND F(**)) U **))) : X(X(G(*))) : ((X(**) AND (F(G(**)) AND (** AND **))) OR (G(F(**)) AND F((X(**) AND (F(G(**)) AND (** AND **)))))) : F(G(**)) : X(F((F(**) AND (** AND (** AND **))))) : ((** U X(X(F(**)))) U **) : (X(**) AND (** OR (G(*) AND F(**)))) : (F((X(G(**)) OR **)) U G(*)) : G((F(**) AND ((X(G(**)) U (G(**) AND X(**))) OR **)))"
},
"net":
{
"arcs": 94,
"conflict_clusters": 11,
"places": 27,
"places_significant": 16,
"singleton_clusters": 0,
"transitions": 29
},
"result":
{
"preliminary_value": "no unknown unknown no no no no no no no ",
"value": "no unknown unknown no no no no no no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 56/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 864
lola: finding significant places
lola: 27 places, 29 transitions, 16 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from LTLFireability.xml
lola: LP says that atomic proposition is always true: (1 <= p16)
lola: X ((G (F (G (NOT(F ((((1 <= p8) AND (1 <= p9)) U ((1 <= p8) AND (1 <= p9)))))))) OR ((1 <= p8) AND (1 <= p9)))) : X (X (((G (X (X (((1 <= p0) AND (1 <= p26))))) AND F (((1 <= p7) U (1 <= p20)))) U ((1 <= p0) AND (1 <= p26) AND (1 <= p7))))) : X (X (NOT(F ((1 <= p22))))) : (G (F ((1 <= p11))) U (((X ((1 <= p11)) AND F (X (G ((1 <= p22))))) AND (1 <= p10)) AND (1 <= p25))) : F ((F (((1 <= p5) AND (1 <= p7) AND (1 <= p26))) U F (G (((1 <= p3) AND (1 <= p4) AND (1 <= p5) AND (1 <= p7) AND (1 <= p26) AND ((p13 <= 0) OR (p17 <= 0) OR (p21 <= 0))))))) : X (F ((((F ((1 <= p2)) AND (1 <= p11)) AND (1 <= p12)) AND (1 <= p25)))) : (((1 <= p14) U NOT(X (NOT(F (X ((1 <= p14))))))) U (1 <= p15)) : (X ((p14 <= 0)) AND (NOT(F ((1 <= p11))) U ((1 <= p5) AND (1 <= p7) AND (1 <= p26)))) : (F ((X (G (((1 <= p3) AND (1 <= p4)))) OR ((1 <= p8) AND (1 <= p25)))) U NOT(F (((1 <= p13))))) : G (((G (X ((1 <= p24))) U (G ((1 <= p22)) AND X ((1 <= p15)))) U (p15 <= 0)))
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k: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:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((F (G (((p8 <= 0) OR (p9 <= 0)))) OR ((1 <= p8) AND (1 <= p9))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((F (G (((p8 <= 0) OR (p9 <= 0)))) OR ((1 <= p8) AND (1 <= p9))))
lola: processed formula length: 68
lola: 37 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 2567 markings, 2567 edges
lola: ========================================
lola: subprocess 1 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (((X (X (G (((1 <= p0) AND (1 <= p26))))) AND F ((1 <= p20))) U ((1 <= p0) AND (1 <= p26) AND (1 <= p7)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (((X (X (G (((1 <= p0) AND (1 <= p26))))) AND F ((1 <= p20))) U ((1 <= p0) AND (1 <= p26) AND (1 <= p7)))))
lola: processed formula length: 112
lola: 37 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: 5096558 markings, 7682541 edges, 1019312 markings/sec, 0 secs
lola: 9810956 markings, 14775469 edges, 942880 markings/sec, 5 secs
lola: 14547371 markings, 21898322 edges, 947283 markings/sec, 10 secs
lola: 19265124 markings, 28990941 edges, 943551 markings/sec, 15 secs
lola: 23992467 markings, 36096863 edges, 945469 markings/sec, 20 secs
lola: 28630274 markings, 43067232 edges, 927561 markings/sec, 25 secs
lola: 33236591 markings, 49989423 edges, 921263 markings/sec, 30 secs
lola: 37801420 markings, 56849001 edges, 912966 markings/sec, 35 secs
lola: 42489085 markings, 63892593 edges, 937533 markings/sec, 40 secs
lola: 47130947 markings, 70866773 edges, 928372 markings/sec, 45 secs
lola: 51664857 markings, 77678373 edges, 906782 markings/sec, 50 secs
lola: 56211256 markings, 84508713 edges, 909280 markings/sec, 55 secs
lola: 60719029 markings, 91280163 edges, 901555 markings/sec, 60 secs
lola: 65277034 markings, 98127398 edges, 911601 markings/sec, 65 secs
lola: 69798015 markings, 104918560 edges, 904196 markings/sec, 70 secs
lola: 72441749 markings, 108889790 edges, 528747 markings/sec, 75 secs
lola: 75084013 markings, 112860662 edges, 528453 markings/sec, 80 secs
lola: 78780700 markings, 118419515 edges, 739337 markings/sec, 85 secs
lola: 82539672 markings, 124057334 edges, 751794 markings/sec, 90 secs
lola: 86102469 markings, 129413644 edges, 712559 markings/sec, 95 secs
lola: 89625695 markings, 134700519 edges, 704645 markings/sec, 100 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 2 will run for 432 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (G ((p22 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (G ((p22 <= 0))))
lola: processed formula length: 22
lola: 37 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 5100621 markings, 7688700 edges, 1020124 markings/sec, 0 secs
lola: 9890611 markings, 14895363 edges, 957998 markings/sec, 5 secs
lola: 14685101 markings, 22105318 edges, 958898 markings/sec, 10 secs
lola: 19554325 markings, 29425733 edges, 973845 markings/sec, 15 secs
lola: 24387817 markings, 36691038 edges, 966698 markings/sec, 20 secs
lola: 29167299 markings, 43874353 edges, 955896 markings/sec, 25 secs
lola: 33920999 markings, 51018127 edges, 950740 markings/sec, 30 secs
lola: 38438970 markings, 57806948 edges, 903594 markings/sec, 35 secs
lola: 43078830 markings, 64778508 edges, 927972 markings/sec, 40 secs
lola: 47708461 markings, 71734239 edges, 925926 markings/sec, 45 secs
lola: 52292443 markings, 78621191 edges, 916796 markings/sec, 50 secs
lola: 56858740 markings, 85481212 edges, 913259 markings/sec, 55 secs
lola: 61213341 markings, 92022830 edges, 870920 markings/sec, 60 secs
lola: 65480519 markings, 98433139 edges, 853436 markings/sec, 65 secs
lola: 69668643 markings, 104724060 edges, 837625 markings/sec, 70 secs
lola: 73526626 markings, 110520398 edges, 771597 markings/sec, 75 secs
lola: 76678813 markings, 115255742 edges, 630437 markings/sec, 80 secs
lola: 79702427 markings, 119796099 edges, 604723 markings/sec, 85 secs
lola: 82224190 markings, 123583386 edges, 504353 markings/sec, 90 secs
lola: 84417771 markings, 126878127 edges, 438716 markings/sec, 95 secs
lola: 85739271 markings, 128863208 edges, 264300 markings/sec, 100 secs
lola: 86537883 markings, 130062671 edges, 159722 markings/sec, 105 secs
lola: 89713126 markings, 134831719 edges, 635049 markings/sec, 110 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 3 will run for 477 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((X ((1 <= p11)) AND (F (G ((1 <= p22))) AND ((1 <= p10) AND (1 <= p25)))) OR (G (F ((1 <= p11))) AND F ((X ((1 <= p11)) AND (F (G ((1 <= p22))) AND ((1 <= p10) AND (1 <= p25)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 477 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p10) AND (1 <= p25))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: processed formula: ((1 <= p10) AND (1 <= p25))
lola: processed formula length: 27
lola: 38 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 4 will run for 557 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((1 <= p11)))
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 <= p11)))
lola: processed formula length: 18
lola: 37 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 20486 markings, 20486 edges
lola: ========================================
lola: subprocess 5 will run for 668 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((1 <= p22)))
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 ((1 <= p22)))
lola: processed formula length: 18
lola: 37 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: add low 3
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: 15366 markings, 15367 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 4 will run for 557 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((F ((1 <= p2)) AND ((1 <= p11) AND ((1 <= p12) AND (1 <= p25))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((F ((1 <= p2)) AND ((1 <= p11) AND ((1 <= p12) AND (1 <= p25))))))
lola: processed formula length: 72
lola: 37 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 2565 markings, 2565 edges
lola: ========================================
lola: subprocess 5 will run for 668 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p14) U X (X (F ((1 <= p14))))) U (1 <= p15))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (((1 <= p14) U X (X (F ((1 <= p14))))) U (1 <= p15))
lola: processed formula length: 52
lola: 37 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: 2565 markings, 2565 edges
lola: subprocess 6 will run for 835 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X ((p14 <= 0)) AND (((1 <= p5) AND (1 <= p7) AND (1 <= p26)) OR (G ((p11 <= 0)) AND F (((1 <= p5) AND (1 <= p7) AND (1 <= p26))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: subprocess 6 will run for 835 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p5) AND (1 <= p7) AND (1 <= p26))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p5) AND (1 <= p7) AND (1 <= p26))
lola: processed formula length: 40
lola: 37 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 3 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 7 will run for 1114 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((p11 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((p11 <= 0))
lola: processed formula length: 14
lola: 37 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 2565 markings, 2565 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 7 will run for 1114 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F ((X (G (((1 <= p3) AND (1 <= p4)))) OR ((1 <= p8) AND (1 <= p25)))) U G (((p13 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (F ((X (G (((1 <= p3) AND (1 <= p4)))) OR ((1 <= p8) AND (1 <= p25)))) U G (((p13 <= 0))))
lola: processed formula length: 90
lola: 37 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: add low 25
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: 2567 markings, 2568 edges
lola: ========================================
lola: subprocess 8 will run for 1671 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((F ((p15 <= 0)) AND ((X (G ((1 <= p24))) U (G ((1 <= p22)) AND X ((1 <= p15)))) OR (p15 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((F ((p15 <= 0)) AND ((X (G ((1 <= p24))) U (G ((1 <= p22)) AND X ((1 <= p15)))) OR (p15 <= 0))))
lola: processed formula length: 99
lola: 37 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 10 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: 2568 markings, 2569 edges
lola: ========================================
lola: subprocess 9 will run for 3342 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((1 <= p3) AND (1 <= p4) AND (1 <= p5) AND (1 <= p7) AND (1 <= p26) AND ((p13 <= 0) OR (p17 <= 0) OR (p21 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G (((1 <= p3) AND (1 <= p4) AND (1 <= p5) AND (1 <= p7) AND (1 <= p26) AND ((p13 <= 0) OR (p17 <= 0) OR (p21 <= 0)))))
lola: processed formula length: 123
lola: 37 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: add low 25
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: 2566 markings, 2567 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: X (X (((X (X (G (((1 <= p0) AND (1 <= p26))))) AND F ((1 <= p20))) U ((1 <= p0) AND (1 <= p26) AND (1 <= p7)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (((X (X (G (((1 <= p0) AND (1 <= p26))))) AND F ((1 <= p20))) U ((1 <= p0) AND (1 <= p26) AND (1 <= p7)))))
lola: processed formula length: 112
lola: 37 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: 5035926 markings, 7591353 edges, 1007185 markings/sec, 0 secs
lola: 9783771 markings, 14734696 edges, 949569 markings/sec, 5 secs
lola: 14509141 markings, 21840721 edges, 945074 markings/sec, 10 secs
lola: 19257137 markings, 28978933 edges, 949599 markings/sec, 15 secs
lola: 23973772 markings, 36068769 edges, 943327 markings/sec, 20 secs
lola: 28550265 markings, 42947007 edges, 915299 markings/sec, 25 secs
lola: 33075887 markings, 49748092 edges, 905124 markings/sec, 30 secs
lola: 37574198 markings, 56507585 edges, 899662 markings/sec, 35 secs
lola: 42105964 markings, 63316816 edges, 906353 markings/sec, 40 secs
lola: 46641224 markings, 70130887 edges, 907052 markings/sec, 45 secs
lola: 51079373 markings, 76798738 edges, 887630 markings/sec, 50 secs
lola: 55596143 markings, 83584328 edges, 903354 markings/sec, 55 secs
lola: 60013226 markings, 90220007 edges, 883417 markings/sec, 60 secs
lola: 64696773 markings, 97255866 edges, 936709 markings/sec, 65 secs
lola: 69113734 markings, 103890704 edges, 883392 markings/sec, 70 secs
lola: 73294694 markings, 110170914 edges, 836192 markings/sec, 75 secs
lola: 76928500 markings, 115631997 edges, 726761 markings/sec, 80 secs
lola: 80605060 markings, 121151892 edges, 735312 markings/sec, 85 secs
lola: 83391244 markings, 125336669 edges, 557237 markings/sec, 90 secs
lola: 87227420 markings, 131098266 edges, 767235 markings/sec, 95 secs
lola: 89853529 markings, 135042581 edges, 525222 markings/sec, 100 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: X (X (G ((p22 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (G ((p22 <= 0))))
lola: processed formula length: 22
lola: 37 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 5119246 markings, 7716802 edges, 1023849 markings/sec, 0 secs
lola: 9970873 markings, 15016077 edges, 970325 markings/sec, 5 secs
lola: 14815755 markings, 22301692 edges, 968976 markings/sec, 10 secs
lola: 19434246 markings, 29245243 edges, 923698 markings/sec, 15 secs
lola: 24036472 markings, 36163105 edges, 920445 markings/sec, 20 secs
lola: 28531057 markings, 42918122 edges, 898917 markings/sec, 25 secs
lola: 33128199 markings, 49826775 edges, 919428 markings/sec, 30 secs
lola: 37647249 markings, 56617453 edges, 903810 markings/sec, 35 secs
lola: 42335175 markings, 63661158 edges, 937585 markings/sec, 40 secs
lola: 46905277 markings, 70527602 edges, 914020 markings/sec, 45 secs
lola: 51544780 markings, 77497808 edges, 927901 markings/sec, 50 secs
lola: 56063782 markings, 84286879 edges, 903800 markings/sec, 55 secs
lola: 60586591 markings, 91081556 edges, 904562 markings/sec, 60 secs
lola: 65164849 markings, 97958971 edges, 915652 markings/sec, 65 secs
lola: 69710024 markings, 104786297 edges, 909035 markings/sec, 70 secs
lola: 73854353 markings, 111013114 edges, 828866 markings/sec, 75 secs
lola: 76223372 markings, 114572024 edges, 473804 markings/sec, 80 secs
lola: 79728660 markings, 119836515 edges, 701058 markings/sec, 85 secs
lola: 83290947 markings, 125185733 edges, 712457 markings/sec, 90 secs
lola: 87064656 markings, 130853972 edges, 754742 markings/sec, 95 secs
lola: 89609492 markings, 134676069 edges, 508967 markings/sec, 100 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: no unknown unknown no no no no no no no
lola:
preliminary result: no unknown unknown no no no no no no no
lola: memory consumption: 3452 KB
lola: time consumption: 443 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="CloudOpsManagement-PT-05120by02560"
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 CloudOpsManagement-PT-05120by02560, 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 r056-oct2-162038334800226"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CloudOpsManagement-PT-05120by02560.tgz
mv CloudOpsManagement-PT-05120by02560 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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;