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-162089432900333.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 RefineWMG-PT-025026, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r189-tajo-162089432900333
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 372K
-rw-r--r-- 1 mcc users 9.6K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 94K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.9K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 75K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Mar 28 16:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 28 16:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 16:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 28 16:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.0K Mar 27 10:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 27 10:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 25 14:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 25 14:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.4K Mar 22 08:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.4K Mar 22 08:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 7 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 56K 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 RefineWMG-PT-025026-00
FORMULA_NAME RefineWMG-PT-025026-01
FORMULA_NAME RefineWMG-PT-025026-02
FORMULA_NAME RefineWMG-PT-025026-03
FORMULA_NAME RefineWMG-PT-025026-04
FORMULA_NAME RefineWMG-PT-025026-05
FORMULA_NAME RefineWMG-PT-025026-06
FORMULA_NAME RefineWMG-PT-025026-07
FORMULA_NAME RefineWMG-PT-025026-08
FORMULA_NAME RefineWMG-PT-025026-09
FORMULA_NAME RefineWMG-PT-025026-10
FORMULA_NAME RefineWMG-PT-025026-11
FORMULA_NAME RefineWMG-PT-025026-12
FORMULA_NAME RefineWMG-PT-025026-13
FORMULA_NAME RefineWMG-PT-025026-14
FORMULA_NAME RefineWMG-PT-025026-15

=== Now, execution of the tool begins

BK_START 1621429290169

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-19 13:01:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2021-05-19 13:01:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-19 13:01:31] [INFO ] Load time of PNML (sax parser for PT used): 41 ms
[2021-05-19 13:01:31] [INFO ] Transformed 129 places.
[2021-05-19 13:01:31] [INFO ] Transformed 103 transitions.
[2021-05-19 13:01:31] [INFO ] Parsed PT model containing 129 places and 103 transitions in 77 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100022 steps, including 0 resets, run finished after 215 ms. (steps per millisecond=465 ) properties seen :[1, 1, 1, 1, 1, 0, 1, 1, 0, 0, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 0, 1, 0, 0, 0, 0, 1, 0, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 103 rows 129 cols
[2021-05-19 13:01:32] [INFO ] Computed 52 place invariants in 6 ms
[2021-05-19 13:01:32] [INFO ] [Real]Absence check using 52 positive place invariants in 12 ms returned unsat
[2021-05-19 13:01:32] [INFO ] [Real]Absence check using 52 positive place invariants in 18 ms returned sat
[2021-05-19 13:01:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:01:32] [INFO ] [Real]Absence check using state equation in 61 ms returned sat
[2021-05-19 13:01:32] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 13:01:32] [INFO ] [Nat]Absence check using 52 positive place invariants in 20 ms returned sat
[2021-05-19 13:01:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 13:01:32] [INFO ] [Nat]Absence check using state equation in 66 ms returned sat
[2021-05-19 13:01:32] [INFO ] Computed and/alt/rep : 77/102/77 causal constraints in 12 ms.
[2021-05-19 13:01:32] [INFO ] Added : 57 causal constraints over 12 iterations in 146 ms. Result :sat
[2021-05-19 13:01:32] [INFO ] [Real]Absence check using 52 positive place invariants in 13 ms returned sat
[2021-05-19 13:01:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:01:32] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2021-05-19 13:01:32] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 13:01:32] [INFO ] [Nat]Absence check using 52 positive place invariants in 20 ms returned sat
[2021-05-19 13:01:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 13:01:32] [INFO ] [Nat]Absence check using state equation in 59 ms returned sat
[2021-05-19 13:01:33] [INFO ] Computed and/alt/rep : 77/102/77 causal constraints in 9 ms.
[2021-05-19 13:01:33] [INFO ] Added : 57 causal constraints over 12 iterations in 86 ms. Result :sat
[2021-05-19 13:01:33] [INFO ] [Real]Absence check using 52 positive place invariants in 2 ms returned unsat
[2021-05-19 13:01:33] [INFO ] [Real]Absence check using 52 positive place invariants in 2 ms returned unsat
[2021-05-19 13:01:33] [INFO ] [Real]Absence check using 52 positive place invariants in 11 ms returned sat
[2021-05-19 13:01:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:01:33] [INFO ] [Real]Absence check using state equation in 54 ms returned sat
[2021-05-19 13:01:33] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 13:01:33] [INFO ] [Nat]Absence check using 52 positive place invariants in 13 ms returned sat
[2021-05-19 13:01:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 13:01:33] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2021-05-19 13:01:33] [INFO ] Computed and/alt/rep : 77/102/77 causal constraints in 14 ms.
[2021-05-19 13:01:33] [INFO ] Added : 51 causal constraints over 11 iterations in 82 ms. Result :sat
[2021-05-19 13:01:33] [INFO ] [Real]Absence check using 52 positive place invariants in 2 ms returned unsat
[2021-05-19 13:01:33] [INFO ] [Real]Absence check using 52 positive place invariants in 2 ms returned unsat
[2021-05-19 13:01:33] [INFO ] [Real]Absence check using 52 positive place invariants in 11 ms returned sat
[2021-05-19 13:01:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:01:33] [INFO ] [Real]Absence check using state equation in 63 ms returned sat
[2021-05-19 13:01:33] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 13:01:33] [INFO ] [Nat]Absence check using 52 positive place invariants in 12 ms returned sat
[2021-05-19 13:01:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 13:01:33] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2021-05-19 13:01:33] [INFO ] Computed and/alt/rep : 77/102/77 causal constraints in 6 ms.
[2021-05-19 13:01:33] [INFO ] Added : 52 causal constraints over 11 iterations in 74 ms. Result :sat
[2021-05-19 13:01:33] [INFO ] [Real]Absence check using 52 positive place invariants in 21 ms returned sat
[2021-05-19 13:01:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 13:01:33] [INFO ] [Real]Absence check using state equation in 58 ms returned sat
[2021-05-19 13:01:33] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 13:01:33] [INFO ] [Nat]Absence check using 52 positive place invariants in 18 ms returned sat
[2021-05-19 13:01:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 13:01:33] [INFO ] [Nat]Absence check using state equation in 68 ms returned sat
[2021-05-19 13:01:33] [INFO ] Computed and/alt/rep : 77/102/77 causal constraints in 6 ms.
[2021-05-19 13:01:33] [INFO ] Added : 56 causal constraints over 12 iterations in 76 ms. Result :sat
[2021-05-19 13:01:34] [INFO ] [Real]Absence check using 52 positive place invariants in 2 ms returned unsat
[2021-05-19 13:01:34] [INFO ] [Real]Absence check using 52 positive place invariants in 4 ms returned unsat
[2021-05-19 13:01:34] [INFO ] [Real]Absence check using 52 positive place invariants in 3 ms returned unsat
[2021-05-19 13:01:34] [INFO ] [Real]Absence check using 52 positive place invariants in 3 ms returned unsat
Successfully simplified 9 atomic propositions for a total of 12 simplifications.
[2021-05-19 13:01:34] [INFO ] Initial state reduction rules for CTL removed 7 formulas.
[2021-05-19 13:01:34] [INFO ] Flatten gal took : 38 ms
FORMULA RefineWMG-PT-025026-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-025026-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-025026-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-025026-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-025026-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-025026-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-025026-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-19 13:01:34] [INFO ] Flatten gal took : 12 ms
[2021-05-19 13:01:34] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2021-05-19 13:01:34] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 3 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ RefineWMG-PT-025026 @ 3570 seconds

FORMULA RefineWMG-PT-025026-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-025026-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-025026-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-025026-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-025026-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-025026-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-025026-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-025026-03 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-025026-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2962
rslt: Output for LTLCardinality @ RefineWMG-PT-025026

{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2020",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=LTLCardinality.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Wed May 19 13:01:35 2021
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "X (F (((X (G ((p111 <= p33))) AND (p21 + 1 <= p53)) OR (3 <= p118))))",
"processed_size": 69,
"rewrites": 38
},
"result":
{
"edges": 27,
"markings": 27,
"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": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 1,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X ((((1 <= p20) U X (F ((2 <= p25)))) AND (1 <= p72)))",
"processed_size": 54,
"rewrites": 38
},
"result":
{
"edges": 28,
"markings": 28,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"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": 571
},
"child":
[

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 686
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(p80 <= 0)",
"processed_size": 10,
"rewrites": 40
},
"result":
{
"edges": 7,
"markings": 7,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 2
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 3,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 686
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (X (F ((p63 + 1 <= p5))))",
"processed_size": 27,
"rewrites": 38
},
"result":
{
"edges": 27,
"markings": 27,
"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": 857
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (F ((p126 <= p4)))",
"processed_size": 20,
"rewrites": 38
},
"result":
{
"edges": 27,
"markings": 27,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"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": 1627
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "G (F ((p54 <= 1)))",
"processed_size": 18,
"rewrites": 38
},
"result":
{
"edges": 469,
"markings": 366,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "fairness",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3255
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 1,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "((1 <= p19) U G ((p33 <= p70)))",
"processed_size": 31,
"rewrites": 38
},
"result":
{
"edges": 818,
"markings": 585,
"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"
}
}
],
"exit":
{
"error": null,
"memory": 3472,
"runtime": 608.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "X(F(((X(G(**)) AND **) OR **))) : X(((** U X(F(**))) AND **)) : F((X(G(*)) OR G(F(*)))) : (X(*) AND (F(**) OR **)) : X(X(F(*))) : X(F(**)) : G(F(*)) : ((F(**) U (F(**) AND G(F(**)))) AND (** U G(**))) : X(X(F(((** U G(**)) R F(*)))))"
},
"net":
{
"arcs": 308,
"conflict_clusters": 78,
"places": 129,
"places_significant": 77,
"singleton_clusters": 0,
"transitions": 103
},
"result":
{
"preliminary_value": "no no unknown no no no no no unknown ",
"value": "no no unknown no no no no no unknown "
},
"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: 232/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 4128
lola: finding significant places
lola: 129 places, 103 transitions, 77 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from LTLCardinality.xml
lola: X ((F ((X (G ((p111 <= p33))) AND (p21 + 1 <= p53))) OR F ((3 <= p118)))) : X ((((1 <= p20) U X (F ((2 <= p25)))) AND ((1 <= 0) U (1 <= p72)))) : F (((p61 <= p80) U (NOT(X (F ((p80 + 1 <= p61)))) OR NOT(F (G ((3 <= p59))))))) : (NOT(X ((p82 <= p33))) AND ((((1 <= p80) U (0 <= 0)) U (1 <= p80)) OR (p82 <= p33))) : X (X (NOT(G ((p5 <= p63))))) : X (F ((NOT(X (F ((2 <= p31)))) U (p126 <= p4)))) : NOT(G (((0 <= 0) U G ((2 <= p54))))) : ((F ((p33 <= p70)) U (F ((p100 <= p62)) AND G (F ((p33 <= p70))))) AND ((1 <= p19) U G ((p33 <= p70)))) : X (X (F (NOT((NOT(((2 <= p90) U G ((2 <= p7)))) U G (((1 <= p55) OR (p46 + 1 <= p128))))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:519
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:166
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:341
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:332
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: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F (((X (G ((p111 <= p33))) AND (p21 + 1 <= p53)) OR (3 <= p118))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F (((X (G ((p111 <= p33))) AND (p21 + 1 <= p53)) OR (3 <= p118))))
lola: processed formula length: 69
lola: 38 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 27 markings, 27 edges
lola: ========================================
lola: subprocess 1 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((((1 <= p20) U X (F ((2 <= p25)))) AND (1 <= p72)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((((1 <= p20) U X (F ((2 <= p25)))) AND (1 <= p72)))
lola: processed formula length: 54
lola: 38 rewrites
lola: closed formula file LTLCardinality.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: 28 markings, 28 edges
lola: ========================================
lola: subprocess 2 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((X (G ((p61 <= p80))) OR G (F ((p59 <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((X (G ((p61 <= p80))) OR G (F ((p59 <= 2)))))
lola: processed formula length: 48
lola: 38 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 3020198 markings, 4588336 edges, 604040 markings/sec, 0 secs
lola: 6454935 markings, 9806513 edges, 686947 markings/sec, 5 secs
lola: 9580712 markings, 14555277 edges, 625155 markings/sec, 10 secs
lola: 12555606 markings, 19074845 edges, 594979 markings/sec, 15 secs
lola: 15677653 markings, 23817936 edges, 624409 markings/sec, 20 secs
lola: 18752915 markings, 28489967 edges, 615052 markings/sec, 25 secs
lola: 21510506 markings, 32679376 edges, 551518 markings/sec, 30 secs
lola: 24641192 markings, 37435626 edges, 626137 markings/sec, 35 secs
lola: 27559574 markings, 41869323 edges, 583676 markings/sec, 40 secs
lola: 30652991 markings, 46568947 edges, 618683 markings/sec, 45 secs
lola: 33565884 markings, 50994280 edges, 582579 markings/sec, 50 secs
lola: 36540087 markings, 55512785 edges, 594841 markings/sec, 55 secs
lola: 39502250 markings, 60012988 edges, 592433 markings/sec, 60 secs
lola: 42629412 markings, 64763873 edges, 625432 markings/sec, 65 secs
lola: 45796760 markings, 69575826 edges, 633470 markings/sec, 70 secs
lola: 48824189 markings, 74175177 edges, 605486 markings/sec, 75 secs
lola: 51688696 markings, 78527031 edges, 572901 markings/sec, 80 secs
lola: 54210730 markings, 82360530 edges, 504407 markings/sec, 85 secs
lola: 55918593 markings, 84953910 edges, 341573 markings/sec, 90 secs
lola: 57724426 markings, 87696686 edges, 361167 markings/sec, 95 secs
lola: 59558136 markings, 90482527 edges, 366742 markings/sec, 100 secs
lola: 61518944 markings, 93461446 edges, 392162 markings/sec, 105 secs
lola: 62703301 markings, 95260753 edges, 236871 markings/sec, 110 secs
lola: 63988927 markings, 97213917 edges, 257125 markings/sec, 115 secs
lola: 65730795 markings, 99860217 edges, 348374 markings/sec, 120 secs
lola: 66387969 markings, 100858592 edges, 131435 markings/sec, 125 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 3 will run for 571 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X ((p33 + 1 <= p82)) AND (F ((1 <= p80)) OR (p82 <= p33)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 571 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p82 <= p33)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p82 <= p33)
lola: processed formula length: 12
lola: 38 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 4 will run for 686 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((1 <= p80))
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: (p80 <= 0)
lola: processed formula length: 10
lola: 40 rewrites
lola: closed formula file LTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 7 markings, 7 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 4 will run for 686 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (F ((p63 + 1 <= p5))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (F ((p63 + 1 <= p5))))
lola: processed formula length: 27
lola: 38 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 27 markings, 27 edges
lola: ========================================
lola: subprocess 5 will run for 857 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((p126 <= p4)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((p126 <= p4)))
lola: processed formula length: 20
lola: 38 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 27 markings, 27 edges
lola: ========================================
lola: subprocess 6 will run for 1143 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (F ((((2 <= p90) U G ((2 <= p7))) R F (((p55 <= 0) AND (p128 <= p46)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (F ((((2 <= p90) U G ((2 <= p7))) R F (((p55 <= 0) AND (p128 <= p46)))))))
lola: processed formula length: 79
lola: 38 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 12 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: 2065916 markings, 4509478 edges, 413183 markings/sec, 0 secs
lola: 4213898 markings, 9198526 edges, 429596 markings/sec, 5 secs
lola: 6366084 markings, 13896767 edges, 430437 markings/sec, 10 secs
lola: 8575531 markings, 18719983 edges, 441889 markings/sec, 15 secs
lola: 10927970 markings, 23855339 edges, 470488 markings/sec, 20 secs
lola: 13029862 markings, 28443791 edges, 420378 markings/sec, 25 secs
lola: 15150583 markings, 33073319 edges, 424144 markings/sec, 30 secs
lola: 17207801 markings, 37564226 edges, 411444 markings/sec, 35 secs
lola: 19344302 markings, 42228207 edges, 427300 markings/sec, 40 secs
lola: 21651985 markings, 47265886 edges, 461537 markings/sec, 45 secs
lola: 23790969 markings, 51935272 edges, 427797 markings/sec, 50 secs
lola: 25994304 markings, 56745133 edges, 440667 markings/sec, 55 secs
lola: 28347052 markings, 61881149 edges, 470550 markings/sec, 60 secs
lola: 30445495 markings, 66462052 edges, 419689 markings/sec, 65 secs
lola: 32811601 markings, 71627284 edges, 473221 markings/sec, 70 secs
lola: 35068943 markings, 76555062 edges, 451468 markings/sec, 75 secs
lola: 37550714 markings, 81972759 edges, 496354 markings/sec, 80 secs
lola: 40001218 markings, 87322225 edges, 490101 markings/sec, 85 secs
lola: 42468352 markings, 92707951 edges, 493427 markings/sec, 90 secs
lola: 44896295 markings, 98008132 edges, 485589 markings/sec, 95 secs
lola: 47364013 markings, 103395201 edges, 493544 markings/sec, 100 secs
lola: 49587104 markings, 108248164 edges, 444618 markings/sec, 105 secs
lola: 52025093 markings, 113570326 edges, 487598 markings/sec, 110 secs
lola: 54404476 markings, 118764484 edges, 475877 markings/sec, 115 secs
lola: 55609270 markings, 121395270 edges, 240959 markings/sec, 120 secs
lola: 56738099 markings, 123859300 edges, 225766 markings/sec, 125 secs
lola: 58029773 markings, 126678524 edges, 258335 markings/sec, 130 secs
lola: 59388089 markings, 129643697 edges, 271663 markings/sec, 135 secs
lola: 60569737 markings, 132223260 edges, 236330 markings/sec, 140 secs
lola: 62237506 markings, 135864000 edges, 333554 markings/sec, 145 secs
lola: 64165555 markings, 140072930 edges, 385610 markings/sec, 150 secs
lola: 65888428 markings, 143833948 edges, 344575 markings/sec, 155 secs
lola: 67065830 markings, 146404226 edges, 235480 markings/sec, 160 secs
lola: 68473890 markings, 149478295 edges, 281612 markings/sec, 165 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 7 will run for 1627 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((p54 <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking fairness
lola: fairness not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((p54 <= 1)))
lola: processed formula length: 18
lola: 38 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 366 markings, 469 edges
lola: ========================================
lola: subprocess 8 will run for 3255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((F ((p33 <= p70)) U (F ((p100 <= p62)) AND G (F ((p33 <= p70))))) AND ((1 <= p19) U G ((p33 <= p70))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 3255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p19) U G ((p33 <= p70)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((1 <= p19) U G ((p33 <= p70)))
lola: processed formula length: 31
lola: 38 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: 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: 585 markings, 818 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: F ((X (G ((p61 <= p80))) OR G (F ((p59 <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((X (G ((p61 <= p80))) OR G (F ((p59 <= 2)))))
lola: processed formula length: 48
lola: 38 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 3167847 markings, 4812659 edges, 633569 markings/sec, 0 secs
lola: 6579989 markings, 9996495 edges, 682428 markings/sec, 5 secs
lola: 10015190 markings, 15215336 edges, 687040 markings/sec, 10 secs
lola: 13247799 markings, 20126406 edges, 646522 markings/sec, 15 secs
lola: 16742630 markings, 25435873 edges, 698966 markings/sec, 20 secs
lola: 20115963 markings, 30560770 edges, 674667 markings/sec, 25 secs
lola: 23483490 markings, 35676797 edges, 673505 markings/sec, 30 secs
lola: 26789485 markings, 40699373 edges, 661199 markings/sec, 35 secs
lola: 30156987 markings, 45815394 edges, 673500 markings/sec, 40 secs
lola: 33549258 markings, 50969015 edges, 678454 markings/sec, 45 secs
lola: 36926278 markings, 56099509 edges, 675404 markings/sec, 50 secs
lola: 40287703 markings, 61206275 edges, 672285 markings/sec, 55 secs
lola: 43704376 markings, 66396989 edges, 683335 markings/sec, 60 secs
lola: 47118743 markings, 71584202 edges, 682873 markings/sec, 65 secs
lola: 50451028 markings, 76646709 edges, 666457 markings/sec, 70 secs
lola: 53808117 markings, 81746904 edges, 671418 markings/sec, 75 secs
lola: 56076101 markings, 85192503 edges, 453597 markings/sec, 80 secs
lola: 57285741 markings, 87032170 edges, 241928 markings/sec, 85 secs
lola: 59068711 markings, 89740939 edges, 356594 markings/sec, 90 secs
lola: 60903882 markings, 92527022 edges, 367034 markings/sec, 95 secs
lola: 62092975 markings, 94333522 edges, 237819 markings/sec, 100 secs
lola: 63816702 markings, 96952283 edges, 344745 markings/sec, 105 secs
lola: 65410517 markings, 99373628 edges, 318763 markings/sec, 110 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: X (X (F ((((2 <= p90) U G ((2 <= p7))) R F (((p55 <= 0) AND (p128 <= p46)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (F ((((2 <= p90) U G ((2 <= p7))) R F (((p55 <= 0) AND (p128 <= p46)))))))
lola: processed formula length: 79
lola: 38 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 12 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: 2318337 markings, 5060511 edges, 463667 markings/sec, 0 secs
lola: 4753789 markings, 10377135 edges, 487090 markings/sec, 5 secs
lola: 7136981 markings, 15579606 edges, 476638 markings/sec, 10 secs
lola: 9434769 markings, 20595687 edges, 459558 markings/sec, 15 secs
lola: 11638437 markings, 25406303 edges, 440734 markings/sec, 20 secs
lola: 14081205 markings, 30738870 edges, 488554 markings/sec, 25 secs
lola: 16570735 markings, 36173508 edges, 497906 markings/sec, 30 secs
lola: 19011915 markings, 41502585 edges, 488236 markings/sec, 35 secs
lola: 21469250 markings, 46866966 edges, 491467 markings/sec, 40 secs
lola: 23889493 markings, 52150322 edges, 484049 markings/sec, 45 secs
lola: 26355355 markings, 57533320 edges, 493172 markings/sec, 50 secs
lola: 28870264 markings, 63023339 edges, 502982 markings/sec, 55 secs
lola: 31302070 markings, 68331995 edges, 486361 markings/sec, 60 secs
lola: 33691092 markings, 73547213 edges, 477804 markings/sec, 65 secs
lola: 36143918 markings, 78901768 edges, 490565 markings/sec, 70 secs
lola: 38597828 markings, 84258603 edges, 490782 markings/sec, 75 secs
lola: 41337061 markings, 90238384 edges, 547847 markings/sec, 80 secs
lola: 43588688 markings, 95153652 edges, 450325 markings/sec, 85 secs
lola: 45796266 markings, 99972794 edges, 441516 markings/sec, 90 secs
lola: 48034777 markings, 104859446 edges, 447702 markings/sec, 95 secs
lola: 50409874 markings, 110044280 edges, 475019 markings/sec, 100 secs
lola: 52857707 markings, 115387914 edges, 489567 markings/sec, 105 secs
lola: 55014880 markings, 120097079 edges, 431435 markings/sec, 110 secs
lola: 56671266 markings, 123714464 edges, 331277 markings/sec, 115 secs
lola: 57882802 markings, 126358633 edges, 242307 markings/sec, 120 secs
lola: 59591699 markings, 130089022 edges, 341779 markings/sec, 125 secs
lola: 61110469 markings, 133403675 edges, 303754 markings/sec, 130 secs
lola: 62409634 markings, 136239773 edges, 259833 markings/sec, 135 secs
lola: 63756084 markings, 139179071 edges, 269290 markings/sec, 140 secs
lola: 65214324 markings, 142362366 edges, 291648 markings/sec, 145 secs
lola: 66596207 markings, 145379029 edges, 276377 markings/sec, 150 secs
lola: 68292629 markings, 149082339 edges, 339284 markings/sec, 155 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: no no unknown no no no no no unknown
lola:
preliminary result: no no unknown no no no no no unknown
lola: memory consumption: 3472 KB
lola: time consumption: 608 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.json
rslt: finished

--------------------
content from stderr:

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="RefineWMG-PT-025026"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="gold2020"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool gold2020"
echo " Input is RefineWMG-PT-025026, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r189-tajo-162089432900333"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/RefineWMG-PT-025026.tgz
mv RefineWMG-PT-025026 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;