fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r170-smll-158987815600281
Last Updated
Jun 28, 2020

About the Execution of ITS-LoLa for FlexibleBarrier-PT-06b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15743.870 3600000.00 708679.00 1870.90 FTFFTFFTTTFTTFFT normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2020-input.r170-smll-158987815600281.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/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 FlexibleBarrier-PT-06b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r170-smll-158987815600281
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 328K
-rw-r--r-- 1 mcc users 3.7K Apr 4 18:11 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Apr 4 18:11 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 4 06:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 4 06:23 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 8 14:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 8 14:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 3 20:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K Apr 3 20:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Apr 3 13:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 3 13:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 4 01:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 4 01:37 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 141K 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 FlexibleBarrier-PT-06b-00
FORMULA_NAME FlexibleBarrier-PT-06b-01
FORMULA_NAME FlexibleBarrier-PT-06b-02
FORMULA_NAME FlexibleBarrier-PT-06b-03
FORMULA_NAME FlexibleBarrier-PT-06b-04
FORMULA_NAME FlexibleBarrier-PT-06b-05
FORMULA_NAME FlexibleBarrier-PT-06b-06
FORMULA_NAME FlexibleBarrier-PT-06b-07
FORMULA_NAME FlexibleBarrier-PT-06b-08
FORMULA_NAME FlexibleBarrier-PT-06b-09
FORMULA_NAME FlexibleBarrier-PT-06b-10
FORMULA_NAME FlexibleBarrier-PT-06b-11
FORMULA_NAME FlexibleBarrier-PT-06b-12
FORMULA_NAME FlexibleBarrier-PT-06b-13
FORMULA_NAME FlexibleBarrier-PT-06b-14
FORMULA_NAME FlexibleBarrier-PT-06b-15

=== Now, execution of the tool begins

BK_START 1591333839447

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-05 05:10:42] [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 05:10:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-05 05:10:42] [INFO ] Load time of PNML (sax parser for PT used): 144 ms
[2020-06-05 05:10:42] [INFO ] Transformed 542 places.
[2020-06-05 05:10:42] [INFO ] Transformed 621 transitions.
[2020-06-05 05:10:42] [INFO ] Found NUPN structural information;
[2020-06-05 05:10:42] [INFO ] Parsed PT model containing 542 places and 621 transitions in 207 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 36 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 1934 resets, run finished after 438 ms. (steps per millisecond=228 ) properties seen :[1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0]
// Phase 1: matrix 621 rows 542 cols
[2020-06-05 05:10:43] [INFO ] Computed 8 place invariants in 33 ms
[2020-06-05 05:10:43] [INFO ] [Real]Absence check using 8 positive place invariants in 39 ms returned sat
[2020-06-05 05:10:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 05:10:44] [INFO ] [Real]Absence check using state equation in 883 ms returned sat
[2020-06-05 05:10:44] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 05:10:44] [INFO ] [Nat]Absence check using 8 positive place invariants in 228 ms returned unsat
[2020-06-05 05:10:45] [INFO ] [Real]Absence check using 8 positive place invariants in 27 ms returned sat
[2020-06-05 05:10:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 05:10:45] [INFO ] [Real]Absence check using state equation in 853 ms returned sat
[2020-06-05 05:10:45] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 05:10:46] [INFO ] [Nat]Absence check using 8 positive place invariants in 230 ms returned unsat
[2020-06-05 05:10:46] [INFO ] [Real]Absence check using 8 positive place invariants in 27 ms returned sat
[2020-06-05 05:10:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 05:10:47] [INFO ] [Real]Absence check using state equation in 876 ms returned sat
[2020-06-05 05:10:47] [INFO ] Deduced a trap composed of 189 places in 555 ms
[2020-06-05 05:10:48] [INFO ] Deduced a trap composed of 46 places in 297 ms
[2020-06-05 05:10:48] [INFO ] Deduced a trap composed of 188 places in 594 ms
[2020-06-05 05:10:48] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1614 ms
[2020-06-05 05:10:48] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 05:10:55] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-05 05:10:58] [INFO ] [Nat]Absence check using 8 positive place invariants in 9334 ms returned unknown
[2020-06-05 05:10:58] [INFO ] [Real]Absence check using 8 positive place invariants in 27 ms returned sat
[2020-06-05 05:10:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 05:10:59] [INFO ] [Real]Absence check using state equation in 952 ms returned sat
[2020-06-05 05:10:59] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 05:11:05] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-05 05:11:09] [INFO ] [Nat]Absence check using 8 positive place invariants in 9345 ms returned unknown
Successfully simplified 2 atomic propositions for a total of 2 simplifications.
[2020-06-05 05:11:09] [INFO ] Initial state reduction rules for CTL removed 9 formulas.
[2020-06-05 05:11:09] [INFO ] Flatten gal took : 131 ms
FORMULA FlexibleBarrier-PT-06b-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-06b-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-06b-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-06b-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-06b-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-06b-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-06b-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-06b-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-06b-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-05 05:11:09] [INFO ] Applying decomposition
[2020-06-05 05:11:09] [INFO ] Flatten gal took : 46 ms
[2020-06-05 05:11:09] [INFO ] Decomposing Gal with order
[2020-06-05 05:11:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-06-05 05:11:09] [INFO ] Removed a total of 35 redundant transitions.
[2020-06-05 05:11:09] [INFO ] Flatten gal took : 106 ms
[2020-06-05 05:11:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 140 labels/synchronizations in 28 ms.
[2020-06-05 05:11:09] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2020-06-05 05:11:10] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 8 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ FlexibleBarrier-PT-06b @ 3570 seconds

FORMULA FlexibleBarrier-PT-06b-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FlexibleBarrier-PT-06b-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FlexibleBarrier-PT-06b-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FlexibleBarrier-PT-06b-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FlexibleBarrier-PT-06b-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FlexibleBarrier-PT-06b-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FlexibleBarrier-PT-06b-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2910
rslt: Output for LTLCardinality @ FlexibleBarrier-PT-06b

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 0,
"U": 1,
"X": 1,
"aconj": 5,
"adisj": 4,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "F ((((((1 <= p136)) AND ((p196 <= 0))) U X ((((p298 <= 0)) OR ((1 <= p374))))) AND F ((((p313 <= 0)) OR ((1 <= p350))))))",
"processed_size": 123,
"rewrites": 47
},
"result":
{
"edges": 2,
"markings": 3,
"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": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"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 ((((1 <= p312)) AND ((p445 <= 0))))",
"processed_size": 37,
"rewrites": 47
},
"result":
{
"edges": 14,
"markings": 14,
"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": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 4,
"G": 1,
"U": 0,
"X": 2,
"aconj": 6,
"adisj": 5,
"aneg": 0,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 2,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "X (F (((((p120 <= 0)) OR ((1 <= p510))) OR (F ((((p120 <= 0)) OR ((1 <= p510)))) AND F (G ((F (((p98 <= 0))) AND (X (((1 <= p199))) OR (((1 <= p342)) AND ((p287 <= 0)))))))))))",
"processed_size": 178,
"rewrites": 47
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 9
},
"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": 891
},
"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": "(((p124 <= 0)) OR ((1 <= p183)))",
"processed_size": 33,
"rewrites": 49
},
"result":
{
"edges": 45,
"markings": 46,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 5
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1188
},
"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 ((((p175 <= 0)) OR ((1 <= p307)))))",
"processed_size": 41,
"rewrites": 47
},
"result":
{
"edges": 4087,
"markings": 3130,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 4,
"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": 1783
},
"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": "G (F ((((p479 <= 0)) OR ((1 <= p110)))))",
"processed_size": 41,
"rewrites": 47
},
"result":
{
"edges": 97902347,
"markings": 33458636,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "fairness",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2910
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 0,
"aconj": 6,
"adisj": 3,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "F (G (((((p372 <= 0)) OR ((1 <= p461))) OR (G ((((p154 <= 0)) OR ((1 <= p456)))) AND F ((((p372 <= 0)) OR ((1 <= p461))))))))",
"processed_size": 128,
"rewrites": 47
},
"result":
{
"edges": 37807,
"markings": 23662,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 8
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"error": null,
"memory": 29036,
"runtime": 660.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "F(G((** OR (G(**) AND F(**))))) : F(G(**)) : F(**) : F(((** U X(**)) AND F(**))) : G(F(**)) : X(**) : X(F((** OR (F(**) AND F(G((F(**) AND (X(**) OR **))))))))"
},
"net":
{
"arcs": 1533,
"conflict_clusters": 425,
"places": 542,
"places_significant": 534,
"singleton_clusters": 0,
"transitions": 621
},
"result":
{
"preliminary_value": "no no no yes no no yes ",
"value": "no no no yes no no yes "
},
"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: 1163/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 542
lola: finding significant places
lola: 542 places, 621 transitions, 534 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: (p456 <= 1)
lola: LP says that atomic proposition is always true: (p461 <= 1)
lola: LP says that atomic proposition is always true: (p307 <= 1)
lola: LP says that atomic proposition is always true: (p183 <= 1)
lola: LP says that atomic proposition is always true: (p183 <= 1)
lola: LP says that atomic proposition is always true: (p196 <= 1)
lola: LP says that atomic proposition is always true: (p374 <= 1)
lola: LP says that atomic proposition is always true: (p350 <= 1)
lola: LP says that atomic proposition is always true: (p110 <= 1)
lola: LP says that atomic proposition is always true: (p445 <= 1)
lola: LP says that atomic proposition is always true: (p98 <= 1)
lola: LP says that atomic proposition is always true: (p199 <= 1)
lola: LP says that atomic proposition is always true: (p287 <= 1)
lola: LP says that atomic proposition is always true: (p510 <= 1)
lola: X (X (NOT(F (G (F (G (F (NOT((G ((((p154 <= 0)) OR ((1 <= p456)))) U (((p372 <= 0)) OR ((1 <= p461))))))))))))) : X (((1 <= 0) U NOT(X (G (NOT(G ((((p175 <= 0)) OR ((1 <= p307)))))))))) : (NOT(G ((((p124 <= 0)) OR ((1 <= p183))))) U F (F ((((1 <= p124)) AND ((p183 <= 0)))))) : F ((((((1 <= p136)) AND ((p196 <= 0))) U X ((((p298 <= 0)) OR ((1 <= p374))))) AND F (((1 <= 0) U (((p313 <= 0)) OR ((1 <= p350))))))) : G (F (X (X (F ((((p479 <= 0)) OR ((1 <= p110)))))))) : ((1 <= 0) U X ((((1 <= p312)) AND ((p445 <= 0))))) : X (F ((F (G ((F (((p98 <= 0))) AND (X (((1 <= p199))) OR (((1 <= p342)) AND ((p287 <= 0))))))) U (((p120 <= 0)) OR ((1 <= p510))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:428
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 ((((((1 <= p136)) AND ((p196 <= 0))) U X ((((p298 <= 0)) OR ((1 <= p374))))) AND F ((((p313 <= 0)) OR ((1 <= p350))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((((((1 <= p136)) AND ((p196 <= 0))) U X ((((p298 <= 0)) OR ((1 <= p374))))) AND F ((((p313 <= 0)) OR ((1 <= p350))))))
lola: processed formula length: 123
lola: 47 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: 3 markings, 2 edges
lola: ========================================
lola: subprocess 1 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((((1 <= p312)) AND ((p445 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((((1 <= p312)) AND ((p445 <= 0))))
lola: processed formula length: 37
lola: 47 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: 14 markings, 14 edges
lola: ========================================
lola: subprocess 2 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F (((((p120 <= 0)) OR ((1 <= p510))) OR (F ((((p120 <= 0)) OR ((1 <= p510)))) AND F (G ((F (((p98 <= 0))) AND (X (((1 <= p199))) OR (((1 <= p342)) AND ((p287 <= 0)))))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F (((((p120 <= 0)) OR ((1 <= p510))) OR (F ((((p120 <= 0)) OR ((1 <= p510)))) AND F (G ((F (((p98 <= 0))) AND (X (((1 <= p199))) OR (((1 <= p342)) AND ((p287 <= 0)))))))))))
lola: processed formula length: 178
lola: 47 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 9 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 3 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((((1 <= p124)) AND ((p183 <= 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: (((p124 <= 0)) OR ((1 <= p183)))
lola: processed formula length: 33
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: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 46 markings, 45 edges
lola: ========================================
lola: subprocess 4 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((((p175 <= 0)) OR ((1 <= p307)))))
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 ((((p175 <= 0)) OR ((1 <= p307)))))
lola: processed formula length: 41
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: 3130 markings, 4087 edges
lola: ========================================
lola: subprocess 5 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((((p479 <= 0)) OR ((1 <= p110)))))
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 ((((p479 <= 0)) OR ((1 <= p110)))))
lola: processed formula length: 41
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: 339053 markings, 631126 edges, 67811 markings/sec, 0 secs
lola: 703719 markings, 1323371 edges, 72933 markings/sec, 5 secs
lola: 1069831 markings, 2013238 edges, 73222 markings/sec, 10 secs
lola: 1429335 markings, 2690429 edges, 71901 markings/sec, 15 secs
lola: 1782132 markings, 3360918 edges, 70559 markings/sec, 20 secs
lola: 2141428 markings, 4036987 edges, 71859 markings/sec, 25 secs
lola: 2476410 markings, 4672904 edges, 66996 markings/sec, 30 secs
lola: 2813392 markings, 5314274 edges, 67396 markings/sec, 35 secs
lola: 3159937 markings, 5964909 edges, 69309 markings/sec, 40 secs
lola: 3506708 markings, 6619882 edges, 69354 markings/sec, 45 secs
lola: 3856443 markings, 7278357 edges, 69947 markings/sec, 50 secs
lola: 4186178 markings, 7948443 edges, 65947 markings/sec, 55 secs
lola: 4492635 markings, 8641960 edges, 61291 markings/sec, 60 secs
lola: 4762925 markings, 9323004 edges, 54058 markings/sec, 65 secs
lola: 4968963 markings, 10115047 edges, 41208 markings/sec, 70 secs
lola: 5224376 markings, 10860216 edges, 51083 markings/sec, 75 secs
lola: 5442879 markings, 11638788 edges, 43701 markings/sec, 80 secs
lola: 5651928 markings, 12436945 edges, 41810 markings/sec, 85 secs
lola: 5861878 markings, 13258047 edges, 41990 markings/sec, 90 secs
lola: 6081458 markings, 14091131 edges, 43916 markings/sec, 95 secs
lola: 6291044 markings, 14859592 edges, 41917 markings/sec, 100 secs
lola: 6487703 markings, 15620514 edges, 39332 markings/sec, 105 secs
lola: 6671727 markings, 16404268 edges, 36805 markings/sec, 110 secs
lola: 6863477 markings, 17181181 edges, 38350 markings/sec, 115 secs
lola: 7072805 markings, 17977946 edges, 41866 markings/sec, 120 secs
lola: 7392571 markings, 18662085 edges, 63953 markings/sec, 125 secs
lola: 7705691 markings, 19359514 edges, 62624 markings/sec, 130 secs
lola: 7992273 markings, 20078088 edges, 57316 markings/sec, 135 secs
lola: 8200314 markings, 20886058 edges, 41608 markings/sec, 140 secs
lola: 8456261 markings, 21630664 edges, 51189 markings/sec, 145 secs
lola: 8661412 markings, 22415894 edges, 41030 markings/sec, 150 secs
lola: 8867080 markings, 23223202 edges, 41134 markings/sec, 155 secs
lola: 9084986 markings, 24047715 edges, 43581 markings/sec, 160 secs
lola: 9300420 markings, 24889131 edges, 43087 markings/sec, 165 secs
lola: 9515539 markings, 25653870 edges, 43024 markings/sec, 170 secs
lola: 9708692 markings, 26401762 edges, 38631 markings/sec, 175 secs
lola: 9892501 markings, 27185940 edges, 36762 markings/sec, 180 secs
lola: 10072181 markings, 27915536 edges, 35936 markings/sec, 185 secs
lola: 10281576 markings, 28694251 edges, 41879 markings/sec, 190 secs
lola: 10624279 markings, 29361116 edges, 68541 markings/sec, 195 secs
lola: 10963469 markings, 30011582 edges, 67838 markings/sec, 200 secs
lola: 11283189 markings, 30668314 edges, 63944 markings/sec, 205 secs
lola: 11571533 markings, 31391793 edges, 57669 markings/sec, 210 secs
lola: 11828797 markings, 32150330 edges, 51453 markings/sec, 215 secs
lola: 12023279 markings, 32954235 edges, 38896 markings/sec, 220 secs
lola: 12224781 markings, 33767913 edges, 40300 markings/sec, 225 secs
lola: 12460288 markings, 34581903 edges, 47101 markings/sec, 230 secs
lola: 12683910 markings, 35433695 edges, 44724 markings/sec, 235 secs
lola: 12899095 markings, 36265561 edges, 43037 markings/sec, 240 secs
lola: 13097045 markings, 37068888 edges, 39590 markings/sec, 245 secs
lola: 13289397 markings, 37820516 edges, 38470 markings/sec, 250 secs
lola: 13510641 markings, 38590842 edges, 44249 markings/sec, 255 secs
lola: 13838694 markings, 39258383 edges, 65611 markings/sec, 260 secs
lola: 14132108 markings, 39914682 edges, 58683 markings/sec, 265 secs
lola: 14410827 markings, 40643138 edges, 55744 markings/sec, 270 secs
lola: 14602676 markings, 41406779 edges, 38370 markings/sec, 275 secs
lola: 14793963 markings, 42186109 edges, 38257 markings/sec, 280 secs
lola: 15000688 markings, 42998854 edges, 41345 markings/sec, 285 secs
lola: 15236840 markings, 43819126 edges, 47230 markings/sec, 290 secs
lola: 15448653 markings, 44634218 edges, 42363 markings/sec, 295 secs
lola: 15643238 markings, 45374645 edges, 38917 markings/sec, 300 secs
lola: 15840475 markings, 46183300 edges, 39447 markings/sec, 305 secs
lola: 16054505 markings, 46998583 edges, 42806 markings/sec, 310 secs
lola: 16344040 markings, 47716889 edges, 57907 markings/sec, 315 secs
lola: 16688780 markings, 48366897 edges, 68948 markings/sec, 320 secs
lola: 17033048 markings, 49017982 edges, 68854 markings/sec, 325 secs
lola: 17377770 markings, 49673451 edges, 68944 markings/sec, 330 secs
lola: 17707142 markings, 50292626 edges, 65874 markings/sec, 335 secs
lola: 18058843 markings, 50964544 edges, 70340 markings/sec, 340 secs
lola: 18402834 markings, 51648697 edges, 68798 markings/sec, 345 secs
lola: 18683437 markings, 52382820 edges, 56121 markings/sec, 350 secs
lola: 18914874 markings, 53167101 edges, 46287 markings/sec, 355 secs
lola: 19125926 markings, 53975655 edges, 42210 markings/sec, 360 secs
lola: 19344090 markings, 54793004 edges, 43633 markings/sec, 365 secs
lola: 19557507 markings, 55624961 edges, 42683 markings/sec, 370 secs
lola: 19783310 markings, 56463460 edges, 45161 markings/sec, 375 secs
lola: 19997864 markings, 57241541 edges, 42911 markings/sec, 380 secs
lola: 20196419 markings, 58027056 edges, 39711 markings/sec, 385 secs
lola: 20379558 markings, 58843943 edges, 36628 markings/sec, 390 secs
lola: 20574937 markings, 59632218 edges, 39076 markings/sec, 395 secs
lola: 20782257 markings, 60418600 edges, 41464 markings/sec, 400 secs
lola: 21082900 markings, 61114729 edges, 60129 markings/sec, 405 secs
lola: 21431661 markings, 61797707 edges, 69752 markings/sec, 410 secs
lola: 21751164 markings, 62499374 edges, 63901 markings/sec, 415 secs
lola: 21947712 markings, 63271800 edges, 39310 markings/sec, 420 secs
lola: 22172697 markings, 64031869 edges, 44997 markings/sec, 425 secs
lola: 22382876 markings, 64818853 edges, 42036 markings/sec, 430 secs
lola: 22592454 markings, 65625011 edges, 41916 markings/sec, 435 secs
lola: 22808090 markings, 66463875 edges, 43127 markings/sec, 440 secs
lola: 23040603 markings, 67288145 edges, 46503 markings/sec, 445 secs
lola: 23245750 markings, 68070714 edges, 41029 markings/sec, 450 secs
lola: 23428224 markings, 68864148 edges, 36495 markings/sec, 455 secs
lola: 23599041 markings, 69588461 edges, 34163 markings/sec, 460 secs
lola: 23790491 markings, 70357892 edges, 38290 markings/sec, 465 secs
lola: 24009735 markings, 71085448 edges, 43849 markings/sec, 470 secs
lola: 24359322 markings, 71749410 edges, 69917 markings/sec, 475 secs
lola: 24697803 markings, 72435957 edges, 67696 markings/sec, 480 secs
lola: 24963473 markings, 73186454 edges, 53134 markings/sec, 485 secs
lola: 25186219 markings, 73973856 edges, 44549 markings/sec, 490 secs
lola: 25395508 markings, 74782983 edges, 41858 markings/sec, 495 secs
lola: 25615257 markings, 75597233 edges, 43950 markings/sec, 500 secs
lola: 25834310 markings, 76429386 edges, 43811 markings/sec, 505 secs
lola: 26054308 markings, 77272859 edges, 44000 markings/sec, 510 secs
lola: 26267145 markings, 78033318 edges, 42567 markings/sec, 515 secs
lola: 26461105 markings, 78818170 edges, 38792 markings/sec, 520 secs
lola: 26644823 markings, 79631849 edges, 36744 markings/sec, 525 secs
lola: 26845450 markings, 80432759 edges, 40125 markings/sec, 530 secs
lola: 27060837 markings, 81209214 edges, 43077 markings/sec, 535 secs
lola: 27383448 markings, 81899285 edges, 64522 markings/sec, 540 secs
lola: 27730139 markings, 82588829 edges, 69338 markings/sec, 545 secs
lola: 28023140 markings, 83311966 edges, 58600 markings/sec, 550 secs
lola: 28244296 markings, 84087056 edges, 44231 markings/sec, 555 secs
lola: 28453001 markings, 84880037 edges, 41741 markings/sec, 560 secs
lola: 28673959 markings, 85690368 edges, 44192 markings/sec, 565 secs
lola: 28890890 markings, 86522293 edges, 43386 markings/sec, 570 secs
lola: 29109094 markings, 87368133 edges, 43641 markings/sec, 575 secs
lola: 29318058 markings, 88102908 edges, 41793 markings/sec, 580 secs
lola: 29518913 markings, 88879709 edges, 40171 markings/sec, 585 secs
lola: 29697862 markings, 89676220 edges, 35790 markings/sec, 590 secs
lola: 29886654 markings, 90455385 edges, 37758 markings/sec, 595 secs
lola: 30087453 markings, 91248483 edges, 40160 markings/sec, 600 secs
lola: 30351875 markings, 91960267 edges, 52884 markings/sec, 605 secs
lola: 30695823 markings, 92605140 edges, 68790 markings/sec, 610 secs
lola: 31041867 markings, 93259245 edges, 69209 markings/sec, 615 secs
lola: 31377852 markings, 93914475 edges, 67197 markings/sec, 620 secs
lola: 31714915 markings, 94551509 edges, 67413 markings/sec, 625 secs
lola: 32056823 markings, 95198483 edges, 68382 markings/sec, 630 secs
lola: 32399517 markings, 95841513 edges, 68539 markings/sec, 635 secs
lola: 32741929 markings, 96491817 edges, 68482 markings/sec, 640 secs
lola: 33083056 markings, 97153663 edges, 68225 markings/sec, 645 secs
lola: 33419132 markings, 97824132 edges, 67215 markings/sec, 650 secs
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: 33458636 markings, 97902347 edges
lola: ========================================
lola: subprocess 6 will run for 2910 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((((p372 <= 0)) OR ((1 <= p461))) OR (G ((((p154 <= 0)) OR ((1 <= p456)))) AND F ((((p372 <= 0)) OR ((1 <= p461))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G (((((p372 <= 0)) OR ((1 <= p461))) OR (G ((((p154 <= 0)) OR ((1 <= p456)))) AND F ((((p372 <= 0)) OR ((1 <= p461))))))))
lola: processed formula length: 128
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: 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: 23662 markings, 37807 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no yes no no yes
lola:
preliminary result: no no no yes no no yes
lola: memory consumption: 29036 KB
lola: time consumption: 660 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="FlexibleBarrier-PT-06b"
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 FlexibleBarrier-PT-06b, 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 r170-smll-158987815600281"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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