Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2020-input.r176-tajo-158987871200011.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is Philosophers-COL-000010, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r176-tajo-158987871200011
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 176K
-rw-r--r-- 1 mcc users 3.1K Apr 27 15:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 16K Apr 27 15:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 27 15:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 14K Apr 27 15:14 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 27 15:14 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Apr 27 15:14 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 27 15:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 27 15:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 27 15:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Apr 27 15:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 27 15:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 12K Apr 27 15:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 27 15:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 27 15:14 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Apr 27 15:14 equiv_pt
-rw-r--r-- 1 mcc users 7 Apr 27 15:14 instance
-rw-r--r-- 1 mcc users 5 Apr 27 15:14 iscolored
-rw-r--r-- 1 mcc users 9.9K Apr 27 15:14 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 Philosophers-COL-000010-CTLCardinality-00
FORMULA_NAME Philosophers-COL-000010-CTLCardinality-01
FORMULA_NAME Philosophers-COL-000010-CTLCardinality-02
FORMULA_NAME Philosophers-COL-000010-CTLCardinality-03
FORMULA_NAME Philosophers-COL-000010-CTLCardinality-04
FORMULA_NAME Philosophers-COL-000010-CTLCardinality-05
FORMULA_NAME Philosophers-COL-000010-CTLCardinality-06
FORMULA_NAME Philosophers-COL-000010-CTLCardinality-07
FORMULA_NAME Philosophers-COL-000010-CTLCardinality-08
FORMULA_NAME Philosophers-COL-000010-CTLCardinality-09
FORMULA_NAME Philosophers-COL-000010-CTLCardinality-10
FORMULA_NAME Philosophers-COL-000010-CTLCardinality-11
FORMULA_NAME Philosophers-COL-000010-CTLCardinality-12
FORMULA_NAME Philosophers-COL-000010-CTLCardinality-13
FORMULA_NAME Philosophers-COL-000010-CTLCardinality-14
FORMULA_NAME Philosophers-COL-000010-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1591124239923

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-02 18:57:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-02 18:57:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-02 18:57:21] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
SLF4J: Failed to load class "org.slf4j.impl.StaticLoggerBinder".
SLF4J: Defaulting to no-operation (NOP) logger implementation
SLF4J: See http://www.slf4j.org/codes.html#StaticLoggerBinder for further details.
[2020-06-02 18:57:22] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 551 ms
[2020-06-02 18:57:22] [INFO ] sort/places :
Philo->think,fork,catch1,catch2,eat,

[2020-06-02 18:57:22] [INFO ] Imported 5 HL places and 5 HL transitions for a total of 50 PT places and 50.0 transition bindings in 13 ms.
[2020-06-02 18:57:22] [INFO ] Computed order based on color domains.
[2020-06-02 18:57:22] [INFO ] Unfolded HLPN to a Petri net with 50 places and 50 transitions in 17 ms.
[2020-06-02 18:57:22] [INFO ] Unfolded HLPN properties in 1 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 34 ms.
Incomplete random walk after 100000 steps, including 663 resets, run finished after 202 ms. (steps per millisecond=495 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1]
// Phase 1: matrix 50 rows 50 cols
[2020-06-02 18:57:22] [INFO ] Computed 20 place invariants in 4 ms
[2020-06-02 18:57:22] [INFO ] [Real]Absence check using 20 positive place invariants in 16 ms returned unsat
Successfully simplified 1 atomic propositions for a total of 1 simplifications.
[2020-06-02 18:57:22] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2020-06-02 18:57:22] [INFO ] Flatten gal took : 29 ms
[2020-06-02 18:57:22] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2020-06-02 18:57:22] [INFO ] Flatten gal took : 9 ms
FORMULA Philosophers-COL-000010-CTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-COL-000010-CTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-02 18:57:22] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2020-06-02 18:57:22] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 1 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLCardinality @ Philosophers-COL-000010 @ 3570 seconds

FORMULA Philosophers-COL-000010-CTLCardinality-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Philosophers-COL-000010-CTLCardinality-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Philosophers-COL-000010-CTLCardinality-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Philosophers-COL-000010-CTLCardinality-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Philosophers-COL-000010-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Philosophers-COL-000010-CTLCardinality-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Philosophers-COL-000010-CTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Philosophers-COL-000010-CTLCardinality-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Philosophers-COL-000010-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Philosophers-COL-000010-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Philosophers-COL-000010-CTLCardinality-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Philosophers-COL-000010-CTLCardinality-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Philosophers-COL-000010-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Philosophers-COL-000010-CTLCardinality-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3566
rslt: Output for CTLCardinality @ Philosophers-COL-000010

{
"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=CTLCardinality.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--safe",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--quickchecks",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ctl",
"--json=CTLCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Tue Jun 2 18:57:23 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"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": 10,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 10,
"visible_transitions": 0
},
"processed": "AG(EX((1 <= p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29)))",
"processed_size": 72,
"rewrites": 8
},
"net":
{
"conflict_clusters": 11,
"singleton_clusters": 0
},
"result":
{
"edges": 91,
"markings": 43,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 2,
"F": 0,
"G": 0,
"U": 1,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 30,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 30,
"visible_transitions": 0
},
"processed": "E (X (E (((p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 <= p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39) U (3 <= p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49)))))",
"processed_size": 201,
"rewrites": 9
},
"result":
{
"edges": 48,
"markings": 29,
"produced_by": "state space / EXEU",
"value": true
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "eu preserving",
"visible": 20
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "existential_until_from_successors"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"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": 10,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 10,
"visible_transitions": 0
},
"processed": "(1 <= p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49)",
"processed_size": 64,
"rewrites": 6
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 2,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"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": 20,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 20,
"visible_transitions": 0
},
"processed": "(p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + 1 <= p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29)",
"processed_size": 124,
"rewrites": 9
},
"result":
{
"edges": 5,
"markings": 6,
"produced_by": "state space /EXEF",
"value": false
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "invariance_from_all_successors",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 2,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 0,
"G": 0,
"U": 1,
"X": 1,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 50,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 30,
"visible_transitions": 0
},
"processed": "E(((p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + 1 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19) OR (p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 <= 0)) U AX((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 <= p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29)))",
"processed_size": 315,
"rewrites": 8
},
"net":
{
"conflict_clusters": 11,
"singleton_clusters": 0
},
"result":
{
"edges": 7430,
"markings": 3116,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"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": 10,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 10,
"visible_transitions": 0
},
"processed": "A (G ((1 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9)))",
"processed_size": 62,
"rewrites": 8
},
"result":
{
"edges": 10,
"markings": 11,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"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": 20,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 20,
"visible_transitions": 0
},
"processed": "A (G ((p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9)))",
"processed_size": 118,
"rewrites": 8
},
"result":
{
"edges": 6,
"markings": 7,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"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": 20,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 20,
"visible_transitions": 0
},
"processed": "A (G ((p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19)))",
"processed_size": 128,
"rewrites": 8
},
"result":
{
"edges": 6,
"markings": 7,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 70,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 30,
"visible_transitions": 0
},
"processed": "A (G (((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 <= 1) OR (p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 <= p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49) OR ((2 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19) AND (3 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9)) OR ((p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19)))))",
"processed_size": 436,
"rewrites": 8
},
"result":
{
"edges": 1050,
"markings": 584,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 8,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 50,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 40,
"visible_transitions": 0
},
"processed": "E (F (((p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19) AND (p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 <= p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29) AND (3 <= p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49))))",
"processed_size": 324,
"rewrites": 7
},
"result":
{
"edges": 6,
"markings": 7,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3,
"problems": 3
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 20,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 20,
"visible_transitions": 0
},
"processed": "((p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 <= 2) OR (p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 <= 2))",
"processed_size": 125,
"rewrites": 10
},
"result":
{
"edges": 459270,
"markings": 59049,
"produced_by": "parallel",
"value": false
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "tscc preserving/always up"
}
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"store":
{
"type": "dfs/tscc"
},
"type": "possible_invariance",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"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": 20,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 20,
"visible_transitions": 0
},
"processed": "(p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + 1 <= p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49)",
"processed_size": 124,
"rewrites": 9
},
"result":
{
"edges": 13,
"markings": 13,
"produced_by": "state space /EFEG",
"value": true
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 20
},
"threads": 1,
"type": "dfs"
},
"type": "reachability_of_possible_preservation",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1189
},
"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": 20,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 20,
"visible_transitions": 0
},
"processed": "(p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 <= p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39)",
"processed_size": 120,
"rewrites": 10
},
"result":
{
"edges": 459270,
"markings": 59049,
"produced_by": "parallel",
"value": false
},
"task":
{
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "tscc preserving/always up"
}
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"store":
{
"type": "dfs/tscc"
},
"type": "possible_invariance",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1783
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 0,
"G": 1,
"U": 1,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 40,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 30,
"visible_transitions": 0
},
"processed": "E(((p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 <= 2) OR (p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + 1 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9)) U AG((3 <= p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39)))",
"processed_size": 259,
"rewrites": 8
},
"net":
{
"conflict_clusters": 11,
"singleton_clusters": 0
},
"result":
{
"edges": 26039,
"markings": 6753,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3566
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 3,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 40,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 30,
"visible_transitions": 0
},
"processed": "AG((AF((p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 <= p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49)) OR AF((p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 <= p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39))))",
"processed_size": 258,
"rewrites": 9
},
"net":
{
"conflict_clusters": 11,
"singleton_clusters": 0
},
"result":
{
"edges": 99,
"markings": 87,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
}
],
"exit":
{
"error": null,
"memory": 22888,
"runtime": 4.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A(G((A(F(**)) OR A(F(**))))) : A(G(E(X(**)))) : E(X(E((** U **)))) : (** OR A(X(A(G(**))))) : E(F(E(G(**)))) : A(G(**)) : E((** U A(X(**)))) : E(F(A(G(*)))) : A(G(**)) : E((** U A(G(**)))) : E(F(**)) : E(F(A(G(**)))) : A(G(**)) : A(G(**))"
},
"net":
{
"arcs": 160,
"conflict_clusters": 11,
"places": 50,
"places_significant": 30,
"singleton_clusters": 0,
"transitions": 50
},
"result":
{
"preliminary_value": "no no yes no yes no yes no no yes yes no no no ",
"value": "no no yes no yes no yes no no yes yes 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: 100/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 50
lola: finding significant places
lola: 50 places, 50 transitions, 30 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 CTLCardinality.xml
lola: A (G ((A (F ((p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 <= p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49))) OR A (F ((p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 <= p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39)))))) : A (G (E (X ((1 <= p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29))))) : E (X (E (((p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 <= p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39) U (3 <= p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49))))) : ((1 <= p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49) OR A (X (A (G ((p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19)))))) : E (F (E (G ((p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + 1 <= p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49))))) : A (G (((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 <= 1) OR (p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 <= p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49) OR ((2 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19) AND (3 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9)) OR ((p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19))))) : E ((((p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + 1 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19) OR (p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 <= 0)) U A (X ((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 <= p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29))))) : E (F (NOT(E (F ((p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 <= p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39)))))) : A (G ((p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9))) : E ((((p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 <= 2) OR (p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + 1 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9)) U A (G ((3 <= p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39))))) : E (((0 <= 0) U ((p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19) AND (p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 <= p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29) AND (3 <= p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49)))) : E (F (A (G (((3 <= p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29) AND (3 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9)))))) : E (G (A (G ((1 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9))))) : A (G ((p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19)))
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:476
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (X ((1 <= p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: processed formula: AG(EX((1 <= p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29)))
lola: processed formula length: 72
lola: 8 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 43 markings, 91 edges
lola: ========================================
lola: subprocess 1 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (E (((p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 <= p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39) U (3 <= p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49)))))
lola: ========================================
lola: SUBTASK
lola: checking existential until from successors
lola: rewrite Frontend/Parser/formula_rewrite.k:688
lola: built state equation task
lola: rewrite Frontend/Parser/formula_rewrite.k:716
lola: rewrite Frontend/Parser/formula_rewrite.k:688
lola: processed formula: E (X (E (((p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 <= p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39) U (3 <= p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49)))))
lola: processed formula length: 201
lola: 9 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EXEU)
lola: state space: using reachability graph (EXEU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: state equation task get result started, id 0
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (3 <= p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EXEU
lola: There is a path where Predicate Phi holds until Predicate Psi from some successor.
lola: 29 markings, 48 edges
lola: ========================================
lola: subprocess 2 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49) OR A (X (A (G ((p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49)
lola: processed formula length: 64
lola: 6 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (A (G ((p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance from all successors
lola: rewrite Frontend/Parser/formula_rewrite.k:624
lola: rewrite Frontend/Parser/formula_rewrite.k:753
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + 1 <= p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29)
lola: processed formula length: 124
lola: 9 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EXEF)
lola: state space: using reachability graph (EXef version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: SUBRESULT
lola: formula 0: (p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + 1 <= p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: result: no
lola: produced by: state space /EXEF
lola: The predicate is not invariant from successors.
lola: 6 markings, 5 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 3 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((((p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + 1 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19) OR (p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 <= 0)) U A (X ((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 <= p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: processed formula: E(((p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + 1 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19) OR (p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 <= 0)) U AX((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 <= p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29)))
lola: processed formula length: 315
lola: 8 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 3116 markings, 7430 edges
lola: ========================================
lola: subprocess 4 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((1 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G ((1 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9)))
lola: processed formula length: 62
lola: 8 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 <= 0)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 11 markings, 10 edges
lola: ========================================
lola: subprocess 5 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G ((p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9)))
lola: processed formula length: 118
lola: 8 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + 1 <= p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 7 markings, 6 edges
lola: ========================================
lola: subprocess 6 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G ((p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19)))
lola: processed formula length: 128
lola: 8 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + 1 <= p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 7 markings, 6 edges
lola: ========================================
lola: subprocess 7 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 <= 1) OR (p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 <= p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49) OR ((2 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19) AND (3 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9)) OR ((p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 <= p10 + p11 + p12 + p13 + p1... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G (((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 <= 1) OR (p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 <= p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49) OR ((2 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19) AND (3 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9)) OR ((p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 <= p10 + p11 + p12 + p13 + p1... (shortened)
lola: processed formula length: 436
lola: 8 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((2 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9) AND (p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + 1 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9) AND ((p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 <= 1) OR (p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 <= 2)) AND ((p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + 1 <= p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 8 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-7-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 584 markings, 1050 edges
lola: ========================================
lola: subprocess 8 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19) AND (p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 <= p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29) AND (3 <= p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19) AND (p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 <= p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29) AND (3 <= p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49))))
lola: processed formula length: 324
lola: 7 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: The predicate is reachable.
lola: 7 markings, 6 edges
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19) AND (p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 <= p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29) AND (3 <= p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: ========================================
lola: subprocess 9 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (G (((3 <= p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29) AND (3 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9))))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: rewrite Frontend/Parser/formula_rewrite.k:604
lola: rewrite Frontend/Parser/formula_rewrite.k:614
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 <= 2) OR (p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 <= 2))
lola: processed formula length: 125
lola: 10 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using tscc preserving stubborn set method (--stubborn)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 1
lola: formula 0: ((3 <= p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29) AND (3 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9))
lola: state equation task get result unparse finished id 0
lola: state equation task get result unparse finished++ id 1
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: formula 1: ((p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 <= 2) OR (p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 <= 2))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-9-0.sara
lola: state equation: write sara problem file to CTLCardinality-9-1.sara
lola: state equation: calling and running sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-9-0.sara.
sara: try reading problem file CTLCardinality-9-1.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic


lola: state equation 0: solution produced
lola: state equation 1: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: parallel
lola: The predicate is not possibly invariant.
lola: 59049 markings, 459270 edges
lola: ========================================
lola: subprocess 10 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (E (G ((p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + 1 <= p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability of possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:598
lola: rewrite Frontend/Parser/formula_rewrite.k:633
lola: rewrite Frontend/Parser/formula_rewrite.k:730
lola: processed formula: (p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + 1 <= p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49)
lola: processed formula length: 124
lola: 9 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EFEG)
lola: state space: using reachability graph (EFEG version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EFEG
lola: state equation task get result unparse finished++ id 0
lola: The predicate is possibly preserved from a reachable marking.
lola: 13 markings, 13 edges
lola: ========================================
lola: subprocess 11 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (G ((p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + 1 <= p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49)))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: rewrite Frontend/Parser/formula_rewrite.k:604
lola: rewrite Frontend/Parser/formula_rewrite.k:614
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: (p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 <= p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39)
lola: processed formula length: 120
lola: 10 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using tscc preserving stubborn set method (--stubborn)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: formula 1: (p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 <= p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39)
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + 1 <= p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-11-1.sara
lola: state equation: calling and running sara
lola: state equation: write sara problem file to CTLCardinality-11-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-11-1.sara.
sara: try reading problem file CTLCardinality-11-0.sara.
sara: place or transition ordering is non-deterministic

sara: place or transition ordering is non-deterministic

lola: state equation 0: solution produced
lola: state equation 1: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: parallel
lola: The predicate is not possibly invariant.
lola: 59049 markings, 459270 edges
lola: ========================================
lola: subprocess 12 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((((p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 <= 2) OR (p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + 1 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9)) U A (G ((3 <= p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: processed formula: E(((p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 <= 2) OR (p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + 1 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9)) U AG((3 <= p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39)))
lola: processed formula length: 259
lola: 8 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 6753 markings, 26039 edges
lola: ========================================
lola: subprocess 13 will run for 3566 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((A (F ((p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 <= p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49))) OR A (F ((p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 <= p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: processed formula: AG((AF((p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 <= p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49)) OR AF((p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 <= p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39))))
lola: processed formula length: 258
lola: 9 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 87 markings, 99 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no yes no yes no yes no no yes yes no no no
lola:
preliminary result: no no yes no yes no yes no no yes yes no no no
lola: memory consumption: 22888 KB
lola: time consumption: 4 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLCardinality.json
lola: closed JSON file CTLCardinality.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="Philosophers-COL-000010"
export BK_EXAMINATION="CTLCardinality"
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 Philosophers-COL-000010, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r176-tajo-158987871200011"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Philosophers-COL-000010.tgz
mv Philosophers-COL-000010 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;