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.r211-tajo-159033477700601.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 ShieldPPPt-PT-003A, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r211-tajo-159033477700601
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 204K
-rw-r--r-- 1 mcc users 3.2K May 14 01:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K May 14 01:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 13 19:15 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 13 19:15 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 14 10:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 14 10:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 14 10:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 14 10:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 20:42 NewModel
-rw-r--r-- 1 mcc users 3.2K May 13 14:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K May 13 14:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 13 08:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 22K May 13 08:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 13 16:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 13 16:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 20:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 12 20:42 instance
-rw-r--r-- 1 mcc users 6 May 12 20:42 iscolored
-rw-r--r-- 1 mcc users 21K May 12 20:42 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 ShieldPPPt-PT-003A-00
FORMULA_NAME ShieldPPPt-PT-003A-01
FORMULA_NAME ShieldPPPt-PT-003A-02
FORMULA_NAME ShieldPPPt-PT-003A-03
FORMULA_NAME ShieldPPPt-PT-003A-04
FORMULA_NAME ShieldPPPt-PT-003A-05
FORMULA_NAME ShieldPPPt-PT-003A-06
FORMULA_NAME ShieldPPPt-PT-003A-07
FORMULA_NAME ShieldPPPt-PT-003A-08
FORMULA_NAME ShieldPPPt-PT-003A-09
FORMULA_NAME ShieldPPPt-PT-003A-10
FORMULA_NAME ShieldPPPt-PT-003A-11
FORMULA_NAME ShieldPPPt-PT-003A-12
FORMULA_NAME ShieldPPPt-PT-003A-13
FORMULA_NAME ShieldPPPt-PT-003A-14
FORMULA_NAME ShieldPPPt-PT-003A-15

=== Now, execution of the tool begins

BK_START 1591316657717

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-05 00:24:19] [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-05 00:24:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-05 00:24:19] [INFO ] Load time of PNML (sax parser for PT used): 36 ms
[2020-06-05 00:24:19] [INFO ] Transformed 78 places.
[2020-06-05 00:24:19] [INFO ] Transformed 57 transitions.
[2020-06-05 00:24:19] [INFO ] Found NUPN structural information;
[2020-06-05 00:24:19] [INFO ] Parsed PT model containing 78 places and 57 transitions in 71 ms.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 16 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 166 ms. (steps per millisecond=602 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 56 rows 78 cols
[2020-06-05 00:24:19] [INFO ] Computed 34 place invariants in 6 ms
[2020-06-05 00:24:19] [INFO ] [Real]Absence check using 34 positive place invariants in 28 ms returned sat
[2020-06-05 00:24:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 00:24:19] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2020-06-05 00:24:19] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 00:24:19] [INFO ] [Nat]Absence check using 34 positive place invariants in 8 ms returned unsat
Successfully simplified 1 atomic propositions for a total of 1 simplifications.
[2020-06-05 00:24:19] [INFO ] Initial state reduction rules for CTL removed 8 formulas.
[2020-06-05 00:24:19] [INFO ] Flatten gal took : 31 ms
FORMULA ShieldPPPt-PT-003A-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-003A-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-003A-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-003A-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-003A-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-003A-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-003A-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-003A-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-05 00:24:19] [INFO ] Applying decomposition
[2020-06-05 00:24:19] [INFO ] Flatten gal took : 11 ms
[2020-06-05 00:24:19] [INFO ] Decomposing Gal with order
[2020-06-05 00:24:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-06-05 00:24:19] [INFO ] Removed a total of 18 redundant transitions.
[2020-06-05 00:24:19] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-06-05 00:24:19] [INFO ] Flatten gal took : 34 ms
[2020-06-05 00:24:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2020-06-05 00:24:20] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA ShieldPPPt-PT-003A-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-05 00:24:20] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2020-06-05 00:24:20] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 1 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ ShieldPPPt-PT-003A @ 3570 seconds

FORMULA ShieldPPPt-PT-003A-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-003A-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-003A-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-003A-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-003A-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-003A-03 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-003A-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2714
rslt: Output for LTLCardinality @ ShieldPPPt-PT-003A

{
"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": "Fri Jun 5 00:24:20 2020
",
"timelimit": 3570
},
"child":
[

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"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": "F (G ((((p49 <= 0)) OR ((1 <= p70)))))",
"processed_size": 39,
"rewrites": 47
},
"result":
{
"edges": 6030,
"markings": 5737,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 0,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 2,
"X": 2,
"aconj": 9,
"adisj": 3,
"aneg": 0,
"comp": 9,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "((((p75 <= 0)) OR ((1 <= p45)) OR ((p44 <= 0)) OR ((1 <= p23))) U X (X (((F (((1 <= p20))) AND (((p1 <= 0)) OR ((1 <= p56)))) U (((p1 <= 0)) OR ((1 <= p56)))))))",
"processed_size": 166,
"rewrites": 47
},
"result":
{
"edges": 62,
"markings": 62,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 8
},
"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": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"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": "F (G ((((p53 <= 0)) OR ((1 <= p70)))))",
"processed_size": 39,
"rewrites": 47
},
"result":
{
"edges": 12,
"markings": 11,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"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 ((((p8 <= 0)) OR ((1 <= p40))))",
"processed_size": 34,
"rewrites": 47
},
"result":
{
"edges": 225,
"markings": 185,
"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": 1586
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1586
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 2,
"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": "(((1 <= p74)) AND ((p13 <= 0)))",
"processed_size": 31,
"rewrites": 47
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 5,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3173
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 2,
"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": "(((p74 <= 0)) OR ((1 <= p13)))",
"processed_size": 31,
"rewrites": 49
},
"result":
{
"edges": 10,
"markings": 10,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 6
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 5,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3173
},
"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": "(((p63 <= 0)) OR ((1 <= p58)))",
"processed_size": 31,
"rewrites": 47
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 6,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1
},
"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 ((((p56 <= 0)) OR ((1 <= p20))))",
"processed_size": 35,
"rewrites": 47
},
"result":
{
"edges": 444,
"markings": 412,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 8,
"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": 1
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"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": "F ((G ((((p56 <= 0)) OR ((1 <= p20)))) AND (((p63 <= 0)) OR ((1 <= p58)))))",
"processed_size": 77,
"rewrites": 47
},
"result":
{
"edges": 4247,
"markings": 3837,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 6,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 2,
"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": "(((1 <= p74)) AND ((p13 <= 0)))",
"processed_size": 31,
"rewrites": 47
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 8,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 2,
"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": "(((p74 <= 0)) OR ((1 <= p13)))",
"processed_size": 31,
"rewrites": 49
},
"result":
{
"edges": 10,
"markings": 10,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 6
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"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": "G (F ((((1 <= p67)) AND ((p36 <= 0)))))",
"processed_size": 39,
"rewrites": 47
},
"result":
{
"edges": 40,
"markings": 37,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "fairness",
"workflow": "product automaton"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 8,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 3800,
"runtime": 856.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "((G(**) AND **) OR (G(**) AND F((G(**) AND **)))) : (F(G(**)) AND (G((** OR G(**))) AND X(G(**)))) : G((F(**) OR (** OR (** OR (** OR **))))) : F(G(**)) : G(**) : (** OR (G(F(*)) AND F(**))) : (** U X(X(((F(**) AND **) U **))))"
},
"net":
{
"arcs": 220,
"conflict_clusters": 36,
"places": 78,
"places_significant": 44,
"singleton_clusters": 0,
"transitions": 56
},
"result":
{
"preliminary_value": "no no unknown no no no no ",
"value": "no no unknown no no no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 134/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 2496
lola: finding significant places
lola: 78 places, 56 transitions, 44 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: (p20 <= 1)
lola: LP says that atomic proposition is always true: (p20 <= 1)
lola: LP says that atomic proposition is always true: (p58 <= 1)
lola: LP says that atomic proposition is always true: (p43 <= 1)
lola: LP says that atomic proposition is always true: (p70 <= 1)
lola: LP says that atomic proposition is always true: (p43 <= 1)
lola: LP says that atomic proposition is always true: (p18 <= 1)
lola: LP says that atomic proposition is always true: (p23 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p52 <= 1)
lola: LP says that atomic proposition is always true: (p31 <= 1)
lola: LP says that atomic proposition is always true: (p74 <= 1)
lola: LP says that atomic proposition is always true: (p74 <= 1)
lola: LP says that atomic proposition is always true: (p70 <= 1)
lola: LP says that atomic proposition is always true: (p40 <= 1)
lola: LP says that atomic proposition is always true: (p36 <= 1)
lola: LP says that atomic proposition is always true: (p13 <= 1)
lola: LP says that atomic proposition is always true: (p45 <= 1)
lola: LP says that atomic proposition is always true: (p23 <= 1)
lola: LP says that atomic proposition is always true: (p20 <= 1)
lola: LP says that atomic proposition is always true: (p56 <= 1)
lola: LP says that atomic proposition is always true: (p56 <= 1)
lola: (G ((((p56 <= 0)) OR ((1 <= p20)))) U (G ((((p56 <= 0)) OR ((1 <= p20)))) AND (((p63 <= 0)) OR ((1 <= p58))))) : (NOT(F (NOT(((((p49 <= 0)) OR ((1 <= p43))) U G ((((p49 <= 0)) OR ((1 <= p70)))))))) AND NOT(X (NOT(G ((((p49 <= 0)) OR ((1 <= p43)))))))) : G (((((F ((((p21 <= 0)) OR ((1 <= p18)))) OR ((p23 <= 0))) OR ((1 <= p23))) OR ((p11 <= 0))) OR ((1 <= p9)))) : (((((p2 <= 0)) OR ((1 <= p52))) AND (((p47 <= 0)) OR ((1 <= p31)) OR ((p49 <= 0)) OR ((1 <= p74)))) U ((((1 <= p49)) AND ((p74 <= 0))) U F (X (G ((((p53 <= 0)) OR ((1 <= p70)))))))) : G ((((p8 <= 0)) OR ((1 <= p40)))) : (NOT(G (X (F (NOT(F (NOT(X (X ((((p67 <= 0)) OR ((1 <= p36)))))))))))) U (((1 <= p74)) AND ((p13 <= 0)))) : ((((p75 <= 0)) OR ((1 <= p45)) OR ((p44 <= 0)) OR ((1 <= p23))) U X (X (((F (((1 <= p20))) AND (((p1 <= 0)) OR ((1 <= p56)))) U (((p1 <= 0)) OR ((1 <= p56)))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:431
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:332
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:437
lola: rewrite Frontend/Parser/formula_rewrite.k:374
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:300
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
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:431
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (G ((((p49 <= 0)) OR ((1 <= p70))))) AND (G (((((p49 <= 0)) OR ((1 <= p43))) OR G ((((p49 <= 0)) OR ((1 <= p70)))))) AND X (G ((((p49 <= 0)) OR ((1 <= p43)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((((p49 <= 0)) OR ((1 <= p70)))))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((((p49 <= 0)) OR ((1 <= p70)))))
lola: processed formula length: 39
lola: 47 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: 5737 markings, 6030 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((((p75 <= 0)) OR ((1 <= p45)) OR ((p44 <= 0)) OR ((1 <= p23))) U X (X (((F (((1 <= p20))) AND (((p1 <= 0)) OR ((1 <= p56)))) U (((p1 <= 0)) OR ((1 <= p56)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((((p75 <= 0)) OR ((1 <= p45)) OR ((p44 <= 0)) OR ((1 <= p23))) U X (X (((F (((1 <= p20))) AND (((p1 <= 0)) OR ((1 <= p56)))) U (((p1 <= 0)) OR ((1 <= p56)))))))
lola: processed formula length: 166
lola: 47 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 8 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 62 markings, 62 edges
lola: ========================================
lola: subprocess 2 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((((p53 <= 0)) OR ((1 <= p70)))))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((((p53 <= 0)) OR ((1 <= p70)))))
lola: processed formula length: 39
lola: 47 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: 11 markings, 12 edges
lola: ========================================
lola: subprocess 3 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((((p8 <= 0)) OR ((1 <= p40))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((((p8 <= 0)) OR ((1 <= p40))))
lola: processed formula length: 34
lola: 47 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: 185 markings, 225 edges
lola: ========================================
lola: subprocess 4 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((F ((((p21 <= 0)) OR ((1 <= p18)))) OR (((p23 <= 0)) OR (((1 <= p23)) OR (((p11 <= 0)) OR ((1 <= p9)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((F ((((p21 <= 0)) OR ((1 <= p18)))) OR (((p23 <= 0)) OR (((1 <= p23)) OR (((p11 <= 0)) OR ((1 <= p9)))))))
lola: processed formula length: 110
lola: 47 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: 1879972 markings, 2544398 edges, 375994 markings/sec, 0 secs
lola: 3795142 markings, 5266441 edges, 383034 markings/sec, 5 secs
lola: 5878190 markings, 8278609 edges, 416610 markings/sec, 10 secs
lola: 7968370 markings, 11327950 edges, 418036 markings/sec, 15 secs
lola: 10008598 markings, 14310547 edges, 408046 markings/sec, 20 secs
lola: 12143233 markings, 17446534 edges, 426927 markings/sec, 25 secs
lola: 14280192 markings, 20589606 edges, 427392 markings/sec, 30 secs
lola: 16360367 markings, 23658238 edges, 416035 markings/sec, 35 secs
lola: 18277665 markings, 26486118 edges, 383460 markings/sec, 40 secs
lola: 20212815 markings, 29345251 edges, 387030 markings/sec, 45 secs
lola: 22248840 markings, 32352741 edges, 407205 markings/sec, 50 secs
lola: 24375074 markings, 35501914 edges, 425247 markings/sec, 55 secs
lola: 26332158 markings, 38397179 edges, 391417 markings/sec, 60 secs
lola: 28241597 markings, 41220081 edges, 381888 markings/sec, 65 secs
lola: 30224290 markings, 44155644 edges, 396539 markings/sec, 70 secs
lola: 32133802 markings, 46981722 edges, 381902 markings/sec, 75 secs
lola: 34048531 markings, 49821090 edges, 382946 markings/sec, 80 secs
lola: 35950257 markings, 52646486 edges, 380345 markings/sec, 85 secs
lola: 37834391 markings, 55441998 edges, 376827 markings/sec, 90 secs
lola: 39685994 markings, 58194080 edges, 370321 markings/sec, 95 secs
lola: 41631169 markings, 61087766 edges, 389035 markings/sec, 100 secs
lola: 43634649 markings, 64067383 edges, 400696 markings/sec, 105 secs
lola: 45680215 markings, 67114732 edges, 409113 markings/sec, 110 secs
lola: 47706483 markings, 70132642 edges, 405254 markings/sec, 115 secs
lola: 49718846 markings, 73131806 edges, 402473 markings/sec, 120 secs
lola: 51737994 markings, 76143469 edges, 403830 markings/sec, 125 secs
lola: 53749560 markings, 79143947 edges, 402313 markings/sec, 130 secs
lola: 55752012 markings, 82133993 edges, 400490 markings/sec, 135 secs
lola: 57753119 markings, 85124479 edges, 400221 markings/sec, 140 secs
lola: 59750408 markings, 88113622 edges, 399458 markings/sec, 145 secs
lola: 61713054 markings, 91050564 edges, 392529 markings/sec, 150 secs
lola: 63681261 markings, 93996669 edges, 393641 markings/sec, 155 secs
lola: 65645852 markings, 96936164 edges, 392918 markings/sec, 160 secs
lola: 67629392 markings, 99908299 edges, 396708 markings/sec, 165 secs
lola: 69606555 markings, 102870385 edges, 395433 markings/sec, 170 secs
lola: 71582766 markings, 105834416 edges, 395242 markings/sec, 175 secs
lola: 73545580 markings, 108779156 edges, 392563 markings/sec, 180 secs
lola: 75493195 markings, 111703763 edges, 389523 markings/sec, 185 secs
lola: 77280710 markings, 114384638 edges, 357503 markings/sec, 190 secs
lola: 79100515 markings, 117115752 edges, 363961 markings/sec, 195 secs
lola: 80990418 markings, 119955424 edges, 377981 markings/sec, 200 secs
lola: 82959241 markings, 122910062 edges, 393765 markings/sec, 205 secs
lola: 84916874 markings, 125850065 edges, 391527 markings/sec, 210 secs
lola: 86862308 markings, 128778148 edges, 389087 markings/sec, 215 secs
lola: 88819821 markings, 131719605 edges, 391503 markings/sec, 220 secs
lola: 90777659 markings, 134663634 edges, 391568 markings/sec, 225 secs
lola: 92732229 markings, 137604783 edges, 390914 markings/sec, 230 secs
lola: 94676092 markings, 140531201 edges, 388773 markings/sec, 235 secs
lola: 96619196 markings, 143455004 edges, 388621 markings/sec, 240 secs
lola: 98562502 markings, 146384044 edges, 388661 markings/sec, 245 secs
lola: 100494297 markings, 149295211 edges, 386359 markings/sec, 250 secs
lola: 102401454 markings, 152172665 edges, 381431 markings/sec, 255 secs
lola: 104196721 markings, 154877883 edges, 359053 markings/sec, 260 secs
lola: 105858875 markings, 157382331 edges, 332431 markings/sec, 265 secs
lola: 107188499 markings, 159386053 edges, 265925 markings/sec, 270 secs
lola: 108486738 markings, 161344216 edges, 259648 markings/sec, 275 secs
lola: 109765107 markings, 163274925 edges, 255674 markings/sec, 280 secs
lola: 111385558 markings, 165722792 edges, 324090 markings/sec, 285 secs
lola: 112563665 markings, 167500390 edges, 235621 markings/sec, 290 secs
lola: 113623563 markings, 169102107 edges, 211980 markings/sec, 295 secs
lola: 114678096 markings, 170697487 edges, 210907 markings/sec, 300 secs
lola: 115935128 markings, 172597890 edges, 251406 markings/sec, 305 secs
lola: 117191279 markings, 174494883 edges, 251230 markings/sec, 310 secs
lola: 118492626 markings, 176458758 edges, 260269 markings/sec, 315 secs
lola: 120042420 markings, 178798723 edges, 309959 markings/sec, 320 secs
lola: 121447356 markings, 180921700 edges, 280987 markings/sec, 325 secs
lola: 122695700 markings, 182810240 edges, 249669 markings/sec, 330 secs
lola: 123820609 markings, 184512152 edges, 224982 markings/sec, 335 secs
lola: 124931058 markings, 186189828 edges, 222090 markings/sec, 340 secs
lola: 126319089 markings, 188288345 edges, 277606 markings/sec, 345 secs
lola: 127605581 markings, 190233544 edges, 257298 markings/sec, 350 secs
lola: 128753250 markings, 191972424 edges, 229534 markings/sec, 355 secs
lola: 129864318 markings, 193651506 edges, 222214 markings/sec, 360 secs
lola: 130936086 markings, 195270707 edges, 214354 markings/sec, 365 secs
lola: 132108325 markings, 197043504 edges, 234448 markings/sec, 370 secs
lola: 133145713 markings, 198612463 edges, 207478 markings/sec, 375 secs
lola: 134336121 markings, 200414660 edges, 238082 markings/sec, 380 secs
lola: 134883047 markings, 201241610 edges, 109385 markings/sec, 385 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 5 will run for 1586 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((((1 <= p74)) AND ((p13 <= 0))) OR (G (F ((((1 <= p67)) AND ((p36 <= 0))))) AND F ((((1 <= p74)) AND ((p13 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 1586 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p74)) AND ((p13 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((1 <= p74)) AND ((p13 <= 0)))
lola: processed formula length: 31
lola: 47 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 2 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 6 will run for 3173 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((((1 <= p74)) AND ((p13 <= 0))))
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: (((p74 <= 0)) OR ((1 <= p13)))
lola: processed formula length: 31
lola: 49 rewrites
lola: closed formula file LTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 10 markings, 10 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: subprocess 6 will run for 3173 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((G ((((p56 <= 0)) OR ((1 <= p20)))) AND (((p63 <= 0)) OR ((1 <= p58)))) OR (G ((((p56 <= 0)) OR ((1 <= p20)))) AND F ((G ((((p56 <= 0)) OR ((1 <= p20)))) AND (((p63 <= 0)) OR ((1 <= p58)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 3173 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p63 <= 0)) OR ((1 <= p58)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((p63 <= 0)) OR ((1 <= p58)))
lola: processed formula length: 31
lola: 47 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: Child process aborted or communication problem between parent and child process
lola: subprocess 8 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((((p56 <= 0)) OR ((1 <= p20))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((((p56 <= 0)) OR ((1 <= p20))))
lola: processed formula length: 35
lola: 47 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: 412 markings, 444 edges
lola: ========================================
lola: subprocess 9 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((G ((((p56 <= 0)) OR ((1 <= p20)))) AND (((p63 <= 0)) OR ((1 <= p58)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((G ((((p56 <= 0)) OR ((1 <= p20)))) AND (((p63 <= 0)) OR ((1 <= p58)))))
lola: processed formula length: 77
lola: 47 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: 3837 markings, 4247 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: G ((F ((((p21 <= 0)) OR ((1 <= p18)))) OR (((p23 <= 0)) OR (((1 <= p23)) OR (((p11 <= 0)) OR ((1 <= p9)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((F ((((p21 <= 0)) OR ((1 <= p18)))) OR (((p23 <= 0)) OR (((1 <= p23)) OR (((p11 <= 0)) OR ((1 <= p9)))))))
lola: processed formula length: 110
lola: 47 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: 2104572 markings, 2860189 edges, 420914 markings/sec, 0 secs
lola: 3770403 markings, 5230859 edges, 333166 markings/sec, 5 secs
lola: 5313952 markings, 7458224 edges, 308710 markings/sec, 10 secs
lola: 6785938 markings, 9599357 edges, 294397 markings/sec, 15 secs
lola: 8248279 markings, 11738938 edges, 292468 markings/sec, 20 secs
lola: 9904962 markings, 14157878 edges, 331337 markings/sec, 25 secs
lola: 11841999 markings, 17002647 edges, 387407 markings/sec, 30 secs
lola: 13427432 markings, 19338530 edges, 317087 markings/sec, 35 secs
lola: 15042582 markings, 21712496 edges, 323030 markings/sec, 40 secs
lola: 16615162 markings, 24035395 edges, 314516 markings/sec, 45 secs
lola: 18215106 markings, 26393802 edges, 319989 markings/sec, 50 secs
lola: 19833885 markings, 28783009 edges, 323756 markings/sec, 55 secs
lola: 21439931 markings, 31160562 edges, 321209 markings/sec, 60 secs
lola: 22991188 markings, 33452828 edges, 310251 markings/sec, 65 secs
lola: 24484158 markings, 35664428 edges, 298594 markings/sec, 70 secs
lola: 26073765 markings, 38012739 edges, 317921 markings/sec, 75 secs
lola: 27647051 markings, 40340470 edges, 314657 markings/sec, 80 secs
lola: 29208075 markings, 42651823 edges, 312205 markings/sec, 85 secs
lola: 30736780 markings, 44913775 edges, 305741 markings/sec, 90 secs
lola: 32238181 markings, 47137036 edges, 300280 markings/sec, 95 secs
lola: 33750352 markings, 49378715 edges, 302434 markings/sec, 100 secs
lola: 35272786 markings, 51638744 edges, 304487 markings/sec, 105 secs
lola: 36818922 markings, 53935288 edges, 309227 markings/sec, 110 secs
lola: 38390066 markings, 56268004 edges, 314229 markings/sec, 115 secs
lola: 39910418 markings, 58527905 edges, 304070 markings/sec, 120 secs
lola: 41377519 markings, 60710130 edges, 293420 markings/sec, 125 secs
lola: 42960434 markings, 63064583 edges, 316583 markings/sec, 130 secs
lola: 44610406 markings, 65519526 edges, 329994 markings/sec, 135 secs
lola: 46218471 markings, 67915460 edges, 321613 markings/sec, 140 secs
lola: 47743995 markings, 70188803 edges, 305105 markings/sec, 145 secs
lola: 49266708 markings, 72458554 edges, 304543 markings/sec, 150 secs
lola: 50798783 markings, 74743063 edges, 306415 markings/sec, 155 secs
lola: 52377437 markings, 77097273 edges, 315731 markings/sec, 160 secs
lola: 53957174 markings, 79453218 edges, 315947 markings/sec, 165 secs
lola: 55538473 markings, 81814897 edges, 316260 markings/sec, 170 secs
lola: 57124770 markings, 84184428 edges, 317259 markings/sec, 175 secs
lola: 58665433 markings, 86490794 edges, 308133 markings/sec, 180 secs
lola: 60232874 markings, 88834280 edges, 313488 markings/sec, 185 secs
lola: 61770840 markings, 91136639 edges, 307593 markings/sec, 190 secs
lola: 63336506 markings, 93479752 edges, 313133 markings/sec, 195 secs
lola: 64772461 markings, 95629746 edges, 287191 markings/sec, 200 secs
lola: 66102470 markings, 97621152 edges, 266002 markings/sec, 205 secs
lola: 67405842 markings, 99573212 edges, 260674 markings/sec, 210 secs
lola: 68732605 markings, 101561025 edges, 265353 markings/sec, 215 secs
lola: 70048414 markings, 103532811 edges, 263162 markings/sec, 220 secs
lola: 71356064 markings, 105494187 edges, 261530 markings/sec, 225 secs
lola: 72646502 markings, 107429237 edges, 258088 markings/sec, 230 secs
lola: 73932526 markings, 109360155 edges, 257205 markings/sec, 235 secs
lola: 75248128 markings, 111335288 edges, 263120 markings/sec, 240 secs
lola: 76458228 markings, 113152711 edges, 242020 markings/sec, 245 secs
lola: 77736952 markings, 115069087 edges, 255745 markings/sec, 250 secs
lola: 79016633 markings, 116990089 edges, 255936 markings/sec, 255 secs
lola: 80497186 markings, 119214013 edges, 296111 markings/sec, 260 secs
lola: 82082039 markings, 121592847 edges, 316971 markings/sec, 265 secs
lola: 83721022 markings, 124054133 edges, 327797 markings/sec, 270 secs
lola: 85368050 markings, 126529920 edges, 329406 markings/sec, 275 secs
lola: 87013409 markings, 129003971 edges, 329072 markings/sec, 280 secs
lola: 88662910 markings, 131484847 edges, 329900 markings/sec, 285 secs
lola: 90259562 markings, 133883915 edges, 319330 markings/sec, 290 secs
lola: 91915281 markings, 136375862 edges, 331144 markings/sec, 295 secs
lola: 93568871 markings, 138864149 edges, 330718 markings/sec, 300 secs
lola: 95211894 markings, 141338749 edges, 328605 markings/sec, 305 secs
lola: 96874298 markings, 143838700 edges, 332481 markings/sec, 310 secs
lola: 98529909 markings, 146334959 edges, 331122 markings/sec, 315 secs
lola: 100127770 markings, 148742375 edges, 319572 markings/sec, 320 secs
lola: 101799459 markings, 151265246 edges, 334338 markings/sec, 325 secs
lola: 103473343 markings, 153786274 edges, 334777 markings/sec, 330 secs
lola: 105077561 markings, 156204755 edges, 320844 markings/sec, 335 secs
lola: 106783407 markings, 158775073 edges, 341169 markings/sec, 340 secs
lola: 107988228 markings, 160591892 edges, 240964 markings/sec, 345 secs
lola: 109356958 markings, 162658104 edges, 273746 markings/sec, 350 secs
lola: 110704031 markings, 164694333 edges, 269415 markings/sec, 355 secs
lola: 112072084 markings, 166758570 edges, 273611 markings/sec, 360 secs
lola: 113323158 markings, 168648054 edges, 250215 markings/sec, 365 secs
lola: 114651482 markings, 170656945 edges, 265665 markings/sec, 370 secs
lola: 115832908 markings, 172443161 edges, 236285 markings/sec, 375 secs
lola: 117134472 markings, 174409042 edges, 260313 markings/sec, 380 secs
lola: 118495721 markings, 176463553 edges, 272250 markings/sec, 385 secs
lola: 119926116 markings, 178623228 edges, 286079 markings/sec, 390 secs
lola: 121088524 markings, 180379978 edges, 232482 markings/sec, 395 secs
lola: 122237031 markings, 182117112 edges, 229701 markings/sec, 400 secs
lola: 123444892 markings, 183944072 edges, 241572 markings/sec, 405 secs
lola: 124614426 markings, 185710664 edges, 233907 markings/sec, 410 secs
lola: 125677007 markings, 187318744 edges, 212516 markings/sec, 415 secs
lola: 126734268 markings, 188915265 edges, 211452 markings/sec, 420 secs
lola: 127855642 markings, 190612023 edges, 224275 markings/sec, 425 secs
lola: 129071401 markings, 192452531 edges, 243152 markings/sec, 430 secs
lola: 130184738 markings, 194136810 edges, 222667 markings/sec, 435 secs
lola: 131383243 markings, 195947226 edges, 239701 markings/sec, 440 secs
lola: 132841847 markings, 198152867 edges, 291721 markings/sec, 445 secs
lola: 134102013 markings, 200059529 edges, 252033 markings/sec, 450 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: ((((1 <= p74)) AND ((p13 <= 0))) OR (G (F ((((1 <= p67)) AND ((p36 <= 0))))) AND F ((((1 <= p74)) AND ((p13 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: (((1 <= p74)) AND ((p13 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((1 <= p74)) AND ((p13 <= 0)))
lola: processed formula length: 31
lola: 47 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 2 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: ...considering subproblem: F ((((1 <= p74)) AND ((p13 <= 0))))
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: (((p74 <= 0)) OR ((1 <= p13)))
lola: processed formula length: 31
lola: 49 rewrites
lola: closed formula file LTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 10 markings, 10 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: G (F ((((1 <= p67)) AND ((p36 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking fairness
lola: fairness not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((((1 <= p67)) AND ((p36 <= 0)))))
lola: processed formula length: 39
lola: 47 rewrites
lola: closed formula file LTLCardinality.xml
lola: ========================================
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: 37 markings, 40 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no unknown no no no no
lola:
preliminary result: no no unknown no no no no
lola: memory consumption: 3800 KB
lola: time consumption: 856 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="ShieldPPPt-PT-003A"
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 ShieldPPPt-PT-003A, 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 r211-tajo-159033477700601"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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