Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2020-input.r182-oct2-158987914100619.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2020-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 itslola
Input is CSRepetitions-COL-03, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r182-oct2-158987914100619
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 188K
-rw-r--r-- 1 mcc users 3.9K Apr 27 15:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K Apr 27 15:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Apr 27 15:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K 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.0K Apr 27 15:14 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Apr 27 15:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 27 15:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.6K Apr 27 15:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Apr 27 15:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.3K Apr 27 15:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 27 15:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 27 15:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K 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 3 Apr 27 15:14 instance
-rw-r--r-- 1 mcc users 5 Apr 27 15:14 iscolored
-rw-r--r-- 1 mcc users 14K 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 CSRepetitions-COL-03-CTLCardinality-00
FORMULA_NAME CSRepetitions-COL-03-CTLCardinality-01
FORMULA_NAME CSRepetitions-COL-03-CTLCardinality-02
FORMULA_NAME CSRepetitions-COL-03-CTLCardinality-03
FORMULA_NAME CSRepetitions-COL-03-CTLCardinality-04
FORMULA_NAME CSRepetitions-COL-03-CTLCardinality-05
FORMULA_NAME CSRepetitions-COL-03-CTLCardinality-06
FORMULA_NAME CSRepetitions-COL-03-CTLCardinality-07
FORMULA_NAME CSRepetitions-COL-03-CTLCardinality-08
FORMULA_NAME CSRepetitions-COL-03-CTLCardinality-09
FORMULA_NAME CSRepetitions-COL-03-CTLCardinality-10
FORMULA_NAME CSRepetitions-COL-03-CTLCardinality-11
FORMULA_NAME CSRepetitions-COL-03-CTLCardinality-12
FORMULA_NAME CSRepetitions-COL-03-CTLCardinality-13
FORMULA_NAME CSRepetitions-COL-03-CTLCardinality-14
FORMULA_NAME CSRepetitions-COL-03-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1591168118450

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 07:08:41] [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-03 07:08:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 07:08:41] [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-03 07:08:41] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 498 ms
[2020-06-03 07:08:41] [INFO ] sort/places :
Server->serverWaiting,
Computation->serverAnwering,
Dot->requestBufferSlots,
Client->clientSending,requestBuffer,clientWaiting,

[2020-06-03 07:08:41] [INFO ] Imported 6 HL places and 5 HL transitions for a total of 58 PT places and 81.0 transition bindings in 13 ms.
[2020-06-03 07:08:41] [INFO ] Computed order based on color domains.
[2020-06-03 07:08:41] [INFO ] Unfolded HLPN to a Petri net with 58 places and 81 transitions in 11 ms.
[2020-06-03 07:08:41] [INFO ] Unfolded HLPN properties in 0 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 25 ms.
Incomplete random walk after 100001 steps, including 3345 resets, run finished after 315 ms. (steps per millisecond=317 ) properties seen :[1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 81 rows 58 cols
[2020-06-03 07:08:42] [INFO ] Computed 12 place invariants in 4 ms
[2020-06-03 07:08:42] [INFO ] [Real]Absence check using 12 positive place invariants in 36 ms returned unsat
[2020-06-03 07:08:42] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned unsat
[2020-06-03 07:08:42] [INFO ] [Real]Absence check using 12 positive place invariants in 44 ms returned sat
[2020-06-03 07:08:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 07:08:42] [INFO ] [Real]Absence check using state equation in 66 ms returned unsat
[2020-06-03 07:08:42] [INFO ] [Real]Absence check using 12 positive place invariants in 9 ms returned unsat
Successfully simplified 4 atomic propositions for a total of 4 simplifications.
[2020-06-03 07:08:42] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2020-06-03 07:08:42] [INFO ] Flatten gal took : 63 ms
[2020-06-03 07:08:42] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2020-06-03 07:08:42] [INFO ] Flatten gal took : 13 ms
FORMULA CSRepetitions-COL-03-CTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-COL-03-CTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 07:08:42] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2020-06-03 07:08:42] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 1 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLCardinality @ CSRepetitions-COL-03 @ 3570 seconds

FORMULA CSRepetitions-COL-03-CTLCardinality-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CSRepetitions-COL-03-CTLCardinality-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CSRepetitions-COL-03-CTLCardinality-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CSRepetitions-COL-03-CTLCardinality-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CSRepetitions-COL-03-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CSRepetitions-COL-03-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CSRepetitions-COL-03-CTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CSRepetitions-COL-03-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CSRepetitions-COL-03-CTLCardinality-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CSRepetitions-COL-03-CTLCardinality-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CSRepetitions-COL-03-CTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CSRepetitions-COL-03-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CSRepetitions-COL-03-CTLCardinality-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CSRepetitions-COL-03-CTLCardinality-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2856
rslt: Output for CTLCardinality @ CSRepetitions-COL-03

{
"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",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--quickchecks",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ctl",
"--json=CTLCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Wed Jun 3 07:08:43 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"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": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "(p19 + p20 + p21 <= 0)",
"processed_size": 22,
"rewrites": 24
},
"result":
{
"edges": 16,
"markings": 15,
"produced_by": "state space /EXEF",
"value": true
},
"task":
{
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability_from_a_successor",
"workflow": "stateequation"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 21,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 12,
"visible_transitions": 0
},
"processed": "((p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 <= 0) OR (p19 + p20 + p21 + 1 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18))",
"processed_size": 141,
"rewrites": 22
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 1,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 14,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 13,
"visible_transitions": 0
},
"processed": "E (((p19 + p20 + p21 <= p0) U (p0 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18)))",
"processed_size": 91,
"rewrites": 25
},
"result":
{
"edges": 2304,
"markings": 512,
"produced_by": "state space /EU",
"value": false
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "eu preserving",
"visible": 36
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "existential_until",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 1,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 18,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 18,
"visible_transitions": 0
},
"processed": "AX((p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9))",
"processed_size": 103,
"rewrites": 23
},
"net":
{
"conflict_clusters": 11,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"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": 27,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 27,
"visible_transitions": 0
},
"processed": "(p54 + p53 + p52 + p51 + p50 + p49 + p48 + p47 + p46 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p55 + p56 + p57 <= 0)",
"processed_size": 166,
"rewrites": 25
},
"result":
{
"edges": 14,
"markings": 15,
"produced_by": "state space /EXEG",
"value": false
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "invisibility based",
"visible": 27
},
"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
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 36,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 36,
"visible_transitions": 0
},
"processed": "EX(AF((p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + 1 <= p54 + p53 + p52 + p51 + p50 + p49 + p48 + p47 + p46 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p55 + p56 + p57)))",
"processed_size": 228,
"rewrites": 24
},
"net":
{
"conflict_clusters": 11,
"singleton_clusters": 0
},
"result":
{
"edges": 58,
"markings": 51,
"produced_by": "CTL model checker",
"value": false
},
"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": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 19,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 19,
"visible_transitions": 0
},
"processed": "EG(AX(((2 <= p0) AND (p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9))))",
"processed_size": 123,
"rewrites": 24
},
"net":
{
"conflict_clusters": 11,
"singleton_clusters": 0
},
"result":
{
"edges": 4608,
"markings": 2816,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "E (F ((p19 + p20 + p21 <= 0)))",
"processed_size": 30,
"rewrites": 23
},
"result":
{
"edges": 13,
"markings": 12,
"produced_by": "state space",
"value": true
},
"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": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 35,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 22,
"visible_transitions": 0
},
"processed": "E (F (((1 <= p19 + p20 + p21) AND (p30 + p29 + p28 + p27 + p26 + p25 + p24 + p23 + p22 + 1 <= p19 + p20 + p21) AND (p0 <= 2) AND ((p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 <= p0) OR (2 <= p30 + p29 + p28 + p27 + p26 + p25 + p24 + p23 + p22)))))",
"processed_size": 247,
"rewrites": 23
},
"result":
{
"edges": 8,
"markings": 9,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 8,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 58,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 49,
"visible_transitions": 0
},
"processed": "E (F (((1 <= p0) AND (p30 + p29 + p28 + p27 + p26 + p25 + p24 + p23 + p22 <= p19 + p20 + p21) AND ((2 <= p54 + p53 + p52 + p51 + p50 + p49 + p48 + p47 + p46 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p55 + p56 + p57) OR (p30 + p29 + p28 + p27 + p26 + p25 + p24 + p23 + p22 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9)))))",
"processed_size": 373,
"rewrites": 23
},
"result":
{
"edges": 6,
"markings": 7,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 6,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"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": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "(1 <= p19 + p20 + p21)",
"processed_size": 22,
"rewrites": 26
},
"result":
{
"edges": 453606525,
"markings": 58934225,
"produced_by": "parallel",
"value": false
},
"task":
{
"compoundnumber": 10,
"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": 952
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 2,
"F": 0,
"G": 1,
"U": 1,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 22,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 22,
"visible_transitions": 0
},
"processed": "E(EG((3 <= p19 + p20 + p21)) U ((p0 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18) AND (p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 <= 0)))",
"processed_size": 147,
"rewrites": 24
},
"net":
{
"conflict_clusters": 11,
"singleton_clusters": 0
},
"result":
{
"edges": 759006,
"markings": 240125,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1428
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 13,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 13,
"visible_transitions": 0
},
"processed": "((p0 + 1 <= p19 + p20 + p21) R F ((p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 <= 1)))",
"processed_size": 94,
"rewrites": 31
},
"result":
{
"edges": 18,
"markings": 19,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "existential single path",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2856
},
"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": 9,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 9,
"visible_transitions": 0
},
"processed": "(3 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18)",
"processed_size": 58,
"rewrites": 22
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 13,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 13,
"type": "boolean"
}
},

{
"child":
[

{
"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": 9,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 9,
"visible_transitions": 0
},
"processed": "(3 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18)",
"processed_size": 58,
"rewrites": 22
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 14,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"formula":
{
"count":
{
"A": 1,
"E": 1,
"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": 36,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 36,
"visible_transitions": 0
},
"processed": "AF(EG((p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 <= p54 + p53 + p52 + p51 + p50 + p49 + p48 + p47 + p46 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p55 + p56 + p57)))",
"processed_size": 224,
"rewrites": 24
},
"net":
{
"conflict_clusters": 11,
"singleton_clusters": 0
},
"result":
{
"edges": 6823,
"markings": 3583,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 14,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 22668,
"runtime": 714.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(** OR A(F(E(G(**))))) : E((** U E(G(**)))) : E(X(E(F(*)))) : (E((** U **)) AND (** OR A(X(*)))) : (A(X(A(F(**)))) AND A(X(**))) : A(G(**)) : E(F(**)) : E(X(A(F(*)))) : E(F(*)) : E((E(G(**)) U **)) : E(G(A(X(**)))) : E(F(*)) : E(F(**)) : E(F(A(G(*))))"
},
"net":
{
"arcs": 279,
"conflict_clusters": 11,
"places": 58,
"places_significant": 46,
"singleton_clusters": 0,
"transitions": 81
},
"result":
{
"preliminary_value": "no no yes no no no yes no yes no no yes yes no ",
"value": "no no yes no no no yes no yes no no yes yes 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: 139/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 1856
lola: finding significant places
lola: 58 places, 81 transitions, 46 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: ((3 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18) OR A (F (E (G ((p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 <= p54 + p53 + p52 + p51 + p50 + p49 + p48 + p47 + p46 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p55 + p56 + p57)))))) : E (((p19 + p20 + p21 <= p0) U E (G ((2 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18))))) : E (F (NOT(A (X ((1 <= p19 + p20 + p21)))))) : (E (((p19 + p20 + p21 <= p0) U (p0 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18))) AND (((p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 <= 0) OR (p19 + p20 + p21 + 1 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18)) OR NOT(E (X ((p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 <= p19 + p20 + p21)))))) : A (X ((A (F ((1 <= p54 + p53 + p52 + p51 + p50 + p49 + p48 + p47 + p46 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p55 + p56 + p57))) AND (p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9)))) : A (G (((p54 + p53 + p52 + p51 + p50 + p49 + p48 + p47 + p46 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p55 + p56 + p57 <= 2) AND (p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + 1 <= p30 + p29 + p28 + p27 + p26 + p25 + p24 + p23 + p22)))) : E (F (((1 <= p0) AND (p30 + p29 + p28 + p27 + p26 + p25 + p24 + p23 + p22 <= p19 + p20 + p21) AND ((2 <= p54 + p53 + p52 + p51 + p50 + p49 + p48 + p47 + p46 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p55 + p56 + p57) OR (p30 + p29 + p28 + p27 + p26 + p25 + p24 + p23 + p22 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9))))) : E (X (NOT(E (G ((p54 + p53 + p52 + p51 + p50 + p49 + p48 + p47 + p46 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p55 + p56 + p57 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18)))))) : NOT(A (G (((p54 + p53 + p52 + p51 + p50 + p49 + p48 + p47 + p46 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p55 + p56 + p57 + 1 <= p30 + p29 + p28 + p27 + p26 + p25 + p24 + p23 + p22) OR (p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 <= 0))))) : E ((E (G ((3 <= p19 + p20 + p21))) U ((p0 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18) AND (p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 <= 0)))) : E (G (A (X (((2 <= p0) AND (p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9)))))) : NOT(A (G ((1 <= p19 + p20 + p21)))) : E (F (((1 <= p19 + p20 + p21) AND (p30 + p29 + p28 + p27 + p26 + p25 + p24 + p23 + p22 + 1 <= p19 + p20 + p21) AND (p0 <= 2) AND ((p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 <= p0) OR (2 <= p30 + p29 + p28 + p27 + p26 + p25 + p24 + p23 + p22))))) : NOT(A (G (E (F ((1 <= p19 + p20 + p21))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:395
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:551
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
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: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (E (F ((p19 + p20 + p21 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability from a successor
lola: rewrite Frontend/Parser/formula_rewrite.k:623
lola: rewrite Frontend/Parser/formula_rewrite.k:714
lola: processed formula: (p19 + p20 + p21 <= 0)
lola: processed formula length: 22
lola: 24 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: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p19 + p20 + p21 <= 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: yes
lola: produced by: state space /EXEF
lola: The predicate is reachable from some successor.
lola: 15 markings, 16 edges
lola: state equation: write sara problem file to CTLCardinality-0.sara
lola: subprocess 1 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (((p19 + p20 + p21 <= p0) U (p0 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18))) AND (((p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 <= 0) OR (p19 + p20 + p21 + 1 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18)) OR A (X ((p19 + p20 + p21 + 1 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 <= 0) OR (p19 + p20 + p21 + 1 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 <= 0) OR (p19 + p20 + p21 + 1 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18))
lola: processed formula length: 141
lola: 22 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: state equation: calling and running sara
lola: subprocess 2 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (((p19 + p20 + p21 <= p0) U (p0 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18)))
lola: ========================================
lola: SUBTASK
lola: checking existential until
lola: rewrite Frontend/Parser/formula_rewrite.k:618
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: rewrite Frontend/Parser/formula_rewrite.k:738
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: E (((p19 + p20 + p21 <= p0) U (p0 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18)))
lola: processed formula length: 91
lola: 25 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 /EU)
lola: state space: using reachability graph (EU 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: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p0 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18)
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-2-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EU
lola: There is no path where Predicate Phi holds until Predicate Psi.
lola: 512 markings, 2304 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (A (X (A (F ((1 <= p54 + p53 + p52 + p51 + p50 + p49 + p48 + p47 + p46 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p55 + p56 + p57))))) AND A (X ((p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9))))
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: A (X ((p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX((p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9))
lola: processed formula length: 103
lola: 23 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 0 significant temporal operators and needs 0 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: 0 markings, 0 edges
lola: ========================================
sara: try reading problem file CTLCardinality-0.sara.
lola: subprocess 3 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (A (F ((1 <= p54 + p53 + p52 + p51 + p50 + p49 + p48 + p47 + p46 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p55 + p56 + p57)))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence from all successors
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:754
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (p54 + p53 + p52 + p51 + p50 + p49 + p48 + p47 + p46 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p55 + p56 + p57 <= 0)
lola: processed formula length: 166
lola: 25 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 /EXEG)
lola: state space: using reachability graph (EXEG version) (--search=depth)
lola: state space: using invisibility based stubborn set method (--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:753
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: formula 0: (1 <= p54 + p53 + p52 + p51 + p50 + p49 + p48 + p47 + p46 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p55 + p56 + p57)
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 /EXEG
lola: The predicate does not eventually occur from all successors.
lola: 15 markings, 14 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 (X (A (F ((p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + 1 <= p54 + p53 + p52 + p51 + p50 + p49 + p48 + p47 + p46 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p55 + p56 + p57)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: processed formula: EX(AF((p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + 1 <= p54 + p53 + p52 + p51 + p50 + p49 + p48 + p47 + p46 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p55 + p56 + p57)))
lola: processed formula length: 228
lola: 24 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: 51 markings, 58 edges
lola: ========================================
lola: subprocess 4 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (A (X (((2 <= p0) AND (p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: processed formula: EG(AX(((2 <= p0) AND (p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9))))
lola: processed formula length: 123
lola: 24 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).
sara: error: :375: error near 'TRANSITION': syntax error, unexpected KEY_TRANSITION, expecting SEMICOLON or COMMA
sara: error while reading Petri net from file -- aborting [#04]
sara: see manual for a documentation of this error
sara: last error message: No such file or directory
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 2816 markings, 4608 edges
lola: ========================================
lola: subprocess 5 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((p19 + p20 + p21 <= 0)))
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 ((p19 + p20 + p21 <= 0)))
lola: processed formula length: 30
lola: 23 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:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p19 + p20 + p21 <= 0)
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-5-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-5-0.sara.
sara: error: :375: error near 'TRANSITION': syntax error, unexpected KEY_TRANSITION, expecting SEMICOLON or COMMA
sara: error while reading Petri net from file -- aborting [#04]
sara: see manual for a documentation of this error
sara: last error message: No such file or directory
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 12 markings, 13 edges
lola: ========================================
lola: subprocess 6 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p19 + p20 + p21) AND (p30 + p29 + p28 + p27 + p26 + p25 + p24 + p23 + p22 + 1 <= p19 + p20 + p21) AND (p0 <= 2) AND ((p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 <= p0) OR (2 <= p30 + p29 + p28 + p27 + p26 + p25 + p24 + p23 + p22)))))
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 (((1 <= p19 + p20 + p21) AND (p30 + p29 + p28 + p27 + p26 + p25 + p24 + p23 + p22 + 1 <= p19 + p20 + p21) AND (p0 <= 2) AND ((p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 <= p0) OR (2 <= p30 + p29 + p28 + p27 + p26 + p25 + p24 + p23 + p22)))))
lola: processed formula length: 247
lola: 23 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:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p19 + p20 + p21) AND (p30 + p29 + p28 + p27 + p26 + p25 + p24 + p23 + p22 + 1 <= p19 + p20 + p21) AND (p0 <= 2) AND ((p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 <= p0) OR (2 <= p30 + p29 + p28 + p27 + p26 + p25 + p24 + p23 + p22)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 8 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 9 markings, 8 edges
lola: ========================================
lola: subprocess 7 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((p30 + p29 + p28 + p27 + p26 + p25 + p24 + p23 + p22 <= p54 + p53 + p52 + p51 + p50 + p49 + p48 + p47 + p46 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p55 + p56 + p57) AND (1 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18))))
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 (((p30 + p29 + p28 + p27 + p26 + p25 + p24 + p23 + p22 <= p54 + p53 + p52 + p51 + p50 + p49 + p48 + p47 + p46 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p55 + p56 + p57) AND (1 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18))))
lola: processed formula length: 289
lola: 23 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:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p30 + p29 + p28 + p27 + p26 + p25 + p24 + p23 + p22 <= p54 + p53 + p52 + p51 + p50 + p49 + p48 + p47 + p46 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p55 + p56 + p57) AND (1 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18))
lola: state equation task get result unparse finished id 0
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 11 markings, 10 edges
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: ========================================
lola: subprocess 8 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p54 + p53 + p52 + p51 + p50 + p49 + p48 + p47 + p46 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p55 + p56 + p57 <= 2) AND (p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + 1 <= p30 + p29 + p28 + p27 + p26 + p25 + p24 + p23 + p22))))
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 (((p54 + p53 + p52 + p51 + p50 + p49 + p48 + p47 + p46 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p55 + p56 + p57 <= 2) AND (p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + 1 <= p30 + p29 + p28 + p27 + p26 + p25 + p24 + p23 + p22))))
lola: processed formula length: 293
lola: 24 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: ((3 <= p54 + p53 + p52 + p51 + p50 + p49 + p48 + p47 + p46 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p55 + p56 + p57) OR (p30 + p29 + p28 + p27 + p26 + p25 + p24 + p23 + p22 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 8 markings, 7 edges
lola: ========================================
lola: subprocess 9 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p0) AND (p30 + p29 + p28 + p27 + p26 + p25 + p24 + p23 + p22 <= p19 + p20 + p21) AND ((2 <= p54 + p53 + p52 + p51 + p50 + p49 + p48 + p47 + p46 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p55 + p56 + p57) OR (p30 + p29 + p28 + p27 + p26 + p25 + p24 + p23 + p22 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9)))))
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 (((1 <= p0) AND (p30 + p29 + p28 + p27 + p26 + p25 + p24 + p23 + p22 <= p19 + p20 + p21) AND ((2 <= p54 + p53 + p52 + p51 + p50 + p49 + p48 + p47 + p46 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p55 + p56 + p57) OR (p30 + p29 + p28 + p27 + p26 + p25 + p24 + p23 + p22 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9)))))
lola: processed formula length: 373
lola: 23 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:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p0) AND (p30 + p29 + p28 + p27 + p26 + p25 + p24 + p23 + p22 <= p19 + p20 + p21) AND ((2 <= p54 + p53 + p52 + p51 + p50 + p49 + p48 + p47 + p46 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p55 + p56 + p57) OR (p30 + p29 + p28 + p27 + p26 + p25 + p24 + p23 + p22 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9)))
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 7 markings, 6 edges
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: ========================================
lola: subprocess 10 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (G ((p19 + p20 + p21 <= 0)))))
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: (1 <= p19 + p20 + p21)
lola: processed formula length: 22
lola: 26 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: formula 0: (p19 + p20 + p21 <= 0)
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 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: formula 1: (1 <= p19 + p20 + p21)
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: write sara problem file to CTLCardinality-10-0.sara
lola: state equation: write sara problem file to CTLCardinality-10-1.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-10-0.sara.
sara: error: :375: error near 'TRANSITION': syntax error, unexpected KEY_TRANSITION, expecting SEMICOLON or COMMA
sara: error while reading Petri net from file -- aborting [#04]
sara: see manual for a documentation of this error
sara: last error message: No such file or directory
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-10-1.sara.
lola: state equation:solution unknown
sara: error: :375: error near 'TRANSITION': syntax error, unexpected KEY_TRANSITION, expecting SEMICOLON or COMMA
sara: error while reading Petri net from file -- aborting [#04]
sara: see manual for a documentation of this error
sara: last error message: No such file or directory
lola: state equation:solution unknown
lola: sara is running 0 secs || sara is running 0 secs || 996979 markings, 5144009 edges, 199396 markings/sec, 0 secs
lola: sara is running 5 secs || sara is running 5 secs || 1737079 markings, 10149559 edges, 148020 markings/sec, 5 secs
lola: sara is running 10 secs || sara is running 10 secs || 2615814 markings, 14646023 edges, 175747 markings/sec, 10 secs
lola: sara is running 15 secs || sara is running 15 secs || 3384925 markings, 18762053 edges, 153822 markings/sec, 15 secs
lola: sara is running 20 secs || sara is running 20 secs || 4086039 markings, 22626172 edges, 140223 markings/sec, 20 secs
lola: sara is running 25 secs || sara is running 25 secs || 4746737 markings, 26356519 edges, 132140 markings/sec, 25 secs
lola: sara is running 30 secs || sara is running 30 secs || 5383002 markings, 30001624 edges, 127253 markings/sec, 30 secs
lola: sara is running 35 secs || sara is running 35 secs || 5998526 markings, 33571997 edges, 123105 markings/sec, 35 secs
lola: sara is running 40 secs || sara is running 40 secs || 6589322 markings, 37046390 edges, 118159 markings/sec, 40 secs
lola: sara is running 45 secs || sara is running 45 secs || 7171045 markings, 40521810 edges, 116345 markings/sec, 45 secs
lola: sara is running 50 secs || sara is running 50 secs || 7743351 markings, 43997915 edges, 114461 markings/sec, 50 secs
lola: sara is running 55 secs || sara is running 55 secs || 8281578 markings, 47389536 edges, 107645 markings/sec, 55 secs
lola: sara is running 60 secs || sara is running 60 secs || 8807378 markings, 50663609 edges, 105160 markings/sec, 60 secs
lola: sara is running 65 secs || sara is running 65 secs || 9322064 markings, 54017202 edges, 102937 markings/sec, 65 secs
lola: sara is running 70 secs || sara is running 70 secs || 9633931 markings, 56266975 edges, 62373 markings/sec, 70 secs
lola: sara is running 75 secs || sara is running 75 secs || 9871124 markings, 58175216 edges, 47439 markings/sec, 75 secs
lola: sara is running 80 secs || sara is running 80 secs || 10082968 markings, 60008990 edges, 42369 markings/sec, 80 secs
lola: sara is running 85 secs || sara is running 85 secs || 10282032 markings, 61778175 edges, 39813 markings/sec, 85 secs
lola: sara is running 90 secs || sara is running 90 secs || 10472450 markings, 63690354 edges, 38084 markings/sec, 90 secs
lola: sara is running 95 secs || sara is running 95 secs || 10739755 markings, 66586304 edges, 53461 markings/sec, 95 secs
lola: sara is running 100 secs || sara is running 100 secs || 10985754 markings, 69740904 edges, 49200 markings/sec, 100 secs
lola: sara is running 105 secs || sara is running 105 secs || 11142439 markings, 72782892 edges, 31337 markings/sec, 105 secs
lola: sara is running 110 secs || sara is running 110 secs || 11188855 markings, 75448564 edges, 9283 markings/sec, 110 secs
lola: sara is running 115 secs || sara is running 115 secs || 11211411 markings, 77923473 edges, 4511 markings/sec, 115 secs
lola: sara is running 120 secs || sara is running 120 secs || 11680632 markings, 82539592 edges, 93844 markings/sec, 120 secs
lola: sara is running 125 secs || sara is running 125 secs || 12595598 markings, 87047853 edges, 182993 markings/sec, 125 secs
lola: sara is running 130 secs || sara is running 130 secs || 13425466 markings, 91317719 edges, 165974 markings/sec, 130 secs
lola: sara is running 135 secs || sara is running 135 secs || 14155896 markings, 95137576 edges, 146086 markings/sec, 135 secs
lola: sara is running 140 secs || sara is running 140 secs || 14868438 markings, 98961418 edges, 142508 markings/sec, 140 secs
lola: sara is running 145 secs || sara is running 145 secs || 15564474 markings, 102729077 edges, 139207 markings/sec, 145 secs
lola: sara is running 150 secs || sara is running 150 secs || 16250996 markings, 106452308 edges, 137304 markings/sec, 150 secs
lola: sara is running 155 secs || sara is running 155 secs || 16906444 markings, 110074426 edges, 131090 markings/sec, 155 secs
lola: sara is running 160 secs || sara is running 160 secs || 17547109 markings, 113628212 edges, 128133 markings/sec, 160 secs
lola: sara is running 165 secs || sara is running 165 secs || 18190097 markings, 117216582 edges, 128598 markings/sec, 165 secs
lola: sara is running 170 secs || sara is running 170 secs || 18819573 markings, 120730413 edges, 125895 markings/sec, 170 secs
lola: sara is running 175 secs || sara is running 175 secs || 19448180 markings, 124236822 edges, 125721 markings/sec, 175 secs
lola: sara is running 180 secs || sara is running 180 secs || 20072787 markings, 127768973 edges, 124921 markings/sec, 180 secs
lola: sara is running 185 secs || sara is running 185 secs || 20670178 markings, 131188180 edges, 119478 markings/sec, 185 secs
lola: sara is running 190 secs || sara is running 190 secs || 21255837 markings, 134518361 edges, 117132 markings/sec, 190 secs
lola: sara is running 195 secs || sara is running 195 secs || 21831747 markings, 137819314 edges, 115182 markings/sec, 195 secs
lola: sara is running 200 secs || sara is running 200 secs || 22418708 markings, 141183478 edges, 117392 markings/sec, 200 secs
lola: sara is running 205 secs || sara is running 205 secs || 22992951 markings, 144508508 edges, 114849 markings/sec, 205 secs
lola: sara is running 210 secs || sara is running 210 secs || 23549153 markings, 147727189 edges, 111240 markings/sec, 210 secs
lola: sara is running 215 secs || sara is running 215 secs || 24107134 markings, 150999552 edges, 111596 markings/sec, 215 secs
lola: sara is running 220 secs || sara is running 220 secs || 24681569 markings, 154363294 edges, 114887 markings/sec, 220 secs
lola: sara is running 225 secs || sara is running 225 secs || 25247468 markings, 157669765 edges, 113180 markings/sec, 225 secs
lola: sara is running 230 secs || sara is running 230 secs || 25805542 markings, 160943005 edges, 111615 markings/sec, 230 secs
lola: sara is running 235 secs || sara is running 235 secs || 26352191 markings, 164147357 edges, 109330 markings/sec, 235 secs
lola: sara is running 240 secs || sara is running 240 secs || 26888482 markings, 167332326 edges, 107258 markings/sec, 240 secs
lola: sara is running 245 secs || sara is running 245 secs || 27426596 markings, 170509565 edges, 107623 markings/sec, 245 secs
lola: sara is running 250 secs || sara is running 250 secs || 27977611 markings, 173789153 edges, 110203 markings/sec, 250 secs
lola: sara is running 255 secs || sara is running 255 secs || 28539396 markings, 177057919 edges, 112357 markings/sec, 255 secs
lola: sara is running 260 secs || sara is running 260 secs || 29072674 markings, 180230808 edges, 106656 markings/sec, 260 secs
lola: sara is running 265 secs || sara is running 265 secs || 29600819 markings, 183371766 edges, 105629 markings/sec, 265 secs
lola: sara is running 270 secs || sara is running 270 secs || 30144490 markings, 186590355 edges, 108734 markings/sec, 270 secs
lola: sara is running 275 secs || sara is running 275 secs || 30685999 markings, 189842466 edges, 108302 markings/sec, 275 secs
lola: sara is running 280 secs || sara is running 280 secs || 31216682 markings, 193048225 edges, 106137 markings/sec, 280 secs
lola: sara is running 285 secs || sara is running 285 secs || 31740214 markings, 196215884 edges, 104706 markings/sec, 285 secs
lola: sara is running 290 secs || sara is running 290 secs || 32266041 markings, 199423247 edges, 105165 markings/sec, 290 secs
lola: sara is running 295 secs || sara is running 295 secs || 32787171 markings, 202579133 edges, 104226 markings/sec, 295 secs
lola: sara is running 300 secs || sara is running 300 secs || 33305880 markings, 205732498 edges, 103742 markings/sec, 300 secs
lola: sara is running 305 secs || sara is running 305 secs || 33822034 markings, 208907899 edges, 103231 markings/sec, 305 secs
lola: sara is running 310 secs || sara is running 310 secs || 34335786 markings, 212059190 edges, 102750 markings/sec, 310 secs
lola: sara is running 315 secs || sara is running 315 secs || 34852877 markings, 215235039 edges, 103418 markings/sec, 315 secs
lola: sara is running 320 secs || sara is running 320 secs || 35360576 markings, 218363463 edges, 101540 markings/sec, 320 secs
lola: sara is running 325 secs || sara is running 325 secs || 35860101 markings, 221412977 edges, 99905 markings/sec, 325 secs
lola: sara is running 330 secs || sara is running 330 secs || 36368686 markings, 224552177 edges, 101717 markings/sec, 330 secs
lola: sara is running 335 secs || sara is running 335 secs || 36869367 markings, 227660009 edges, 100136 markings/sec, 335 secs
lola: sara is running 340 secs || sara is running 340 secs || 37379116 markings, 230780656 edges, 101950 markings/sec, 340 secs
lola: sara is running 345 secs || sara is running 345 secs || 37888698 markings, 233959858 edges, 101916 markings/sec, 345 secs
lola: sara is running 350 secs || sara is running 350 secs || 38403875 markings, 237150065 edges, 103035 markings/sec, 350 secs
lola: sara is running 355 secs || sara is running 355 secs || 38922724 markings, 240366227 edges, 103770 markings/sec, 355 secs
lola: sara is running 360 secs || sara is running 360 secs || 39441552 markings, 243578696 edges, 103766 markings/sec, 360 secs
lola: sara is running 365 secs || sara is running 365 secs || 39960504 markings, 246749907 edges, 103790 markings/sec, 365 secs
lola: sara is running 370 secs || sara is running 370 secs || 40469173 markings, 249920479 edges, 101734 markings/sec, 370 secs
lola: sara is running 375 secs || sara is running 375 secs || 40977143 markings, 253055956 edges, 101594 markings/sec, 375 secs
lola: sara is running 380 secs || sara is running 380 secs || 41490293 markings, 256226042 edges, 102630 markings/sec, 380 secs
lola: sara is running 385 secs || sara is running 385 secs || 41992771 markings, 259412188 edges, 100496 markings/sec, 385 secs
lola: sara is running 390 secs || sara is running 390 secs || 42492075 markings, 262589626 edges, 99861 markings/sec, 390 secs
lola: sara is running 395 secs || sara is running 395 secs || 43010263 markings, 265841800 edges, 103638 markings/sec, 395 secs
lola: sara is running 400 secs || sara is running 400 secs || 43524042 markings, 269103784 edges, 102756 markings/sec, 400 secs
lola: sara is running 405 secs || sara is running 405 secs || 44036196 markings, 272365865 edges, 102431 markings/sec, 405 secs
lola: sara is running 410 secs || sara is running 410 secs || 44559833 markings, 275698079 edges, 104727 markings/sec, 410 secs
lola: sara is running 415 secs || sara is running 415 secs || 45073362 markings, 278985246 edges, 102706 markings/sec, 415 secs
lola: sara is running 420 secs || sara is running 420 secs || 45596063 markings, 282360740 edges, 104540 markings/sec, 420 secs
lola: sara is running 425 secs || sara is running 425 secs || 46089464 markings, 285598664 edges, 98680 markings/sec, 425 secs
lola: sara is running 430 secs || sara is running 430 secs || 46599495 markings, 288886963 edges, 102006 markings/sec, 430 secs
lola: sara is running 435 secs || sara is running 435 secs || 47093187 markings, 292121110 edges, 98738 markings/sec, 435 secs
lola: sara is running 440 secs || sara is running 440 secs || 47583214 markings, 295276041 edges, 98005 markings/sec, 440 secs
lola: sara is running 445 secs || sara is running 445 secs || 48095466 markings, 298567280 edges, 102450 markings/sec, 445 secs
lola: sara is running 450 secs || sara is running 450 secs || 48589507 markings, 301670130 edges, 98808 markings/sec, 450 secs
lola: sara is running 455 secs || sara is running 455 secs || 49025732 markings, 304699537 edges, 87245 markings/sec, 455 secs
lola: sara is running 460 secs || sara is running 460 secs || 49464613 markings, 307727162 edges, 87776 markings/sec, 460 secs
lola: sara is running 465 secs || sara is running 465 secs || 49934826 markings, 310855817 edges, 94043 markings/sec, 465 secs
lola: sara is running 470 secs || sara is running 470 secs || 50435517 markings, 314167792 edges, 100138 markings/sec, 470 secs
lola: sara is running 475 secs || sara is running 475 secs || 50870813 markings, 317262938 edges, 87059 markings/sec, 475 secs
lola: sara is running 480 secs || sara is running 480 secs || 51295542 markings, 320404680 edges, 84946 markings/sec, 480 secs
lola: sara is running 485 secs || sara is running 485 secs || 51703448 markings, 323542440 edges, 81581 markings/sec, 485 secs
lola: sara is running 490 secs || sara is running 490 secs || 52089507 markings, 326626884 edges, 77212 markings/sec, 490 secs
lola: sara is running 495 secs || sara is running 495 secs || 52443730 markings, 329649875 edges, 70845 markings/sec, 495 secs
lola: sara is running 500 secs || sara is running 500 secs || 52781798 markings, 332680661 edges, 67614 markings/sec, 500 secs
lola: sara is running 505 secs || sara is running 505 secs || 53111217 markings, 335696679 edges, 65884 markings/sec, 505 secs
lola: sara is running 510 secs || sara is running 510 secs || 53416992 markings, 338678548 edges, 61155 markings/sec, 510 secs
lola: sara is running 515 secs || sara is running 515 secs || 53711022 markings, 341640840 edges, 58806 markings/sec, 515 secs
lola: sara is running 520 secs || sara is running 520 secs || 54009908 markings, 344611140 edges, 59777 markings/sec, 520 secs
lola: sara is running 525 secs || sara is running 525 secs || 54304992 markings, 347565427 edges, 59017 markings/sec, 525 secs
lola: sara is running 530 secs || sara is running 530 secs || 54590653 markings, 350507105 edges, 57132 markings/sec, 530 secs
lola: sara is running 535 secs || sara is running 535 secs || 54853958 markings, 353433245 edges, 52661 markings/sec, 535 secs
lola: sara is running 540 secs || sara is running 540 secs || 55109945 markings, 356344096 edges, 51197 markings/sec, 540 secs
lola: sara is running 545 secs || sara is running 545 secs || 55374323 markings, 359245151 edges, 52876 markings/sec, 545 secs
lola: sara is running 550 secs || sara is running 550 secs || 55621838 markings, 362131127 edges, 49503 markings/sec, 550 secs
lola: sara is running 555 secs || sara is running 555 secs || 55874537 markings, 365001771 edges, 50540 markings/sec, 555 secs
lola: sara is running 560 secs || sara is running 560 secs || 56113429 markings, 367862440 edges, 47778 markings/sec, 560 secs
lola: sara is running 565 secs || sara is running 565 secs || 56342981 markings, 370692705 edges, 45910 markings/sec, 565 secs
lola: sara is running 570 secs || sara is running 570 secs || 56575042 markings, 373533141 edges, 46412 markings/sec, 570 secs
lola: sara is running 575 secs || sara is running 575 secs || 56786531 markings, 376387300 edges, 42298 markings/sec, 575 secs
lola: sara is running 580 secs || sara is running 580 secs || 56981509 markings, 379212055 edges, 38996 markings/sec, 580 secs
lola: sara is running 585 secs || sara is running 585 secs || 57183142 markings, 382050920 edges, 40327 markings/sec, 585 secs
lola: sara is running 590 secs || sara is running 590 secs || 57366742 markings, 384801872 edges, 36720 markings/sec, 590 secs
lola: sara is running 595 secs || sara is running 595 secs || 57548389 markings, 387649060 edges, 36329 markings/sec, 595 secs
lola: sara is running 600 secs || sara is running 600 secs || 57717134 markings, 390473686 edges, 33749 markings/sec, 600 secs
lola: sara is running 605 secs || sara is running 605 secs || 57866502 markings, 393353914 edges, 29874 markings/sec, 605 secs
lola: sara is running 610 secs || sara is running 610 secs || 58008775 markings, 396152778 edges, 28455 markings/sec, 610 secs
lola: sara is running 615 secs || sara is running 615 secs || 58131201 markings, 398998951 edges, 24485 markings/sec, 615 secs
lola: sara is running 620 secs || sara is running 620 secs || 58260999 markings, 401868365 edges, 25960 markings/sec, 620 secs
lola: sara is running 625 secs || sara is running 625 secs || 58363440 markings, 404693128 edges, 20488 markings/sec, 625 secs
lola: sara is running 630 secs || sara is running 630 secs || 58455693 markings, 407524642 edges, 18451 markings/sec, 630 secs
lola: sara is running 635 secs || sara is running 635 secs || 58541406 markings, 410365194 edges, 17143 markings/sec, 635 secs
lola: sara is running 640 secs || sara is running 640 secs || 58607046 markings, 413152645 edges, 13128 markings/sec, 640 secs
lola: sara is running 645 secs || sara is running 645 secs || 58659157 markings, 415982441 edges, 10422 markings/sec, 645 secs
lola: sara is running 650 secs || sara is running 650 secs || 58703392 markings, 418842097 edges, 8847 markings/sec, 650 secs
lola: sara is running 655 secs || sara is running 655 secs || 58741219 markings, 421693545 edges, 7565 markings/sec, 655 secs
lola: sara is running 660 secs || sara is running 660 secs || 58772853 markings, 424580186 edges, 6327 markings/sec, 660 secs
lola: sara is running 665 secs || sara is running 665 secs || 58799315 markings, 427369468 edges, 5292 markings/sec, 665 secs
lola: sara is running 670 secs || sara is running 670 secs || 58824441 markings, 430235254 edges, 5025 markings/sec, 670 secs
lola: sara is running 675 secs || sara is running 675 secs || 58845514 markings, 433110715 edges, 4215 markings/sec, 675 secs
lola: sara is running 680 secs || sara is running 680 secs || 58865252 markings, 436132985 edges, 3948 markings/sec, 680 secs
lola: sara is running 685 secs || sara is running 685 secs || 58883919 markings, 439214357 edges, 3733 markings/sec, 685 secs
lola: sara is running 690 secs || sara is running 690 secs || 58900430 markings, 442338478 edges, 3302 markings/sec, 690 secs
lola: sara is running 695 secs || sara is running 695 secs || 58913910 markings, 445641370 edges, 2696 markings/sec, 695 secs
lola: sara is running 700 secs || sara is running 700 secs || 58926536 markings, 449061421 edges, 2525 markings/sec, 700 secs
lola: sara is running 705 secs || sara is running 705 secs || 58934036 markings, 453165190 edges, 1500 markings/sec, 705 secs
lola: SUBRESULT
lola: result: no
lola: produced by: parallel
lola: The predicate is not possibly invariant.
lola: 58934225 markings, 453606525 edges
lola: ========================================
lola: subprocess 11 will run for 952 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((E (G ((3 <= p19 + p20 + p21))) U ((p0 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18) AND (p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: processed formula: E(EG((3 <= p19 + p20 + p21)) U ((p0 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18) AND (p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 <= 0)))
lola: processed formula length: 147
lola: 24 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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 240125 markings, 759006 edges
lola: ========================================
lola: subprocess 12 will run for 1428 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (((p19 + p20 + p21 <= p0) U E (G ((2 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18)))))
lola: ========================================
lola: SUBTASK
lola: checking an existential CTL formula with single witness path (use LTL...)
lola: rewrite Frontend/Parser/formula_rewrite.k:658
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:663
lola: rewrite Frontend/Parser/formula_rewrite.k:668
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:662
lola: rewrite Frontend/Parser/formula_rewrite.k:668
lola: rewrite Frontend/Parser/formula_rewrite.k:679
lola: rewrite Frontend/Parser/formula_rewrite.k:679
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((p0 + 1 <= p19 + p20 + p21) R F ((p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 <= 1)))
lola: processed formula length: 94
lola: 31 rewrites
lola: closed formula file CTLCardinality.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 insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The existential single path CTL formula does not hold.
lola: 19 markings, 18 edges
lola: ========================================
lola: subprocess 13 will run for 2856 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((3 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18) OR A (F (E (G ((p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 <= p54 + p53 + p52 + p51 + p50 + p49 + p48 + p47 + p46 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p55 + p56 + p57))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 2856 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (3 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18)
lola: processed formula length: 58
lola: 22 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: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: ((3 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18) OR A (F (E (G ((p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 <= p54 + p53 + p52 + p51 + p50 + p49 + p48 + p47 + p46 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p55 + p56 + p57))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: (3 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18)
lola: processed formula length: 58
lola: 22 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: ========================================
lola: ...considering subproblem: A (F (E (G ((p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 <= p54 + p53 + p52 + p51 + p50 + p49 + p48 + p47 + p46 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p55 + p56 + p57)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF(EG((p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 <= p54 + p53 + p52 + p51 + p50 + p49 + p48 + p47 + p46 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p55 + p56 + p57)))
lola: processed formula length: 224
lola: 24 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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 3583 markings, 6823 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no yes no no no yes no yes no no yes yes no
lola:
preliminary result: no no yes no no no yes no yes no no yes yes no
lola: ========================================
lola: memory consumption: 22668 KB
lola: time consumption: 714 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="CSRepetitions-COL-03"
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 CSRepetitions-COL-03, 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 r182-oct2-158987914100619"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CSRepetitions-COL-03.tgz
mv CSRepetitions-COL-03 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 ;