Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 208K
-rw-r--r-- 1 mcc users 3.4K Apr 8 13:00 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Apr 8 13:00 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 7 16:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 7 16:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 14 12:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K Apr 14 12:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Apr 6 19:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Apr 6 19:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 6 02:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 21K Apr 6 02:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 6 20:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 6 20:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 25K 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 MAPK-PT-02560-00
FORMULA_NAME MAPK-PT-02560-01
FORMULA_NAME MAPK-PT-02560-02
FORMULA_NAME MAPK-PT-02560-03
FORMULA_NAME MAPK-PT-02560-04
FORMULA_NAME MAPK-PT-02560-05
FORMULA_NAME MAPK-PT-02560-06
FORMULA_NAME MAPK-PT-02560-07
FORMULA_NAME MAPK-PT-02560-08
FORMULA_NAME MAPK-PT-02560-09
FORMULA_NAME MAPK-PT-02560-10
FORMULA_NAME MAPK-PT-02560-11
FORMULA_NAME MAPK-PT-02560-12
FORMULA_NAME MAPK-PT-02560-13
FORMULA_NAME MAPK-PT-02560-14
FORMULA_NAME MAPK-PT-02560-15

=== Now, execution of the tool begins

BK_START 1591129705645

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-02 20:28:28] [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-02 20:28:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-02 20:28:28] [INFO ] Load time of PNML (sax parser for PT used): 59 ms
[2020-06-02 20:28:28] [INFO ] Transformed 22 places.
[2020-06-02 20:28:28] [INFO ] Transformed 30 transitions.
[2020-06-02 20:28:28] [INFO ] Parsed PT model containing 22 places and 30 transitions in 125 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 32 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 101248 steps, including 0 resets, run finished after 112 ms. (steps per millisecond=904 ) properties seen :[1, 1, 1, 0, 0, 1, 0, 0, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 0]
// Phase 1: matrix 30 rows 22 cols
[2020-06-02 20:28:28] [INFO ] Computed 7 place invariants in 7 ms
[2020-06-02 20:28:28] [INFO ] [Real]Absence check using 7 positive place invariants in 21 ms returned sat
[2020-06-02 20:28:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 20:28:28] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2020-06-02 20:28:28] [INFO ] Computed and/alt/rep : 29/74/29 causal constraints in 28 ms.
[2020-06-02 20:28:28] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 20:28:28] [INFO ] [Nat]Absence check using 7 positive place invariants in 9 ms returned sat
[2020-06-02 20:28:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 20:28:28] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2020-06-02 20:28:28] [INFO ] Computed and/alt/rep : 29/74/29 causal constraints in 9 ms.
[2020-06-02 20:28:28] [INFO ] Added : 26 causal constraints over 6 iterations in 85 ms. Result :sat
[2020-06-02 20:28:28] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2020-06-02 20:28:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 20:28:28] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2020-06-02 20:28:28] [INFO ] Computed and/alt/rep : 29/74/29 causal constraints in 8 ms.
[2020-06-02 20:28:28] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 20:28:28] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2020-06-02 20:28:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 20:28:28] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2020-06-02 20:28:28] [INFO ] Computed and/alt/rep : 29/74/29 causal constraints in 7 ms.
[2020-06-02 20:28:29] [INFO ] Added : 26 causal constraints over 6 iterations in 140 ms. Result :sat
[2020-06-02 20:28:29] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2020-06-02 20:28:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 20:28:29] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2020-06-02 20:28:29] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 20:28:29] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2020-06-02 20:28:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 20:28:29] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2020-06-02 20:28:29] [INFO ] Computed and/alt/rep : 29/74/29 causal constraints in 5 ms.
[2020-06-02 20:28:29] [INFO ] Added : 26 causal constraints over 6 iterations in 44 ms. Result :sat
[2020-06-02 20:28:29] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2020-06-02 20:28:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 20:28:29] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2020-06-02 20:28:29] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 20:28:29] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2020-06-02 20:28:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 20:28:29] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2020-06-02 20:28:29] [INFO ] Computed and/alt/rep : 29/74/29 causal constraints in 7 ms.
[2020-06-02 20:28:29] [INFO ] Added : 27 causal constraints over 6 iterations in 34 ms. Result :sat
[2020-06-02 20:28:29] [INFO ] [Real]Absence check using 7 positive place invariants in 14 ms returned unsat
[2020-06-02 20:28:29] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2020-06-02 20:28:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 20:28:29] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2020-06-02 20:28:29] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 20:28:29] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2020-06-02 20:28:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 20:28:29] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2020-06-02 20:28:29] [INFO ] Computed and/alt/rep : 29/74/29 causal constraints in 2 ms.
[2020-06-02 20:28:29] [INFO ] Added : 27 causal constraints over 6 iterations in 25 ms. Result :sat
[2020-06-02 20:28:29] [INFO ] [Real]Absence check using 7 positive place invariants in 19 ms returned unsat
[2020-06-02 20:28:29] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2020-06-02 20:28:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 20:28:29] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2020-06-02 20:28:29] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 20:28:29] [INFO ] [Nat]Absence check using 7 positive place invariants in 40 ms returned sat
[2020-06-02 20:28:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 20:28:29] [INFO ] [Nat]Absence check using state equation in 78 ms returned sat
[2020-06-02 20:28:29] [INFO ] Computed and/alt/rep : 29/74/29 causal constraints in 2 ms.
[2020-06-02 20:28:29] [INFO ] Added : 26 causal constraints over 7 iterations in 25 ms. Result :sat
[2020-06-02 20:28:29] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned unsat
[2020-06-02 20:28:29] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned unsat
[2020-06-02 20:28:29] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned unsat
[2020-06-02 20:28:29] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned unsat
[2020-06-02 20:28:29] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned unsat
[2020-06-02 20:28:29] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2020-06-02 20:28:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 20:28:29] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2020-06-02 20:28:29] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 20:28:29] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2020-06-02 20:28:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 20:28:29] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2020-06-02 20:28:29] [INFO ] Computed and/alt/rep : 29/74/29 causal constraints in 5 ms.
[2020-06-02 20:28:29] [INFO ] Added : 26 causal constraints over 6 iterations in 35 ms. Result :sat
Successfully simplified 7 atomic propositions for a total of 11 simplifications.
[2020-06-02 20:28:29] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2020-06-02 20:28:29] [INFO ] Flatten gal took : 39 ms
FORMULA MAPK-PT-02560-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MAPK-PT-02560-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MAPK-PT-02560-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MAPK-PT-02560-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-02 20:28:29] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-06-02 20:28:29] [INFO ] Flatten gal took : 11 ms
[2020-06-02 20:28:29] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA MAPK-PT-02560-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-02 20:28:29] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2020-06-02 20:28:29] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 1 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ MAPK-PT-02560 @ 3570 seconds

FORMULA MAPK-PT-02560-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA MAPK-PT-02560-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA MAPK-PT-02560-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA MAPK-PT-02560-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA MAPK-PT-02560-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA MAPK-PT-02560-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA MAPK-PT-02560-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA MAPK-PT-02560-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA MAPK-PT-02560-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA MAPK-PT-02560-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA MAPK-PT-02560-01 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3155
rslt: Output for LTLCardinality @ MAPK-PT-02560

{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2020",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=LTLCardinality.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Tue Jun 2 20:28:30 2020
",
"timelimit": 3570
},
"child":
[

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 373
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (F ((p18 <= p2)))",
"processed_size": 19,
"rewrites": 91
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"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": 420
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (X (F ((p19 <= p17))))",
"processed_size": 24,
"rewrites": 91
},
"result":
{
"edges": 4,
"markings": 5,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"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": 480
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 480
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "G ((3 <= p16))",
"processed_size": 14,
"rewrites": 91
},
"result":
{
"edges": 5122,
"markings": 5122,
"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": "LTL",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 672
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (X (F ((p11 + 1 <= p6))))",
"processed_size": 27,
"rewrites": 91
},
"result":
{
"edges": 4,
"markings": 4,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 6,
"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": 560
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "G (F ((2 <= p8)))",
"processed_size": 17,
"rewrites": 91
},
"result":
{
"edges": 19188,
"markings": 12795,
"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": 672
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "F (G ((2 <= p7)))",
"processed_size": 17,
"rewrites": 91
},
"result":
{
"edges": 5124,
"markings": 5123,
"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": "stabilization",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 840
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G (F ((p9 + 1 <= p8)))",
"processed_size": 22,
"rewrites": 91
},
"result":
{
"edges": 5122,
"markings": 5122,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 7,
"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": 1120
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 2,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "F (G ((G (F ((p6 <= 1))) OR F ((3 <= p8)))))",
"processed_size": 44,
"rewrites": 91
},
"result":
{
"edges": 174951,
"markings": 98049,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1680
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "G (((p12 <= p15) AND (p19 <= p13)))",
"processed_size": 35,
"rewrites": 91
},
"result":
{
"edges": 5124,
"markings": 5124,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3361
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G ((p18 <= p3))",
"processed_size": 15,
"rewrites": 91
},
"result":
{
"edges": 10249,
"markings": 8327,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(p18 <= p3)",
"processed_size": 11,
"rewrites": 93
},
"result":
{
"edges": 5122,
"markings": 5122,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 4
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 10,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 3288,
"runtime": 415.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "G(F(*)) : G(((X(X(*)) U **) AND F(G((F(**) AND (** OR **)))))) : G(F(**)) : (* AND ((F(*) OR G(*)) AND (F(G((* AND (F(*) OR G(*))))) OR G((* AND (F(*) OR G(*))))))) : X(X(G(*))) : X(F(**)) : F(G(**)) : G(**) : X(X(F(**))) : F(G((G(F(*)) OR F(**)))) : ((X(X(F(*))) OR (G(**) AND X(X(F(*))))) AND F(*))"
},
"net":
{
"arcs": 90,
"conflict_clusters": 12,
"places": 22,
"places_significant": 15,
"singleton_clusters": 0,
"transitions": 30
},
"result":
{
"preliminary_value": "no unknown no no no yes no no yes no no ",
"value": "no unknown no no no yes no no yes no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 52/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 704
lola: finding significant places
lola: 22 places, 30 transitions, 15 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: F (NOT(F (((F ((p20 <= p13)) U (((p12 <= p4) U (3 <= p16)) AND (p9 + 1 <= p8))) U G ((p8 <= p9)))))) : G (((NOT(X (X ((p20 <= p10)))) U (p1 <= p15)) AND F (G (((p1 <= p15) U ((p1 <= p15) OR (1 <= p10))))))) : G (((0 <= 0) U (2 <= p8))) : NOT((G (F ((G ((2 <= p16)) U (p13 <= p9)))) U (G ((p18 <= p3)) U (p3 + 1 <= p18)))) : X (NOT(F (X (F ((((p14 <= p11) AND (3 <= p17)) U (p14 <= p0))))))) : F (X ((p18 <= p2))) : NOT(X (F (NOT(F (G (X (G ((2 <= p7))))))))) : G (((p12 <= p15) AND (p19 <= p13))) : F (X (NOT(X (NOT(((3 <= p8) U (p19 <= p17))))))) : F (G ((G (NOT(F (((3 <= p8) U F (G ((2 <= p6))))))) OR ((0 <= 0) U (3 <= p8))))) : ((G ((3 <= p16)) U F (X (F (NOT(X ((p6 <= p11))))))) AND NOT(G ((2 <= p14))))
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
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:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
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:332
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:434
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
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:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:371
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:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:341
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:431
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:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((X (X ((p10 + 1 <= p20))) U (p1 <= p15)) AND F (G ((F (((p1 <= p15) OR (1 <= p10))) AND ((p1 <= p15) OR ((p1 <= p15) OR (1 <= p10))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((X (X ((p10 + 1 <= p20))) U (p1 <= p15)) AND F (G ((F (((p1 <= p15) OR (1 <= p10))) AND ((p1 <= p15) OR ((p1 <= p15) OR (1 <= p10))))))))
lola: processed formula length: 143
lola: 91 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: 2597392 markings, 4677814 edges, 519478 markings/sec, 0 secs
lola: 4985515 markings, 8977522 edges, 477625 markings/sec, 5 secs
lola: 6718083 markings, 12095724 edges, 346514 markings/sec, 10 secs
lola: 8314113 markings, 14969342 edges, 319206 markings/sec, 15 secs
lola: 9986758 markings, 17980083 edges, 334529 markings/sec, 20 secs
lola: 11574656 markings, 20839054 edges, 317580 markings/sec, 25 secs
lola: 13093760 markings, 23573530 edges, 303821 markings/sec, 30 secs
lola: 14630344 markings, 26341298 edges, 307317 markings/sec, 35 secs
lola: 16144131 markings, 29064544 edges, 302757 markings/sec, 40 secs
lola: 17674764 markings, 31819773 edges, 306127 markings/sec, 45 secs
lola: 19923252 markings, 36804062 edges, 449698 markings/sec, 50 secs
lola: 22866292 markings, 44100360 edges, 588608 markings/sec, 55 secs
lola: 25779971 markings, 51342436 edges, 582736 markings/sec, 60 secs
lola: 28609495 markings, 58383030 edges, 565905 markings/sec, 65 secs
lola: 31415101 markings, 65367761 edges, 561121 markings/sec, 70 secs
lola: 34259261 markings, 72452677 edges, 568832 markings/sec, 75 secs
lola: 37204444 markings, 79791291 edges, 589037 markings/sec, 80 secs
lola: 40103743 markings, 87015849 edges, 579860 markings/sec, 85 secs
lola: 42959568 markings, 94136093 edges, 571165 markings/sec, 90 secs
lola: 45831784 markings, 101296493 edges, 574443 markings/sec, 95 secs
lola: 48670517 markings, 108374716 edges, 567747 markings/sec, 100 secs
lola: 51511094 markings, 115456388 edges, 568115 markings/sec, 105 secs
lola: 54427567 markings, 122730824 edges, 583295 markings/sec, 110 secs
lola: 57211359 markings, 129671898 edges, 556758 markings/sec, 115 secs
lola: 59954777 markings, 136517456 edges, 548684 markings/sec, 120 secs
lola: 62712128 markings, 143394587 edges, 551470 markings/sec, 125 secs
lola: 65508738 markings, 150372647 edges, 559322 markings/sec, 130 secs
lola: 68285718 markings, 157297363 edges, 555396 markings/sec, 135 secs
lola: 71135371 markings, 164407579 edges, 569931 markings/sec, 140 secs
lola: 73848410 markings, 171177748 edges, 542608 markings/sec, 145 secs
lola: 76543134 markings, 177901785 edges, 538945 markings/sec, 150 secs
lola: 79077971 markings, 184227326 edges, 506967 markings/sec, 155 secs
lola: 81511654 markings, 190300262 edges, 486737 markings/sec, 160 secs
lola: 83369972 markings, 194937881 edges, 371664 markings/sec, 165 secs
lola: 85018068 markings, 199050739 edges, 329619 markings/sec, 170 secs
lola: 87007579 markings, 204020410 edges, 397902 markings/sec, 175 secs
lola: 89067193 markings, 209153227 edges, 411923 markings/sec, 180 secs
lola: 91077378 markings, 214171274 edges, 402037 markings/sec, 185 secs
lola: 92678242 markings, 218164156 edges, 320173 markings/sec, 190 secs
lola: 95160543 markings, 224360621 edges, 496460 markings/sec, 195 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 1 will run for 336 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (G ((p0 + 1 <= p14))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (G ((p0 + 1 <= p14))))
lola: processed formula length: 27
lola: 91 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 5 markings, 5 edges
lola: ========================================
lola: subprocess 2 will run for 373 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((p18 <= p2)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((p18 <= p2)))
lola: processed formula length: 19
lola: 91 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: 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 420 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (F ((p19 <= p17))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (F ((p19 <= p17))))
lola: processed formula length: 24
lola: 91 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 5 markings, 4 edges
lola: ========================================
lola: subprocess 4 will run for 480 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((X (X (F ((p11 + 1 <= p6)))) OR (G ((3 <= p16)) AND X (X (F ((p11 + 1 <= p6)))))) AND F ((p14 <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 480 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((3 <= p16))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((3 <= p16))
lola: processed formula length: 14
lola: 91 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: 5122 markings, 5122 edges
lola: ========================================
lola: subprocess 5 will run for 560 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((p14 <= 1))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: (2 <= p14)
lola: processed formula length: 10
lola: 93 rewrites
lola: closed formula file LTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 6 will run for 672 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (F ((p11 + 1 <= p6))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (F ((p11 + 1 <= p6))))
lola: processed formula length: 27
lola: 91 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: 4 markings, 4 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 5 will run for 560 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((2 <= p8)))
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 ((2 <= p8)))
lola: processed formula length: 17
lola: 91 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: 12795 markings, 19188 edges
lola: ========================================
lola: subprocess 6 will run for 672 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((2 <= p7)))
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 ((2 <= p7)))
lola: processed formula length: 17
lola: 91 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: add low 12
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: 5123 markings, 5124 edges
lola: ========================================
lola: subprocess 7 will run for 840 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((p9 + 1 <= p8)))
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 ((p9 + 1 <= p8)))
lola: processed formula length: 22
lola: 91 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: 5122 markings, 5122 edges
lola: ========================================
lola: subprocess 8 will run for 1120 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((G (F ((p6 <= 1))) OR F ((3 <= p8)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((G (F ((p6 <= 1))) OR F ((3 <= p8)))))
lola: processed formula length: 44
lola: 91 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: 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: 98049 markings, 174951 edges
lola: ========================================
lola: subprocess 9 will run for 1680 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((p12 <= p15) AND (p19 <= p13)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((p12 <= p15) AND (p19 <= p13)))
lola: processed formula length: 35
lola: 91 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: 5124 markings, 5124 edges
lola: ========================================
lola: subprocess 10 will run for 3361 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p18 <= p3) AND ((F ((p3 + 1 <= p18)) OR G ((p18 <= p3))) AND (F (G (((p9 + 1 <= p13) AND (F ((p16 <= 1)) OR G ((p9 + 1 <= p13)))))) OR G (((p18 <= p3) AND (F ((p3 + 1 <= p18)) OR G ((p18 <= p3))))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 3361 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((p18 <= p3))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((p18 <= p3))
lola: processed formula length: 15
lola: 91 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: 8327 markings, 10249 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 12 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p18 <= p3)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p18 <= p3)
lola: processed formula length: 11
lola: 91 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 1 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 13 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((p3 + 1 <= p18))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: (p18 <= p3)
lola: processed formula length: 11
lola: 93 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: 5122 markings, 5122 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: G (((X (X ((p10 + 1 <= p20))) U (p1 <= p15)) AND F (G ((F (((p1 <= p15) OR (1 <= p10))) AND ((p1 <= p15) OR ((p1 <= p15) OR (1 <= p10))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((X (X ((p10 + 1 <= p20))) U (p1 <= p15)) AND F (G ((F (((p1 <= p15) OR (1 <= p10))) AND ((p1 <= p15) OR ((p1 <= p15) OR (1 <= p10))))))))
lola: processed formula length: 143
lola: 91 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: 2960739 markings, 5331738 edges, 592148 markings/sec, 0 secs
lola: 5538102 markings, 9972269 edges, 515473 markings/sec, 5 secs
lola: 7733298 markings, 13924669 edges, 439039 markings/sec, 10 secs
lola: 9495412 markings, 17095066 edges, 352423 markings/sec, 15 secs
lola: 11138852 markings, 20055692 edges, 328688 markings/sec, 20 secs
lola: 12687483 markings, 22842086 edges, 309726 markings/sec, 25 secs
lola: 14245792 markings, 25647294 edges, 311662 markings/sec, 30 secs
lola: 15790332 markings, 28426563 edges, 308908 markings/sec, 35 secs
lola: 17323104 markings, 31187523 edges, 306554 markings/sec, 40 secs
lola: 19210141 markings, 35042023 edges, 377407 markings/sec, 45 secs
lola: 22333314 markings, 42776848 edges, 624635 markings/sec, 50 secs
lola: 25183591 markings, 49858528 edges, 570055 markings/sec, 55 secs
lola: 28030234 markings, 56940717 edges, 569329 markings/sec, 60 secs
lola: 30854747 markings, 63973737 edges, 564903 markings/sec, 65 secs
lola: 33708144 markings, 71078917 edges, 570679 markings/sec, 70 secs
lola: 36472048 markings, 77966552 edges, 552781 markings/sec, 75 secs
lola: 39294748 markings, 84999533 edges, 564540 markings/sec, 80 secs
lola: 42072081 markings, 91923458 edges, 555467 markings/sec, 85 secs
lola: 44869279 markings, 98895965 edges, 559440 markings/sec, 90 secs
lola: 47725265 markings, 106017943 edges, 571197 markings/sec, 95 secs
lola: 50502108 markings, 112940152 edges, 555369 markings/sec, 100 secs
lola: 53569735 markings, 120590498 edges, 613525 markings/sec, 105 secs
lola: 56634711 markings, 128236355 edges, 612995 markings/sec, 110 secs
lola: 59501999 markings, 135386328 edges, 573458 markings/sec, 115 secs
lola: 62488577 markings, 142837780 edges, 597316 markings/sec, 120 secs
lola: 65464588 markings, 150261968 edges, 595202 markings/sec, 125 secs
lola: 68367151 markings, 157501478 edges, 580513 markings/sec, 130 secs
lola: 71366280 markings, 164985597 edges, 599826 markings/sec, 135 secs
lola: 74385715 markings, 172517421 edges, 603887 markings/sec, 140 secs
lola: 77340176 markings, 179888561 edges, 590892 markings/sec, 145 secs
lola: 79888422 markings, 186251181 edges, 509649 markings/sec, 150 secs
lola: 81750681 markings, 190897985 edges, 372452 markings/sec, 155 secs
lola: 84226044 markings, 197072184 edges, 495073 markings/sec, 160 secs
lola: 86783435 markings, 203453371 edges, 511478 markings/sec, 165 secs
lola: 88904927 markings, 208750168 edges, 424298 markings/sec, 170 secs
lola: 90824973 markings, 213538931 edges, 384009 markings/sec, 175 secs
lola: 92812855 markings, 218501110 edges, 397576 markings/sec, 180 secs
lola: 95452556 markings, 225088667 edges, 527940 markings/sec, 185 secs
lola: 96690245 markings, 228178264 edges, 247538 markings/sec, 190 secs
lola: 96698382 markings, 228198624 edges, 1627 markings/sec, 195 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: no unknown no no no yes no no yes no no
lola:
preliminary result: no unknown no no no yes no no yes no no
lola: memory consumption: 3288 KB
lola: time consumption: 415 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="MAPK-PT-02560"
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 MAPK-PT-02560, 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 r174-csrt-158987852600065"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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