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.r180-ebro-158987900500593.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 DLCround-PT-12a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r180-ebro-158987900500593
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 3.3K Mar 30 20:46 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 30 20:46 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 29 10:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 29 10:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Apr 8 14:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 8 14:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Mar 28 06:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 28 06:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 27 00:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K Mar 27 00:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 28 14:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 28 14:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 871K Mar 24 05:37 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 DLCround-PT-12a-00
FORMULA_NAME DLCround-PT-12a-01
FORMULA_NAME DLCround-PT-12a-02
FORMULA_NAME DLCround-PT-12a-03
FORMULA_NAME DLCround-PT-12a-04
FORMULA_NAME DLCround-PT-12a-05
FORMULA_NAME DLCround-PT-12a-06
FORMULA_NAME DLCround-PT-12a-07
FORMULA_NAME DLCround-PT-12a-08
FORMULA_NAME DLCround-PT-12a-09
FORMULA_NAME DLCround-PT-12a-10
FORMULA_NAME DLCround-PT-12a-11
FORMULA_NAME DLCround-PT-12a-12
FORMULA_NAME DLCround-PT-12a-13
FORMULA_NAME DLCround-PT-12a-14
FORMULA_NAME DLCround-PT-12a-15

=== Now, execution of the tool begins

BK_START 1591256224844

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-04 07:37:07] [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 07:37:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-04 07:37:08] [INFO ] Load time of PNML (sax parser for PT used): 375 ms
[2020-06-04 07:37:08] [INFO ] Transformed 419 places.
[2020-06-04 07:37:08] [INFO ] Transformed 3407 transitions.
[2020-06-04 07:37:08] [INFO ] Found NUPN structural information;
[2020-06-04 07:37:08] [INFO ] Parsed PT model containing 419 places and 3407 transitions in 480 ms.
Ensure Unique test removed 315 transitions
Reduce redundant transitions removed 315 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 79 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 2012 ms. (steps per millisecond=49 ) properties seen :[1, 1, 1, 0, 1, 0, 0, 0, 0, 1, 0, 0, 1, 0, 1, 1, 1, 0, 0, 1, 1, 0, 0, 1, 0, 0, 0, 1, 1, 1, 1, 1]
[2020-06-04 07:37:10] [INFO ] Flow matrix only has 250 transitions (discarded 2842 similar events)
// Phase 1: matrix 250 rows 419 cols
[2020-06-04 07:37:10] [INFO ] Computed 277 place invariants in 38 ms
[2020-06-04 07:37:11] [INFO ] [Real]Absence check using 277 positive place invariants in 205 ms returned sat
[2020-06-04 07:37:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 07:37:11] [INFO ] [Real]Absence check using state equation in 749 ms returned sat
[2020-06-04 07:37:12] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 07:37:12] [INFO ] [Nat]Absence check using 277 positive place invariants in 27 ms returned unsat
[2020-06-04 07:37:12] [INFO ] [Real]Absence check using 277 positive place invariants in 179 ms returned sat
[2020-06-04 07:37:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 07:37:13] [INFO ] [Real]Absence check using state equation in 754 ms returned sat
[2020-06-04 07:37:13] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 07:37:13] [INFO ] [Nat]Absence check using 277 positive place invariants in 124 ms returned unsat
[2020-06-04 07:37:13] [INFO ] [Real]Absence check using 277 positive place invariants in 164 ms returned sat
[2020-06-04 07:37:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 07:37:14] [INFO ] [Real]Absence check using state equation in 736 ms returned sat
[2020-06-04 07:37:14] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 07:37:14] [INFO ] [Nat]Absence check using 277 positive place invariants in 138 ms returned unsat
[2020-06-04 07:37:15] [INFO ] [Real]Absence check using 277 positive place invariants in 172 ms returned sat
[2020-06-04 07:37:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 07:37:15] [INFO ] [Real]Absence check using state equation in 739 ms returned sat
[2020-06-04 07:37:15] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 07:37:16] [INFO ] [Nat]Absence check using 277 positive place invariants in 125 ms returned unsat
[2020-06-04 07:37:16] [INFO ] [Real]Absence check using 277 positive place invariants in 169 ms returned sat
[2020-06-04 07:37:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 07:37:17] [INFO ] [Real]Absence check using state equation in 823 ms returned sat
[2020-06-04 07:37:17] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 07:37:17] [INFO ] [Nat]Absence check using 277 positive place invariants in 150 ms returned unsat
[2020-06-04 07:37:17] [INFO ] [Real]Absence check using 277 positive place invariants in 171 ms returned sat
[2020-06-04 07:37:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 07:37:18] [INFO ] [Real]Absence check using state equation in 733 ms returned sat
[2020-06-04 07:37:18] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 07:37:18] [INFO ] [Nat]Absence check using 277 positive place invariants in 135 ms returned unsat
[2020-06-04 07:37:18] [INFO ] [Real]Absence check using 277 positive place invariants in 175 ms returned sat
[2020-06-04 07:37:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 07:37:19] [INFO ] [Real]Absence check using state equation in 727 ms returned sat
[2020-06-04 07:37:19] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 07:37:19] [INFO ] [Nat]Absence check using 277 positive place invariants in 135 ms returned unsat
[2020-06-04 07:37:20] [INFO ] [Real]Absence check using 277 positive place invariants in 198 ms returned sat
[2020-06-04 07:37:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 07:37:21] [INFO ] [Real]Absence check using state equation in 822 ms returned sat
[2020-06-04 07:37:21] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 07:37:21] [INFO ] [Nat]Absence check using 277 positive place invariants in 173 ms returned unsat
[2020-06-04 07:37:21] [INFO ] [Real]Absence check using 277 positive place invariants in 183 ms returned sat
[2020-06-04 07:37:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 07:37:22] [INFO ] [Real]Absence check using state equation in 749 ms returned sat
[2020-06-04 07:37:22] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 07:37:22] [INFO ] [Nat]Absence check using 277 positive place invariants in 24 ms returned unsat
[2020-06-04 07:37:22] [INFO ] [Real]Absence check using 277 positive place invariants in 192 ms returned sat
[2020-06-04 07:37:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 07:37:23] [INFO ] [Real]Absence check using state equation in 726 ms returned sat
[2020-06-04 07:37:23] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 07:37:23] [INFO ] [Nat]Absence check using 277 positive place invariants in 90 ms returned unsat
[2020-06-04 07:37:24] [INFO ] [Real]Absence check using 277 positive place invariants in 179 ms returned sat
[2020-06-04 07:37:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 07:37:24] [INFO ] [Real]Absence check using state equation in 728 ms returned sat
[2020-06-04 07:37:24] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 07:37:25] [INFO ] [Nat]Absence check using 277 positive place invariants in 96 ms returned unsat
[2020-06-04 07:37:25] [INFO ] [Real]Absence check using 277 positive place invariants in 179 ms returned sat
[2020-06-04 07:37:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 07:37:26] [INFO ] [Real]Absence check using state equation in 727 ms returned sat
[2020-06-04 07:37:26] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 07:37:26] [INFO ] [Nat]Absence check using 277 positive place invariants in 104 ms returned unsat
[2020-06-04 07:37:26] [INFO ] [Real]Absence check using 277 positive place invariants in 165 ms returned sat
[2020-06-04 07:37:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 07:37:27] [INFO ] [Real]Absence check using state equation in 665 ms returned sat
[2020-06-04 07:37:27] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 07:37:27] [INFO ] [Nat]Absence check using 277 positive place invariants in 20 ms returned unsat
[2020-06-04 07:37:27] [INFO ] [Real]Absence check using 277 positive place invariants in 155 ms returned sat
[2020-06-04 07:37:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 07:37:28] [INFO ] [Real]Absence check using state equation in 795 ms returned sat
[2020-06-04 07:37:28] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 07:37:28] [INFO ] [Nat]Absence check using 277 positive place invariants in 152 ms returned unsat
[2020-06-04 07:37:28] [INFO ] [Real]Absence check using 277 positive place invariants in 159 ms returned sat
[2020-06-04 07:37:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 07:37:29] [INFO ] [Real]Absence check using state equation in 665 ms returned sat
[2020-06-04 07:37:29] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 07:37:29] [INFO ] [Nat]Absence check using 277 positive place invariants in 28 ms returned unsat
Successfully simplified 15 atomic propositions for a total of 16 simplifications.
[2020-06-04 07:37:30] [INFO ] Initial state reduction rules for CTL removed 12 formulas.
[2020-06-04 07:37:30] [INFO ] Flatten gal took : 485 ms
FORMULA DLCround-PT-12a-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-12a-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-12a-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-12a-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-12a-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-12a-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-12a-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-12a-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-12a-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-12a-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-12a-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-12a-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-04 07:37:30] [INFO ] Applying decomposition
[2020-06-04 07:37:30] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-06-04 07:37:30] [INFO ] Flatten gal took : 246 ms
[2020-06-04 07:37:31] [INFO ] Decomposing Gal with order
[2020-06-04 07:37:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-06-04 07:37:31] [INFO ] Removed a total of 5280 redundant transitions.
[2020-06-04 07:37:31] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-06-04 07:37:32] [INFO ] Flatten gal took : 547 ms
[2020-06-04 07:37:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 176 labels/synchronizations in 204 ms.
[2020-06-04 07:37:32] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA DLCround-PT-12a-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-04 07:37:32] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 4 ms.
[2020-06-04 07:37:32] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 52 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ DLCround-PT-12a @ 3570 seconds

FORMULA DLCround-PT-12a-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DLCround-PT-12a-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DLCround-PT-12a-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3563
rslt: Output for LTLCardinality @ DLCround-PT-12a

{
"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": "Thu Jun 4 07:37:32 2020
",
"timelimit": 3570
},
"child":
[

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1781
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 2,
"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": "X (X ((((1 <= p30)) AND ((p128 <= 0)))))",
"processed_size": 40,
"rewrites": 32
},
"result":
{
"edges": 4,
"markings": 4,
"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"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3563
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 1,
"U": 0,
"X": 2,
"aconj": 4,
"adisj": 1,
"aneg": 4,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 3,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "X ((F ((G (((p374 <= 0))) OR (F (((p374 <= 0))) AND (((p374 <= 0)) AND ((p374 <= 0)))))) AND X (F (((p374 <= 0))))))",
"processed_size": 116,
"rewrites": 32
},
"result":
{
"edges": 4,
"markings": 4,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"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"
}
}
],
"exit":
{
"error": null,
"memory": 40692,
"runtime": 7.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "X((X(**) OR (** OR **))) : X(X(**)) : X((F((G(*) OR (F(*) AND (* AND *)))) AND X(F(**))))"
},
"net":
{
"arcs": 12180,
"conflict_clusters": 27,
"places": 419,
"places_significant": 142,
"singleton_clusters": 0,
"transitions": 3092
},
"result":
{
"preliminary_value": "yes no no ",
"value": "yes 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: 3511/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 419
lola: finding significant places
lola: 419 places, 3092 transitions, 142 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: (p108 <= 1)
lola: LP says that atomic proposition is always true: (p10 <= 1)
lola: LP says that atomic proposition is always true: (p128 <= 1)
lola: LP says that atomic proposition is always true: (p374 <= 1)
lola: LP says that atomic proposition is always true: (p374 <= 1)
lola: LP says that atomic proposition is always true: (p374 <= 1)
lola: LP says that atomic proposition is always true: (p374 <= 1)
lola: X (((X ((((p26 <= 0)) OR ((1 <= p108)))) OR ((p84 <= 0))) OR ((1 <= p10)))) : (X (((1 <= 0) U (0 <= 0))) AND X ((((0 <= 0) U (1 <= 0)) U X ((((1 <= p30)) AND ((p128 <= 0))))))) : NOT(X ((G (((G (((1 <= p374))) OR ((1 <= p374))) U ((1 <= p374)))) OR NOT(X (F (((p374 <= 0))))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:525
lola: rewrite Frontend/Parser/formula_rewrite.k:116
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:318
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:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 1187 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X ((((p26 <= 0)) OR ((1 <= p108)))) OR (((p84 <= 0)) OR ((1 <= p10)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X ((((p26 <= 0)) OR ((1 <= p108)))) OR (((p84 <= 0)) OR ((1 <= p10)))))
lola: processed formula length: 76
lola: 32 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 2 markings, 1 edges
lola: ========================================
lola: subprocess 1 will run for 1781 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X ((((1 <= p30)) AND ((p128 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X ((((1 <= p30)) AND ((p128 <= 0)))))
lola: processed formula length: 40
lola: 32 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: 4 markings, 4 edges
lola: ========================================
lola: subprocess 2 will run for 3563 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((F ((G (((p374 <= 0))) OR (F (((p374 <= 0))) AND (((p374 <= 0)) AND ((p374 <= 0)))))) AND X (F (((p374 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((F ((G (((p374 <= 0))) OR (F (((p374 <= 0))) AND (((p374 <= 0)) AND ((p374 <= 0)))))) AND X (F (((p374 <= 0))))))
lola: processed formula length: 116
lola: 32 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 7 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 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: 4 markings, 4 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no no
lola:
preliminary result: yes no no
lola: memory consumption: 40692 KB
lola: time consumption: 7 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="DLCround-PT-12a"
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 DLCround-PT-12a, 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 r180-ebro-158987900500593"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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