fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r170-smll-158987815900435
Last Updated
Jun 28, 2020

About the Execution of ITS-LoLa for GPPP-PT-C0001N0000000100

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15794.930 3600000.00 1365628.00 24925.80 TTTTFFTFTTFTFTFT normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2020-input.r170-smll-158987815900435.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/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 GPPP-PT-C0001N0000000100, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r170-smll-158987815900435
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 208K
-rw-r--r-- 1 mcc users 3.4K Apr 4 20:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Apr 4 20:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Apr 4 09:10 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 4 09:10 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.7K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 8 14:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 8 14:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Apr 3 21:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K Apr 3 21:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.7K Apr 3 13:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 3 13:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 4 01:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 4 01:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 17 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 1 Mar 24 05:37 large_marking
-rw-r--r-- 1 mcc users 21K 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 GPPP-PT-C0001N0000000100-CTLCardinality-00
FORMULA_NAME GPPP-PT-C0001N0000000100-CTLCardinality-01
FORMULA_NAME GPPP-PT-C0001N0000000100-CTLCardinality-02
FORMULA_NAME GPPP-PT-C0001N0000000100-CTLCardinality-03
FORMULA_NAME GPPP-PT-C0001N0000000100-CTLCardinality-04
FORMULA_NAME GPPP-PT-C0001N0000000100-CTLCardinality-05
FORMULA_NAME GPPP-PT-C0001N0000000100-CTLCardinality-06
FORMULA_NAME GPPP-PT-C0001N0000000100-CTLCardinality-07
FORMULA_NAME GPPP-PT-C0001N0000000100-CTLCardinality-08
FORMULA_NAME GPPP-PT-C0001N0000000100-CTLCardinality-09
FORMULA_NAME GPPP-PT-C0001N0000000100-CTLCardinality-10
FORMULA_NAME GPPP-PT-C0001N0000000100-CTLCardinality-11
FORMULA_NAME GPPP-PT-C0001N0000000100-CTLCardinality-12
FORMULA_NAME GPPP-PT-C0001N0000000100-CTLCardinality-13
FORMULA_NAME GPPP-PT-C0001N0000000100-CTLCardinality-14
FORMULA_NAME GPPP-PT-C0001N0000000100-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1591430112983

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-06 07:55:16] [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-06 07:55:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-06 07:55:16] [INFO ] Load time of PNML (sax parser for PT used): 52 ms
[2020-06-06 07:55:16] [INFO ] Transformed 33 places.
[2020-06-06 07:55:16] [INFO ] Transformed 22 transitions.
[2020-06-06 07:55:16] [INFO ] Parsed PT model containing 33 places and 22 transitions in 119 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 27 ms.
Incomplete random walk after 100003 steps, including 0 resets, run finished after 394 ms. (steps per millisecond=253 ) properties seen :[0, 1, 0, 0, 0, 1, 0, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 0, 1, 0, 1, 0, 1, 1, 0, 0, 0, 1]
// Phase 1: matrix 22 rows 33 cols
[2020-06-06 07:55:16] [INFO ] Computed 13 place invariants in 8 ms
[2020-06-06 07:55:16] [INFO ] [Real]Absence check using 6 positive place invariants in 25 ms returned sat
[2020-06-06 07:55:16] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 17 ms returned sat
[2020-06-06 07:55:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-06 07:55:17] [INFO ] [Real]Absence check using state equation in 58 ms returned sat
[2020-06-06 07:55:17] [INFO ] Solution in real domain found non-integer solution.
[2020-06-06 07:55:17] [INFO ] [Nat]Absence check using 6 positive place invariants in 13 ms returned sat
[2020-06-06 07:55:17] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 6 ms returned sat
[2020-06-06 07:55:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-06 07:55:17] [INFO ] [Nat]Absence check using state equation in 62 ms returned sat
[2020-06-06 07:55:17] [INFO ] Computed and/alt/rep : 21/47/21 causal constraints in 9 ms.
[2020-06-06 07:55:17] [INFO ] Added : 19 causal constraints over 4 iterations in 64 ms. Result :sat
[2020-06-06 07:55:17] [INFO ] [Real]Absence check using 6 positive place invariants in 6 ms returned sat
[2020-06-06 07:55:17] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 6 ms returned unsat
[2020-06-06 07:55:17] [INFO ] [Real]Absence check using 6 positive place invariants in 7 ms returned sat
[2020-06-06 07:55:17] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 4 ms returned unsat
[2020-06-06 07:55:17] [INFO ] [Real]Absence check using 6 positive place invariants in 6 ms returned sat
[2020-06-06 07:55:17] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 4 ms returned unsat
[2020-06-06 07:55:17] [INFO ] [Real]Absence check using 6 positive place invariants in 9 ms returned sat
[2020-06-06 07:55:17] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 5 ms returned sat
[2020-06-06 07:55:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-06 07:55:17] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2020-06-06 07:55:17] [INFO ] Solution in real domain found non-integer solution.
[2020-06-06 07:55:17] [INFO ] [Nat]Absence check using 6 positive place invariants in 8 ms returned sat
[2020-06-06 07:55:17] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 5 ms returned sat
[2020-06-06 07:55:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-06 07:55:17] [INFO ] [Nat]Absence check using state equation in 69 ms returned sat
[2020-06-06 07:55:17] [INFO ] Computed and/alt/rep : 21/47/21 causal constraints in 7 ms.
[2020-06-06 07:55:17] [INFO ] Added : 21 causal constraints over 5 iterations in 67 ms. Result :sat
[2020-06-06 07:55:17] [INFO ] [Real]Absence check using 6 positive place invariants in 10 ms returned sat
[2020-06-06 07:55:17] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned unsat
[2020-06-06 07:55:17] [INFO ] [Real]Absence check using 6 positive place invariants in 7 ms returned sat
[2020-06-06 07:55:17] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 7 ms returned sat
[2020-06-06 07:55:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-06 07:55:17] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2020-06-06 07:55:17] [INFO ] Solution in real domain found non-integer solution.
[2020-06-06 07:55:17] [INFO ] [Nat]Absence check using 6 positive place invariants in 10 ms returned sat
[2020-06-06 07:55:17] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 15 ms returned sat
[2020-06-06 07:55:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-06 07:55:17] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2020-06-06 07:55:17] [INFO ] Computed and/alt/rep : 21/47/21 causal constraints in 9 ms.
[2020-06-06 07:55:17] [INFO ] Added : 19 causal constraints over 4 iterations in 51 ms. Result :sat
[2020-06-06 07:55:17] [INFO ] [Real]Absence check using 6 positive place invariants in 6 ms returned sat
[2020-06-06 07:55:17] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 4 ms returned unsat
[2020-06-06 07:55:17] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2020-06-06 07:55:17] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 7 ms returned sat
[2020-06-06 07:55:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-06 07:55:17] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2020-06-06 07:55:18] [INFO ] Solution in real domain found non-integer solution.
[2020-06-06 07:55:18] [INFO ] [Nat]Absence check using 6 positive place invariants in 8 ms returned sat
[2020-06-06 07:55:18] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 9 ms returned sat
[2020-06-06 07:55:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-06 07:55:18] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2020-06-06 07:55:18] [INFO ] Computed and/alt/rep : 21/47/21 causal constraints in 7 ms.
[2020-06-06 07:55:18] [INFO ] Added : 20 causal constraints over 4 iterations in 50 ms. Result :sat
[2020-06-06 07:55:18] [INFO ] [Real]Absence check using 6 positive place invariants in 11 ms returned sat
[2020-06-06 07:55:18] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 5 ms returned sat
[2020-06-06 07:55:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-06 07:55:18] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2020-06-06 07:55:18] [INFO ] Solution in real domain found non-integer solution.
[2020-06-06 07:55:18] [INFO ] [Nat]Absence check using 6 positive place invariants in 8 ms returned sat
[2020-06-06 07:55:18] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 6 ms returned sat
[2020-06-06 07:55:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-06 07:55:18] [INFO ] [Nat]Absence check using state equation in 266 ms returned sat
[2020-06-06 07:55:18] [INFO ] Computed and/alt/rep : 21/47/21 causal constraints in 18 ms.
[2020-06-06 07:55:18] [INFO ] Added : 21 causal constraints over 5 iterations in 113 ms. Result :sat
[2020-06-06 07:55:18] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned unsat
[2020-06-06 07:55:18] [INFO ] [Real]Absence check using 6 positive place invariants in 7 ms returned sat
[2020-06-06 07:55:18] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned unsat
[2020-06-06 07:55:18] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2020-06-06 07:55:18] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 8 ms returned unsat
[2020-06-06 07:55:18] [INFO ] [Real]Absence check using 6 positive place invariants in 6 ms returned sat
[2020-06-06 07:55:18] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned unsat
Successfully simplified 9 atomic propositions for a total of 10 simplifications.
[2020-06-06 07:55:19] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2020-06-06 07:55:19] [INFO ] Flatten gal took : 55 ms
[2020-06-06 07:55:19] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2020-06-06 07:55:19] [INFO ] Flatten gal took : 15 ms
FORMULA GPPP-PT-C0001N0000000100-CTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0001N0000000100-CTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0001N0000000100-CTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0001N0000000100-CTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-06 07:55:19] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLCardinality.sr.xml took 4 ms.
[2020-06-06 07:55:19] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 2 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLCardinality @ GPPP-PT-C0001N0000000100 @ 3570 seconds

FORMULA GPPP-PT-C0001N0000000100-CTLCardinality-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA GPPP-PT-C0001N0000000100-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

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

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

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

FORMULA GPPP-PT-C0001N0000000100-CTLCardinality-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA GPPP-PT-C0001N0000000100-CTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA GPPP-PT-C0001N0000000100-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA GPPP-PT-C0001N0000000100-CTLCardinality-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA GPPP-PT-C0001N0000000100-CTLCardinality-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA GPPP-PT-C0001N0000000100-CTLCardinality-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2175
rslt: Output for CTLCardinality @ GPPP-PT-C0001N0000000100

{
"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": "Sat Jun 6 07:55:20 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 0
},
"processed": "NOT DEADLOCK",
"processed_size": 12,
"rewrites": 21
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 0,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"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": "(3 <= p31)",
"processed_size": 10,
"rewrites": 23
},
"result":
{
"edges": 29,
"markings": 29,
"produced_by": "state space /EXEG",
"value": true
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "invisibility based",
"visible": 1
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability_from_a_successor",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"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": "((p32 + 1 <= p23))",
"processed_size": 18,
"rewrites": 24
},
"result":
{
"edges": 36,
"markings": 37,
"produced_by": "state space /EXEF",
"value": false
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "invariance_from_all_successors",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"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": "A (G ((p22 <= 1)))",
"processed_size": 18,
"rewrites": 23
},
"result":
{
"edges": 22,
"markings": 23,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 520
},
"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 ((p23 <= p20)))",
"processed_size": 20,
"rewrites": 23
},
"result":
{
"edges": 18,
"markings": 19,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 624
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"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": "A (G (((3 <= p27) OR (p25 <= p0))))",
"processed_size": 36,
"rewrites": 23
},
"result":
{
"edges": 3500,
"markings": 3501,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 780
},
"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": 3,
"visible_transitions": 0
},
"processed": "((p9 <= p4) AND (p5 <= p9))",
"processed_size": 27,
"rewrites": 24
},
"result":
{
"edges": 78825166,
"markings": 30273902,
"produced_by": "tscc_search",
"value": true
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "tscc preserving/always up"
}
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"store":
{
"type": "dfs/tscc"
},
"type": "liveness",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1011
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 2,
"F": 2,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "EG((AF((p5 <= p28)) AND EF((2 <= p22))))",
"processed_size": 40,
"rewrites": 24
},
"net":
{
"conflict_clusters": 14,
"singleton_clusters": 0
},
"result":
{
"edges": 396,
"markings": 217,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1516
},
"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": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "E (F ((p4 <= 0)))",
"processed_size": 17,
"rewrites": 22
},
"result":
{
"edges": 2216,
"markings": 2217,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 10,
"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": 3033
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"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": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "E (((p6 <= 1) R (p8 <= 2)))",
"processed_size": 27,
"rewrites": 24
},
"result":
{
"edges": 20,
"markings": 20,
"produced_by": "state space /ER",
"value": true
},
"task":
{
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl",
"visible": 2
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "existential_release",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 10,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3033
},
"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": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "((p12 + 1 <= p11) AND (3 <= p0))",
"processed_size": 32,
"rewrites": 21
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 11,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1
},
"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": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "E (F ((p28 + 1 <= p25)))",
"processed_size": 24,
"rewrites": 22
},
"result":
{
"edges": 21,
"markings": 22,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 13,
"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": 1
},
"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 ((p0 + 1 <= p5)))",
"processed_size": 22,
"rewrites": 22
},
"result":
{
"edges": 18,
"markings": 19,
"produced_by": "state space",
"value": true
},
"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": "reachability",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 11,
"type": "boolean"
}
},

{
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 1,
"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": "AG(EX(((p9 <= p32) OR (p16 <= p22))))",
"processed_size": 38,
"rewrites": 23
},
"net":
{
"conflict_clusters": 14,
"singleton_clusters": 0
},
"result":
{
"edges": 869739366,
"markings": 145476966,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
}
],
"exit":
{
"error": null,
"memory": 3372,
"runtime": 1395.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "NODEADLOCK : ((** OR E(F(**))) AND (E(F(*)) OR **)) : A(G(E(X(**)))) : A(G(**)) : A(G(**)) : E(X(E(G(**)))) : A(X(A(G(**)))) : (E((* R *)) AND E(F(*))) : E(G((A(F(**)) AND E(F(**))))) : A(G(*)) : NODEADLOCK : A(G(E(F(**))))"
},
"net":
{
"arcs": 83,
"conflict_clusters": 14,
"places": 33,
"places_significant": 20,
"singleton_clusters": 0,
"transitions": 22
},
"result":
{
"preliminary_value": "yes yes yes no no yes no yes yes no yes yes ",
"value": "yes yes yes no no yes no yes yes no yes yes "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 55/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 1056
lola: finding significant places
lola: 33 places, 22 transitions, 20 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from CTLCardinality.xml
lola: LP says that atomic proposition is always true: (p8 <= p27)
lola: LP says that atomic proposition is always true: (1 <= p1)
lola: E (X ((0 <= 0))) : ((((1 <= p20) OR (p4 <= p0)) OR E (F ((p0 + 1 <= p5)))) AND (NOT(A (G ((p25 <= p28)))) OR ((p12 + 1 <= p11) AND (3 <= p0)))) : A (G (E (X (((p9 <= p32) OR (p16 <= p22)))))) : A (G ((p23 <= p20))) : E (G (A (G (((3 <= p27) OR (p25 <= p0)))))) : E (X (E (G ((3 <= p31))))) : A (G (A (X (((p23 <= p32)))))) : (NOT(A (((2 <= p6) U (3 <= p8)))) AND NOT(A (G ((1 <= p4))))) : E (G ((A (F ((p5 <= p28))) AND E (F ((2 <= p22)))))) : NOT(E (((0 <= 0) U (2 <= p22)))) : E (X ((0 <= 0))) : A (G (E (F (((p9 <= p4) AND (p5 <= p9))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:130
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:476
lola: rewrite Frontend/Parser/formula_rewrite.k:398
lola: rewrite Frontend/Parser/formula_rewrite.k:323
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:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:130
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: NOT DEADLOCK
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: NOT DEADLOCK
lola: processed formula length: 12
lola: 21 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 0 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 1 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: NOT DEADLOCK
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: NOT DEADLOCK
lola: processed formula length: 12
lola: 21 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 0 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 2 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (E (G ((3 <= p31)))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation from a successor
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: rewrite Frontend/Parser/formula_rewrite.k:715
lola: processed formula: (3 <= p31)
lola: processed formula length: 10
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 /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: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (3 <= p31)
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 /EXEG
lola: The predicate is possibly preserved from some successor.
lola: 29 markings, 29 edges
lola: ========================================
lola: subprocess 3 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (A (G (((p23 <= p32))))))
lola: ========================================
lola: SUBTASK
lola: checking invariance from all successors
lola: rewrite Frontend/Parser/formula_rewrite.k:624
lola: rewrite Frontend/Parser/formula_rewrite.k:753
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((p32 + 1 <= p23))
lola: processed formula length: 18
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: 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: ((p32 + 1 <= p23))
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 /EXEF
lola: The predicate is not invariant from successors.
lola: 37 markings, 36 edges
lola: ========================================
lola: subprocess 4 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (X (((p9 <= p32) OR (p16 <= p22))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: processed formula: AG(EX(((p9 <= p32) OR (p16 <= p22))))
lola: processed formula length: 38
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 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 1730397 markings, 5772807 edges, 346079 markings/sec, 0 secs
lola: 2830855 markings, 12317621 edges, 220092 markings/sec, 5 secs
lola: 3895327 markings, 18680180 edges, 212894 markings/sec, 10 secs
lola: 4949095 markings, 24986694 edges, 210754 markings/sec, 15 secs
lola: 5999781 markings, 31276606 edges, 210137 markings/sec, 20 secs
lola: 7041619 markings, 37527238 edges, 208368 markings/sec, 25 secs
lola: 8075277 markings, 43726853 edges, 206732 markings/sec, 30 secs
lola: 9037224 markings, 49501579 edges, 192389 markings/sec, 35 secs
lola: 10078264 markings, 55745199 edges, 208208 markings/sec, 40 secs
lola: 11108603 markings, 61931956 edges, 206068 markings/sec, 45 secs
lola: 12118765 markings, 67995314 edges, 202032 markings/sec, 50 secs
lola: 13056756 markings, 73629190 edges, 187598 markings/sec, 55 secs
lola: 14033254 markings, 79495143 edges, 195300 markings/sec, 60 secs
lola: 15055146 markings, 85627714 edges, 204378 markings/sec, 65 secs
lola: 16082073 markings, 91799874 edges, 205385 markings/sec, 70 secs
lola: 17106422 markings, 97957217 edges, 204870 markings/sec, 75 secs
lola: 18134639 markings, 104139194 edges, 205643 markings/sec, 80 secs
lola: 19161496 markings, 110311951 edges, 205371 markings/sec, 85 secs
lola: 20186422 markings, 116473034 edges, 204985 markings/sec, 90 secs
lola: 21207805 markings, 122612267 edges, 204277 markings/sec, 95 secs
lola: 22228893 markings, 128749537 edges, 204218 markings/sec, 100 secs
lola: 23248432 markings, 134877289 edges, 203908 markings/sec, 105 secs
lola: 24261794 markings, 140967750 edges, 202672 markings/sec, 110 secs
lola: 25276748 markings, 147068023 edges, 202991 markings/sec, 115 secs
lola: 26296008 markings, 153193005 edges, 203852 markings/sec, 120 secs
lola: 27317183 markings, 159328782 edges, 204235 markings/sec, 125 secs
lola: 28337517 markings, 165459588 edges, 204067 markings/sec, 130 secs
lola: 29350324 markings, 171543748 edges, 202561 markings/sec, 135 secs
lola: 30369786 markings, 177668906 edges, 203892 markings/sec, 140 secs
lola: 31382287 markings, 183753552 edges, 202500 markings/sec, 145 secs
lola: 32393837 markings, 189833519 edges, 202310 markings/sec, 150 secs
lola: 33407206 markings, 195926084 edges, 202674 markings/sec, 155 secs
lola: 34446932 markings, 202024996 edges, 207945 markings/sec, 160 secs
lola: 35500520 markings, 208034642 edges, 210718 markings/sec, 165 secs
lola: 36560785 markings, 214103535 edges, 212053 markings/sec, 170 secs
lola: 37625206 markings, 220185680 edges, 212884 markings/sec, 175 secs
lola: 38694661 markings, 226299339 edges, 213891 markings/sec, 180 secs
lola: 39760987 markings, 232393450 edges, 213265 markings/sec, 185 secs
lola: 40829734 markings, 238502137 edges, 213749 markings/sec, 190 secs
lola: 41907611 markings, 244653605 edges, 215575 markings/sec, 195 secs
lola: 43037044 markings, 250984773 edges, 225887 markings/sec, 200 secs
lola: 44252564 markings, 257044942 edges, 243104 markings/sec, 205 secs
lola: 45164098 markings, 262469389 edges, 182307 markings/sec, 210 secs
lola: 46051991 markings, 267776969 edges, 177579 markings/sec, 215 secs
lola: 46928089 markings, 273028641 edges, 175220 markings/sec, 220 secs
lola: 47799607 markings, 278252438 edges, 174304 markings/sec, 225 secs
lola: 48674821 markings, 283458731 edges, 175043 markings/sec, 230 secs
lola: 49543238 markings, 288669612 edges, 173683 markings/sec, 235 secs
lola: 50408354 markings, 293861203 edges, 173023 markings/sec, 240 secs
lola: 51278340 markings, 299082485 edges, 173997 markings/sec, 245 secs
lola: 52147243 markings, 304297321 edges, 173781 markings/sec, 250 secs
lola: 53007149 markings, 309466603 edges, 171981 markings/sec, 255 secs
lola: 53866500 markings, 314629758 edges, 171870 markings/sec, 260 secs
lola: 54735051 markings, 319844663 edges, 173710 markings/sec, 265 secs
lola: 55608068 markings, 325091848 edges, 174603 markings/sec, 270 secs
lola: 56480130 markings, 330341416 edges, 174412 markings/sec, 275 secs
lola: 57354353 markings, 335597055 edges, 174845 markings/sec, 280 secs
lola: 58236352 markings, 340899390 edges, 176400 markings/sec, 285 secs
lola: 59119956 markings, 346213175 edges, 176721 markings/sec, 290 secs
lola: 59994590 markings, 351476840 edges, 174927 markings/sec, 295 secs
lola: 60883533 markings, 356822167 edges, 177789 markings/sec, 300 secs
lola: 61768036 markings, 362145682 edges, 176901 markings/sec, 305 secs
lola: 62665878 markings, 367543820 edges, 179568 markings/sec, 310 secs
lola: 63553230 markings, 372877471 edges, 177470 markings/sec, 315 secs
lola: 64450395 markings, 378268604 edges, 179433 markings/sec, 320 secs
lola: 65332279 markings, 383577066 edges, 176377 markings/sec, 325 secs
lola: 66218706 markings, 388913690 edges, 177285 markings/sec, 330 secs
lola: 67111193 markings, 394280489 edges, 178497 markings/sec, 335 secs
lola: 67999478 markings, 399629959 edges, 177657 markings/sec, 340 secs
lola: 68892071 markings, 404998101 edges, 178519 markings/sec, 345 secs
lola: 69783469 markings, 410363791 edges, 178280 markings/sec, 350 secs
lola: 70682944 markings, 415773564 edges, 179895 markings/sec, 355 secs
lola: 71573988 markings, 421139345 edges, 178209 markings/sec, 360 secs
lola: 72470977 markings, 426541988 edges, 179398 markings/sec, 365 secs
lola: 73366810 markings, 431929579 edges, 179167 markings/sec, 370 secs
lola: 74261075 markings, 437315737 edges, 178853 markings/sec, 375 secs
lola: 75158660 markings, 442714671 edges, 179517 markings/sec, 380 secs
lola: 76050304 markings, 448084280 edges, 178329 markings/sec, 385 secs
lola: 76946088 markings, 453471616 edges, 179157 markings/sec, 390 secs
lola: 77837823 markings, 458842401 edges, 178347 markings/sec, 395 secs
lola: 78735879 markings, 464245805 edges, 179611 markings/sec, 400 secs
lola: 79650314 markings, 469696857 edges, 182887 markings/sec, 405 secs
lola: 80564673 markings, 475288783 edges, 182872 markings/sec, 410 secs
lola: 81487817 markings, 480921281 edges, 184629 markings/sec, 415 secs
lola: 82414342 markings, 486572237 edges, 185305 markings/sec, 420 secs
lola: 83341062 markings, 492227934 edges, 185344 markings/sec, 425 secs
lola: 84267613 markings, 497769659 edges, 185310 markings/sec, 430 secs
lola: 85196290 markings, 503433877 edges, 185735 markings/sec, 435 secs
lola: local time limit reached - aborting
lola:
preliminary result: yes unknown unknown unknown unknown yes no unknown unknown unknown yes unknown
lola: caught signal User defined signal 2 - aborting LoLA
lola:
preliminary result: yes unknown unknown unknown unknown yes no unknown unknown unknown yes unknown
lola: memory consumption: 10297160 KB
lola: time consumption: 448 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 5 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p22 <= 1)))
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:788
lola: processed formula: A (G ((p22 <= 1)))
lola: processed formula length: 18
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: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: (2 <= p22)
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: 23 markings, 22 edges
lola: state equation: write sara problem file to CTLCardinality-5-0.sara
lola: subprocess 6 will run for 520 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p23 <= p20)))
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:787lola:
lola: ========================================
processed formula: A (G ((p23 <= p20)))
lola: processed formula length: 20
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: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: (p20 + 1 <= p23)
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: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 19 markings, 18 edges
lola: ========================================
lola: subprocess 7 will run for 624 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((3 <= p27) OR (p25 <= p0))))
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 (((3 <= p27) OR (p25 <= p0))))
lola: processed formula length: 36
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: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: ((p27 <= 2) AND (p0 + 1 <= p25))
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-7-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-5-0.sara.
sara: try reading problem file CTLCardinality-7-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 3501 markings, 3500 edges
lola: ========================================
lola: subprocess 8 will run for 780 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (F (((p9 <= p4) AND (p5 <= p9))))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: rewrite Frontend/Parser/formula_rewrite.k:603
lola: rewrite Frontend/Parser/formula_rewrite.k:613
lola: rewrite Frontend/Parser/formula_rewrite.k:703
lola: processed formula: ((p9 <= p4) AND (p5 <= p9))
lola: processed formula length: 27
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
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 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 1
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: ((p4 + 1 <= p9) OR (p9 + 1 <= p5))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas

lola: formula 1: ((p9 <= p4) AND (p5 <= p9))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-8-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-8-0.sara.
lola: state equation: write sara problem file to CTLCardinality-8-1.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-8-1.sara.

lola: state equation 1: solution produced

lola: state equation 0: solution produced
lola: sara is running 0 secs || sara is running 0 secs || 1861449 markings, 6511078 edges, 372290 markings/sec, 0 secs
lola: sara is running 5 secs || sara is running 5 secs || 3873671 markings, 11633030 edges, 402444 markings/sec, 5 secs
lola: sara is running 10 secs || sara is running 10 secs || 5737659 markings, 16379000 edges, 372798 markings/sec, 10 secs
lola: sara is running 15 secs || sara is running 15 secs || 7566788 markings, 21034940 edges, 365826 markings/sec, 15 secs
lola: sara is running 20 secs || sara is running 20 secs || 9390771 markings, 25675553 edges, 364797 markings/sec, 20 secs
lola: sara is running 25 secs || sara is running 25 secs || 11192483 markings, 30259871 edges, 360342 markings/sec, 25 secs
lola: sara is running 30 secs || sara is running 30 secs || 12946174 markings, 34719882 edges, 350738 markings/sec, 30 secs
lola: sara is running 35 secs || sara is running 35 secs || 14655743 markings, 39068040 edges, 341914 markings/sec, 35 secs
lola: sara is running 40 secs || sara is running 40 secs || 16370308 markings, 43427836 edges, 342913 markings/sec, 40 secs
lola: sara is running 45 secs || sara is running 45 secs || 17934537 markings, 47404701 edges, 312846 markings/sec, 45 secs
lola: sara is running 50 secs || sara is running 50 secs || 19588407 markings, 51608495 edges, 330774 markings/sec, 50 secs
lola: sara is running 55 secs || sara is running 55 secs || 21247389 markings, 55823471 edges, 331796 markings/sec, 55 secs
lola: sara is running 60 secs || sara is running 60 secs || 22920036 markings, 60074431 edges, 334529 markings/sec, 60 secs
lola: sara is running 65 secs || sara is running 65 secs || 24490916 markings, 64065977 edges, 314176 markings/sec, 65 secs
lola: sara is running 70 secs || sara is running 70 secs || 26148370 markings, 68275585 edges, 331491 markings/sec, 70 secs
lola: sara is running 75 secs || sara is running 75 secs || 27748641 markings, 72338808 edges, 320054 markings/sec, 75 secs
lola: sara is running 80 secs || sara is running 80 secs || 29400247 markings, 76533898 edges, 330321 markings/sec, 80 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: tscc_search
lola: The predicate is live.
lola: 30273902 markings, 78825166 edges
lola: ========================================
lola: subprocess 9 will run for 1011 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((A (F ((p5 <= p28))) AND E (F ((2 <= p22))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: processed formula: EG((AF((p5 <= p28)) AND EF((2 <= p22))))
lola: processed formula length: 40
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 3 significant temporal operators and needs 13 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: 217 markings, 396 edges
lola: ========================================
lola: subprocess 10 will run for 1517 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (((p6 <= 1) R (p8 <= 2))) AND E (F ((p4 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 1516 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((p4 <= 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 ((p4 <= 0)))
lola: processed formula length: 17
lola: 22 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: (p4 <= 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-10-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 2217 markings, 2216 edges
lola: ========================================
lola: subprocess 11 will run for 3033 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (((p6 <= 1) R (p8 <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking existential release
lola: rewrite Frontend/Parser/formula_rewrite.k:576
lola: rewrite Frontend/Parser/formula_rewrite.k:736
lola: rewrite Frontend/Parser/formula_rewrite.k:696
lola: processed formula: E (((p6 <= 1) R (p8 <= 2)))
lola: processed formula length: 27
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 /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: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 <= p8)
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: yes
lola: produced by: state space /ER
lola: There is a path where Predicate Phi releases Predicate Psi.
lola: 20 markings, 20 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 11 will run for 3033 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((((1 <= p20) OR (p4 <= p0)) OR E (F ((p0 + 1 <= p5)))) AND (E (F ((p28 + 1 <= p25))) OR ((p12 + 1 <= p11) AND (3 <= p0))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 3033 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p12 + 1 <= p11) AND (3 <= p0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p12 + 1 <= p11) AND (3 <= p0))
lola: processed formula length: 32
lola: 21 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: Child process aborted or communication problem between parent and child process
lola: subprocess 13 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((p28 + 1 <= p25)))
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 ((p28 + 1 <= p25)))
lola: processed formula length: 24
lola: 22 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: (p28 + 1 <= p25)
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: 22 markings, 21 edges
lola: ========================================
lola: subprocess 14 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((p0 + 1 <= p5)))
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 ((p0 + 1 <= p5)))
lola: processed formula length: 22
lola: 22 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: (p0 + 1 <= p5)
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: 19 markings, 18 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (G (E (X (((p9 <= p32) OR (p16 <= p22))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: processed formula: AG(EX(((p9 <= p32) OR (p16 <= p22))))
lola: processed formula length: 38
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 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 1792471 markings, 6142421 edges, 358494 markings/sec, 0 secs
lola: 2873723 markings, 12576437 edges, 216250 markings/sec, 5 secs
lola: 3934791 markings, 18911292 edges, 212214 markings/sec, 10 secs
lola: 4986462 markings, 25205292 edges, 210334 markings/sec, 15 secs
lola: 6031102 markings, 31466039 edges, 208928 markings/sec, 20 secs
lola: 7066935 markings, 37679365 edges, 207167 markings/sec, 25 secs
lola: 8101804 markings, 43886759 edges, 206974 markings/sec, 30 secs
lola: 9134512 markings, 50081152 edges, 206542 markings/sec, 35 secs
lola: 10168691 markings, 56290357 edges, 206836 markings/sec, 40 secs
lola: 11202670 markings, 62499087 edges, 206796 markings/sec, 45 secs
lola: 12236256 markings, 68703709 edges, 206717 markings/sec, 50 secs
lola: 13271015 markings, 74914014 edges, 206952 markings/sec, 55 secs
lola: 14300063 markings, 81096490 edges, 205810 markings/sec, 60 secs
lola: 15335165 markings, 87309131 edges, 207020 markings/sec, 65 secs
lola: 16364305 markings, 93494783 edges, 205828 markings/sec, 70 secs
lola: 17393531 markings, 99682531 edges, 205845 markings/sec, 75 secs
lola: 18422518 markings, 105868542 edges, 205797 markings/sec, 80 secs
lola: 19449115 markings, 112040443 edges, 205319 markings/sec, 85 secs
lola: 20476063 markings, 118213028 edges, 205390 markings/sec, 90 secs
lola: 21500951 markings, 124373284 edges, 204978 markings/sec, 95 secs
lola: 22524725 markings, 130526862 edges, 204755 markings/sec, 100 secs
lola: 23549828 markings, 136688279 edges, 205021 markings/sec, 105 secs
lola: 24571844 markings, 142830980 edges, 204403 markings/sec, 110 secs
lola: 25598542 markings, 149001026 edges, 205340 markings/sec, 115 secs
lola: 26620266 markings, 155141215 edges, 204345 markings/sec, 120 secs
lola: 27653515 markings, 161349589 edges, 206650 markings/sec, 125 secs
lola: 28686477 markings, 167555745 edges, 206592 markings/sec, 130 secs
lola: 29718507 markings, 173756355 edges, 206406 markings/sec, 135 secs
lola: 30748397 markings, 179944824 edges, 205978 markings/sec, 140 secs
lola: 31777383 markings, 186129056 edges, 205797 markings/sec, 145 secs
lola: 32806812 markings, 192317942 edges, 205886 markings/sec, 150 secs
lola: 33838514 markings, 198520939 edges, 206340 markings/sec, 155 secs
lola: 34919053 markings, 204701804 edges, 216108 markings/sec, 160 secs
lola: 35990931 markings, 210838621 edges, 214376 markings/sec, 165 secs
lola: 37065768 markings, 216987027 edges, 214967 markings/sec, 170 secs
lola: 38141920 markings, 223139483 edges, 215230 markings/sec, 175 secs
lola: 39222503 markings, 229318441 edges, 216117 markings/sec, 180 secs
lola: 40305251 markings, 235503867 edges, 216550 markings/sec, 185 secs
lola: 41390364 markings, 241703545 edges, 217023 markings/sec, 190 secs
lola: 42497594 markings, 248007759 edges, 221446 markings/sec, 195 secs
lola: 43731585 markings, 254421814 edges, 246798 markings/sec, 200 secs
lola: 44772449 markings, 260131736 edges, 208173 markings/sec, 205 secs
lola: 45672790 markings, 265506773 edges, 180068 markings/sec, 210 secs
lola: 46523183 markings, 270596465 edges, 170079 markings/sec, 215 secs
lola: 47262796 markings, 275030161 edges, 147923 markings/sec, 220 secs
lola: 48123625 markings, 280194280 edges, 172166 markings/sec, 225 secs
lola: 48957547 markings, 285157580 edges, 166784 markings/sec, 230 secs
lola: 49836280 markings, 290423440 edges, 175747 markings/sec, 235 secs
lola: 50712094 markings, 295679043 edges, 175163 markings/sec, 240 secs
lola: 51585580 markings, 300928080 edges, 174697 markings/sec, 245 secs
lola: 52459986 markings, 306178402 edges, 174881 markings/sec, 250 secs
lola: 53323695 markings, 311368684 edges, 172742 markings/sec, 255 secs
lola: 54194794 markings, 316597186 edges, 174220 markings/sec, 260 secs
lola: 55072718 markings, 321874772 edges, 175585 markings/sec, 265 secs
lola: 55953014 markings, 327167038 edges, 176059 markings/sec, 270 secs
lola: 56837430 markings, 332484258 edges, 176883 markings/sec, 275 secs
lola: 57719751 markings, 337795472 edges, 176464 markings/sec, 280 secs
lola: 58608247 markings, 343137323 edges, 177699 markings/sec, 285 secs
lola: 59503976 markings, 348523363 edges, 179146 markings/sec, 290 secs
lola: 60393525 markings, 353871467 edges, 177910 markings/sec, 295 secs
lola: 61286345 markings, 359244297 edges, 178564 markings/sec, 300 secs
lola: 62187124 markings, 364660711 edges, 180156 markings/sec, 305 secs
lola: 63085163 markings, 370060427 edges, 179608 markings/sec, 310 secs
lola: 63980970 markings, 375450800 edges, 179161 markings/sec, 315 secs
lola: 64883460 markings, 380875910 edges, 180498 markings/sec, 320 secs
lola: 65780012 markings, 386273283 edges, 179310 markings/sec, 325 secs
lola: 66685108 markings, 391716387 edges, 181019 markings/sec, 330 secs
lola: 67584886 markings, 397133674 edges, 179956 markings/sec, 335 secs
lola: 68491777 markings, 402588019 edges, 181378 markings/sec, 340 secs
lola: 69392286 markings, 408009272 edges, 180102 markings/sec, 345 secs
lola: 70302010 markings, 413480792 edges, 181945 markings/sec, 350 secs
lola: 71203929 markings, 418911852 edges, 180384 markings/sec, 355 secs
lola: 72118399 markings, 424412451 edges, 182894 markings/sec, 360 secs
lola: 73026698 markings, 429882564 edges, 181660 markings/sec, 365 secs
lola: 73938553 markings, 435375698 edges, 182371 markings/sec, 370 secs
lola: 74854860 markings, 440886912 edges, 183261 markings/sec, 375 secs
lola: 75770360 markings, 446401550 edges, 183100 markings/sec, 380 secs
lola: 76688322 markings, 451922873 edges, 183592 markings/sec, 385 secs
lola: 77592470 markings, 457368770 edges, 180830 markings/sec, 390 secs
lola: 78498628 markings, 462818884 edges, 181232 markings/sec, 395 secs
lola: 79404936 markings, 468277688 edges, 181262 markings/sec, 400 secs
lola: 80338597 markings, 473903150 edges, 186732 markings/sec, 405 secs
lola: 81264536 markings, 479553084 edges, 185188 markings/sec, 410 secs
lola: 82187722 markings, 485197814 edges, 184637 markings/sec, 415 secs
lola: 83115740 markings, 490858609 edges, 185604 markings/sec, 420 secs
lola: 84046726 markings, 496540497 edges, 186197 markings/sec, 425 secs
lola: 84971417 markings, 502068740 edges, 184938 markings/sec, 430 secs
lola: 85905919 markings, 507766878 edges, 186900 markings/sec, 435 secs
lola: 86845766 markings, 513497128 edges, 187969 markings/sec, 440 secs
lola: 87793481 markings, 519273159 edges, 189543 markings/sec, 445 secs
lola: 88732523 markings, 525010974 edges, 187808 markings/sec, 450 secs
lola: 89690750 markings, 530847918 edges, 191645 markings/sec, 455 secs
lola: 90647540 markings, 536674619 edges, 191358 markings/sec, 460 secs
lola: 91592106 markings, 542443313 edges, 188913 markings/sec, 465 secs
lola: 92552301 markings, 548286693 edges, 192039 markings/sec, 470 secs
lola: 93515119 markings, 554144417 edges, 192564 markings/sec, 475 secs
lola: 94461637 markings, 559920218 edges, 189304 markings/sec, 480 secs
lola: 95418591 markings, 565753140 edges, 191391 markings/sec, 485 secs
lola: 96380895 markings, 571618797 edges, 192461 markings/sec, 490 secs
lola: 97334412 markings, 577431595 edges, 190703 markings/sec, 495 secs
lola: 98281330 markings, 583217284 edges, 189384 markings/sec, 500 secs
lola: 99233277 markings, 589020816 edges, 190389 markings/sec, 505 secs
lola: 100187605 markings, 594838475 edges, 190866 markings/sec, 510 secs
lola: 101143169 markings, 600663498 edges, 191113 markings/sec, 515 secs
lola: 102095893 markings, 606470418 edges, 190545 markings/sec, 520 secs
lola: 103046389 markings, 612263853 edges, 190099 markings/sec, 525 secs
lola: 103998404 markings, 618067236 edges, 190403 markings/sec, 530 secs
lola: 104949886 markings, 623867093 edges, 190296 markings/sec, 535 secs
lola: 105899833 markings, 629658859 edges, 189989 markings/sec, 540 secs
lola: 106852734 markings, 635465304 edges, 190580 markings/sec, 545 secs
lola: 107808815 markings, 641288423 edges, 191216 markings/sec, 550 secs
lola: 108767172 markings, 647122058 edges, 191671 markings/sec, 555 secs
lola: 109717810 markings, 652917064 edges, 190128 markings/sec, 560 secs
lola: 110680982 markings, 658774461 edges, 192634 markings/sec, 565 secs
lola: 111637158 markings, 664605019 edges, 191235 markings/sec, 570 secs
lola: 112604526 markings, 670487748 edges, 193474 markings/sec, 575 secs
lola: 113569834 markings, 676361788 edges, 193062 markings/sec, 580 secs
lola: 114533097 markings, 682224791 edges, 192653 markings/sec, 585 secs
lola: 115502215 markings, 688114546 edges, 193824 markings/sec, 590 secs
lola: 116472095 markings, 694006809 edges, 193976 markings/sec, 595 secs
lola: 117449171 markings, 699944228 edges, 195415 markings/sec, 600 secs
lola: 118429346 markings, 705892263 edges, 196035 markings/sec, 605 secs
lola: 119417528 markings, 711885434 edges, 197636 markings/sec, 610 secs
lola: 120420303 markings, 717954347 edges, 200555 markings/sec, 615 secs
lola: 121430246 markings, 724066470 edges, 201989 markings/sec, 620 secs
lola: 122448379 markings, 730201655 edges, 203627 markings/sec, 625 secs
lola: 123514961 markings, 736518144 edges, 213316 markings/sec, 630 secs
lola: 124535788 markings, 742675919 edges, 204165 markings/sec, 635 secs
lola: 125556066 markings, 748891412 edges, 204056 markings/sec, 640 secs
lola: 126667748 markings, 754761438 edges, 222336 markings/sec, 645 secs
lola: 127724000 markings, 760944128 edges, 211250 markings/sec, 650 secs
lola: 128760940 markings, 767171206 edges, 207388 markings/sec, 655 secs
lola: 129789867 markings, 773263580 edges, 205785 markings/sec, 660 secs
lola: 130837025 markings, 779426291 edges, 209432 markings/sec, 665 secs
lola: 131935525 markings, 785828671 edges, 219700 markings/sec, 670 secs
lola: 133003406 markings, 792110753 edges, 213576 markings/sec, 675 secs
lola: 134016149 markings, 798251320 edges, 202549 markings/sec, 680 secs
lola: 135019220 markings, 804365354 edges, 200614 markings/sec, 685 secs
lola: 136009725 markings, 810450677 edges, 198101 markings/sec, 690 secs
lola: 136946779 markings, 816037669 edges, 187411 markings/sec, 695 secs
lola: 137946915 markings, 822020409 edges, 200027 markings/sec, 700 secs
lola: 138903538 markings, 827746691 edges, 191325 markings/sec, 705 secs
lola: 139871104 markings, 833583244 edges, 193513 markings/sec, 710 secs
lola: 140581940 markings, 837599827 edges, 142167 markings/sec, 715 secs
lola: 141481826 markings, 842796439 edges, 179977 markings/sec, 720 secs
lola: 142444575 markings, 848538353 edges, 192550 markings/sec, 725 secs
lola: 143439833 markings, 854439680 edges, 199052 markings/sec, 730 secs
lola: 144403728 markings, 860129649 edges, 192779 markings/sec, 735 secs
lola: 145253303 markings, 864875141 edges, 169915 markings/sec, 740 secs
lola: 145476781 markings, 868193880 edges, 44696 markings/sec, 745 secs
lola: 145476781 markings, 868704879 edges, 0 markings/sec, 750 secs
lola: 145476781 markings, 868919455 edges, 0 markings/sec, 755 secs
lola: 145476966 markings, 869060433 edges, 37 markings/sec, 760 secs
lola: 145476966 markings, 869182501 edges, 0 markings/sec, 765 secs
lola: 145476966 markings, 869294735 edges, 0 markings/sec, 770 secs
lola: 145476966 markings, 869395624 edges, 0 markings/sec, 775 secs
lola: 145476966 markings, 869495574 edges, 0 markings/sec, 780 secs
lola: 145476966 markings, 869578902 edges, 0 markings/sec, 785 secs
lola: 145476966 markings, 869686343 edges, 0 markings/sec, 790 secs
lola: 145476966 markings, 869739366 edges, 0 markings/sec, 795 secs
lola: 145476966 markings, 869739366 edges, 0 markings/sec, 800 secs
lola: 145476966 markings, 869739366 edges, 0 markings/sec, 805 secs
lola: 145476966 markings, 869739366 edges, 0 markings/sec, 810 secs
lola: 145476966 markings, 869739366 edges, 0 markings/sec, 815 secs
lola: 145476966 markings, 869739366 edges, 0 markings/sec, 820 secs
lola: 145476966 markings, 869739366 edges, 0 markings/sec, 825 secs
lola: 145476966 markings, 869739366 edges, 0 markings/sec, 830 secs
lola: 145476966 markings, 869739366 edges, 0 markings/sec, 835 secs
lola: 145476966 markings, 869739366 edges, 0 markings/sec, 840 secs
lola: 145476966 markings, 869739366 edges, 0 markings/sec, 845 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 145476966 markings, 869739366 edges
lola: 145476966 markings, 869739366 edges, 0 markings/sec, 850 secs
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes yes yes no no yes no yes yes no yes yes
lola:
preliminary result: yes yes yes no no yes no yes yes no yes yes
lola: memory consumption: 3372 KB
lola: time consumption: 1395 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="GPPP-PT-C0001N0000000100"
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 GPPP-PT-C0001N0000000100, 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 r170-smll-158987815900435"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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