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.r166-smll-158987787700465.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 AutoFlight-PT-12a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r166-smll-158987787700465
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 276K
-rw-r--r-- 1 mcc users 4.7K Mar 25 23:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Mar 25 23:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 25 18:35 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 25 18:35 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Apr 8 14:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Apr 8 14:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Mar 25 15:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 25 15:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 25 10:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K Mar 25 10:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 25 17:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 25 17:54 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 85K 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 AutoFlight-PT-12a-00
FORMULA_NAME AutoFlight-PT-12a-01
FORMULA_NAME AutoFlight-PT-12a-02
FORMULA_NAME AutoFlight-PT-12a-03
FORMULA_NAME AutoFlight-PT-12a-04
FORMULA_NAME AutoFlight-PT-12a-05
FORMULA_NAME AutoFlight-PT-12a-06
FORMULA_NAME AutoFlight-PT-12a-07
FORMULA_NAME AutoFlight-PT-12a-08
FORMULA_NAME AutoFlight-PT-12a-09
FORMULA_NAME AutoFlight-PT-12a-10
FORMULA_NAME AutoFlight-PT-12a-11
FORMULA_NAME AutoFlight-PT-12a-12
FORMULA_NAME AutoFlight-PT-12a-13
FORMULA_NAME AutoFlight-PT-12a-14
FORMULA_NAME AutoFlight-PT-12a-15

=== Now, execution of the tool begins

BK_START 1591492683346

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-07 01:18:06] [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-07 01:18:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-07 01:18:06] [INFO ] Load time of PNML (sax parser for PT used): 107 ms
[2020-06-07 01:18:06] [INFO ] Transformed 307 places.
[2020-06-07 01:18:06] [INFO ] Transformed 305 transitions.
[2020-06-07 01:18:06] [INFO ] Found NUPN structural information;
[2020-06-07 01:18:06] [INFO ] Parsed PT model containing 307 places and 305 transitions in 162 ms.
Ensure Unique test removed 60 transitions
Reduce redundant transitions removed 60 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 28 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 1886 resets, run finished after 603 ms. (steps per millisecond=165 ) properties seen :[0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 0, 0, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1]
// Phase 1: matrix 245 rows 307 cols
[2020-06-07 01:18:07] [INFO ] Computed 76 place invariants in 15 ms
[2020-06-07 01:18:07] [INFO ] [Real]Absence check using 75 positive place invariants in 58 ms returned sat
[2020-06-07 01:18:07] [INFO ] [Real]Absence check using 75 positive and 1 generalized place invariants in 3 ms returned sat
[2020-06-07 01:18:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-07 01:18:07] [INFO ] [Real]Absence check using state equation in 500 ms returned sat
[2020-06-07 01:18:08] [INFO ] Solution in real domain found non-integer solution.
[2020-06-07 01:18:08] [INFO ] [Nat]Absence check using 75 positive place invariants in 73 ms returned sat
[2020-06-07 01:18:08] [INFO ] [Nat]Absence check using 75 positive and 1 generalized place invariants in 3 ms returned sat
[2020-06-07 01:18:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-07 01:18:08] [INFO ] [Nat]Absence check using state equation in 475 ms returned sat
[2020-06-07 01:18:08] [INFO ] State equation strengthened by 60 read => feed constraints.
[2020-06-07 01:18:08] [INFO ] [Nat]Added 60 Read/Feed constraints in 21 ms returned sat
[2020-06-07 01:18:09] [INFO ] Deduced a trap composed of 127 places in 234 ms
[2020-06-07 01:18:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 318 ms
[2020-06-07 01:18:09] [INFO ] Computed and/alt/rep : 244/892/244 causal constraints in 30 ms.
[2020-06-07 01:18:11] [INFO ] Added : 239 causal constraints over 48 iterations in 2018 ms. Result :sat
[2020-06-07 01:18:11] [INFO ] Deduced a trap composed of 136 places in 184 ms
[2020-06-07 01:18:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 279 ms
[2020-06-07 01:18:11] [INFO ] [Real]Absence check using 75 positive place invariants in 60 ms returned sat
[2020-06-07 01:18:11] [INFO ] [Real]Absence check using 75 positive and 1 generalized place invariants in 3 ms returned sat
[2020-06-07 01:18:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-07 01:18:11] [INFO ] [Real]Absence check using state equation in 445 ms returned sat
[2020-06-07 01:18:11] [INFO ] [Real]Added 60 Read/Feed constraints in 8 ms returned sat
[2020-06-07 01:18:12] [INFO ] Computed and/alt/rep : 244/892/244 causal constraints in 29 ms.
[2020-06-07 01:18:12] [INFO ] Solution in real domain found non-integer solution.
[2020-06-07 01:18:12] [INFO ] [Nat]Absence check using 75 positive place invariants in 41 ms returned sat
[2020-06-07 01:18:12] [INFO ] [Nat]Absence check using 75 positive and 1 generalized place invariants in 2 ms returned sat
[2020-06-07 01:18:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-07 01:18:12] [INFO ] [Nat]Absence check using state equation in 315 ms returned sat
[2020-06-07 01:18:12] [INFO ] [Nat]Added 60 Read/Feed constraints in 12 ms returned sat
[2020-06-07 01:18:12] [INFO ] Computed and/alt/rep : 244/892/244 causal constraints in 21 ms.
[2020-06-07 01:18:14] [INFO ] Added : 185 causal constraints over 37 iterations in 2120 ms. Result :sat
[2020-06-07 01:18:14] [INFO ] [Real]Absence check using 75 positive place invariants in 63 ms returned sat
[2020-06-07 01:18:14] [INFO ] [Real]Absence check using 75 positive and 1 generalized place invariants in 3 ms returned sat
[2020-06-07 01:18:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-07 01:18:15] [INFO ] [Real]Absence check using state equation in 478 ms returned sat
[2020-06-07 01:18:15] [INFO ] Solution in real domain found non-integer solution.
[2020-06-07 01:18:15] [INFO ] [Nat]Absence check using 75 positive place invariants in 20 ms returned unsat
[2020-06-07 01:18:15] [INFO ] [Real]Absence check using 75 positive place invariants in 40 ms returned sat
[2020-06-07 01:18:15] [INFO ] [Real]Absence check using 75 positive and 1 generalized place invariants in 2 ms returned sat
[2020-06-07 01:18:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-07 01:18:15] [INFO ] [Real]Absence check using state equation in 321 ms returned sat
[2020-06-07 01:18:15] [INFO ] Solution in real domain found non-integer solution.
[2020-06-07 01:18:16] [INFO ] [Nat]Absence check using 75 positive place invariants in 20 ms returned unsat
[2020-06-07 01:18:16] [INFO ] [Real]Absence check using 75 positive place invariants in 70 ms returned sat
[2020-06-07 01:18:16] [INFO ] [Real]Absence check using 75 positive and 1 generalized place invariants in 3 ms returned sat
[2020-06-07 01:18:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-07 01:18:16] [INFO ] [Real]Absence check using state equation in 491 ms returned sat
[2020-06-07 01:18:16] [INFO ] Solution in real domain found non-integer solution.
[2020-06-07 01:18:16] [INFO ] [Nat]Absence check using 75 positive place invariants in 12 ms returned unsat
[2020-06-07 01:18:16] [INFO ] [Real]Absence check using 75 positive place invariants in 60 ms returned sat
[2020-06-07 01:18:16] [INFO ] [Real]Absence check using 75 positive and 1 generalized place invariants in 3 ms returned sat
[2020-06-07 01:18:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-07 01:18:17] [INFO ] [Real]Absence check using state equation in 512 ms returned sat
[2020-06-07 01:18:17] [INFO ] Solution in real domain found non-integer solution.
[2020-06-07 01:18:17] [INFO ] [Nat]Absence check using 75 positive place invariants in 61 ms returned unsat
[2020-06-07 01:18:17] [INFO ] [Real]Absence check using 75 positive place invariants in 10 ms returned unsat
Successfully simplified 5 atomic propositions for a total of 5 simplifications.
[2020-06-07 01:18:18] [INFO ] Initial state reduction rules for CTL removed 8 formulas.
[2020-06-07 01:18:18] [INFO ] Flatten gal took : 113 ms
FORMULA AutoFlight-PT-12a-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-12a-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-12a-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-12a-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-12a-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-12a-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-12a-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-12a-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-07 01:18:18] [INFO ] Applying decomposition
[2020-06-07 01:18:18] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-06-07 01:18:18] [INFO ] Flatten gal took : 53 ms
[2020-06-07 01:18:18] [INFO ] Decomposing Gal with order
[2020-06-07 01:18:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-06-07 01:18:18] [INFO ] Removed a total of 62 redundant transitions.
[2020-06-07 01:18:18] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-06-07 01:18:18] [INFO ] Flatten gal took : 129 ms
[2020-06-07 01:18:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 48 labels/synchronizations in 26 ms.
[2020-06-07 01:18:18] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA AutoFlight-PT-12a-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-07 01:18:18] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 4 ms.
[2020-06-07 01:18:18] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 7 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ AutoFlight-PT-12a @ 3570 seconds

FORMULA AutoFlight-PT-12a-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA AutoFlight-PT-12a-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA AutoFlight-PT-12a-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA AutoFlight-PT-12a-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA AutoFlight-PT-12a-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA AutoFlight-PT-12a-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA AutoFlight-PT-12a-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3166
rslt: Output for LTLCardinality @ AutoFlight-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": "Sun Jun 7 01:18:19 2020
",
"timelimit": 3570
},
"child":
[

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

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 1,
"aconj": 4,
"adisj": 4,
"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": 5,
"visible_transitions": 0
},
"processed": "F (G ((G (F ((X ((((1 <= p46)) AND ((p181 <= 0)))) AND ((p162 <= 0))))) OR ((1 <= p162) AND (((p197 <= 0)) OR ((1 <= p254)))))))",
"processed_size": 129,
"rewrites": 32
},
"result":
{
"edges": 8835134,
"markings": 1010223,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"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": 709
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 1,
"aconj": 4,
"adisj": 2,
"aneg": 1,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G (F ((X (F ((((1 <= p209)) AND ((p17 <= 0))))) AND (((p209 <= 0)) OR ((1 <= p17))))))",
"processed_size": 87,
"rewrites": 32
},
"result":
{
"edges": 42,
"markings": 42,
"produced_by": "LTL model checker",
"value": false
},
"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": 886
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 3,
"U": 0,
"X": 3,
"aconj": 5,
"adisj": 1,
"aneg": 4,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 2,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "X (X (F ((G (F ((X (G ((((1 <= p208)) AND ((p95 <= 0))))) AND (((1 <= p299)) AND ((p116 <= 0)))))) OR G (((p45 <= 0)))))))",
"processed_size": 122,
"rewrites": 32
},
"result":
{
"edges": 4688820,
"markings": 295662,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 8
},
"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": 1178
},
"child":
[

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1767
},
"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 ((((p12 <= 0)) OR ((1 <= p203)))))",
"processed_size": 40,
"rewrites": 32
},
"result":
{
"edges": 66217455,
"markings": 10315707,
"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": 3216
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G ((((p137 <= 0)) OR ((1 <= p167))))",
"processed_size": 37,
"rewrites": 32
},
"result":
{
"edges": 16976526,
"markings": 1642645,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"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": 28332,
"runtime": 404.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(X(F(*)) OR **) : F(G((G(F((X(**) AND **))) OR **))) : G(F((X(F(*)) AND **))) : X(X(F((G(F((X(G(*)) AND (* AND *)))) OR G(*))))) : G(**) : G(F(**)) : (F((X(**) AND **)) AND **)"
},
"net":
{
"arcs": 860,
"conflict_clusters": 159,
"places": 307,
"places_significant": 231,
"singleton_clusters": 0,
"transitions": 245
},
"result":
{
"preliminary_value": "no no no no no no no ",
"value": "no no no no no no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 552/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 307
lola: finding significant places
lola: 307 places, 245 transitions, 231 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: (p185 <= 1)
lola: LP says that atomic proposition is always true: (p185 <= 1)
lola: LP says that atomic proposition is always true: (p181 <= 1)
lola: LP says that atomic proposition is always true: (p162 <= 1)
lola: LP says that atomic proposition is always true: (p162 <= 1)
lola: LP says that atomic proposition is always true: (p254 <= 1)
lola: LP says that atomic proposition is always true: (p17 <= 1)
lola: LP says that atomic proposition is always true: (p17 <= 1)
lola: LP says that atomic proposition is always true: (p95 <= 1)
lola: LP says that atomic proposition is always true: (p116 <= 1)
lola: LP says that atomic proposition is always true: (p45 <= 1)
lola: LP says that atomic proposition is always true: (p167 <= 1)
lola: LP says that atomic proposition is always true: (p214 <= 1)
lola: LP says that atomic proposition is always true: (p203 <= 1)
lola: LP says that atomic proposition is always true: (p171 <= 1)
lola: LP says that atomic proposition is always true: (p62 <= 1)
lola: LP says that atomic proposition is always true: (p226 <= 1)
lola: (NOT(X (G ((((p240 <= 0)) OR ((1 <= p185)))))) OR (((1 <= p240)) AND ((p185 <= 0)))) : F (G ((G (X (F ((X ((((1 <= p46)) AND ((p181 <= 0)))) AND ((p162 <= 0)))))) OR ((1 <= p162) AND (((p197 <= 0)) OR ((1 <= p254))))))) : X (F (G (F ((NOT(G (X (G ((((p209 <= 0)) OR ((1 <= p17))))))) AND (((p209 <= 0)) OR ((1 <= p17)))))))) : X (X (F ((NOT(F (G (((X (F ((((p208 <= 0)) OR ((1 <= p95))))) OR ((p299 <= 0))) OR ((1 <= p116)))))) OR NOT(F (((1 <= p45)))))))) : G (((1 <= 0) U G ((((p137 <= 0)) OR ((1 <= p167)))))) : G ((F (X (NOT(((1 <= 0) U (((p138 <= 0)) OR ((1 <= p214))))))) U F ((((p12 <= 0)) OR ((1 <= p203)))))) : (F ((X (((1 <= p171))) AND ((1 <= p62)))) AND (((p158 <= 0)) OR ((1 <= p226))))
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
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:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (F ((((1 <= p240)) AND ((p185 <= 0))))) OR (((1 <= p240)) AND ((p185 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p240)) AND ((p185 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((1 <= p240)) AND ((p185 <= 0)))
lola: processed formula length: 33
lola: 32 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((((1 <= p240)) AND ((p185 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((((1 <= p240)) AND ((p185 <= 0)))))
lola: processed formula length: 41
lola: 32 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: 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: 42 markings, 42 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((G (F ((X ((((1 <= p46)) AND ((p181 <= 0)))) AND ((p162 <= 0))))) OR ((1 <= p162) AND (((p197 <= 0)) OR ((1 <= p254)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((G (F ((X ((((1 <= p46)) AND ((p181 <= 0)))) AND ((p162 <= 0))))) OR ((1 <= p162) AND (((p197 <= 0)) OR ((1 <= p254)))))))
lola: processed formula length: 129
lola: 32 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 227079 markings, 2031784 edges, 45416 markings/sec, 0 secs
lola: 428833 markings, 4131683 edges, 40351 markings/sec, 5 secs
lola: 644263 markings, 6224680 edges, 43086 markings/sec, 10 secs
lola: 930867 markings, 8297020 edges, 57321 markings/sec, 15 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: 1010223 markings, 8835134 edges
lola: ========================================
lola: subprocess 2 will run for 709 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((X (F ((((1 <= p209)) AND ((p17 <= 0))))) AND (((p209 <= 0)) OR ((1 <= p17))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((X (F ((((1 <= p209)) AND ((p17 <= 0))))) AND (((p209 <= 0)) OR ((1 <= p17))))))
lola: processed formula length: 87
lola: 32 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: 42 markings, 42 edges
lola: ========================================
lola: subprocess 3 will run for 886 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (F ((G (F ((X (G ((((1 <= p208)) AND ((p95 <= 0))))) AND (((1 <= p299)) AND ((p116 <= 0)))))) OR G (((p45 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (F ((G (F ((X (G ((((1 <= p208)) AND ((p95 <= 0))))) AND (((1 <= p299)) AND ((p116 <= 0)))))) OR G (((p45 <= 0)))))))
lola: processed formula length: 122
lola: 32 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: 130606 markings, 1894790 edges, 26121 markings/sec, 0 secs
lola: 258617 markings, 4044976 edges, 25602 markings/sec, 5 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: 295662 markings, 4688820 edges
lola: ========================================
lola: subprocess 4 will run for 1178 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F ((X (((1 <= p171))) AND ((1 <= p62)))) AND (((p158 <= 0)) OR ((1 <= p226))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 1178 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p158 <= 0)) OR ((1 <= p226)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((p158 <= 0)) OR ((1 <= p226)))
lola: processed formula length: 33
lola: 32 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 5 will run for 1767 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((X (((1 <= p171))) AND ((1 <= p62))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((X (((1 <= p171))) AND ((1 <= p62))))
lola: processed formula length: 40
lola: 32 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: 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: 42 markings, 42 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 5 will run for 1767 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((((p12 <= 0)) OR ((1 <= p203)))))
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 ((((p12 <= 0)) OR ((1 <= p203)))))
lola: processed formula length: 40
lola: 32 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: 206516 markings, 1613002 edges, 41303 markings/sec, 0 secs
lola: 387888 markings, 3248517 edges, 36274 markings/sec, 5 secs
lola: 557445 markings, 4901939 edges, 33911 markings/sec, 10 secs
lola: 729190 markings, 6592873 edges, 34349 markings/sec, 15 secs
lola: 882522 markings, 8306796 edges, 30666 markings/sec, 20 secs
lola: 1023413 markings, 10039681 edges, 28178 markings/sec, 25 secs
lola: 1176103 markings, 11722099 edges, 30538 markings/sec, 30 secs
lola: 1306135 markings, 13328150 edges, 26006 markings/sec, 35 secs
lola: 1442759 markings, 15104693 edges, 27325 markings/sec, 40 secs
lola: 1625098 markings, 16780358 edges, 36468 markings/sec, 45 secs
lola: 1875873 markings, 17755417 edges, 50155 markings/sec, 50 secs
lola: 2098310 markings, 18737615 edges, 44487 markings/sec, 55 secs
lola: 2282081 markings, 19653959 edges, 36754 markings/sec, 60 secs
lola: 2455153 markings, 20594115 edges, 34614 markings/sec, 65 secs
lola: 2637282 markings, 21516675 edges, 36426 markings/sec, 70 secs
lola: 2799740 markings, 22410562 edges, 32492 markings/sec, 75 secs
lola: 2951180 markings, 23293364 edges, 30288 markings/sec, 80 secs
lola: 3128606 markings, 24231009 edges, 35485 markings/sec, 85 secs
lola: 3300494 markings, 25166182 edges, 34378 markings/sec, 90 secs
lola: 3467098 markings, 26127135 edges, 33321 markings/sec, 95 secs
lola: 3634471 markings, 27083025 edges, 33475 markings/sec, 100 secs
lola: 3791042 markings, 28012207 edges, 31314 markings/sec, 105 secs
lola: 3941476 markings, 28928132 edges, 30087 markings/sec, 110 secs
lola: 4095263 markings, 29837598 edges, 30757 markings/sec, 115 secs
lola: 4269415 markings, 30763420 edges, 34830 markings/sec, 120 secs
lola: 4430800 markings, 31666473 edges, 32277 markings/sec, 125 secs
lola: 4589191 markings, 32588871 edges, 31678 markings/sec, 130 secs
lola: 4753496 markings, 33524703 edges, 32861 markings/sec, 135 secs
lola: 4907451 markings, 34444243 edges, 30791 markings/sec, 140 secs
lola: 5049269 markings, 35349689 edges, 28364 markings/sec, 145 secs
lola: 5211041 markings, 36286996 edges, 32354 markings/sec, 150 secs
lola: 5371207 markings, 37232661 edges, 32033 markings/sec, 155 secs
lola: 5523963 markings, 38171181 edges, 30551 markings/sec, 160 secs
lola: 5674941 markings, 39119314 edges, 30196 markings/sec, 165 secs
lola: 5826830 markings, 40074625 edges, 30378 markings/sec, 170 secs
lola: 5970707 markings, 41012804 edges, 28775 markings/sec, 175 secs
lola: 6104204 markings, 41934007 edges, 26699 markings/sec, 180 secs
lola: 6289484 markings, 42847316 edges, 37056 markings/sec, 185 secs
lola: 6469271 markings, 43743655 edges, 35957 markings/sec, 190 secs
lola: 6639672 markings, 44665911 edges, 34080 markings/sec, 195 secs
lola: 6818910 markings, 45578149 edges, 35848 markings/sec, 200 secs
lola: 6979450 markings, 46463955 edges, 32108 markings/sec, 205 secs
lola: 7131693 markings, 47339317 edges, 30449 markings/sec, 210 secs
lola: 7303599 markings, 48263017 edges, 34381 markings/sec, 215 secs
lola: 7475642 markings, 49192366 edges, 34409 markings/sec, 220 secs
lola: 7643200 markings, 50151527 edges, 33512 markings/sec, 225 secs
lola: 7802642 markings, 51060092 edges, 31888 markings/sec, 230 secs
lola: 7956794 markings, 51984205 edges, 30830 markings/sec, 235 secs
lola: 8107220 markings, 52886951 edges, 30085 markings/sec, 240 secs
lola: 8252879 markings, 53784608 edges, 29132 markings/sec, 245 secs
lola: 8430026 markings, 54705438 edges, 35429 markings/sec, 250 secs
lola: 8591480 markings, 55600523 edges, 32291 markings/sec, 255 secs
lola: 8741104 markings, 56498527 edges, 29925 markings/sec, 260 secs
lola: 8911221 markings, 57439794 edges, 34023 markings/sec, 265 secs
lola: 9063402 markings, 58350552 edges, 30436 markings/sec, 270 secs
lola: 9206953 markings, 59248153 edges, 28710 markings/sec, 275 secs
lola: 9361493 markings, 60161302 edges, 30908 markings/sec, 280 secs
lola: 9519937 markings, 61102910 edges, 31689 markings/sec, 285 secs
lola: 9672306 markings, 62023962 edges, 30474 markings/sec, 290 secs
lola: 9818494 markings, 62954309 edges, 29238 markings/sec, 295 secs
lola: 9973646 markings, 63906944 edges, 31030 markings/sec, 300 secs
lola: 10116658 markings, 64839182 edges, 28602 markings/sec, 305 secs
lola: 10252252 markings, 65754757 edges, 27119 markings/sec, 310 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: 10315707 markings, 66217455 edges
lola: ========================================
lola: subprocess 6 will run for 3216 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((((p137 <= 0)) OR ((1 <= p167))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((((p137 <= 0)) OR ((1 <= p167))))
lola: processed formula length: 37
lola: 32 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: 202633 markings, 1581411 edges, 40527 markings/sec, 0 secs
lola: 385493 markings, 3225976 edges, 36572 markings/sec, 5 secs
lola: 556395 markings, 4893646 edges, 34180 markings/sec, 10 secs
lola: 729170 markings, 6592646 edges, 34555 markings/sec, 15 secs
lola: 883780 markings, 8321180 edges, 30922 markings/sec, 20 secs
lola: 1025210 markings, 10065338 edges, 28286 markings/sec, 25 secs
lola: 1178603 markings, 11754005 edges, 30679 markings/sec, 30 secs
lola: 1318326 markings, 13483444 edges, 27945 markings/sec, 35 secs
lola: 1452990 markings, 15245032 edges, 26933 markings/sec, 40 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: 1642645 markings, 16976526 edges
lola: RESULT
lola:
SUMMARY: no no no no no no no
lola:
preliminary result: no no no no no no no
lola: ========================================
lola: memory consumption: 28332 KB
lola: time consumption: 404 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="AutoFlight-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 AutoFlight-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 r166-smll-158987787700465"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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