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-158987872000531.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 PolyORBLF-PT-S06J06T04, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r176-tajo-158987872000531
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 12M
-rw-r--r-- 1 mcc users 12K Apr 12 05:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 41K Apr 12 05:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 116K Apr 11 05:33 CTLFireability.txt
-rw-r--r-- 1 mcc users 368K Apr 11 05:33 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 7.4K Apr 14 12:46 LTLCardinality.txt
-rw-r--r-- 1 mcc users 33K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 13K Apr 14 12:46 LTLFireability.txt
-rw-r--r-- 1 mcc users 48K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 10 12:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 35K Apr 10 12:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 237K Apr 9 18:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 742K Apr 9 18:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.9K Apr 10 22:23 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.2K Apr 10 22:23 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 10 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 9.5M Mar 24 05:37 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME PolyORBLF-PT-S06J06T04-CTLCardinality-00
FORMULA_NAME PolyORBLF-PT-S06J06T04-CTLCardinality-01
FORMULA_NAME PolyORBLF-PT-S06J06T04-CTLCardinality-02
FORMULA_NAME PolyORBLF-PT-S06J06T04-CTLCardinality-03
FORMULA_NAME PolyORBLF-PT-S06J06T04-CTLCardinality-04
FORMULA_NAME PolyORBLF-PT-S06J06T04-CTLCardinality-05
FORMULA_NAME PolyORBLF-PT-S06J06T04-CTLCardinality-06
FORMULA_NAME PolyORBLF-PT-S06J06T04-CTLCardinality-07
FORMULA_NAME PolyORBLF-PT-S06J06T04-CTLCardinality-08
FORMULA_NAME PolyORBLF-PT-S06J06T04-CTLCardinality-09
FORMULA_NAME PolyORBLF-PT-S06J06T04-CTLCardinality-10
FORMULA_NAME PolyORBLF-PT-S06J06T04-CTLCardinality-11
FORMULA_NAME PolyORBLF-PT-S06J06T04-CTLCardinality-12
FORMULA_NAME PolyORBLF-PT-S06J06T04-CTLCardinality-13
FORMULA_NAME PolyORBLF-PT-S06J06T04-CTLCardinality-14
FORMULA_NAME PolyORBLF-PT-S06J06T04-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1591161235247

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 05:13:57] [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 05:13:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 05:13:57] [INFO ] Load time of PNML (sax parser for PT used): 432 ms
[2020-06-03 05:13:57] [INFO ] Transformed 506 places.
[2020-06-03 05:13:57] [INFO ] Transformed 7154 transitions.
[2020-06-03 05:13:57] [INFO ] Parsed PT model containing 506 places and 7154 transitions in 507 ms.
Ensure Unique test removed 5380 transitions
Reduce redundant transitions removed 5380 transitions.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 216 ms.
Incomplete random walk after 100000 steps, including 503 resets, run finished after 724 ms. (steps per millisecond=138 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 0, 1]
[2020-06-03 05:13:58] [INFO ] Flow matrix only has 1750 transitions (discarded 24 similar events)
// Phase 1: matrix 1750 rows 506 cols
[2020-06-03 05:13:58] [INFO ] Computed 54 place invariants in 127 ms
[2020-06-03 05:13:59] [INFO ] [Real]Absence check using 23 positive place invariants in 35 ms returned sat
[2020-06-03 05:13:59] [INFO ] [Real]Absence check using 23 positive and 31 generalized place invariants in 37 ms returned unsat
[2020-06-03 05:13:59] [INFO ] [Real]Absence check using 23 positive place invariants in 27 ms returned sat
[2020-06-03 05:13:59] [INFO ] [Real]Absence check using 23 positive and 31 generalized place invariants in 40 ms returned unsat
[2020-06-03 05:13:59] [INFO ] [Real]Absence check using 23 positive place invariants in 18 ms returned sat
[2020-06-03 05:13:59] [INFO ] [Real]Absence check using 23 positive and 31 generalized place invariants in 22 ms returned unsat
[2020-06-03 05:13:59] [INFO ] [Real]Absence check using 23 positive place invariants in 18 ms returned sat
[2020-06-03 05:13:59] [INFO ] [Real]Absence check using 23 positive and 31 generalized place invariants in 25 ms returned unsat
[2020-06-03 05:13:59] [INFO ] [Real]Absence check using 23 positive place invariants in 11 ms returned unsat
[2020-06-03 05:14:00] [INFO ] [Real]Absence check using 23 positive place invariants in 8 ms returned unsat
[2020-06-03 05:14:00] [INFO ] [Real]Absence check using 23 positive place invariants in 23 ms returned unsat
[2020-06-03 05:14:00] [INFO ] [Real]Absence check using 23 positive place invariants in 13 ms returned sat
[2020-06-03 05:14:00] [INFO ] [Real]Absence check using 23 positive and 31 generalized place invariants in 20 ms returned sat
[2020-06-03 05:14:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:14:03] [INFO ] [Real]Absence check using state equation in 2988 ms returned sat
[2020-06-03 05:14:03] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:14:03] [INFO ] [Nat]Absence check using 23 positive place invariants in 32 ms returned sat
[2020-06-03 05:14:03] [INFO ] [Nat]Absence check using 23 positive and 31 generalized place invariants in 33 ms returned unsat
Successfully simplified 8 atomic propositions for a total of 8 simplifications.
[2020-06-03 05:14:04] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2020-06-03 05:14:04] [INFO ] Flatten gal took : 399 ms
[2020-06-03 05:14:04] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2020-06-03 05:14:04] [INFO ] Flatten gal took : 104 ms
FORMULA PolyORBLF-PT-S06J06T04-CTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J06T04-CTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J06T04-CTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 05:14:04] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLCardinality.sr.xml took 4 ms.
[2020-06-03 05:14:04] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 23 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLCardinality @ PolyORBLF-PT-S06J06T04 @ 3570 seconds

FORMULA PolyORBLF-PT-S06J06T04-CTLCardinality-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBLF-PT-S06J06T04-CTLCardinality-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBLF-PT-S06J06T04-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBLF-PT-S06J06T04-CTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBLF-PT-S06J06T04-CTLCardinality-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBLF-PT-S06J06T04-CTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBLF-PT-S06J06T04-CTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBLF-PT-S06J06T04-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBLF-PT-S06J06T04-CTLCardinality-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBLF-PT-S06J06T04-CTLCardinality-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBLF-PT-S06J06T04-CTLCardinality-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBLF-PT-S06J06T04-CTLCardinality-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBLF-PT-S06J06T04-CTLCardinality-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2743
rslt: Output for CTLCardinality @ PolyORBLF-PT-S06J06T04

{
"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 05:14:04 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 251
},
"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": 53,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 53,
"visible_transitions": 0
},
"processed": "((p376 <= 1) OR (p5 + p101 + p102 + p146 + p148 + p191 + p205 + p210 + p232 + p254 + p285 + p350 + p362 + p364 + p66 + p421 + p443 + p444 + p460 + p475 + p484 + p53 + p95 + p97 + 1 <= p8 + p138 + p160 + p170 + p184 + p185 + p209 + p241 + p292 + p299 + p312 + p343 + p348 + p358 + p367 + p375 + p391 + p396 + p442 + p462 + p463 + p472 + p500 + p15 + p20 + p80 + p87 + p89))",
"processed_size": 373,
"rewrites": 18
},
"result":
{
"edges": 637021,
"markings": 327059,
"produced_by": "state space /EXEG",
"value": false
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "invisibility based",
"visible": 884
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "invariance_from_all_successors",
"workflow": "stateequation"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 299
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "E (F ((p342 + 1 <= p105)))",
"processed_size": 26,
"rewrites": 16
},
"result":
{
"edges": 286,
"markings": 287,
"produced_by": "state space",
"value": true
},
"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": "reachability",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 2,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 299
},
"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": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (G ((p148 <= p80)))",
"processed_size": 21,
"rewrites": 17
},
"result":
{
"edges": 6650,
"markings": 4834,
"produced_by": "state space",
"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",
"workflow": "stateequation||search"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 374
},
"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": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (G ((p349 <= p493)))",
"processed_size": 22,
"rewrites": 17
},
"result":
{
"edges": 119,
"markings": 120,
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 3,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 333
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 2,
"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 (G (((2 <= p50) OR (p230 <= p279))))",
"processed_size": 39,
"rewrites": 16
},
"result":
{
"edges": 27,
"markings": 28,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 20
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "possible_preservation",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 374
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "((p242 <= p164) AND (p47 <= p136))",
"processed_size": 34,
"rewrites": 18
},
"result":
{
"edges": 27,
"markings": 28,
"produced_by": "state space /EFEG",
"value": true
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 10
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "reachability_of_possible_preservation",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 428
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 1,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "((p469 <= p316) OR (p228 <= p170) OR ((p137 <= p102) AND (1 <= p252)))",
"processed_size": 72,
"rewrites": 18
},
"result":
{
"edges": 27,
"markings": 28,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 118
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 6,
"problems": 2
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 499
},
"exit":
{
"localtimelimitreached": false
},
"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": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "AF(EG((p160 <= p273)))",
"processed_size": 22,
"rewrites": 17
},
"net":
{
"conflict_clusters": 169,
"singleton_clusters": 0
},
"result":
{
"edges": 367,
"markings": 367,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 749
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"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 (((p467 + 1 <= p20) AND (p307 <= 2))))",
"processed_size": 43,
"rewrites": 16
},
"result":
{
"edges": 424,
"markings": 309,
"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": 2,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 8,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 749
},
"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": 8,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "(p365 <= p165 + p249 + p315 + p381 + p493 + p32 + p96)",
"processed_size": 54,
"rewrites": 15
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 9,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 999
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"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": 36,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 36,
"visible_transitions": 0
},
"processed": "A (((p318 + p384 + p481 + p52 <= p4 + p141 + p144 + p151 + p173 + p204 + p245 + p247 + p260 + p289 + p300 + p305 + p311 + p332 + p341 + p369 + p370 + p440 + p486 + p489 + p34 + p45 + p73 + p86) U (p178 + p246 + p494 + p83 + 1 <= p142 + p280 + p326 + p397)))",
"processed_size": 257,
"rewrites": 20
},
"result":
{
"edges": 15,
"markings": 16,
"produced_by": "state space /ER",
"value": false
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl",
"visible": 36
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "universal_until",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 9,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 999
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(p372 + 1 <= p240)",
"processed_size": 18,
"rewrites": 19
},
"result":
{
"edges": 75153,
"markings": 25391,
"produced_by": "state space /EGEF",
"value": false
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving",
"visible": 20
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "eventual_invariance",
"workflow": "stateequation"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1498
},
"exit":
{
"localtimelimitreached": false
},
"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": 36,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 36,
"visible_transitions": 0
},
"processed": "((p7 + p104 + p152 + p199 + 1 <= p117 + p306 + p356 + p415) OR (1 <= p8 + p138 + p160 + p170 + p184 + p185 + p209 + p241 + p292 + p299 + p312 + p343 + p348 + p358 + p367 + p375 + p391 + p396 + p442 + p462 + p463 + p472 + p500 + p15 + p20 + p80 + p87 + p89))",
"processed_size": 258,
"rewrites": 15
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 11,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2997
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 2,
"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": "A (((p182 + p224 + p263 + p303 + 1 <= p115 + p118 + p121 + p126 + p168 + p169 + p202 + p211 + p217 + p251 + p273 + p283 + p295 + p330 + p336 + p345 + p403 + p63 + p59 + p432 + p58 + p467 + p468 + p496 + p497 + p24 + p27 + p37) R (p188 + p200 + p262 + p68 <= 2)))",
"processed_size": 262,
"rewrites": 20
},
"result":
{
"edges": 503,
"markings": 246,
"produced_by": "state space /EU",
"value": true
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "eu preserving",
"visible": 172
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "universal_release",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 11,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2997
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 2,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 16,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 16,
"visible_transitions": 0
},
"processed": "(((p318 + p384 + p481 + p52 <= p31) AND ((2 <= p176) OR (p198 + p313 + p410 + p479 <= p175 + p177 + p237 + p363 + p478 + p38))))",
"processed_size": 129,
"rewrites": 15
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 12,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 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 ((p207 + p250 + p408 + p416 <= p175 + p177 + p237 + p363 + p478 + p38)))",
"processed_size": 77,
"rewrites": 17
},
"result":
{
"edges": 37,
"markings": 24,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 14,
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 12,
"type": "boolean"
}
},

{
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 0,
"G": 0,
"U": 1,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 44,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 44,
"visible_transitions": 0
},
"processed": "A(EX((p142 + p280 + p326 + p397 <= p207 + p250 + p408 + p416)) U ((p219 + 1 <= p109 + p145 + p161 + p171 + p179 + p197 + p258 + p266 + p267 + p323 + p334 + p346 + p361 + p395 + p407 + p62 + p434 + p436 + p446 + p474 + p50 + p35 + p69 + p93) AND (p111 + p325 + p439 + p29 + 1 <= p165 + p249 + p315 + p381 + p493 + p32 + p96)))",
"processed_size": 325,
"rewrites": 17
},
"net":
{
"conflict_clusters": 169,
"singleton_clusters": 0
},
"result":
{
"edges": 64755847,
"markings": 18772007,
"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"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 2,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 16,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 16,
"visible_transitions": 0
},
"processed": "(((p318 + p384 + p481 + p52 <= p31) AND ((2 <= p176) OR (p198 + p313 + p410 + p479 <= p175 + p177 + p237 + p363 + p478 + p38))))",
"processed_size": 129,
"rewrites": 15
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 14,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"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": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "(p111 + p325 + p439 + p29 + 1 <= p372)",
"processed_size": 38,
"rewrites": 18
},
"result":
{
"edges": 19,
"markings": 16,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 866
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},

{
"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 ((p207 + p250 + p408 + p416 <= p175 + p177 + p237 + p363 + p478 + p38)))",
"processed_size": 77,
"rewrites": 17
},
"result":
{
"edges": 37,
"markings": 24,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 16,
"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"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 14,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 81720,
"runtime": 827.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A((E(X(**)) U **)) : A(X(A(F(**)))) : (** OR A((* R *))) : (** OR A((** U **))) : (A(G(**)) OR (A(F(**)) AND **)) : A(F(A(G(**)))) : (E(F(**)) OR (E(X(**)) AND **)) : E(F(E(G(**)))) : (** AND (A(X(**)) AND (A(G(**)) OR (E(G(**)) AND A(G(**)))))) : E(G(*)) : (E(F(**)) OR **) : A(F(E(G(**)))) : A(F(**))"
},
"net":
{
"arcs": 10564,
"conflict_clusters": 169,
"places": 506,
"places_significant": 452,
"singleton_clusters": 0,
"transitions": 1774
},
"result":
{
"preliminary_value": "no no yes no no no yes yes no yes yes yes no ",
"value": "no no yes no no no yes yes no yes 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: 2280/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 16192
lola: finding significant places
lola: 506 places, 1774 transitions, 452 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: LP says that atomic proposition is always false: (2 <= p117 + p306 + p356 + p415)
lola: A ((E (X ((p142 + p280 + p326 + p397 <= p207 + p250 + p408 + p416))) U ((p219 + 1 <= p109 + p145 + p161 + p171 + p179 + p197 + p258 + p266 + p267 + p323 + p334 + p346 + p361 + p395 + p407 + p62 + p434 + p436 + p446 + p474 + p50 + p35 + p69 + p93) AND (p111 + p325 + p439 + p29 + 1 <= p165 + p249 + p315 + p381 + p493 + p32 + p96)))) : A (X (A (F (((2 <= p376) AND (p8 + p138 + p160 + p170 + p184 + p185 + p209 + p241 + p292 + p299 + p312 + p343 + p348 + p358 + p367 + p375 + p391 + p396 + p442 + p462 + p463 + p472 + p500 + p15 + p20 + p80 + p87 + p89 <= p5 + p101 + p102 + p146 + p148 + p191 + p205 + p210 + p232 + p254 + p285 + p350 + p362 + p364 + p66 + p421 + p443 + p444 + p460 + p475 + p484 + p53 + p95 + p97)))))) : (((p7 + p104 + p152 + p199 + 1 <= p117 + p306 + p356 + p415) OR (1 <= p8 + p138 + p160 + p170 + p184 + p185 + p209 + p241 + p292 + p299 + p312 + p343 + p348 + p358 + p367 + p375 + p391 + p396 + p442 + p462 + p463 + p472 + p500 + p15 + p20 + p80 + p87 + p89)) OR NOT(E (((p115 + p118 + p121 + p126 + p168 + p169 + p202 + p211 + p217 + p251 + p273 + p283 + p295 + p330 + p336 + p345 + p403 + p63 + p59 + p432 + p58 + p467 + p468 + p496 + p497 + p24 + p27 + p37 <= p182 + p224 + p263 + p303) U (3 <= p188 + p200 + p262 + p68))))) : ((p365 <= p165 + p249 + p315 + p381 + p493 + p32 + p96) OR A (((p318 + p384 + p481 + p52 <= p4 + p141 + p144 + p151 + p173 + p204 + p245 + p247 + p260 + p289 + p300 + p305 + p311 + p332 + p341 + p369 + p370 + p440 + p486 + p489 + p34 + p45 + p73 + p86) U (p178 + p246 + p494 + p83 + 1 <= p142 + p280 + p326 + p397)))) : (A (G (A (G ((p207 + p250 + p408 + p416 <= p175 + p177 + p237 + p363 + p478 + p38))))) OR (A (F ((p372 <= p111 + p325 + p439 + p29))) AND (((p318 + p384 + p481 + p52 <= p31) AND ((2 <= p176) OR (p198 + p313 + p410 + p479 <= p175 + p177 + p237 + p363 + p478 + p38)))))) : A (((0 <= 0) U A (G ((p240 <= p372))))) : (E (F ((p342 + 1 <= p105))) OR (E (X (((1 <= p143) OR (p365 <= p325)))) AND (1 <= p81))) : E (F (E (G (((p242 <= p164) AND (p47 <= p136)))))) : (((p231 <= 0) AND A (X ((p90 <= p410)))) AND (A (G ((p349 <= p493))) OR (E (G ((p419 <= p49))) AND A (G ((p148 <= p80)))))) : NOT(A (F (((p50 <= 1) AND (p279 + 1 <= p230))))) : (E (F (((p467 + 1 <= p20) AND (p307 <= 2)))) OR (p214 <= p427)) : (A (F (E (G ((p160 <= p273))))) AND E (G ((0 <= 0)))) : A (F (((p316 + 1 <= p469) AND (p170 + 1 <= p228) AND ((p102 + 1 <= p137) OR (p252 <= 0)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:389
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:323
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:160
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:115
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 251 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((E (X ((p142 + p280 + p326 + p397 <= p207 + p250 + p408 + p416))) U ((p219 + 1 <= p109 + p145 + p161 + p171 + p179 + p197 + p258 + p266 + p267 + p323 + p334 + p346 + p361 + p395 + p407 + p62 + p434 + p436 + p446 + p474 + p50 + p35 + p69 + p93) AND (p111 + p325 + p439 + p29 + 1 <= p165 + p249 + p315 + p381 + p493 + p32 + p96))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: processed formula: A(EX((p142 + p280 + p326 + p397 <= p207 + p250 + p408 + p416)) U ((p219 + 1 <= p109 + p145 + p161 + p171 + p179 + p197 + p258 + p266 + p267 + p323 + p334 + p346 + p361 + p395 + p407 + p62 + p434 + p436 + p446 + p474 + p50 + p35 + p69 + p93) AND (p111 + p325 + p439 + p29 + 1 <= p165 + p249 + p315 + p381 + p493 + p32 + p96)))
lola: processed formula length: 325
lola: 17 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: 368180 markings, 1168204 edges, 73636 markings/sec, 0 secs
lola: 767420 markings, 2499874 edges, 79848 markings/sec, 5 secs
lola: 1176310 markings, 3811652 edges, 81778 markings/sec, 10 secs
lola: 1571750 markings, 5127302 edges, 79088 markings/sec, 15 secs
lola: 1967194 markings, 6451207 edges, 79089 markings/sec, 20 secs
lola: 2352882 markings, 7767306 edges, 77138 markings/sec, 25 secs
lola: 2722816 markings, 9099653 edges, 73987 markings/sec, 30 secs
lola: 3077810 markings, 10261144 edges, 70999 markings/sec, 35 secs
lola: 3448866 markings, 11457107 edges, 74211 markings/sec, 40 secs
lola: 3813288 markings, 12631512 edges, 72884 markings/sec, 45 secs
lola: 4184378 markings, 13881755 edges, 74218 markings/sec, 50 secs
lola: 4522290 markings, 15013179 edges, 67582 markings/sec, 55 secs
lola: 4879197 markings, 16238292 edges, 71381 markings/sec, 60 secs
lola: 5217964 markings, 17441719 edges, 67753 markings/sec, 65 secs
lola: 5614030 markings, 18754393 edges, 79213 markings/sec, 70 secs
lola: 5998645 markings, 20043298 edges, 76923 markings/sec, 75 secs
lola: 6346647 markings, 21194842 edges, 69600 markings/sec, 80 secs
lola: 6683594 markings, 22319576 edges, 67389 markings/sec, 85 secs
lola: 7024101 markings, 23442977 edges, 68101 markings/sec, 90 secs
lola: 7339209 markings, 24590701 edges, 63022 markings/sec, 95 secs
lola: 7672136 markings, 25732107 edges, 66585 markings/sec, 100 secs
lola: 8033016 markings, 26916246 edges, 72176 markings/sec, 105 secs
lola: 8396382 markings, 28142152 edges, 72673 markings/sec, 110 secs
lola: 8778441 markings, 29458271 edges, 76412 markings/sec, 115 secs
lola: 9151253 markings, 30768753 edges, 74562 markings/sec, 120 secs
lola: 9533091 markings, 32078166 edges, 76368 markings/sec, 125 secs
lola: 9917337 markings, 33369261 edges, 76849 markings/sec, 130 secs
lola: 10299144 markings, 34668518 edges, 76361 markings/sec, 135 secs
lola: 10659622 markings, 35969962 edges, 72096 markings/sec, 140 secs
lola: 11055468 markings, 37268163 edges, 79169 markings/sec, 145 secs
lola: 11442628 markings, 38547036 edges, 77432 markings/sec, 150 secs
lola: 11823921 markings, 39831479 edges, 76259 markings/sec, 155 secs
lola: 12205088 markings, 41113495 edges, 76233 markings/sec, 160 secs
lola: 12586595 markings, 42409255 edges, 76301 markings/sec, 165 secs
lola: 12948200 markings, 43698248 edges, 72321 markings/sec, 170 secs
lola: 13328753 markings, 44973598 edges, 76111 markings/sec, 175 secs
lola: 13705663 markings, 46244025 edges, 75382 markings/sec, 180 secs
lola: 14077871 markings, 47540706 edges, 74442 markings/sec, 185 secs
lola: 14442770 markings, 48840353 edges, 72980 markings/sec, 190 secs
lola: 14805933 markings, 50163727 edges, 72633 markings/sec, 195 secs
lola: 15177488 markings, 51464007 edges, 74311 markings/sec, 200 secs
lola: 15534812 markings, 52764439 edges, 71465 markings/sec, 205 secs
lola: 15898396 markings, 54064330 edges, 72717 markings/sec, 210 secs
lola: 16266104 markings, 55356454 edges, 73542 markings/sec, 215 secs
lola: 16631557 markings, 56642405 edges, 73091 markings/sec, 220 secs
lola: 16974307 markings, 57961016 edges, 68550 markings/sec, 225 secs
lola: 17329176 markings, 59237869 edges, 70974 markings/sec, 230 secs
lola: 17675570 markings, 60532986 edges, 69279 markings/sec, 235 secs
lola: 18042480 markings, 61833351 edges, 73382 markings/sec, 240 secs
lola: 18384499 markings, 63148793 edges, 68404 markings/sec, 245 secs
lola: local time limit reached - aborting
lola:
preliminary result: unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola: memory consumption: 2783260 KB
lola: time consumption: 551 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLCardinality.json
lola: closed JSON file CTLCardinality.json
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 1 will run for 251 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (A (F (((2 <= p376) AND (p8 + p138 + p160 + p170 + p184 + p185 + p209 + p241 + p292 + p299 + p312 + p343 + p348 + p358 + p367 + p375 + p391 + p396 + p442 + p462 + p463 + p472 + p500 + p15 + p20 + p80 + p87 + p89 <= p5 + p101 + p102 + p146 + p148 + p191 + p205 + p210 + p232 + p254 + p285 + p350 + p362 + p364 + p66 + p421 + p443 + p444 + p460 + p475 + p484 + p53 + p95 + p97))))))
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: ((p376 <= 1) OR (p5 + p101 + p102 + p146 + p148 + p191 + p205 + p210 + p232 + p254 + p285 + p350 + p362 + p364 + p66 + p421 + p443 + p444 + p460 + p475 + p484 + p53 + p95 + p97 + 1 <= p8 + p138 + p160 + p170 + p184 + p185 + p209 + p241 + p292 + p299 + p312 + p343 + p348 + p358 + p367 + p375 + p391 + p396 + p442 + p462 + p463 + p472 + p500 + p15 + p20 + p80 + p87 + p89))
lola: processed formula length: 373
lola: 18 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: ((2 <= p376) AND (p8 + p138 + p160 + p170 + p184 + p185 + p209 + p241 + p292 + p299 + p312 + p343 + p348 + p358 + p367 + p375 + p391 + p396 + p442 + p462 + p463 + p472 + p500 + p15 + p20 + p80 + p87 + p89 <= p5 + p101 + p102 + p146 + p148 + p191 + p205 + p210 + p232 + p254 + p285 + p350 + p362 + p364 + p66 + p421 + p443 + p444 + p460 + p475 + p484 + p53 + p95 + p97))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation 0: solution produced
lola: 75414 markings, 135139 edges, 15083 markings/sec, 0 secs || sara is running 0 secs
lola: 159259 markings, 292876 edges, 16769 markings/sec, 5 secs || sara is running 5 secs
lola: 242032 markings, 454117 edges, 16555 markings/sec, 10 secs || sara is running 10 secs
lola: 322981 markings, 622919 edges, 16190 markings/sec, 15 secs || sara is running 15 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EXEG
lola: The predicate does not eventually occur from all successors.
lola: 327059 markings, 637021 edges
lola: ========================================
lola: subprocess 2 will run for 272 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F ((p342 + 1 <= p105))) OR (E (X (((1 <= p143) OR (p365 <= p325)))) AND (1 <= p81)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 272 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= p81)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p81)
lola: processed formula length: 10
lola: 15 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 299 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((p342 + 1 <= p105)))
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 ((p342 + 1 <= p105)))
lola: processed formula length: 26
lola: 16 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: (p342 + 1 <= p105)
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
lola: The predicate is reachable.
lola: 287 markings, 286 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 3 will run for 299 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p231 <= 0) AND (A (X ((p90 <= p410))) AND (A (G ((p349 <= p493))) OR (E (G ((p419 <= p49))) AND A (G ((p148 <= p80)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 299 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p148 <= p80)))
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 ((p148 <= p80)))
lola: processed formula length: 21
lola: 17 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: (p80 + 1 <= p148)
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-3-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-3-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 4834 markings, 6650 edges
lola: ========================================
lola: subprocess 4 will run for 333 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p231 <= 0)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p231 <= 0)
lola: processed formula length: 11
lola: 15 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 5 will run for 374 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p349 <= p493)))
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 ((p349 <= p493)))
lola: processed formula length: 22
lola: 17 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: (p493 + 1 <= p349)
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: 120 markings, 119 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 4 will run for 333 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (((2 <= p50) OR (p230 <= p279))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G (((2 <= p50) OR (p230 <= p279))))
lola: processed formula length: 39
lola: 16 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 / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving 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:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p50 <= 1) AND (p279 + 1 <= p230))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 28 markings, 27 edges
lola: ========================================
lola: subprocess 5 will run for 374 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (E (G (((p242 <= p164) AND (p47 <= p136))))))
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: ((p242 <= p164) AND (p47 <= p136))
lola: processed formula length: 34
lola: 18 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: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 0
lola: state equation task get result unparse finished++ id 1
lola: formula 0: ((p164 + 1 <= p242) OR (p136 + 1 <= p47))
lola: state equation task get result unparse finished id 0
lola: formula 1: ((p242 <= p164) AND (p47 <= p136))
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: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EFEG
lola: The predicate is possibly preserved from a reachable marking.
lola: 28 markings, 27 edges
lola: ========================================
lola: subprocess 6 will run for 428 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((p316 + 1 <= p469) AND (p170 + 1 <= p228) AND ((p102 + 1 <= p137) OR (p252 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((p469 <= p316) OR (p228 <= p170) OR ((p137 <= p102) AND (1 <= p252)))
lola: processed formula length: 72
lola: 18 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 / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving 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: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: ((p316 + 1 <= p469) AND (p170 + 1 <= p228) AND ((p102 + 1 <= p137) OR (p252 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 28 markings, 27 edges
lola: ========================================
lola: subprocess 7 will run for 499 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (E (G ((p160 <= p273)))))
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((p160 <= p273)))
lola: processed formula length: 22
lola: 17 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: 367 markings, 367 edges
lola: ========================================
lola: subprocess 8 will run for 599 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F (((p467 + 1 <= p20) AND (p307 <= 2)))) OR (p214 <= p427))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 599 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p214 <= p427)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p214 <= p427)
lola: processed formula length: 14
lola: 15 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 9 will run for 749 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((p467 + 1 <= p20) AND (p307 <= 2))))
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 (((p467 + 1 <= p20) AND (p307 <= 2))))
lola: processed formula length: 43
lola: 16 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: ((p467 + 1 <= p20) AND (p307 <= 2))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 309 markings, 424 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 9 will run for 749 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p365 <= p165 + p249 + p315 + p381 + p493 + p32 + p96) OR A (((p318 + p384 + p481 + p52 <= p4 + p141 + p144 + p151 + p173 + p204 + p245 + p247 + p260 + p289 + p300 + p305 + p311 + p332 + p341 + p369 + p370 + p440 + p486 + p489 + p34 + p45 + p73 + p86) U (p178 + p246 + p494 + p83 + 1 <= p142 + p280 + p326 + p397))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 749 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p365 <= p165 + p249 + p315 + p381 + p493 + p32 + p96)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p365 <= p165 + p249 + p315 + p381 + p493 + p32 + p96)
lola: processed formula length: 54
lola: 15 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 10 will run for 999 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((p318 + p384 + p481 + p52 <= p4 + p141 + p144 + p151 + p173 + p204 + p245 + p247 + p260 + p289 + p300 + p305 + p311 + p332 + p341 + p369 + p370 + p440 + p486 + p489 + p34 + p45 + p73 + p86) U (p178 + p246 + p494 + p83 + 1 <= p142 + p280 + p326 + p397)))
lola: ========================================
lola: SUBTASK
lola: checking universal until
lola: rewrite Frontend/Parser/formula_rewrite.k:577
lola: rewrite Frontend/Parser/formula_rewrite.k:735
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (((p318 + p384 + p481 + p52 <= p4 + p141 + p144 + p151 + p173 + p204 + p245 + p247 + p260 + p289 + p300 + p305 + p311 + p332 + p341 + p369 + p370 + p440 + p486 + p489 + p34 + p45 + p73 + p86) U (p178 + p246 + p494 + p83 + 1 <= p142 + p280 + p326 + p397)))
lola: processed formula length: 257
lola: 20 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 /ER)
lola: state space: using reachability graph (ER version) (--search=depth)
lola: state space: using ltl preserving 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: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: (p318 + p384 + p481 + p52 <= p4 + p141 + p144 + p151 + p173 + p204 + p245 + p247 + p260 + p289 + p300 + p305 + p311 + p332 + p341 + p369 + p370 + p440 + p486 + p489 + p34 + p45 + p73 + p86)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: 1
lola: SUBRESULT
lola: result: no
lola: produced by: state space /ER
lola: Predicate Phi does not hild until Predicate Psi on all paths.
lola: 16 markings, 15 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 10 will run for 999 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (A (G ((p240 <= p372)))))
lola: ========================================
lola: SUBTASK
lola: checking eventual invariance
lola: rewrite Frontend/Parser/formula_rewrite.k:594
lola: rewrite Frontend/Parser/formula_rewrite.k:629
lola: rewrite Frontend/Parser/formula_rewrite.k:758
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (p372 + 1 <= p240)
lola: processed formula length: 18
lola: 19 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 /EGEF)
lola: state space: using reachability graph (EGEF version) (--search=depth)
lola: state space: using ctl preserving stubborn set method (--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:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p240 <= p372)
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:787
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: (p372 + 1 <= p240)
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: calling and running sara
sara: try reading problem file 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-1.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EGEF
lola: The predicate is not eventually invariant.
lola: 25391 markings, 75153 edges
lola: ========================================
lola: subprocess 11 will run for 1498 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p7 + p104 + p152 + p199 + 1 <= p117 + p306 + p356 + p415) OR (1 <= p8 + p138 + p160 + p170 + p184 + p185 + p209 + p241 + p292 + p299 + p312 + p343 + p348 + p358 + p367 + p375 + p391 + p396 + p442 + p462 + p463 + p472 + p500 + p15 + p20 + p80 + p87 + p89)) OR A (((p182 + p224 + p263 + p303 + 1 <= p115 + p118 + p121 + p126 + p168 + p169 + p202 + p211 + p217 + p251 + p273 + p283 + p295 + p330 + p... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 1498 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p7 + p104 + p152 + p199 + 1 <= p117 + p306 + p356 + p415) OR (1 <= p8 + p138 + p160 + p170 + p184 + p185 + p209 + p241 + p292 + p299 + p312 + p343 + p348 + p358 + p367 + p375 + p391 + p396 + p442 + p462 + p463 + p472 + p500 + p15 + p20 + p80 + p87 + p89))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p7 + p104 + p152 + p199 + 1 <= p117 + p306 + p356 + p415) OR (1 <= p8 + p138 + p160 + p170 + p184 + p185 + p209 + p241 + p292 + p299 + p312 + p343 + p348 + p358 + p367 + p375 + p391 + p396 + p442 + p462 + p463 + p472 + p500 + p15 + p20 + p80 + p87 + p89))
lola: processed formula length: 258
lola: 15 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 12 will run for 2997 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((p182 + p224 + p263 + p303 + 1 <= p115 + p118 + p121 + p126 + p168 + p169 + p202 + p211 + p217 + p251 + p273 + p283 + p295 + p330 + p336 + p345 + p403 + p63 + p59 + p432 + p58 + p467 + p468 + p496 + p497 + p24 + p27 + p37) R (p188 + p200 + p262 + p68 <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking universal release
lola: rewrite Frontend/Parser/formula_rewrite.k:619
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:693
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: A (((p182 + p224 + p263 + p303 + 1 <= p115 + p118 + p121 + p126 + p168 + p169 + p202 + p211 + p217 + p251 + p273 + p283 + p295 + p330 + p336 + p345 + p403 + p63 + p59 + p432 + p58 + p467 + p468 + p496 + p497 + p24 + p27 + p37) R (p188 + p200 + p262 + p68 <= 2)))
lola: processed formula length: 262
lola: 20 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: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (3 <= p188 + p200 + p262 + p68)
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 /EU
lola: Predicate Phi releases Predicate Psi on all paths.
lola: 246 markings, 503 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 12 will run for 2997 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G ((p207 + p250 + p408 + p416 <= p175 + p177 + p237 + p363 + p478 + p38))) OR (A (F ((p372 <= p111 + p325 + p439 + p29))) AND (((p318 + p384 + p481 + p52 <= p31) AND ((2 <= p176) OR (p198 + p313 + p410 + p479 <= p175 + p177 + p237 + p363 + p478 + p38))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 2997 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p318 + p384 + p481 + p52 <= p31) AND ((2 <= p176) OR (p198 + p313 + p410 + p479 <= p175 + p177 + p237 + p363 + p478 + p38))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((p318 + p384 + p481 + p52 <= p31) AND ((2 <= p176) OR (p198 + p313 + p410 + p479 <= p175 + p177 + p237 + p363 + p478 + p38))))
lola: processed formula length: 129
lola: 15 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 3 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: Child process aborted or communication problem between parent and child process
lola: subprocess 14 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p207 + p250 + p408 + p416 <= p175 + p177 + p237 + p363 + p478 + p38)))
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 ((p207 + p250 + p408 + p416 <= p175 + p177 + p237 + p363 + p478 + p38)))
lola: processed formula length: 77
lola: 17 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: (p175 + p177 + p237 + p363 + p478 + p38 + 1 <= p207 + p250 + p408 + p416)
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: 24 markings, 37 edges
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A ((E (X ((p142 + p280 + p326 + p397 <= p207 + p250 + p408 + p416))) U ((p219 + 1 <= p109 + p145 + p161 + p171 + p179 + p197 + p258 + p266 + p267 + p323 + p334 + p346 + p361 + p395 + p407 + p62 + p434 + p436 + p446 + p474 + p50 + p35 + p69 + p93) AND (p111 + p325 + p439 + p29 + 1 <= p165 + p249 + p315 + p381 + p493 + p32 + p96))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: processed formula: A(EX((p142 + p280 + p326 + p397 <= p207 + p250 + p408 + p416)) U ((p219 + 1 <= p109 + p145 + p161 + p171 + p179 + p197 + p258 + p266 + p267 + p323 + p334 + p346 + p361 + p395 + p407 + p62 + p434 + p436 + p446 + p474 + p50 + p35 + p69 + p93) AND (p111 + p325 + p439 + p29 + 1 <= p165 + p249 + p315 + p381 + p493 + p32 + p96)))
lola: processed formula length: 325
lola: 17 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: place or transition ordering is non-deterministic

lola: 390726 markings, 1245851 edges, 78145 markings/sec, 0 secs
lola: 765624 markings, 2493016 edges, 74980 markings/sec, 5 secs
lola: 1170191 markings, 3791969 edges, 80913 markings/sec, 10 secs
lola: 1561080 markings, 5093294 edges, 78178 markings/sec, 15 secs
lola: 1953764 markings, 6410796 edges, 78537 markings/sec, 20 secs
lola: 2337088 markings, 7713389 edges, 76665 markings/sec, 25 secs
lola: 2701527 markings, 9032645 edges, 72888 markings/sec, 30 secs
lola: 3105585 markings, 10345745 edges, 80812 markings/sec, 35 secs
lola: 3503002 markings, 11644341 edges, 79483 markings/sec, 40 secs
lola: 3898408 markings, 12929064 edges, 79081 markings/sec, 45 secs
lola: 4293134 markings, 14230915 edges, 78945 markings/sec, 50 secs
lola: 4673222 markings, 15524421 edges, 76018 markings/sec, 55 secs
lola: 5045712 markings, 16819664 edges, 74498 markings/sec, 60 secs
lola: 5415815 markings, 18116440 edges, 74021 markings/sec, 65 secs
lola: 5811609 markings, 19417708 edges, 79159 markings/sec, 70 secs
lola: 6198541 markings, 20716794 edges, 77386 markings/sec, 75 secs
lola: 6587075 markings, 22005412 edges, 77707 markings/sec, 80 secs
lola: 6973290 markings, 23281075 edges, 77243 markings/sec, 85 secs
lola: 7336210 markings, 24581083 edges, 72584 markings/sec, 90 secs
lola: 7714461 markings, 25871613 edges, 75650 markings/sec, 95 secs
lola: 8103968 markings, 27162393 edges, 77901 markings/sec, 100 secs
lola: 8490777 markings, 28462299 edges, 77362 markings/sec, 105 secs
lola: 8863191 markings, 29757671 edges, 74483 markings/sec, 110 secs
lola: 9222317 markings, 31053638 edges, 71825 markings/sec, 115 secs
lola: 9605977 markings, 32338171 edges, 76732 markings/sec, 120 secs
lola: 9980629 markings, 33597182 edges, 74930 markings/sec, 125 secs
lola: 10318701 markings, 34730971 edges, 67614 markings/sec, 130 secs
lola: 10669912 markings, 36003574 edges, 70242 markings/sec, 135 secs
lola: 11059883 markings, 37280682 edges, 77994 markings/sec, 140 secs
lola: 11437356 markings, 38530560 edges, 75495 markings/sec, 145 secs
lola: 11811749 markings, 39774510 edges, 74879 markings/sec, 150 secs
lola: 12178352 markings, 41024237 edges, 73321 markings/sec, 155 secs
lola: 12554902 markings, 42297498 edges, 75310 markings/sec, 160 secs
lola: 12898850 markings, 43541011 edges, 68790 markings/sec, 165 secs
lola: 13272338 markings, 44793194 edges, 74698 markings/sec, 170 secs
lola: 13644206 markings, 46046515 edges, 74374 markings/sec, 175 secs
lola: 14019076 markings, 47329983 edges, 74974 markings/sec, 180 secs
lola: 14372189 markings, 48612795 edges, 70623 markings/sec, 185 secs
lola: 14739663 markings, 49920701 edges, 73495 markings/sec, 190 secs
lola: 15105127 markings, 51209905 edges, 73093 markings/sec, 195 secs
lola: 15442551 markings, 52407924 edges, 67485 markings/sec, 200 secs
lola: 15800375 markings, 53693419 edges, 71565 markings/sec, 205 secs
lola: 16154983 markings, 54980749 edges, 70922 markings/sec, 210 secs
lola: 16519078 markings, 56230769 edges, 72819 markings/sec, 215 secs
lola: 16856683 markings, 57514535 edges, 67521 markings/sec, 220 secs
lola: 17199011 markings, 58787244 edges, 68466 markings/sec, 225 secs
lola: 17554357 markings, 60044562 edges, 71069 markings/sec, 230 secs
lola: 17882582 markings, 61247415 edges, 65645 markings/sec, 235 secs
lola: 18218994 markings, 62545104 edges, 67282 markings/sec, 240 secs
lola: 18547865 markings, 63827241 edges, 65774 markings/sec, 245 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 18772007 markings, 64755847 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (A (G ((p207 + p250 + p408 + p416 <= p175 + p177 + p237 + p363 + p478 + p38))) OR (A (F ((p372 <= p111 + p325 + p439 + p29))) AND (((p318 + p384 + p481 + p52 <= p31) AND ((2 <= p176) OR (p198 + p313 + p410 + p479 <= p175 + p177 + p237 + p363 + p478 + p38))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: (((p318 + p384 + p481 + p52 <= p31) AND ((2 <= p176) OR (p198 + p313 + p410 + p479 <= p175 + p177 + p237 + p363 + p478 + p38))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((p318 + p384 + p481 + p52 <= p31) AND ((2 <= p176) OR (p198 + p313 + p410 + p479 <= p175 + p177 + p237 + p363 + p478 + p38))))
lola: processed formula length: 129
lola: 15 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 3 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: ========================================
lola: ...considering subproblem: A (F ((p372 <= p111 + p325 + p439 + p29)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (p111 + p325 + p439 + p29 + 1 <= p372)
lola: processed formula length: 38
lola: 18 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 / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving 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: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: (p372 <= p111 + p325 + p439 + 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 / EG
lola: The predicate does not eventually occur.
lola: 16 markings, 19 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (G ((p207 + p250 + p408 + p416 <= p175 + p177 + p237 + p363 + p478 + p38)))
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 ((p207 + p250 + p408 + p416 <= p175 + p177 + p237 + p363 + p478 + p38)))
lola: processed formula length: 77
lola: 17 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: (p175 + p177 + p237 + p363 + p478 + p38 + 1 <= p207 + p250 + p408 + p416)
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: 24 markings, 37 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no yes no no no yes yes no yes yes yes no
lola:
preliminary result: no no yes no no no yes yes no yes yes yes no
lola: memory consumption: 81720 KB
lola: time consumption: 827 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="PolyORBLF-PT-S06J06T04"
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 PolyORBLF-PT-S06J06T04, 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-158987872000531"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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