Execution Chart

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

Trace from the execution

Formatting '/local/x2003239/mcc2020-input.r194-csrt-159033390200585.qcow2', fmt=qcow2 size=4294967296 backing_file=/local/x2003239/mcc2020-input.qcow2 encryption=off cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is TriangularGrid-PT-5046, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r194-csrt-159033390200585
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 360K
-rw-r--r-- 1 mcc users 2.9K Apr 27 14:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 14K Apr 27 14:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 27 14:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K 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.0K Apr 27 14:36 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 27 14:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 28 14:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 27 14:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 27 14:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Apr 27 14:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.5K 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.8K Apr 27 14:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K 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 5 Apr 27 14:36 instance
-rw-r--r-- 1 mcc users 6 Apr 27 14:36 iscolored
-rwxr-xr-x 1 mcc users 185K 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 TriangularGrid-PT-5046-00
FORMULA_NAME TriangularGrid-PT-5046-01
FORMULA_NAME TriangularGrid-PT-5046-02
FORMULA_NAME TriangularGrid-PT-5046-03
FORMULA_NAME TriangularGrid-PT-5046-04
FORMULA_NAME TriangularGrid-PT-5046-05
FORMULA_NAME TriangularGrid-PT-5046-06
FORMULA_NAME TriangularGrid-PT-5046-07
FORMULA_NAME TriangularGrid-PT-5046-08
FORMULA_NAME TriangularGrid-PT-5046-09
FORMULA_NAME TriangularGrid-PT-5046-10
FORMULA_NAME TriangularGrid-PT-5046-11
FORMULA_NAME TriangularGrid-PT-5046-12
FORMULA_NAME TriangularGrid-PT-5046-13
FORMULA_NAME TriangularGrid-PT-5046-14
FORMULA_NAME TriangularGrid-PT-5046-15

=== Now, execution of the tool begins

BK_START 1591233246833

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-04 01:14:09] [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-04 01:14:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-04 01:14:09] [INFO ] Load time of PNML (sax parser for PT used): 91 ms
[2020-06-04 01:14:09] [INFO ] Transformed 280 places.
[2020-06-04 01:14:09] [INFO ] Transformed 240 transitions.
[2020-06-04 01:14:09] [INFO ] Parsed PT model containing 280 places and 240 transitions in 140 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 20 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 11 resets, run finished after 1280 ms. (steps per millisecond=78 ) properties seen :[0, 0, 0, 1, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1]
// Phase 1: matrix 240 rows 280 cols
[2020-06-04 01:14:10] [INFO ] Computed 116 place invariants in 20 ms
[2020-06-04 01:14:10] [INFO ] [Real]Absence check using 115 positive place invariants in 24 ms returned unsat
[2020-06-04 01:14:11] [INFO ] [Real]Absence check using 115 positive place invariants in 88 ms returned unsat
[2020-06-04 01:14:11] [INFO ] [Real]Absence check using 115 positive place invariants in 76 ms returned unsat
[2020-06-04 01:14:11] [INFO ] [Real]Absence check using 115 positive place invariants in 35 ms returned unsat
[2020-06-04 01:14:11] [INFO ] [Real]Absence check using 115 positive place invariants in 19 ms returned unsat
[2020-06-04 01:14:11] [INFO ] [Real]Absence check using 115 positive place invariants in 31 ms returned unsat
[2020-06-04 01:14:11] [INFO ] [Real]Absence check using 115 positive place invariants in 4 ms returned unsat
[2020-06-04 01:14:11] [INFO ] [Real]Absence check using 115 positive place invariants in 20 ms returned unsat
[2020-06-04 01:14:11] [INFO ] [Real]Absence check using 115 positive place invariants in 11 ms returned unsat
[2020-06-04 01:14:11] [INFO ] [Real]Absence check using 115 positive place invariants in 4 ms returned unsat
[2020-06-04 01:14:11] [INFO ] [Real]Absence check using 115 positive place invariants in 3 ms returned unsat
[2020-06-04 01:14:11] [INFO ] [Real]Absence check using 115 positive place invariants in 18 ms returned unsat
[2020-06-04 01:14:11] [INFO ] [Real]Absence check using 115 positive place invariants in 16 ms returned unsat
[2020-06-04 01:14:11] [INFO ] [Real]Absence check using 115 positive place invariants in 11 ms returned unsat
Successfully simplified 14 atomic propositions for a total of 14 simplifications.
[2020-06-04 01:14:11] [INFO ] Initial state reduction rules for CTL removed 10 formulas.
[2020-06-04 01:14:12] [INFO ] Flatten gal took : 72 ms
FORMULA TriangularGrid-PT-5046-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TriangularGrid-PT-5046-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TriangularGrid-PT-5046-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TriangularGrid-PT-5046-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TriangularGrid-PT-5046-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TriangularGrid-PT-5046-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TriangularGrid-PT-5046-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TriangularGrid-PT-5046-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TriangularGrid-PT-5046-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TriangularGrid-PT-5046-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-04 01:14:12] [INFO ] Flatten gal took : 24 ms
[2020-06-04 01:14:12] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2020-06-04 01:14:12] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 6 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ TriangularGrid-PT-5046 @ 3570 seconds

FORMULA TriangularGrid-PT-5046-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA TriangularGrid-PT-5046-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA TriangularGrid-PT-5046-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA TriangularGrid-PT-5046-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA TriangularGrid-PT-5046-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA TriangularGrid-PT-5046-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3567
rslt: Output for LTLCardinality @ TriangularGrid-PT-5046

{
"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": "Thu Jun 4 01:14:12 2020
",
"timelimit": 3570
},
"child":
[

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X ((p155 <= p233))",
"processed_size": 18,
"rewrites": 19
},
"result":
{
"edges": 1717,
"markings": 1717,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 0,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "X (F ((F ((p245 <= p278)) OR (X ((p266 <= p130)) OR (p180 <= p266)))))",
"processed_size": 70,
"rewrites": 19
},
"result":
{
"edges": 75,
"markings": 76,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"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": 1189
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 3,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 3,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "F ((X (X ((X (G ((2 <= p63))) AND ((2 <= p63) AND (p209 <= p117))))) AND (p58 + 1 <= p13)))",
"processed_size": 91,
"rewrites": 19
},
"result":
{
"edges": 1840,
"markings": 1840,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 24
},
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1783
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "((p256 <= p27) AND (p250 <= p4))",
"processed_size": 32,
"rewrites": 21
},
"result":
{
"edges": 1947,
"markings": 1946,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 11
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3567
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "((p155 + 1 <= p94) OR (p27 + 1 <= p97))",
"processed_size": 40,
"rewrites": 21
},
"result":
{
"edges": 485,
"markings": 485,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 24
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
}
],
"exit":
{
"error": null,
"memory": 20568,
"runtime": 3.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "F(**) : F(G((F(**) AND (X(**) OR (X(**) U **))))) : X(**) : F(**) : X(F((F(**) OR (X(**) OR **)))) : F((X(X((X(G(**)) AND (** AND **)))) AND **))"
},
"net":
{
"arcs": 960,
"conflict_clusters": 115,
"places": 280,
"places_significant": 164,
"singleton_clusters": 0,
"transitions": 240
},
"result":
{
"preliminary_value": "no no no no yes no ",
"value": "no no no no yes no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 520/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 8960
lola: finding significant places
lola: 280 places, 240 transitions, 164 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: (NOT(X (NOT((G ((p256 <= p27)) U (0 <= 0))))) U ((p27 + 1 <= p256) OR (p4 + 1 <= p250))) : F (G ((X ((1 <= p46)) U (X ((p90 <= p179)) U (1 <= p46))))) : ((1 <= 0) U X ((p155 <= p233))) : ((1 <= 0) U F (((p94 <= p155) AND (p97 <= p27)))) : F (X (((F ((p245 <= p278)) OR X ((p266 <= p130))) OR (p180 <= p266)))) : F ((X (X (((X (G ((2 <= p63))) AND (2 <= p63)) AND (p209 <= p117)))) AND (p58 + 1 <= p13)))
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:115
lola: rewrite Frontend/Parser/formula_rewrite.k:124
lola: rewrite Frontend/Parser/formula_rewrite.k:279
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:282
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:522
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:185
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((F ((1 <= p46)) AND (X ((1 <= p46)) OR (X ((p90 <= p179)) U (1 <= p46))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((F ((1 <= p46)) AND (X ((1 <= p46)) OR (X ((p90 <= p179)) U (1 <= p46))))))
lola: processed formula length: 81
lola: 19 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: 1736 markings, 1739 edges
lola: ========================================
lola: subprocess 1 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((p155 <= p233))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((p155 <= p233))
lola: processed formula length: 18
lola: 19 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: 1717 markings, 1717 edges
lola: ========================================
lola: subprocess 2 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((F ((p245 <= p278)) OR (X ((p266 <= p130)) OR (p180 <= p266)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((F ((p245 <= p278)) OR (X ((p266 <= p130)) OR (p180 <= p266)))))
lola: processed formula length: 70
lola: 19 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 76 markings, 75 edges
lola: ========================================
lola: subprocess 3 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((X (X ((X (G ((2 <= p63))) AND ((2 <= p63) AND (p209 <= p117))))) AND (p58 + 1 <= p13)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((X (X ((X (G ((2 <= p63))) AND ((2 <= p63) AND (p209 <= p117))))) AND (p58 + 1 <= p13)))
lola: processed formula length: 91
lola: 19 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 24 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: 1840 markings, 1840 edges
lola: ========================================
lola: subprocess 4 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((p27 + 1 <= p256) OR (p4 + 1 <= p250)))
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: ((p256 <= p27) AND (p250 <= p4))
lola: processed formula length: 32
lola: 21 rewrites
lola: closed formula file LTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 1946 markings, 1947 edges
lola: ========================================
lola: subprocess 5 will run for 3567 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((p94 <= p155) AND (p97 <= p27)))
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: ((p155 + 1 <= p94) OR (p27 + 1 <= p97))
lola: processed formula length: 40
lola: 21 rewrites
lola: closed formula file LTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 485 markings, 485 edges
lola: RESULT
lola:
SUMMARY: no no no no yes no
lola:
preliminary result: no no no no yes no
lola: ========================================
lola: memory consumption: 20568 KB
lola: time consumption: 3 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="TriangularGrid-PT-5046"
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 TriangularGrid-PT-5046, 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 r194-csrt-159033390200585"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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