Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r113-smll-162075355700101.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2021-input.qcow2 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 gold2020
Input is GPPP-PT-C0001N0000100000, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r113-smll-162075355700101
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 356K
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 101K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Mar 28 16:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 28 16:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Mar 28 16:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 28 16:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 23 11:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 23 11:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.7K Mar 22 19:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 22 19:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 17 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 1 May 5 16:51 large_marking
-rw-r--r-- 1 mcc users 21K May 5 16:51 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 GPPP-PT-C0001N0000100000-00
FORMULA_NAME GPPP-PT-C0001N0000100000-01
FORMULA_NAME GPPP-PT-C0001N0000100000-02
FORMULA_NAME GPPP-PT-C0001N0000100000-03
FORMULA_NAME GPPP-PT-C0001N0000100000-04
FORMULA_NAME GPPP-PT-C0001N0000100000-05
FORMULA_NAME GPPP-PT-C0001N0000100000-06
FORMULA_NAME GPPP-PT-C0001N0000100000-07
FORMULA_NAME GPPP-PT-C0001N0000100000-08
FORMULA_NAME GPPP-PT-C0001N0000100000-09
FORMULA_NAME GPPP-PT-C0001N0000100000-10
FORMULA_NAME GPPP-PT-C0001N0000100000-11
FORMULA_NAME GPPP-PT-C0001N0000100000-12
FORMULA_NAME GPPP-PT-C0001N0000100000-13
FORMULA_NAME GPPP-PT-C0001N0000100000-14
FORMULA_NAME GPPP-PT-C0001N0000100000-15

=== Now, execution of the tool begins

BK_START 1620947892747

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-13 23:18:16] [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]
[2021-05-13 23:18:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 23:18:16] [INFO ] Load time of PNML (sax parser for PT used): 63 ms
[2021-05-13 23:18:16] [INFO ] Transformed 33 places.
[2021-05-13 23:18:16] [INFO ] Transformed 22 transitions.
[2021-05-13 23:18:16] [INFO ] Parsed PT model containing 33 places and 22 transitions in 145 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 100002 steps, including 0 resets, run finished after 321 ms. (steps per millisecond=311 ) properties seen :[1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 0, 0, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1]
// Phase 1: matrix 22 rows 33 cols
[2021-05-13 23:18:16] [INFO ] Computed 13 place invariants in 10 ms
[2021-05-13 23:18:17] [INFO ] [Real]Absence check using 6 positive place invariants in 26 ms returned unsat
[2021-05-13 23:18:17] [INFO ] [Real]Absence check using 6 positive place invariants in 17 ms returned sat
[2021-05-13 23:18:17] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 10 ms returned sat
[2021-05-13 23:18:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 23:18:17] [INFO ] [Real]Absence check using state equation in 62 ms returned sat
[2021-05-13 23:18:17] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 23:18:17] [INFO ] [Nat]Absence check using 6 positive place invariants in 18 ms returned sat
[2021-05-13 23:18:17] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 7 ms returned sat
[2021-05-13 23:18:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 23:18:17] [INFO ] [Nat]Absence check using state equation in 97 ms returned sat
[2021-05-13 23:18:17] [INFO ] Computed and/alt/rep : 21/47/21 causal constraints in 9 ms.
[2021-05-13 23:18:17] [INFO ] Added : 19 causal constraints over 4 iterations in 69 ms. Result :sat
[2021-05-13 23:18:17] [INFO ] [Real]Absence check using 6 positive place invariants in 16 ms returned sat
[2021-05-13 23:18:17] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 7 ms returned sat
[2021-05-13 23:18:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 23:18:17] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2021-05-13 23:18:17] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 23:18:17] [INFO ] [Nat]Absence check using 6 positive place invariants in 9 ms returned sat
[2021-05-13 23:18:17] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 11 ms returned sat
[2021-05-13 23:18:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 23:18:17] [INFO ] [Nat]Absence check using state equation in 72 ms returned sat
[2021-05-13 23:18:17] [INFO ] Computed and/alt/rep : 21/47/21 causal constraints in 13 ms.
[2021-05-13 23:18:17] [INFO ] Added : 19 causal constraints over 4 iterations in 67 ms. Result :sat
[2021-05-13 23:18:17] [INFO ] [Real]Absence check using 6 positive place invariants in 7 ms returned sat
[2021-05-13 23:18:17] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned unsat
[2021-05-13 23:18:17] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned unsat
[2021-05-13 23:18:17] [INFO ] [Real]Absence check using 6 positive place invariants in 8 ms returned sat
[2021-05-13 23:18:17] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 6 ms returned sat
[2021-05-13 23:18:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 23:18:17] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2021-05-13 23:18:17] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 23:18:17] [INFO ] [Nat]Absence check using 6 positive place invariants in 9 ms returned sat
[2021-05-13 23:18:17] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 7 ms returned sat
[2021-05-13 23:18:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 23:18:17] [INFO ] [Nat]Absence check using state equation in 59 ms returned sat
[2021-05-13 23:18:17] [INFO ] Computed and/alt/rep : 21/47/21 causal constraints in 5 ms.
[2021-05-13 23:18:18] [INFO ] Added : 19 causal constraints over 4 iterations in 45 ms. Result :sat
[2021-05-13 23:18:18] [INFO ] [Real]Absence check using 6 positive place invariants in 6 ms returned sat
[2021-05-13 23:18:18] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 5 ms returned sat
[2021-05-13 23:18:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 23:18:18] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2021-05-13 23:18:18] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 23:18:18] [INFO ] [Nat]Absence check using 6 positive place invariants in 9 ms returned sat
[2021-05-13 23:18:18] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 8 ms returned sat
[2021-05-13 23:18:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 23:18:18] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2021-05-13 23:18:18] [INFO ] Computed and/alt/rep : 21/47/21 causal constraints in 4 ms.
[2021-05-13 23:18:18] [INFO ] Added : 20 causal constraints over 4 iterations in 41 ms. Result :sat
[2021-05-13 23:18:18] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned unsat
[2021-05-13 23:18:18] [INFO ] [Real]Absence check using 6 positive place invariants in 6 ms returned sat
[2021-05-13 23:18:18] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 4 ms returned sat
[2021-05-13 23:18:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 23:18:18] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2021-05-13 23:18:18] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 23:18:18] [INFO ] [Nat]Absence check using 6 positive place invariants in 8 ms returned sat
[2021-05-13 23:18:18] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 6 ms returned sat
[2021-05-13 23:18:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 23:18:18] [INFO ] [Nat]Absence check using state equation in 216 ms returned sat
[2021-05-13 23:18:18] [INFO ] Computed and/alt/rep : 21/47/21 causal constraints in 9 ms.
[2021-05-13 23:18:18] [INFO ] Added : 21 causal constraints over 5 iterations in 49 ms. Result :sat
[2021-05-13 23:18:18] [INFO ] [Real]Absence check using 6 positive place invariants in 6 ms returned sat
[2021-05-13 23:18:18] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned unsat
[2021-05-13 23:18:18] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2021-05-13 23:18:18] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 4 ms returned sat
[2021-05-13 23:18:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 23:18:18] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2021-05-13 23:18:18] [INFO ] Computed and/alt/rep : 21/47/21 causal constraints in 7 ms.
[2021-05-13 23:18:18] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 23:18:18] [INFO ] [Nat]Absence check using 6 positive place invariants in 7 ms returned sat
[2021-05-13 23:18:18] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 4 ms returned sat
[2021-05-13 23:18:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 23:18:18] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2021-05-13 23:18:18] [INFO ] Computed and/alt/rep : 21/47/21 causal constraints in 4 ms.
[2021-05-13 23:18:18] [INFO ] Added : 20 causal constraints over 4 iterations in 39 ms. Result :sat
[2021-05-13 23:18:18] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned unsat
[2021-05-13 23:18:18] [INFO ] [Real]Absence check using 6 positive place invariants in 6 ms returned sat
[2021-05-13 23:18:18] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 5 ms returned sat
[2021-05-13 23:18:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 23:18:18] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2021-05-13 23:18:18] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 23:18:18] [INFO ] [Nat]Absence check using 6 positive place invariants in 10 ms returned sat
[2021-05-13 23:18:18] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 6 ms returned sat
[2021-05-13 23:18:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 23:18:18] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2021-05-13 23:18:18] [INFO ] Computed and/alt/rep : 21/47/21 causal constraints in 4 ms.
[2021-05-13 23:18:19] [INFO ] Added : 20 causal constraints over 4 iterations in 39 ms. Result :sat
Successfully simplified 6 atomic propositions for a total of 7 simplifications.
[2021-05-13 23:18:19] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2021-05-13 23:18:19] [INFO ] Flatten gal took : 57 ms
FORMULA GPPP-PT-C0001N0000100000-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0001N0000100000-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0001N0000100000-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0001N0000100000-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0001N0000100000-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-13 23:18:19] [INFO ] Flatten gal took : 15 ms
[2021-05-13 23:18:19] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 6 ms.
[2021-05-13 23:18:19] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 1 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ GPPP-PT-C0001N0000100000 @ 3570 seconds

FORMULA GPPP-PT-C0001N0000100000-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA GPPP-PT-C0001N0000100000-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA GPPP-PT-C0001N0000100000-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA GPPP-PT-C0001N0000100000-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA GPPP-PT-C0001N0000100000-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA GPPP-PT-C0001N0000100000-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA GPPP-PT-C0001N0000100000-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA GPPP-PT-C0001N0000100000-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA GPPP-PT-C0001N0000100000-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA GPPP-PT-C0001N0000100000-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA GPPP-PT-C0001N0000100000-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3340
rslt: Output for LTLCardinality @ GPPP-PT-C0001N0000100000

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"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": "X ((F (G ((1 <= p24))) OR (3 <= p5)))",
"processed_size": 37,
"rewrites": 37
},
"result":
{
"edges": 38,
"markings": 38,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "X ((G ((3 <= p28)) AND (X (F ((3 <= p28))) OR (3 <= p28))))",
"processed_size": 59,
"rewrites": 37
},
"result":
{
"edges": 47,
"markings": 47,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"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": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"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": "X (G ((2 <= p28)))",
"processed_size": 18,
"rewrites": 37
},
"result":
{
"edges": 38,
"markings": 38,
"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": 445
},
"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": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "X (F ((3 <= p28)))",
"processed_size": 18,
"rewrites": 37
},
"result":
{
"edges": 9,
"markings": 10,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"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": 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": 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 <= p29)",
"processed_size": 10,
"rewrites": 37
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 4,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "G ((F ((2 <= p29)) AND ((p23 + 1 <= p9) OR (2 <= p29))))",
"processed_size": 56,
"rewrites": 37
},
"result":
{
"edges": 29,
"markings": 29,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"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": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 3,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 2,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "G ((X ((p15 <= p26)) OR G ((X (G ((p15 <= p3))) AND ((1 <= p8) AND (p15 <= p26))))))",
"processed_size": 84,
"rewrites": 37
},
"result":
{
"edges": 47,
"markings": 47,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"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"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X ((F (((p15 <= p6) AND (p32 <= p11))) AND G ((p15 <= p6))))",
"processed_size": 60,
"rewrites": 37
},
"result":
{
"edges": 53821652,
"markings": 27452382,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"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"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 878
},
"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 ((1 <= p27)))",
"processed_size": 18,
"rewrites": 37
},
"result":
{
"edges": 540,
"markings": 429,
"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": "stabilization",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1171
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 3,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G (F ((G ((G ((p18 <= 2)) OR (p18 <= 2))) OR (1 <= p7))))",
"processed_size": 57,
"rewrites": 37
},
"result":
{
"edges": 3035011,
"markings": 2767465,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"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": 1754
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 2,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 2,
"aneg": 0,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 11,
"taut": 0,
"tconj": 2,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "F (G ((F ((p20 <= p4)) AND (((p5 <= 2) OR (p14 + 1 <= p19)) OR ((G ((3 <= p5)) AND F (((p5 <= 2) OR (p14 + 1 <= p19)))) OR (p20 <= p4))))))",
"processed_size": 141,
"rewrites": 37
},
"result":
{
"edges": 126442794,
"markings": 82499969,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 12
},
"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": 3341
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3341
},
"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": "(p8 + 1 <= p31)",
"processed_size": 15,
"rewrites": 39
},
"result":
{
"edges": 30,
"markings": 30,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 5
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 1,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "G ((((p31 <= p8) U (p16 <= p9)) OR G (F ((p31 <= p8)))))",
"processed_size": 56,
"rewrites": 37
},
"result":
{
"edges": 46,
"markings": 45,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 10,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 21352,
"runtime": 230.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "X((F(G(**)) OR **)) : X((G(**) AND (X(F(**)) OR **))) : F(G((F(**) AND (** OR ((G(**) AND F(**)) OR **))))) : X(G(**)) : (F(**) OR ((G(**) AND F(**)) OR (G(((** U **) OR G(F(**)))) AND F((F(**) OR (G(**) AND F(**))))))) : X(F(**)) : (X(F(**)) AND (G((F(**) AND (** OR **))) AND **)) : G((X(**) OR G((X(G(**)) AND (** AND **))))) : X((F(**) AND G(**))) : F(G(**)) : G(F((G((G(*) OR *)) OR **)))"
},
"net":
{
"arcs": 83,
"conflict_clusters": 14,
"places": 33,
"places_significant": 20,
"singleton_clusters": 0,
"transitions": 22
},
"result":
{
"preliminary_value": "no no no no no yes no no no no no ",
"value": "no no no no no yes 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: 55/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 1056
lola: finding significant places
lola: 33 places, 22 transitions, 20 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: X ((F (G ((1 <= p24))) OR (3 <= p5))) : (G (X ((3 <= p28))) AND X ((F (X ((3 <= p28))) OR (3 <= p28)))) : F (G (((G ((3 <= p5)) U ((p5 <= 2) OR (p14 + 1 <= p19))) U (p20 <= p4)))) : ((1 <= 0) U G (X ((2 <= p28)))) : (G ((((p31 <= p8) U (p16 <= p9)) OR F (G (F ((p31 <= p8)))))) U (G ((p30 <= p23)) U F ((p31 <= p8)))) : X (((p25 <= p0) U ((0 <= 0) U F ((3 <= p28))))) : ((F (X (F ((3 <= p4)))) AND G (((p23 + 1 <= p9) U (2 <= p29)))) AND (2 <= p29)) : G ((X ((p15 <= p26)) OR G (((G (X (G ((p15 <= p3)))) AND (1 <= p8)) AND (p15 <= p26))))) : X ((F (((p15 <= p6) AND (p32 <= p11))) AND G ((p15 <= p6)))) : F (G (X ((1 <= p27)))) : F (X (G (F ((NOT(F ((F ((3 <= p18)) AND (3 <= p18)))) OR (1 <= p7))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:525
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:353
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:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((F (G ((1 <= p24))) OR (3 <= p5)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((F (G ((1 <= p24))) OR (3 <= p5)))
lola: processed formula length: 37
lola: 37 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: 38 markings, 38 edges
lola: ========================================
lola: subprocess 1 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((G ((3 <= p28)) AND (X (F ((3 <= p28))) OR (3 <= p28))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((G ((3 <= p28)) AND (X (F ((3 <= p28))) OR (3 <= p28))))
lola: processed formula length: 59
lola: 37 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 5 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: 47 markings, 47 edges
lola: ========================================
lola: subprocess 2 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((2 <= p28)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((2 <= p28)))
lola: processed formula length: 18
lola: 37 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: 38 markings, 38 edges
lola: ========================================
lola: subprocess 3 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((3 <= p28)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((3 <= p28)))
lola: processed formula length: 18
lola: 37 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: 10 markings, 9 edges
lola: ========================================
lola: subprocess 4 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (F ((3 <= p4))) AND (G ((F ((2 <= p29)) AND ((p23 + 1 <= p9) OR (2 <= p29)))) AND (2 <= p29)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (2 <= p29)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= p29)
lola: processed formula length: 10
lola: 37 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 5 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((F ((2 <= p29)) AND ((p23 + 1 <= p9) OR (2 <= p29))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((F ((2 <= p29)) AND ((p23 + 1 <= p9) OR (2 <= p29))))
lola: processed formula length: 56
lola: 37 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: 29 markings, 29 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 5 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((X ((p15 <= p26)) OR G ((X (G ((p15 <= p3))) AND ((1 <= p8) AND (p15 <= p26))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((X ((p15 <= p26)) OR G ((X (G ((p15 <= p3))) AND ((1 <= p8) AND (p15 <= p26))))))
lola: processed formula length: 84
lola: 37 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 7 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 47 markings, 47 edges
lola: ========================================
lola: subprocess 6 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((F (((p15 <= p6) AND (p32 <= p11))) AND G ((p15 <= p6))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((F (((p15 <= p6) AND (p32 <= p11))) AND G ((p15 <= p6))))
lola: processed formula length: 60
lola: 37 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: 3074773 markings, 5185060 edges, 614955 markings/sec, 0 secs
lola: 6270415 markings, 10560524 edges, 639128 markings/sec, 5 secs
lola: 9488821 markings, 16050815 edges, 643681 markings/sec, 10 secs
lola: 11902805 markings, 21156547 edges, 482797 markings/sec, 15 secs
lola: 14323435 markings, 26276317 edges, 484126 markings/sec, 20 secs
lola: 16751648 markings, 31412129 edges, 485643 markings/sec, 25 secs
lola: 19281591 markings, 36651527 edges, 505989 markings/sec, 30 secs
lola: 21463443 markings, 41266284 edges, 436370 markings/sec, 35 secs
lola: 23771981 markings, 46148970 edges, 461708 markings/sec, 40 secs
lola: 25981575 markings, 50822391 edges, 441919 markings/sec, 45 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: 27452382 markings, 53821652 edges
lola: ========================================
lola: subprocess 7 will run for 878 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((1 <= p27)))
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 ((1 <= p27)))
lola: processed formula length: 18
lola: 37 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 7
lola: add low 8
lola: add low 8
lola: add low 11
lola: add low 9
lola: add low 7
lola: add low 7
lola: add low 8
lola: add low 8
lola: add low 10
lola: add low 4
lola: add low 3
lola: add low 1
lola: add low 21
lola: add low 12
lola: add low 0
lola: add low 14
lola: add low 15
lola: add low 16
lola: add low 0
lola: add low 17
lola: add low 18
lola: add low 14
lola: add low 15
lola: add low 16
lola: add low 17
lola: add low 18
lola: add low 9
lola: add low 7
lola: add low 7
lola: add low 8
lola: add low 8
lola: add low 10
lola: add low 4
lola: add low 3
lola: add low 1
lola: add low 0
lola: add low 14
lola: add low 15
lola: add low 16
lola: add low 0
lola: add low 17
lola: add low 18
lola: add low 14
lola: add low 15
lola: add low 16
lola: add low 17
lola: add low 18
lola: add low 13
lola: add low 0
lola: add low 14
lola: add low 15
lola: add low 16
lola: add low 4
lola: add low 3
lola: add low 1
lola: add low 0
lola: add low 17
lola: add low 18
lola: add low 14
lola: add low 15
lola: add low 16
lola: add low 0
lola: add low 17
lola: add low 18
lola: add low 14
lola: add low 15
lola: add low 16
lola: add low 17
lola: add low 18
lola: add low 19
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: 429 markings, 540 edges
lola: ========================================
lola: subprocess 8 will run for 1171 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((G ((G ((p18 <= 2)) OR (p18 <= 2))) OR (1 <= p7))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((G ((G ((p18 <= 2)) OR (p18 <= 2))) OR (1 <= p7))))
lola: processed formula length: 57
lola: 37 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: 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: 2767465 markings, 3035011 edges
lola: subprocess 9 will run for 1754 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ========================================
lola: ...considering subproblem: F (G ((F ((p20 <= p4)) AND (((p5 <= 2) OR (p14 + 1 <= p19)) OR ((G ((3 <= p5)) AND F (((p5 <= 2) OR (p14 + 1 <= p19)))) OR (p20 <= p4))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((F ((p20 <= p4)) AND (((p5 <= 2) OR (p14 + 1 <= p19)) OR ((G ((3 <= p5)) AND F (((p5 <= 2) OR (p14 + 1 <= p19)))) OR (p20 <= p4))))))
lola: processed formula length: 141
lola: 37 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 12 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: 3136787 markings, 3672300 edges, 627357 markings/sec, 0 secs
lola: 6405972 markings, 7499436 edges, 653837 markings/sec, 5 secs
lola: 9666117 markings, 11315991 edges, 652029 markings/sec, 10 secs
lola: 12785746 markings, 15269696 edges, 623926 markings/sec, 15 secs
lola: 15190794 markings, 18821144 edges, 481010 markings/sec, 20 secs
lola: 17477942 markings, 22311935 edges, 457430 markings/sec, 25 secs
lola: 19977607 markings, 26213612 edges, 499933 markings/sec, 30 secs
lola: 22482933 markings, 30156072 edges, 501065 markings/sec, 35 secs
lola: 25044773 markings, 34195896 edges, 512368 markings/sec, 40 secs
lola: 27436040 markings, 37896902 edges, 478253 markings/sec, 45 secs
lola: 29645978 markings, 41395086 edges, 441988 markings/sec, 50 secs
lola: 31913349 markings, 45093899 edges, 453474 markings/sec, 55 secs
lola: 34438643 markings, 48957644 edges, 505059 markings/sec, 60 secs
lola: 37105612 markings, 53163248 edges, 533394 markings/sec, 65 secs
lola: 39408975 markings, 56804747 edges, 460673 markings/sec, 70 secs
lola: 41672465 markings, 60532852 edges, 452698 markings/sec, 75 secs
lola: 43998846 markings, 64289735 edges, 465276 markings/sec, 80 secs
lola: 46475346 markings, 68195458 edges, 495300 markings/sec, 85 secs
lola: 48882052 markings, 71930969 edges, 481341 markings/sec, 90 secs
lola: 51079055 markings, 75387430 edges, 439401 markings/sec, 95 secs
lola: 53239769 markings, 78946251 edges, 432143 markings/sec, 100 secs
lola: 55408979 markings, 82588751 edges, 433842 markings/sec, 105 secs
lola: 57635323 markings, 86274284 edges, 445269 markings/sec, 110 secs
lola: 60004651 markings, 90096890 edges, 473866 markings/sec, 115 secs
lola: 62364039 markings, 93690399 edges, 471878 markings/sec, 120 secs
lola: 64557470 markings, 97195170 edges, 438686 markings/sec, 125 secs
lola: 66701394 markings, 100702345 edges, 428785 markings/sec, 130 secs
lola: 69107820 markings, 104544904 edges, 481285 markings/sec, 135 secs
lola: 71730657 markings, 108576274 edges, 524567 markings/sec, 140 secs
lola: 74131002 markings, 112454352 edges, 480069 markings/sec, 145 secs
lola: 76408574 markings, 116261247 edges, 455514 markings/sec, 150 secs
lola: 78803134 markings, 120263683 edges, 478912 markings/sec, 155 secs
lola: 81229114 markings, 124318634 edges, 485196 markings/sec, 160 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: 82499969 markings, 126442794 edges
lola: ========================================
lola: subprocess 10 will run for 3341 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F ((p31 <= p8)) OR ((G ((p30 <= p23)) AND F ((p31 <= p8))) OR (G ((((p31 <= p8) U (p16 <= p9)) OR G (F ((p31 <= p8))))) AND F ((F ((p31 <= p8)) OR (G ((p30 <= p23)) AND F ((p31 <= p8))))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 3341 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((p31 <= p8))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (p8 + 1 <= p31)
lola: processed formula length: 15
lola: 39 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: 30 markings, 30 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: G ((((p31 <= p8) U (p16 <= p9)) OR G (F ((p31 <= p8)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((((p31 <= p8) U (p16 <= p9)) OR G (F ((p31 <= p8)))))
lola: processed formula length: 56
lola: 37 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 5 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: 45 markings, 46 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no no yes no no no no no
lola:
preliminary result: no no no no no yes no no no no no
lola: memory consumption: 21352 KB
lola: time consumption: 230 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="GPPP-PT-C0001N0000100000"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="gold2020"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# 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 gold2020"
echo " Input is GPPP-PT-C0001N0000100000, 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 r113-smll-162075355700101"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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