Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2020-input.r178-tajo-158987882200329.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
....................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is Dekker-PT-050, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-tajo-158987882200329
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.7M
-rw-r--r-- 1 mcc users 3.7K Apr 27 14:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Apr 27 14:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Apr 27 14:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 27 14:36 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 27 14:36 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Apr 27 14:36 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 27 14:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 27 14:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.8K Apr 27 14:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 13K Apr 27 14:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.7K Apr 27 14:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 27 14:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 27 14:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 27 14:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Apr 27 14:36 equiv_col
-rw-r--r-- 1 mcc users 4 Apr 27 14:36 instance
-rw-r--r-- 1 mcc users 6 Apr 27 14:36 iscolored
-rw-r--r-- 1 mcc users 1.5M Apr 27 14:36 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 Dekker-PT-050-00
FORMULA_NAME Dekker-PT-050-01
FORMULA_NAME Dekker-PT-050-02
FORMULA_NAME Dekker-PT-050-03
FORMULA_NAME Dekker-PT-050-04
FORMULA_NAME Dekker-PT-050-05
FORMULA_NAME Dekker-PT-050-06
FORMULA_NAME Dekker-PT-050-07
FORMULA_NAME Dekker-PT-050-08
FORMULA_NAME Dekker-PT-050-09
FORMULA_NAME Dekker-PT-050-10
FORMULA_NAME Dekker-PT-050-11
FORMULA_NAME Dekker-PT-050-12
FORMULA_NAME Dekker-PT-050-13
FORMULA_NAME Dekker-PT-050-14
FORMULA_NAME Dekker-PT-050-15

=== Now, execution of the tool begins

BK_START 1591216901779

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 20:41:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-03 20:41:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 20:41:43] [INFO ] Load time of PNML (sax parser for PT used): 151 ms
[2020-06-03 20:41:43] [INFO ] Transformed 250 places.
[2020-06-03 20:41:43] [INFO ] Transformed 2600 transitions.
[2020-06-03 20:41:43] [INFO ] Found NUPN structural information;
[2020-06-03 20:41:43] [INFO ] Parsed PT model containing 250 places and 2600 transitions in 210 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 39 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 985 ms. (steps per millisecond=101 ) properties seen :[0, 1, 1, 1, 1, 0, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0]
[2020-06-03 20:41:44] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 250 cols
[2020-06-03 20:41:44] [INFO ] Computed 150 place invariants in 19 ms
[2020-06-03 20:41:45] [INFO ] [Real]Absence check using 100 positive place invariants in 77 ms returned sat
[2020-06-03 20:41:45] [INFO ] [Real]Absence check using 100 positive and 50 generalized place invariants in 18 ms returned sat
[2020-06-03 20:41:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 20:41:45] [INFO ] [Real]Absence check using state equation in 224 ms returned sat
[2020-06-03 20:41:45] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 20:41:45] [INFO ] [Nat]Absence check using 100 positive place invariants in 45 ms returned sat
[2020-06-03 20:41:45] [INFO ] [Nat]Absence check using 100 positive and 50 generalized place invariants in 17 ms returned sat
[2020-06-03 20:41:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 20:41:45] [INFO ] [Nat]Absence check using state equation in 155 ms returned sat
[2020-06-03 20:41:45] [INFO ] State equation strengthened by 50 read => feed constraints.
[2020-06-03 20:41:45] [INFO ] [Nat]Added 50 Read/Feed constraints in 19 ms returned sat
[2020-06-03 20:41:45] [INFO ] Deduced a trap composed of 4 places in 72 ms
[2020-06-03 20:41:45] [INFO ] Deduced a trap composed of 6 places in 43 ms
[2020-06-03 20:41:45] [INFO ] Deduced a trap composed of 4 places in 36 ms
[2020-06-03 20:41:45] [INFO ] Deduced a trap composed of 6 places in 37 ms
[2020-06-03 20:41:45] [INFO ] Deduced a trap composed of 4 places in 33 ms
[2020-06-03 20:41:45] [INFO ] Deduced a trap composed of 4 places in 31 ms
[2020-06-03 20:41:45] [INFO ] Deduced a trap composed of 5 places in 27 ms
[2020-06-03 20:41:46] [INFO ] Deduced a trap composed of 4 places in 22 ms
[2020-06-03 20:41:46] [INFO ] Deduced a trap composed of 5 places in 29 ms
[2020-06-03 20:41:46] [INFO ] Deduced a trap composed of 4 places in 14 ms
[2020-06-03 20:41:46] [INFO ] Deduced a trap composed of 5 places in 21 ms
[2020-06-03 20:41:46] [INFO ] Deduced a trap composed of 4 places in 12 ms
[2020-06-03 20:41:46] [INFO ] Deduced a trap composed of 4 places in 14 ms
[2020-06-03 20:41:46] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 535 ms
[2020-06-03 20:41:46] [INFO ] Computed and/alt/rep : 2550/7500/150 causal constraints in 56 ms.
[2020-06-03 20:41:46] [INFO ] Added : 51 causal constraints over 11 iterations in 465 ms. Result :sat
[2020-06-03 20:41:46] [INFO ] [Real]Absence check using 100 positive place invariants in 42 ms returned sat
[2020-06-03 20:41:46] [INFO ] [Real]Absence check using 100 positive and 50 generalized place invariants in 16 ms returned sat
[2020-06-03 20:41:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 20:41:46] [INFO ] [Real]Absence check using state equation in 175 ms returned sat
[2020-06-03 20:41:46] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 20:41:47] [INFO ] [Nat]Absence check using 100 positive place invariants in 10 ms returned unsat
[2020-06-03 20:41:47] [INFO ] [Real]Absence check using 100 positive place invariants in 35 ms returned sat
[2020-06-03 20:41:47] [INFO ] [Real]Absence check using 100 positive and 50 generalized place invariants in 17 ms returned sat
[2020-06-03 20:41:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 20:41:47] [INFO ] [Real]Absence check using state equation in 216 ms returned sat
[2020-06-03 20:41:47] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 20:41:47] [INFO ] [Nat]Absence check using 100 positive place invariants in 13 ms returned unsat
[2020-06-03 20:41:47] [INFO ] [Real]Absence check using 100 positive place invariants in 36 ms returned sat
[2020-06-03 20:41:47] [INFO ] [Real]Absence check using 100 positive and 50 generalized place invariants in 17 ms returned sat
[2020-06-03 20:41:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 20:41:47] [INFO ] [Real]Absence check using state equation in 196 ms returned sat
[2020-06-03 20:41:47] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 20:41:47] [INFO ] [Nat]Absence check using 100 positive place invariants in 6 ms returned unsat
[2020-06-03 20:41:47] [INFO ] [Real]Absence check using 100 positive place invariants in 37 ms returned sat
[2020-06-03 20:41:47] [INFO ] [Real]Absence check using 100 positive and 50 generalized place invariants in 17 ms returned sat
[2020-06-03 20:41:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 20:41:48] [INFO ] [Real]Absence check using state equation in 217 ms returned sat
[2020-06-03 20:41:48] [INFO ] [Real]Added 50 Read/Feed constraints in 13 ms returned sat
[2020-06-03 20:41:48] [INFO ] Deduced a trap composed of 4 places in 46 ms
[2020-06-03 20:41:48] [INFO ] Deduced a trap composed of 5 places in 40 ms
[2020-06-03 20:41:48] [INFO ] Deduced a trap composed of 5 places in 31 ms
[2020-06-03 20:41:48] [INFO ] Deduced a trap composed of 4 places in 34 ms
[2020-06-03 20:41:48] [INFO ] Deduced a trap composed of 4 places in 24 ms
[2020-06-03 20:41:48] [INFO ] Deduced a trap composed of 6 places in 23 ms
[2020-06-03 20:41:48] [INFO ] Deduced a trap composed of 4 places in 15 ms
[2020-06-03 20:41:48] [INFO ] Deduced a trap composed of 5 places in 28 ms
[2020-06-03 20:41:48] [INFO ] Deduced a trap composed of 4 places in 26 ms
[2020-06-03 20:41:48] [INFO ] Deduced a trap composed of 4 places in 21 ms
[2020-06-03 20:41:48] [INFO ] Deduced a trap composed of 6 places in 17 ms
[2020-06-03 20:41:48] [INFO ] Deduced a trap composed of 4 places in 13 ms
[2020-06-03 20:41:48] [INFO ] Deduced a trap composed of 4 places in 18 ms
[2020-06-03 20:41:48] [INFO ] Deduced a trap composed of 6 places in 15 ms
[2020-06-03 20:41:48] [INFO ] Deduced a trap composed of 4 places in 13 ms
[2020-06-03 20:41:48] [INFO ] Deduced a trap composed of 6 places in 17 ms
[2020-06-03 20:41:48] [INFO ] Deduced a trap composed of 4 places in 15 ms
[2020-06-03 20:41:48] [INFO ] Deduced a trap composed of 4 places in 21 ms
[2020-06-03 20:41:48] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 690 ms
[2020-06-03 20:41:48] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 20:41:48] [INFO ] [Nat]Absence check using 100 positive place invariants in 34 ms returned sat
[2020-06-03 20:41:48] [INFO ] [Nat]Absence check using 100 positive and 50 generalized place invariants in 17 ms returned sat
[2020-06-03 20:41:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 20:41:49] [INFO ] [Nat]Absence check using state equation in 192 ms returned sat
[2020-06-03 20:41:49] [INFO ] [Nat]Added 50 Read/Feed constraints in 12 ms returned sat
[2020-06-03 20:41:49] [INFO ] Deduced a trap composed of 4 places in 45 ms
[2020-06-03 20:41:49] [INFO ] Deduced a trap composed of 5 places in 45 ms
[2020-06-03 20:41:49] [INFO ] Deduced a trap composed of 5 places in 33 ms
[2020-06-03 20:41:49] [INFO ] Deduced a trap composed of 4 places in 25 ms
[2020-06-03 20:41:49] [INFO ] Deduced a trap composed of 4 places in 21 ms
[2020-06-03 20:41:49] [INFO ] Deduced a trap composed of 6 places in 26 ms
[2020-06-03 20:41:49] [INFO ] Deduced a trap composed of 4 places in 18 ms
[2020-06-03 20:41:49] [INFO ] Deduced a trap composed of 5 places in 30 ms
[2020-06-03 20:41:49] [INFO ] Deduced a trap composed of 4 places in 24 ms
[2020-06-03 20:41:49] [INFO ] Deduced a trap composed of 4 places in 25 ms
[2020-06-03 20:41:49] [INFO ] Deduced a trap composed of 6 places in 21 ms
[2020-06-03 20:41:49] [INFO ] Deduced a trap composed of 4 places in 14 ms
[2020-06-03 20:41:49] [INFO ] Deduced a trap composed of 4 places in 22 ms
[2020-06-03 20:41:49] [INFO ] Deduced a trap composed of 6 places in 18 ms
[2020-06-03 20:41:49] [INFO ] Deduced a trap composed of 4 places in 13 ms
[2020-06-03 20:41:49] [INFO ] Deduced a trap composed of 6 places in 17 ms
[2020-06-03 20:41:49] [INFO ] Deduced a trap composed of 4 places in 13 ms
[2020-06-03 20:41:49] [INFO ] Deduced a trap composed of 4 places in 13 ms
[2020-06-03 20:41:49] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 689 ms
[2020-06-03 20:41:49] [INFO ] Computed and/alt/rep : 2550/7500/150 causal constraints in 96 ms.
[2020-06-03 20:41:50] [INFO ] Added : 51 causal constraints over 11 iterations in 466 ms. Result :sat
Successfully simplified 3 atomic propositions for a total of 5 simplifications.
[2020-06-03 20:41:50] [INFO ] Initial state reduction rules for CTL removed 10 formulas.
[2020-06-03 20:41:50] [INFO ] Flatten gal took : 316 ms
FORMULA Dekker-PT-050-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-050-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-050-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-050-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-050-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-050-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-050-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-050-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-050-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-050-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 20:41:50] [INFO ] Applying decomposition
[2020-06-03 20:41:50] [INFO ] Flatten gal took : 197 ms
[2020-06-03 20:41:51] [INFO ] Decomposing Gal with order
[2020-06-03 20:41:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-06-03 20:41:51] [INFO ] Removed a total of 9650 redundant transitions.
[2020-06-03 20:41:51] [INFO ] Flatten gal took : 276 ms
[2020-06-03 20:41:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 43 ms.
[2020-06-03 20:41:51] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2020-06-03 20:41:51] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 43 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ Dekker-PT-050 @ 3570 seconds

FORMULA Dekker-PT-050-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Dekker-PT-050-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Dekker-PT-050-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Dekker-PT-050-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Dekker-PT-050-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Dekker-PT-050-02 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3018
rslt: Output for LTLCardinality @ Dekker-PT-050

{
"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",
"--safe",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Wed Jun 3 20:41:51 2020
",
"timelimit": 3570
},
"child":
[

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 4,
"adisj": 2,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X (((((p186 <= 0)) OR ((1 <= p107))) AND (((p179 <= 0)) OR ((1 <= p168)))))",
"processed_size": 77,
"rewrites": 38
},
"result":
{
"edges": 53,
"markings": 53,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 0,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 824
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 1,
"aconj": 8,
"adisj": 4,
"aneg": 0,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 1,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X ((G (((((p87 <= 0)) OR ((1 <= p58))) OR (G ((((p87 <= 0)) OR ((1 <= p58)))) AND F ((((p87 <= 0)) OR ((1 <= p58))))))) OR (((p87 <= 0)) OR ((1 <= p58)))))",
"processed_size": 159,
"rewrites": 38
},
"result":
{
"edges": 50,
"markings": 51,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1099
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G ((((p131 <= 0)) OR ((1 <= p180))))",
"processed_size": 37,
"rewrites": 38
},
"result":
{
"edges": 15,
"markings": 12,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1648
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X ((((p131 <= 0)) OR ((1 <= p180))))",
"processed_size": 37,
"rewrites": 38
},
"result":
{
"edges": 6,
"markings": 6,
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 3,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1648
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 2,
"aconj": 2,
"adisj": 1,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (X (F ((((1 <= p214)) AND ((p105 <= 0))))))",
"processed_size": 45,
"rewrites": 38
},
"result":
{
"edges": 47,
"markings": 47,
"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": 3297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 1,
"U": 2,
"X": 2,
"aconj": 9,
"adisj": 2,
"aneg": 0,
"comp": 9,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 1,
"tdisj": 3,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "X (X (F (((((1 <= p18)) U ((1 <= p237))) OR (G (((F ((((p106 <= 0)) OR ((1 <= p167)))) U (((p106 <= 0)) OR ((1 <= p167)))) OR (((p88 <= 0)) OR ((1 <= p66))))) AND F (((1 <= p237))))))))",
"processed_size": 187,
"rewrites": 38
},
"result":
{
"edges": 194318,
"markings": 35849,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 14
},
"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"
}
}
],
"exit":
{
"error": null,
"memory": 4264,
"runtime": 552.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(X((** AND **)) AND **) : G(F((G(*) OR (X(*) AND *)))) : X((G((** OR (G(**) AND F(**)))) OR **)) : (X(**) OR G(**)) : X(X(F(*))) : X(X(F(((** U **) OR (G(((F(**) U **) OR (** OR **))) AND F(**))))))"
},
"net":
{
"arcs": 20100,
"conflict_clusters": 1,
"places": 250,
"places_significant": 100,
"singleton_clusters": 0,
"transitions": 2600
},
"result":
{
"preliminary_value": "no unknown yes no no no ",
"value": "no unknown yes 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: 2850/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 250
lola: finding significant places
lola: 250 places, 2600 transitions, 100 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: LP says that atomic proposition is always true: (p107 <= 1)
lola: LP says that atomic proposition is always true: (p168 <= 1)
lola: LP says that atomic proposition is always true: (p107 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p176 <= 1)
lola: LP says that atomic proposition is always true: (p58 <= 1)
lola: LP says that atomic proposition is always true: (p58 <= 1)
lola: LP says that atomic proposition is always true: (p58 <= 1)
lola: LP says that atomic proposition is always true: (p180 <= 1)
lola: LP says that atomic proposition is always true: (p180 <= 1)
lola: LP says that atomic proposition is always true: (p105 <= 1)
lola: LP says that atomic proposition is always true: (p167 <= 1)
lola: LP says that atomic proposition is always true: (p167 <= 1)
lola: LP says that atomic proposition is always true: (p66 <= 1)
lola: LP says that atomic proposition is always true: (p18 <= 1)
lola: LP says that atomic proposition is always true: (p237 <= 1)
lola: ((((1 <= 0) U X ((((p186 <= 0)) OR ((1 <= p107))))) AND X ((((p179 <= 0)) OR ((1 <= p168))))) AND (((p186 <= 0)) OR ((1 <= p107)))) : X (NOT(X (F (G ((X ((((p43 <= 0)) OR ((1 <= p85)))) U (((p40 <= 0)) OR ((1 <= p176))))))))) : (G ((X (G ((((p87 <= 0)) OR ((1 <= p58))))) U X (((1 <= 0) U (((p87 <= 0)) OR ((1 <= p58))))))) OR X ((((p87 <= 0)) OR ((1 <= p58))))) : (((1 <= 0) U X ((((p131 <= 0)) OR ((1 <= p180))))) OR G ((((p131 <= 0)) OR ((1 <= p180))))) : F (((1 <= 0) U NOT(X (G (X ((((p214 <= 0)) OR ((1 <= p105))))))))) : X (F (X ((G ((((F ((((p106 <= 0)) OR ((1 <= p167)))) U (((p106 <= 0)) OR ((1 <= p167)))) OR ((p88 <= 0))) OR ((1 <= p66)))) U (((1 <= p18)) U ((1 <= p237)))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:525
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:528
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (((((p186 <= 0)) OR ((1 <= p107))) AND (((p179 <= 0)) OR ((1 <= p168))))) AND (((p186 <= 0)) OR ((1 <= p107))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p186 <= 0)) OR ((1 <= p107)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((p186 <= 0)) OR ((1 <= p107)))
lola: processed formula length: 33
lola: 38 rewrites
lola: closed formula file LTLCardinality.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 1 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((((p186 <= 0)) OR ((1 <= p107))) AND (((p179 <= 0)) OR ((1 <= p168)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((((p186 <= 0)) OR ((1 <= p107))) AND (((p179 <= 0)) OR ((1 <= p168)))))
lola: processed formula length: 77
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: 53 markings, 53 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((G ((((1 <= p40)) AND ((p176 <= 0)))) OR (X ((((1 <= p43)) AND ((p85 <= 0)))) AND (((1 <= p40)) AND ((p176 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((G ((((1 <= p40)) AND ((p176 <= 0)))) OR (X ((((1 <= p43)) AND ((p85 <= 0)))) AND (((1 <= p40)) AND ((p176 <= 0)))))))
lola: processed formula length: 124
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: 535279 markings, 3461448 edges, 107056 markings/sec, 0 secs
lola: 1020786 markings, 6758659 edges, 97101 markings/sec, 5 secs
lola: 1530090 markings, 10214265 edges, 101861 markings/sec, 10 secs
lola: 2084788 markings, 13571612 edges, 110940 markings/sec, 15 secs
lola: 2576158 markings, 16994776 edges, 98274 markings/sec, 20 secs
lola: 3059847 markings, 20456705 edges, 96738 markings/sec, 25 secs
lola: 3531750 markings, 23927721 edges, 94381 markings/sec, 30 secs
lola: 4031830 markings, 27319065 edges, 100016 markings/sec, 35 secs
lola: 4526090 markings, 30747472 edges, 98852 markings/sec, 40 secs
lola: 4939410 markings, 33846396 edges, 82664 markings/sec, 45 secs
lola: 5329506 markings, 36939309 edges, 78019 markings/sec, 50 secs
lola: 5733635 markings, 40131326 edges, 80826 markings/sec, 55 secs
lola: 6175450 markings, 43282660 edges, 88363 markings/sec, 60 secs
lola: 6608646 markings, 46206945 edges, 86639 markings/sec, 65 secs
lola: 7030114 markings, 49156286 edges, 84294 markings/sec, 70 secs
lola: 7447914 markings, 52263279 edges, 83560 markings/sec, 75 secs
lola: 7920347 markings, 55661479 edges, 94487 markings/sec, 80 secs
lola: 8432842 markings, 59013756 edges, 102499 markings/sec, 85 secs
lola: 8892395 markings, 62509494 edges, 91911 markings/sec, 90 secs
lola: 9352754 markings, 66040470 edges, 92072 markings/sec, 95 secs
lola: 9803358 markings, 69574251 edges, 90121 markings/sec, 100 secs
lola: 10275762 markings, 73032041 edges, 94481 markings/sec, 105 secs
lola: 10749806 markings, 76496262 edges, 94809 markings/sec, 110 secs
lola: 11188007 markings, 80010941 edges, 87640 markings/sec, 115 secs
lola: 11609784 markings, 83554461 edges, 84355 markings/sec, 120 secs
lola: 12028317 markings, 87066437 edges, 83707 markings/sec, 125 secs
lola: 12482745 markings, 90528958 edges, 90886 markings/sec, 130 secs
lola: 12927002 markings, 93769110 edges, 88851 markings/sec, 135 secs
lola: 13393245 markings, 97243200 edges, 93249 markings/sec, 140 secs
lola: 13828514 markings, 100745827 edges, 87054 markings/sec, 145 secs
lola: 14284966 markings, 104193708 edges, 91290 markings/sec, 150 secs
lola: 14776248 markings, 107581989 edges, 98256 markings/sec, 155 secs
lola: 15254570 markings, 110941385 edges, 95664 markings/sec, 160 secs
lola: 15716322 markings, 114345148 edges, 92350 markings/sec, 165 secs
lola: 16182346 markings, 117748499 edges, 93205 markings/sec, 170 secs
lola: 16682110 markings, 121069865 edges, 99953 markings/sec, 175 secs
lola: 17108386 markings, 124071701 edges, 85255 markings/sec, 180 secs
lola: 17523281 markings, 127182343 edges, 82979 markings/sec, 185 secs
lola: 17930371 markings, 130413698 edges, 81418 markings/sec, 190 secs
lola: 18379250 markings, 133887524 edges, 89776 markings/sec, 195 secs
lola: 18856027 markings, 137262292 edges, 95355 markings/sec, 200 secs
lola: 19223019 markings, 140124401 edges, 73398 markings/sec, 205 secs
lola: 19607725 markings, 143182445 edges, 76941 markings/sec, 210 secs
lola: 19937758 markings, 145996400 edges, 66007 markings/sec, 215 secs
lola: 20268377 markings, 148740258 edges, 66124 markings/sec, 220 secs
lola: 20612966 markings, 151471287 edges, 68918 markings/sec, 225 secs
lola: 20950534 markings, 154013816 edges, 67514 markings/sec, 230 secs
lola: 21284154 markings, 156748043 edges, 66724 markings/sec, 235 secs
lola: 21594926 markings, 159394753 edges, 62154 markings/sec, 240 secs
lola: 21908507 markings, 162176870 edges, 62716 markings/sec, 245 secs
lola: 22239581 markings, 165106882 edges, 66215 markings/sec, 250 secs
lola: 22578187 markings, 168032147 edges, 67721 markings/sec, 255 secs
lola: 22905562 markings, 170732307 edges, 65475 markings/sec, 260 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 2 will run for 824 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((G (((((p87 <= 0)) OR ((1 <= p58))) OR (G ((((p87 <= 0)) OR ((1 <= p58)))) AND F ((((p87 <= 0)) OR ((1 <= p58))))))) OR (((p87 <= 0)) OR ((1 <= p58)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((G (((((p87 <= 0)) OR ((1 <= p58))) OR (G ((((p87 <= 0)) OR ((1 <= p58)))) AND F ((((p87 <= 0)) OR ((1 <= p58))))))) OR (((p87 <= 0)) OR ((1 <= p58)))))
lola: processed formula length: 159
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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 51 markings, 50 edges
lola: ========================================
lola: subprocess 3 will run for 1099 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X ((((p131 <= 0)) OR ((1 <= p180)))) OR G ((((p131 <= 0)) OR ((1 <= p180)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 1099 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((((p131 <= 0)) OR ((1 <= p180))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((((p131 <= 0)) OR ((1 <= p180))))
lola: processed formula length: 37
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: 12 markings, 15 edges
lola: ========================================
lola: subprocess 4 will run for 1648 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((((p131 <= 0)) OR ((1 <= p180))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((((p131 <= 0)) OR ((1 <= p180))))
lola: processed formula length: 37
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: 6 markings, 6 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 4 will run for 1648 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (F ((((1 <= p214)) AND ((p105 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (F ((((1 <= p214)) AND ((p105 <= 0))))))
lola: processed formula length: 45
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: 47 markings, 47 edges
lola: ========================================
lola: subprocess 5 will run for 3297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (F (((((1 <= p18)) U ((1 <= p237))) OR (G (((F ((((p106 <= 0)) OR ((1 <= p167)))) U (((p106 <= 0)) OR ((1 <= p167)))) OR (((p88 <= 0)) OR ((1 <= p66))))) AND F (((1 <= p237))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (F (((((1 <= p18)) U ((1 <= p237))) OR (G (((F ((((p106 <= 0)) OR ((1 <= p167)))) U (((p106 <= 0)) OR ((1 <= p167)))) OR (((p88 <= 0)) OR ((1 <= p66))))) AND F (((1 <= p237))))))))
lola: processed formula length: 187
lola: 38 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 14 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: 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: 35849 markings, 194318 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: G (F ((G ((((1 <= p40)) AND ((p176 <= 0)))) OR (X ((((1 <= p43)) AND ((p85 <= 0)))) AND (((1 <= p40)) AND ((p176 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((G ((((1 <= p40)) AND ((p176 <= 0)))) OR (X ((((1 <= p43)) AND ((p85 <= 0)))) AND (((1 <= p40)) AND ((p176 <= 0)))))))
lola: processed formula length: 124
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: 480513 markings, 3131032 edges, 96103 markings/sec, 0 secs
lola: 989414 markings, 6537916 edges, 101780 markings/sec, 5 secs
lola: 1491606 markings, 9960152 edges, 100438 markings/sec, 10 secs
lola: 2029250 markings, 13272996 edges, 107529 markings/sec, 15 secs
lola: 2525574 markings, 16627502 edges, 99265 markings/sec, 20 secs
lola: 3006582 markings, 20049914 edges, 96202 markings/sec, 25 secs
lola: 3473906 markings, 23476766 edges, 93465 markings/sec, 30 secs
lola: 3958798 markings, 26832471 edges, 96978 markings/sec, 35 secs
lola: 4455994 markings, 30209114 edges, 99439 markings/sec, 40 secs
lola: 4913558 markings, 33654710 edges, 91513 markings/sec, 45 secs
lola: 5359173 markings, 37177919 edges, 89123 markings/sec, 50 secs
lola: 5809166 markings, 40643607 edges, 89999 markings/sec, 55 secs
lola: 6290893 markings, 44039923 edges, 96345 markings/sec, 60 secs
lola: 6765372 markings, 47369344 edges, 94896 markings/sec, 65 secs
lola: 7241050 markings, 50766013 edges, 95136 markings/sec, 70 secs
lola: 7703226 markings, 54163798 edges, 92435 markings/sec, 75 secs
lola: 8187438 markings, 57466380 edges, 96842 markings/sec, 80 secs
lola: 8679194 markings, 60832738 edges, 98351 markings/sec, 85 secs
lola: 9136395 markings, 64278121 edges, 91440 markings/sec, 90 secs
lola: 9578338 markings, 67770993 edges, 88389 markings/sec, 95 secs
lola: 10025438 markings, 71213031 edges, 89420 markings/sec, 100 secs
lola: 10508038 markings, 74604129 edges, 96520 markings/sec, 105 secs
lola: 10934922 markings, 78056292 edges, 85377 markings/sec, 110 secs
lola: 11369277 markings, 81542666 edges, 86871 markings/sec, 115 secs
lola: 11783042 markings, 85027314 edges, 82753 markings/sec, 120 secs
lola: 12210386 markings, 88436076 edges, 85469 markings/sec, 125 secs
lola: 12670334 markings, 91829327 edges, 91990 markings/sec, 130 secs
lola: 13119818 markings, 95238471 edges, 89897 markings/sec, 135 secs
lola: 13559738 markings, 98659197 edges, 87984 markings/sec, 140 secs
lola: 13975678 markings, 101892562 edges, 83188 markings/sec, 145 secs
lola: 14405383 markings, 105102448 edges, 85941 markings/sec, 150 secs
lola: 14900746 markings, 108450383 edges, 99073 markings/sec, 155 secs
lola: 15375934 markings, 111764654 edges, 95038 markings/sec, 160 secs
lola: 15832724 markings, 115155916 edges, 91358 markings/sec, 165 secs
lola: 16254332 markings, 118239938 edges, 84322 markings/sec, 170 secs
lola: 16667566 markings, 120978542 edges, 82647 markings/sec, 175 secs
lola: 17107694 markings, 124066435 edges, 88026 markings/sec, 180 secs
lola: 17546844 markings, 127357230 edges, 87830 markings/sec, 185 secs
lola: 17986462 markings, 130848024 edges, 87924 markings/sec, 190 secs
lola: 18437902 markings, 134300221 edges, 90288 markings/sec, 195 secs
lola: 18918623 markings, 137685253 edges, 96144 markings/sec, 200 secs
lola: 19239706 markings, 140275586 edges, 64217 markings/sec, 205 secs
lola: 19516692 markings, 142452491 edges, 55397 markings/sec, 210 secs
lola: 19819218 markings, 145002441 edges, 60505 markings/sec, 215 secs
lola: 20158438 markings, 147835958 edges, 67844 markings/sec, 220 secs
lola: 20459403 markings, 150295182 edges, 60193 markings/sec, 225 secs
lola: 20829518 markings, 153150097 edges, 74023 markings/sec, 230 secs
lola: 21191342 markings, 155961477 edges, 72365 markings/sec, 235 secs
lola: 21558718 markings, 159091931 edges, 73475 markings/sec, 240 secs
lola: 21881010 markings, 161929732 edges, 64458 markings/sec, 245 secs
lola: 22202317 markings, 164770297 edges, 64261 markings/sec, 250 secs
lola: 22511319 markings, 167510827 edges, 61800 markings/sec, 255 secs
lola: 22856026 markings, 170323692 edges, 68941 markings/sec, 260 secs
lola: 22930568 markings, 170936422 edges, 14908 markings/sec, 265 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: no unknown yes no no no
lola:
preliminary result: no unknown yes no no no
lola: memory consumption: 4264 KB
lola: time consumption: 552 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="Dekker-PT-050"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itslola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itslola"
echo " Input is Dekker-PT-050, 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 r178-tajo-158987882200329"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Dekker-PT-050.tgz
mv Dekker-PT-050 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 ;