About the Execution of ITS-LoLa for FMS-PT-10000
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15797.510 | 3600000.00 | 1918606.00 | 151791.40 | ?TT?FT?FT?FFTTTT | 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-158987815400091.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 FMS-PT-10000, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r170-smll-158987815400091
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 192K
-rw-r--r-- 1 mcc users 3.1K Apr 1 20:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K Apr 1 20:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Apr 1 13:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 1 13:48 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 3.1K Apr 8 14:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K Apr 8 14:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Apr 1 10:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Apr 1 10:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Apr 1 06:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 1 06:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Apr 1 13:18 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 1 13:18 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 16K 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 FMS-PT-10000-CTLCardinality-00
FORMULA_NAME FMS-PT-10000-CTLCardinality-01
FORMULA_NAME FMS-PT-10000-CTLCardinality-02
FORMULA_NAME FMS-PT-10000-CTLCardinality-03
FORMULA_NAME FMS-PT-10000-CTLCardinality-04
FORMULA_NAME FMS-PT-10000-CTLCardinality-05
FORMULA_NAME FMS-PT-10000-CTLCardinality-06
FORMULA_NAME FMS-PT-10000-CTLCardinality-07
FORMULA_NAME FMS-PT-10000-CTLCardinality-08
FORMULA_NAME FMS-PT-10000-CTLCardinality-09
FORMULA_NAME FMS-PT-10000-CTLCardinality-10
FORMULA_NAME FMS-PT-10000-CTLCardinality-11
FORMULA_NAME FMS-PT-10000-CTLCardinality-12
FORMULA_NAME FMS-PT-10000-CTLCardinality-13
FORMULA_NAME FMS-PT-10000-CTLCardinality-14
FORMULA_NAME FMS-PT-10000-CTLCardinality-15
=== Now, execution of the tool begins
BK_START 1591156004459
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 03:46:47] [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 03:46:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 03:46:47] [INFO ] Load time of PNML (sax parser for PT used): 55 ms
[2020-06-03 03:46:47] [INFO ] Transformed 22 places.
[2020-06-03 03:46:47] [INFO ] Transformed 20 transitions.
[2020-06-03 03:46:47] [INFO ] Parsed PT model containing 22 places and 20 transitions in 135 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 29 ms.
Incomplete random walk after 100251 steps, including 0 resets, run finished after 125 ms. (steps per millisecond=802 ) properties seen :[1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0]
// Phase 1: matrix 20 rows 22 cols
[2020-06-03 03:46:47] [INFO ] Computed 6 place invariants in 6 ms
[2020-06-03 03:46:47] [INFO ] [Real]Absence check using 6 positive place invariants in 19 ms returned sat
[2020-06-03 03:46:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:46:47] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2020-06-03 03:46:47] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 03:46:47] [INFO ] [Nat]Absence check using 6 positive place invariants in 14 ms returned sat
[2020-06-03 03:46:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 03:46:47] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2020-06-03 03:46:47] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints in 7 ms.
[2020-06-03 03:46:47] [INFO ] Added : 10 causal constraints over 2 iterations in 32 ms. Result :sat
[2020-06-03 03:46:47] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned unsat
[2020-06-03 03:46:47] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2020-06-03 03:46:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:46:47] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2020-06-03 03:46:47] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 03:46:47] [INFO ] [Nat]Absence check using 6 positive place invariants in 5 ms returned sat
[2020-06-03 03:46:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 03:46:47] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2020-06-03 03:46:47] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints in 5 ms.
[2020-06-03 03:46:47] [INFO ] Added : 7 causal constraints over 2 iterations in 24 ms. Result :sat
[2020-06-03 03:46:47] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2020-06-03 03:46:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:46:47] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2020-06-03 03:46:48] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints in 4 ms.
[2020-06-03 03:46:48] [INFO ] Added : 11 causal constraints over 3 iterations in 41 ms. Result :sat
[2020-06-03 03:46:48] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned unsat
[2020-06-03 03:46:48] [INFO ] [Real]Absence check using 6 positive place invariants in 6 ms returned unsat
Successfully simplified 3 atomic propositions for a total of 3 simplifications.
[2020-06-03 03:46:48] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2020-06-03 03:46:48] [INFO ] Flatten gal took : 46 ms
[2020-06-03 03:46:48] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2020-06-03 03:46:48] [INFO ] Flatten gal took : 12 ms
FORMULA FMS-PT-10000-CTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FMS-PT-10000-CTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 03:46:48] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLCardinality.sr.xml took 4 ms.
[2020-06-03 03:46:48] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 2 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLCardinality @ FMS-PT-10000 @ 3570 seconds
FORMULA FMS-PT-10000-CTLCardinality-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA FMS-PT-10000-CTLCardinality-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA FMS-PT-10000-CTLCardinality-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA FMS-PT-10000-CTLCardinality-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA FMS-PT-10000-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA FMS-PT-10000-CTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA FMS-PT-10000-CTLCardinality-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA FMS-PT-10000-CTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA FMS-PT-10000-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA FMS-PT-10000-CTLCardinality-06 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA FMS-PT-10000-CTLCardinality-09 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA FMS-PT-10000-CTLCardinality-03 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA FMS-PT-10000-CTLCardinality-00 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA FMS-PT-10000-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 1441
rslt: Output for CTLCardinality @ FMS-PT-10000
{
"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 03:46:53 2020
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"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 ((p4 <= p15)))",
"processed_size": 19,
"rewrites": 17
},
"result":
{
"edges": 9998,
"markings": 9999,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 2,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "EG(EX((1 <= p7)))",
"processed_size": 17,
"rewrites": 18
},
"net":
{
"conflict_clusters": 17,
"singleton_clusters": 0
},
"result":
{
"edges": 40003,
"markings": 40003,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 0,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "E (F (((p20 + 1 <= p16) AND (p6 + 1 <= p12))))",
"processed_size": 46,
"rewrites": 17
},
"result":
{
"edges": 40016,
"markings": 40015,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 1,
"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": 1,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(2 <= p0)",
"processed_size": 9,
"rewrites": 16
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 2,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(p20 + 1 <= p11)",
"processed_size": 16,
"rewrites": 19
},
"result":
{
"edges": 10001,
"markings": 10002,
"produced_by": "state space /EXEF",
"value": false
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "invariance_from_all_successors",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 2,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 332
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 332
},
"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": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "((p14 <= 1) OR (p7 + 1 <= p5))",
"processed_size": 31,
"rewrites": 16
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 4,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 369
},
"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": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "E (F ((1 <= p16)))",
"processed_size": 18,
"rewrites": 17
},
"result":
{
"edges": 2,
"markings": 3,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 415
},
"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": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "A (G ((1 <= p4)))",
"processed_size": 17,
"rewrites": 18
},
"result":
{
"edges": 10000,
"markings": 10001,
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 4,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 369
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(2 <= p14)",
"processed_size": 10,
"rewrites": 18
},
"result":
{
"edges": 23,
"markings": 24,
"produced_by": "state space /EXEF",
"value": true
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability_from_a_successor",
"workflow": "stateequation"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 415
},
"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": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "E (F ((2 <= p14)))",
"processed_size": 18,
"rewrites": 17
},
"result":
{
"edges": 24,
"markings": 25,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 475
},
"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 ((p4 <= p11)))",
"processed_size": 19,
"rewrites": 17
},
"result":
{
"edges": 10000,
"markings": 10001,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 554
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 1,
"comp": 3,
"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": "E (F (((p19 <= 0) AND (p4 <= 1) AND (p4 + 1 <= p7))))",
"processed_size": 53,
"rewrites": 17
},
"result":
{
"edges": 9999,
"markings": 10000,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3,
"problems": 3
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1241
},
"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": "(p9 <= p17)",
"processed_size": 11,
"rewrites": 20
},
"result":
{
"edges": 40003,
"markings": 40003,
"produced_by": "state space /EGEF",
"value": false
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving",
"visible": 3
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "eventual_invariance",
"workflow": "stateequation"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2483
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2483
},
"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": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "E (F ((p2 <= 2)))",
"processed_size": 17,
"rewrites": 17
},
"result":
{
"edges": 0,
"markings": 0,
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 13,
"type": "boolean"
}
},
{
"child":
[
{
"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": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "E (F ((p2 <= 2)))",
"processed_size": 17,
"rewrites": 17
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 18,
"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"
}
},
{
"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": "(p14 + 1 <= p12)",
"processed_size": 16,
"rewrites": 20
},
"result":
{
"edges": 50009,
"markings": 50009,
"produced_by": "state space /EFEG",
"value": false
},
"task":
{
"compoundnumber": 19,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 1
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "eventual_occurrence_from_all_states",
"workflow": "stateequation"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 18,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 3520,
"runtime": 2129.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "E((** U A(G(**)))) : (E(G(E(X(**)))) AND E(F(**))) : (E(F(*)) OR (A(X(**)) AND E(X(**)))) : E((E(F(**)) U A(G(**)))) : (A(X(A(G(**)))) OR **) : A(X(E((** U **)))) : (A(G(**)) AND (E(X(**)) OR (E(F(**)) AND **))) : E(F(**)) : A(G(E(F(**)))) : A(F(A(G(**)))) : (A(G(A(F(**)))) AND (E(G(*)) OR E(F(**)))) : E(F(*)) : E(X(E(F(**)))) : E(F(**))"
},
"net":
{
"arcs": 50,
"conflict_clusters": 17,
"places": 22,
"places_significant": 16,
"singleton_clusters": 0,
"transitions": 20
},
"result":
{
"preliminary_value": "unknown yes yes unknown no unknown no yes unknown no no yes yes yes ",
"value": "unknown yes yes unknown no unknown no yes unknown no no yes 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: 42/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 704
lola: finding significant places
lola: 22 places, 20 transitions, 16 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: E ((((p9 + 1 <= p7) AND (p0 + 1 <= p6)) U A (G ((p2 <= p4))))) : (E (G (E (X ((1 <= p7))))) AND A (F (E (F ((p4 <= p15)))))) : (NOT(A (G (((p16 <= p20) OR (p12 <= p6))))) OR (A (X (((3 <= p13) AND (1 <= p6)))) AND E (X (((1 <= p6) OR (p18 <= p19)))))) : E ((E (F ((2 <= p12))) U A (G ((1 <= p14))))) : (A (X (A (G ((p11 <= p20))))) OR (2 <= p0)) : A (X (E (((p21 <= p8) U (p4 <= p12))))) : (A (G ((1 <= p4))) AND (E (X (((p14 <= p12) OR (1 <= p10)))) OR (E (F ((1 <= p16))) AND ((p14 <= 1) OR (p7 + 1 <= p5))))) : E (F ((p4 <= p11))) : A (G (E (F ((p3 <= 0))))) : A (F (A (G ((p17 + 1 <= p9))))) : (A (G (A (F ((p12 <= p14))))) AND (NOT(A (F ((3 <= p1)))) OR E (F ((p2 <= 2))))) : NOT(A (G (((1 <= p19) OR (2 <= p4) OR (p7 <= p4))))) : E (F ((E (G ((1 <= 0))) OR E (X ((2 <= p14)))))) : E ((E (X ((p9 <= p4))) U E (F ((2 <= p14)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:449
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
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:98
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:395
lola: rewrite Frontend/Parser/formula_rewrite.k:473
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (G (E (X ((1 <= p7))))) AND E (F ((p4 <= p15))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((p4 <= p15)))
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 <= p15)))
lola: processed formula length: 19
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: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 <= p15)
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-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 9999 markings, 9998 edges
lola: ========================================
lola: subprocess 1 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (E (X ((1 <= p7)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: processed formula: EG(EX((1 <= p7)))
lola: processed formula length: 17
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: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 40003 markings, 40003 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 1 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F (((p20 + 1 <= p16) AND (p6 + 1 <= p12)))) OR (A (X (((3 <= p13) AND (1 <= p6)))) AND E (X (((1 <= p6) OR (p18 <= p19))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((p20 + 1 <= p16) AND (p6 + 1 <= p12))))
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 (((p20 + 1 <= p16) AND (p6 + 1 <= p12))))
lola: processed formula length: 46
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:711
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 <= p16) AND (p6 + 1 <= p12))
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.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 40015 markings, 40016 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 2 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (X (A (G ((p11 <= p20))))) OR (2 <= p0))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (2 <= p0)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= p0)
lola: processed formula length: 9
lola: 16 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (A (G ((p11 <= p20)))))
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: (p20 + 1 <= p11)
lola: processed formula length: 16
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 /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: (p20 + 1 <= p11)
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.
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EXEF
lola: The predicate is not invariant from successors.
lola: 10002 markings, 10001 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 3 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (E (((p21 <= p8) U (p4 <= p12)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX(E((p21 <= p8) U (p4 <= p12)))
lola: processed formula length: 32
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: 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: 3878728 markings, 6427232 edges, 775746 markings/sec, 0 secs
lola: 7614825 markings, 12649210 edges, 747219 markings/sec, 5 secs
lola: 11373256 markings, 18915851 edges, 751686 markings/sec, 10 secs
lola: 14798630 markings, 24626401 edges, 685075 markings/sec, 15 secs
lola: 18459549 markings, 30728023 edges, 732184 markings/sec, 20 secs
lola: 22116426 markings, 36821565 edges, 731375 markings/sec, 25 secs
lola: 25795601 markings, 42949698 edges, 735835 markings/sec, 30 secs
lola: 29485053 markings, 49098390 edges, 737890 markings/sec, 35 secs
lola: 33113650 markings, 55145372 edges, 725719 markings/sec, 40 secs
lola: 36471594 markings, 60741064 edges, 671589 markings/sec, 45 secs
lola: 39663074 markings, 66063839 edges, 638296 markings/sec, 50 secs
lola: 43315148 markings, 72147771 edges, 730415 markings/sec, 55 secs
lola: 46928482 markings, 78174229 edges, 722667 markings/sec, 60 secs
lola: 50395486 markings, 83948034 edges, 693401 markings/sec, 65 secs
lola: 53597730 markings, 89285054 edges, 640449 markings/sec, 70 secs
lola: 57282106 markings, 95429246 edges, 736875 markings/sec, 75 secs
lola: 60830609 markings, 101337673 edges, 709701 markings/sec, 80 secs
lola: 64247855 markings, 107034646 edges, 683449 markings/sec, 85 secs
lola: 67957190 markings, 113220419 edges, 741867 markings/sec, 90 secs
lola: 71692561 markings, 119440943 edges, 747074 markings/sec, 95 secs
lola: 75395259 markings, 125616121 edges, 740540 markings/sec, 100 secs
lola: 78934178 markings, 131513754 edges, 707784 markings/sec, 105 secs
lola: 82614068 markings, 137643320 edges, 735978 markings/sec, 110 secs
lola: 86295704 markings, 143781393 edges, 736327 markings/sec, 115 secs
lola: 90038293 markings, 150021336 edges, 748518 markings/sec, 120 secs
lola: 93726063 markings, 156166660 edges, 737554 markings/sec, 125 secs
lola: 97378361 markings, 162251046 edges, 730460 markings/sec, 130 secs
lola: 100969572 markings, 168234528 edges, 718242 markings/sec, 135 secs
lola: 104645285 markings, 174364468 edges, 735143 markings/sec, 140 secs
lola: 108273923 markings, 180411532 edges, 725728 markings/sec, 145 secs
lola: 111907253 markings, 186467984 edges, 726666 markings/sec, 150 secs
lola: 115437107 markings, 192347483 edges, 705971 markings/sec, 155 secs
lola: 119074493 markings, 198412811 edges, 727477 markings/sec, 160 secs
lola: 121014034 markings, 201642676 edges, 387908 markings/sec, 165 secs
lola: 123341314 markings, 205526487 edges, 465456 markings/sec, 170 secs
lola: 124858548 markings, 208049817 edges, 303447 markings/sec, 175 secs
lola: 127444754 markings, 212362075 edges, 517241 markings/sec, 180 secs
lola: 129992966 markings, 216608352 edges, 509642 markings/sec, 185 secs
lola: 132377461 markings, 220580846 edges, 476899 markings/sec, 190 secs
lola: 134382848 markings, 223926134 edges, 401077 markings/sec, 195 secs
lola: 136408168 markings, 227298381 edges, 405064 markings/sec, 200 secs
lola: 138415044 markings, 230642016 edges, 401375 markings/sec, 205 secs
lola: 140814547 markings, 234640884 edges, 479901 markings/sec, 210 secs
lola: 142027788 markings, 236667295 edges, 242648 markings/sec, 215 secs
lola: 144979730 markings, 241582485 edges, 590388 markings/sec, 220 secs
lola: 147268634 markings, 245398679 edges, 457781 markings/sec, 225 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 332 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G ((1 <= p4))) AND (E (X (((p14 <= p12) OR (1 <= p10)))) OR (E (F ((1 <= p16))) AND ((p14 <= 1) OR (p7 + 1 <= p5)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 332 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p14 <= 1) OR (p7 + 1 <= p5))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p14 <= 1) OR (p7 + 1 <= p5))
lola: processed formula length: 31
lola: 16 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 5 will run for 369 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((1 <= p16)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((1 <= p16)))
lola: processed formula length: 18
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:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (1 <= p16)
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: 3 markings, 2 edges
lola: ========================================
lola: subprocess 6 will run for 415 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((1 <= p4)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G ((1 <= p4)))
lola: processed formula length: 17
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)
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: (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-6-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 10001 markings, 10000 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 5 will run for 369 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (E (F ((2 <= p14)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability from a successor
lola: rewrite Frontend/Parser/formula_rewrite.k:623
lola: rewrite Frontend/Parser/formula_rewrite.k:714
lola: processed formula: (2 <= p14)
lola: processed formula length: 10
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 /EXEF)
lola: state space: using reachability graph (EXef version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (2 <= p14)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EXEF
lola: The predicate is reachable from some successor.
lola: 24 markings, 23 edges
lola: state equation: write sara problem file to CTLCardinality-5-0.sara
lola: state equation: calling and running sara
lola: ========================================
lola: subprocess 6 will run for 415 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((2 <= p14)))
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 ((2 <= p14)))
lola: processed formula length: 18
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:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (2 <= p14)
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: 25 markings, 24 edges
lola: ========================================
lola: subprocess 7 will run for 475 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((p4 <= p11)))
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 <= p11)))
lola: processed formula length: 19
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: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 <= p11)
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-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: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 10001 markings, 10000 edges
lola: ========================================
lola: subprocess 8 will run for 554 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((p19 <= 0) AND (p4 <= 1) AND (p4 + 1 <= p7))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((p19 <= 0) AND (p4 <= 1) AND (p4 + 1 <= p7))))
lola: processed formula length: 53
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:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p19 <= 0) AND (p4 <= 1) AND (p4 + 1 <= p7))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 10000 markings, 9999 edges
lola: ========================================
lola: subprocess 9 will run for 665 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (F ((p3 <= 0)))))
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: (p3 <= 0)
lola: processed formula length: 9
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
lola: using tscc preserving stubborn set method (--stubborn)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (1 <= p3)
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: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: (p3 <= 0)
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-9-1.sara
lola: state equation: write sara problem file to CTLCardinality-9-0.sara
lola: state equation: calling and running sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-9-0.sara.sara:
try reading problem file CTLCardinality-9-1.sara.
lola: state equation 1: solution produced
lola: state equation 0: solution produced
lola: sara is running 0 secs || sara is running 0 secs || 4435281 markings, 5902702 edges, 887056 markings/sec, 0 secs
lola: sara is running 5 secs || sara is running 5 secs || 8661719 markings, 11537148 edges, 845288 markings/sec, 5 secs
lola: sara is running 10 secs || sara is running 10 secs || 12869183 markings, 17148134 edges, 841493 markings/sec, 10 secs
lola: sara is running 15 secs || sara is running 15 secs || 17062229 markings, 22737492 edges, 838609 markings/sec, 15 secs
lola: sara is running 20 secs || sara is running 20 secs || 21231029 markings, 28295484 edges, 833760 markings/sec, 20 secs
lola: sara is running 25 secs || sara is running 25 secs || 25327647 markings, 33758491 edges, 819324 markings/sec, 25 secs
lola: sara is running 30 secs || sara is running 30 secs || 29414912 markings, 39205899 edges, 817453 markings/sec, 30 secs
lola: sara is running 35 secs || sara is running 35 secs || 33505227 markings, 44661167 edges, 818063 markings/sec, 35 secs
lola: sara is running 40 secs || sara is running 40 secs || 37529055 markings, 50026709 edges, 804766 markings/sec, 40 secs
lola: sara is running 45 secs || sara is running 45 secs || 41541427 markings, 55375065 edges, 802474 markings/sec, 45 secs
lola: sara is running 50 secs || sara is running 50 secs || 45490691 markings, 60642207 edges, 789853 markings/sec, 50 secs
lola: sara is running 55 secs || sara is running 55 secs || 49500312 markings, 65987996 edges, 801924 markings/sec, 55 secs
lola: sara is running 60 secs || sara is running 60 secs || 53468717 markings, 71280405 edges, 793681 markings/sec, 60 secs
lola: sara is running 65 secs || sara is running 65 secs || 57426915 markings, 76557504 edges, 791640 markings/sec, 65 secs
lola: sara is running 70 secs || sara is running 70 secs || 61315727 markings, 81740527 edges, 777762 markings/sec, 70 secs
lola: sara is running 75 secs || sara is running 75 secs || 65312267 markings, 87070137 edges, 799308 markings/sec, 75 secs
lola: sara is running 80 secs || sara is running 80 secs || 69236618 markings, 92301468 edges, 784870 markings/sec, 80 secs
lola: sara is running 85 secs || sara is running 85 secs || 73116864 markings, 97476643 edges, 776049 markings/sec, 85 secs
lola: sara is running 90 secs || sara is running 90 secs || 77009948 markings, 102666074 edges, 778617 markings/sec, 90 secs
lola: sara is running 95 secs || sara is running 95 secs || 80915353 markings, 107873986 edges, 781081 markings/sec, 95 secs
lola: sara is running 100 secs || sara is running 100 secs || 84729276 markings, 112959681 edges, 762785 markings/sec, 100 secs
lola: sara is running 105 secs || sara is running 105 secs || 88568294 markings, 118078015 edges, 767804 markings/sec, 105 secs
lola: sara is running 110 secs || sara is running 110 secs || 92346998 markings, 123115883 edges, 755741 markings/sec, 110 secs
lola: sara is running 115 secs || sara is running 115 secs || 96233001 markings, 128296208 edges, 777201 markings/sec, 115 secs
lola: sara is running 120 secs || sara is running 120 secs || 100058923 markings, 133398384 edges, 765184 markings/sec, 120 secs
lola: sara is running 125 secs || sara is running 125 secs || 103894003 markings, 138510813 edges, 767016 markings/sec, 125 secs
lola: sara is running 130 secs || sara is running 130 secs || 107685757 markings, 143568254 edges, 758351 markings/sec, 130 secs
lola: sara is running 135 secs || sara is running 135 secs || 111536135 markings, 148699851 edges, 770076 markings/sec, 135 secs
lola: sara is running 140 secs || sara is running 140 secs || 115268467 markings, 153676940 edges, 746466 markings/sec, 140 secs
lola: sara is running 145 secs || sara is running 145 secs || 118990735 markings, 158640156 edges, 744454 markings/sec, 145 secs
lola: sara is running 150 secs || sara is running 150 secs || 122661513 markings, 163535601 edges, 734156 markings/sec, 150 secs
lola: sara is running 155 secs || sara is running 155 secs || 126492151 markings, 168641905 edges, 766128 markings/sec, 155 secs
lola: sara is running 160 secs || sara is running 160 secs || 130286624 markings, 173700966 edges, 758895 markings/sec, 160 secs
lola: sara is running 165 secs || sara is running 165 secs || 134052713 markings, 178722370 edges, 753218 markings/sec, 165 secs
lola: sara is running 170 secs || sara is running 170 secs || 137853325 markings, 183788097 edges, 760122 markings/sec, 170 secs
lola: sara is running 175 secs || sara is running 175 secs || 141667655 markings, 188874402 edges, 762866 markings/sec, 175 secs
lola: sara is running 180 secs || sara is running 180 secs || 145252395 markings, 193656333 edges, 716948 markings/sec, 180 secs
lola: sara is running 185 secs || sara is running 185 secs || 148952436 markings, 198587400 edges, 740008 markings/sec, 185 secs
lola: sara is running 190 secs || sara is running 190 secs || 152709539 markings, 203596676 edges, 751421 markings/sec, 190 secs
lola: sara is running 195 secs || sara is running 195 secs || 156438218 markings, 208569508 edges, 745736 markings/sec, 195 secs
lola: sara is running 200 secs || sara is running 200 secs || 160136773 markings, 213502110 edges, 739711 markings/sec, 200 secs
lola: sara is running 205 secs || sara is running 205 secs || 162571911 markings, 216747328 edges, 487028 markings/sec, 205 secs
lola: sara is running 210 secs || sara is running 210 secs || 165212159 markings, 220267664 edges, 528050 markings/sec, 210 secs
lola: sara is running 215 secs || sara is running 215 secs || 167453527 markings, 223256920 edges, 448274 markings/sec, 215 secs
lola: sara is running 220 secs || sara is running 220 secs || 169655329 markings, 226190983 edges, 440360 markings/sec, 220 secs
lola: sara is running 225 secs || sara is running 225 secs || 171971326 markings, 229278392 edges, 463199 markings/sec, 225 secs
lola: sara is running 230 secs || sara is running 230 secs || 174415014 markings, 232538803 edges, 488738 markings/sec, 230 secs
lola: sara is running 235 secs || sara is running 235 secs || 176589841 markings, 235435934 edges, 434965 markings/sec, 235 secs
lola: sara is running 240 secs || sara is running 240 secs || 179288704 markings, 239034678 edges, 539773 markings/sec, 240 secs
lola: sara is running 245 secs || sara is running 245 secs || 181969536 markings, 242610208 edges, 536166 markings/sec, 245 secs
lola: sara is running 250 secs || sara is running 250 secs || 185395712 markings, 247179301 edges, 685235 markings/sec, 250 secs
lola: sara is running 255 secs || sara is running 255 secs || 187269711 markings, 249675952 edges, 374800 markings/sec, 255 secs
lola: sara is running 260 secs || sara is running 260 secs || 189741946 markings, 252973436 edges, 494447 markings/sec, 260 secs
lola: sara is running 265 secs || sara is running 265 secs || 191866120 markings, 255804590 edges, 424835 markings/sec, 265 secs
lola: sara is running 270 secs || sara is running 270 secs || 193992647 markings, 258639274 edges, 425305 markings/sec, 270 secs
lola: sara is running 275 secs || sara is running 275 secs || 196221346 markings, 261612211 edges, 445740 markings/sec, 275 secs
lola: sara is running 280 secs || sara is running 280 secs || 198622026 markings, 264813111 edges, 480136 markings/sec, 280 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 10 will run for 758 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((E (F ((2 <= p12))) U A (G ((1 <= p14)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: processed formula: E(EF((2 <= p12)) U AG((1 <= p14)))
lola: processed formula length: 34
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: 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: 4214370 markings, 5606352 edges, 842874 markings/sec, 0 secs
lola: 8186875 markings, 10904911 edges, 794501 markings/sec, 5 secs
lola: 12150646 markings, 16190366 edges, 792754 markings/sec, 10 secs
lola: 16043088 markings, 21378837 edges, 778488 markings/sec, 15 secs
lola: 19929081 markings, 26559751 edges, 777199 markings/sec, 20 secs
lola: 23799964 markings, 31720762 edges, 774177 markings/sec, 25 secs
lola: 27646233 markings, 36847971 edges, 769254 markings/sec, 30 secs
lola: 31455309 markings, 41926398 edges, 761815 markings/sec, 35 secs
lola: 35029350 markings, 46692278 edges, 714808 markings/sec, 40 secs
lola: 38795409 markings, 51716180 edges, 753212 markings/sec, 45 secs
lola: 42544072 markings, 56713989 edges, 749733 markings/sec, 50 secs
lola: 46259439 markings, 61666853 edges, 743073 markings/sec, 55 secs
lola: 49917880 markings, 66544329 edges, 731688 markings/sec, 60 secs
lola: 53602933 markings, 71456726 edges, 737011 markings/sec, 65 secs
lola: 57308041 markings, 76399201 edges, 741022 markings/sec, 70 secs
lola: 60983395 markings, 81297050 edges, 735071 markings/sec, 75 secs
lola: 64717697 markings, 86278316 edges, 746860 markings/sec, 80 secs
lola: 68305893 markings, 91060430 edges, 717639 markings/sec, 85 secs
lola: 71832321 markings, 95764716 edges, 705286 markings/sec, 90 secs
lola: 75447729 markings, 100582827 edges, 723082 markings/sec, 95 secs
lola: 79127226 markings, 105489865 edges, 735899 markings/sec, 100 secs
lola: 82765901 markings, 110339720 edges, 727735 markings/sec, 105 secs
lola: 86369667 markings, 115145190 edges, 720753 markings/sec, 110 secs
lola: 89941716 markings, 119908085 edges, 714410 markings/sec, 115 secs
lola: 93333151 markings, 124430067 edges, 678287 markings/sec, 120 secs
lola: 97007766 markings, 129331003 edges, 734923 markings/sec, 125 secs
lola: 100646945 markings, 134180391 edges, 727836 markings/sec, 130 secs
lola: 104265037 markings, 139007349 edges, 723618 markings/sec, 135 secs
lola: 107654887 markings, 143526955 edges, 677970 markings/sec, 140 secs
lola: 111252247 markings, 148322815 edges, 719472 markings/sec, 145 secs
lola: 114839205 markings, 153103070 edges, 717392 markings/sec, 150 secs
lola: 118391196 markings, 157840881 edges, 710398 markings/sec, 155 secs
lola: 120889431 markings, 161173423 edges, 499647 markings/sec, 160 secs
lola: 123313382 markings, 164404373 edges, 484790 markings/sec, 165 secs
lola: 125474020 markings, 167284762 edges, 432128 markings/sec, 170 secs
lola: 126958465 markings, 169262697 edges, 296889 markings/sec, 175 secs
lola: 128920754 markings, 171879690 edges, 392458 markings/sec, 180 secs
lola: 131425549 markings, 175219931 edges, 500959 markings/sec, 185 secs
lola: 133587090 markings, 178101544 edges, 432308 markings/sec, 190 secs
lola: 135275895 markings, 180352084 edges, 337761 markings/sec, 195 secs
lola: 137407476 markings, 183194347 edges, 426316 markings/sec, 200 secs
lola: 139474417 markings, 185949657 edges, 413388 markings/sec, 205 secs
lola: 141726977 markings, 188953383 edges, 450512 markings/sec, 210 secs
lola: 143865601 markings, 191806212 edges, 427725 markings/sec, 215 secs
lola: 146310229 markings, 195065106 edges, 488926 markings/sec, 220 secs
lola: 147922973 markings, 197217068 edges, 322549 markings/sec, 225 secs
lola: 148093739 markings, 197443208 edges, 34153 markings/sec, 230 secs
lola: 148093838 markings, 197443356 edges, 20 markings/sec, 235 secs
lola: 148096523 markings, 197447384 edges, 537 markings/sec, 240 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 11 will run for 925 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((((p9 + 1 <= p7) AND (p0 + 1 <= p6)) U A (G ((p2 <= p4)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: processed formula: E(((p9 + 1 <= p7) AND (p0 + 1 <= p6)) U AG((p2 <= p4)))
lola: processed formula length: 55
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: 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: 4246254 markings, 5649172 edges, 849251 markings/sec, 0 secs
lola: 8222561 markings, 10952836 edges, 795261 markings/sec, 5 secs
lola: 12183743 markings, 16234150 edges, 792236 markings/sec, 10 secs
lola: 16096635 markings, 21449149 edges, 782578 markings/sec, 15 secs
lola: 20034235 markings, 26700354 edges, 787520 markings/sec, 20 secs
lola: 23929949 markings, 31893730 edges, 779143 markings/sec, 25 secs
lola: 27740117 markings, 36973791 edges, 762034 markings/sec, 30 secs
lola: 31145982 markings, 41517021 edges, 681173 markings/sec, 35 secs
lola: 34823564 markings, 46418607 edges, 735516 markings/sec, 40 secs
lola: 38565599 markings, 51406885 edges, 748407 markings/sec, 45 secs
lola: 41997586 markings, 55984282 edges, 686397 markings/sec, 50 secs
lola: 45697508 markings, 60918981 edges, 739984 markings/sec, 55 secs
lola: 49456953 markings, 65928602 edges, 751889 markings/sec, 60 secs
lola: 53199402 markings, 70921175 edges, 748490 markings/sec, 65 secs
lola: 56932209 markings, 75895470 edges, 746561 markings/sec, 70 secs
lola: 60608744 markings, 80800088 edges, 735307 markings/sec, 75 secs
lola: 64116969 markings, 85477251 edges, 701645 markings/sec, 80 secs
lola: 67850651 markings, 90452913 edges, 746736 markings/sec, 85 secs
lola: 71178419 markings, 94890791 edges, 665554 markings/sec, 90 secs
lola: 74757474 markings, 99662476 edges, 715811 markings/sec, 95 secs
lola: 78439008 markings, 104571623 edges, 736307 markings/sec, 100 secs
lola: 82106991 markings, 109461385 edges, 733597 markings/sec, 105 secs
lola: 85723104 markings, 114285374 edges, 723223 markings/sec, 110 secs
lola: 89322267 markings, 119083939 edges, 719833 markings/sec, 115 secs
lola: 92811504 markings, 123734598 edges, 697847 markings/sec, 120 secs
lola: 96509418 markings, 128664305 edges, 739583 markings/sec, 125 secs
lola: 100161846 markings, 133535185 edges, 730486 markings/sec, 130 secs
lola: 103787185 markings, 138370593 edges, 725068 markings/sec, 135 secs
lola: 107407954 markings, 143196565 edges, 724154 markings/sec, 140 secs
lola: 111065336 markings, 148072455 edges, 731476 markings/sec, 145 secs
lola: 114672084 markings, 152882396 edges, 721350 markings/sec, 150 secs
lola: 118179867 markings, 157558896 edges, 701557 markings/sec, 155 secs
lola: 121452538 markings, 161923163 edges, 654534 markings/sec, 160 secs
lola: 123604983 markings, 164791860 edges, 430489 markings/sec, 165 secs
lola: 125339645 markings, 167103823 edges, 346932 markings/sec, 170 secs
lola: 126900097 markings, 169184326 edges, 312090 markings/sec, 175 secs
lola: 128888112 markings, 171835728 edges, 397603 markings/sec, 180 secs
lola: 131535745 markings, 175367044 edges, 529527 markings/sec, 185 secs
lola: 133571672 markings, 178080835 edges, 407185 markings/sec, 190 secs
lola: 135898734 markings, 181183263 edges, 465412 markings/sec, 195 secs
lola: 136755574 markings, 182326527 edges, 171368 markings/sec, 200 secs
lola: 140022041 markings, 186681063 edges, 653293 markings/sec, 205 secs
lola: 140987149 markings, 187968679 edges, 193022 markings/sec, 210 secs
lola: 143723562 markings, 191618162 edges, 547283 markings/sec, 215 secs
lola: 145450856 markings, 193919016 edges, 345459 markings/sec, 220 secs
lola: 147534642 markings, 196699560 edges, 416757 markings/sec, 225 secs
lola: 147999232 markings, 197316451 edges, 92918 markings/sec, 230 secs
lola: 147999253 markings, 197316483 edges, 4 markings/sec, 235 secs
lola: 147999303 markings, 197316557 edges, 10 markings/sec, 240 secs
lola: 147999361 markings, 197316646 edges, 12 markings/sec, 245 secs
lola: 148058159 markings, 197394839 edges, 11760 markings/sec, 250 secs
lola: 148068993 markings, 197411090 edges, 2167 markings/sec, 255 secs
lola: 148069072 markings, 197411208 edges, 16 markings/sec, 260 secs
lola: 148069149 markings, 197411325 edges, 15 markings/sec, 265 secs
lola: 148069224 markings, 197411437 edges, 15 markings/sec, 270 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 12 will run for 1241 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (A (G ((p17 + 1 <= p9)))))
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: (p9 <= p17)
lola: processed formula length: 11
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 /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: 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: (p9 <= p17)
lola: state equation task get result unparse finished id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p17 + 1 <= p9)
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: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-12-1.sara
lola: lola: state equation: write sara problem file to CTLCardinality-12-0.sara
state equation: calling and running sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-12-1.sara.
sara: try reading problem file CTLCardinality-12-0.sara.
lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EGEF
lola: The predicate is not eventually invariant.
lola: 40003 markings, 40003 edges
lola: ========================================
lola: subprocess 13 will run for 2483 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (A (F ((p12 <= p14))))) AND (E (G ((p1 <= 2))) OR E (F ((p2 <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 2483 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((p2 <= 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 ((p2 <= 2)))
lola: processed formula length: 17
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:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p2 <= 2)
lola: state equation task get result unparse finished id 0
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 0 markings, 0 edges
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-13-0.sara
lola: state equation: calling and running sara
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
sara: try reading problem file CTLCardinality-13-0.sara.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (X (E (((p21 <= p8) U (p4 <= p12)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX(E((p21 <= p8) U (p4 <= p12)))
lola: processed formula length: 32
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: 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: 3610710 markings, 5980536 edges, 722142 markings/sec, 0 secs
lola: 7366754 markings, 12236393 edges, 751209 markings/sec, 5 secs
lola: 10942960 markings, 18195288 edges, 715241 markings/sec, 10 secs
lola: 14597467 markings, 24286743 edges, 730901 markings/sec, 15 secs
lola: 18271443 markings, 30411825 edges, 734795 markings/sec, 20 secs
lola: 21904136 markings, 36467002 edges, 726539 markings/sec, 25 secs
lola: 25472395 markings, 42413308 edges, 713652 markings/sec, 30 secs
lola: 28902716 markings, 48131277 edges, 686064 markings/sec, 35 secs
lola: 32597733 markings, 54286110 edges, 739003 markings/sec, 40 secs
lola: 36318186 markings, 60486375 edges, 744091 markings/sec, 45 secs
lola: 40018843 markings, 66655357 edges, 740131 markings/sec, 50 secs
lola: 43747132 markings, 72871720 edges, 745658 markings/sec, 55 secs
lola: 47455346 markings, 79047931 edges, 741643 markings/sec, 60 secs
lola: 50919567 markings, 84826169 edges, 692844 markings/sec, 65 secs
lola: 54535612 markings, 90848047 edges, 723209 markings/sec, 70 secs
lola: 58265968 markings, 97068546 edges, 746071 markings/sec, 75 secs
lola: 61893744 markings, 103113881 edges, 725555 markings/sec, 80 secs
lola: 65667148 markings, 109400470 edges, 754681 markings/sec, 85 secs
lola: 69356853 markings, 115549665 edges, 737941 markings/sec, 90 secs
lola: 73089322 markings, 121774387 edges, 746494 markings/sec, 95 secs
lola: 76754609 markings, 127880777 edges, 733057 markings/sec, 100 secs
lola: 80409686 markings, 133974688 edges, 731015 markings/sec, 105 secs
lola: 84062323 markings, 140059749 edges, 730527 markings/sec, 110 secs
lola: 87755617 markings, 146216120 edges, 738659 markings/sec, 115 secs
lola: 91465791 markings, 152396251 edges, 742035 markings/sec, 120 secs
lola: 95056717 markings, 158381972 edges, 718185 markings/sec, 125 secs
lola: 98639582 markings, 164353416 edges, 716573 markings/sec, 130 secs
lola: 102280256 markings, 170424551 edges, 728135 markings/sec, 135 secs
lola: 105953383 markings, 176540590 edges, 734625 markings/sec, 140 secs
lola: 109591540 markings, 182606691 edges, 727631 markings/sec, 145 secs
lola: 113192654 markings, 188608711 edges, 720223 markings/sec, 150 secs
lola: 116804074 markings, 194628241 edges, 722284 markings/sec, 155 secs
lola: 120395388 markings, 200614777 edges, 718263 markings/sec, 160 secs
lola: 122504670 markings, 204128856 edges, 421856 markings/sec, 165 secs
lola: 125702412 markings, 209467938 edges, 639548 markings/sec, 170 secs
lola: 126220507 markings, 210323656 edges, 103619 markings/sec, 175 secs
lola: 128845653 markings, 214693795 edges, 525029 markings/sec, 180 secs
lola: 129863721 markings, 216389872 edges, 203614 markings/sec, 185 secs
lola: 132135398 markings, 220178800 edges, 454335 markings/sec, 190 secs
lola: 134092046 markings, 223436278 edges, 391330 markings/sec, 195 secs
lola: 135871954 markings, 226405989 edges, 355982 markings/sec, 200 secs
lola: 137936401 markings, 229844759 edges, 412889 markings/sec, 205 secs
lola: 139706771 markings, 232795396 edges, 354074 markings/sec, 210 secs
lola: 141779048 markings, 236249831 edges, 414455 markings/sec, 215 secs
lola: 143489488 markings, 239100609 edges, 342088 markings/sec, 220 secs
lola: 145600072 markings, 242621652 edges, 422117 markings/sec, 225 secs
lola: 147383015 markings, 245587433 edges, 356589 markings/sec, 230 secs
lola: 147987386 markings, 246596141 edges, 120874 markings/sec, 235 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: A (G (E (F ((p3 <= 0)))))
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: (p3 <= 0)
lola: processed formula length: 9
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
lola: using tscc preserving stubborn set method (--stubborn)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
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 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (1 <= p3)
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 rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: (p3 <= 0)
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-15-0.sara
lola: state equation: write sara problem file to CTLCardinality-15-1.sara
lola: state equation: calling and running sara
lola: state equation: calling and running sara
sara: sara: try reading problem file CTLCardinality-15-1.sara.try reading problem file CTLCardinality-15-0.sara.
lola: state equation 1: solution produced
lola: state equation 0: solution produced
lola: sara is running 0 secs || sara is running 0 secs || 4472550 markings, 5952699 edges, 894510 markings/sec, 0 secs
lola: sara is running 5 secs || sara is running 5 secs || 8643821 markings, 11514109 edges, 834254 markings/sec, 5 secs
lola: sara is running 10 secs || sara is running 10 secs || 12801415 markings, 17056484 edges, 831519 markings/sec, 10 secs
lola: sara is running 15 secs || sara is running 15 secs || 16933372 markings, 22564213 edges, 826391 markings/sec, 15 secs
lola: sara is running 20 secs || sara is running 20 secs || 21022933 markings, 28018351 edges, 817912 markings/sec, 20 secs
lola: sara is running 25 secs || sara is running 25 secs || 24911534 markings, 33202364 edges, 777720 markings/sec, 25 secs
lola: sara is running 30 secs || sara is running 30 secs || 28795270 markings, 38381467 edges, 776747 markings/sec, 30 secs
lola: sara is running 35 secs || sara is running 35 secs || 32872266 markings, 43816758 edges, 815399 markings/sec, 35 secs
lola: sara is running 40 secs || sara is running 40 secs || 36892160 markings, 49176399 edges, 803979 markings/sec, 40 secs
lola: sara is running 45 secs || sara is running 45 secs || 40881604 markings, 54495364 edges, 797889 markings/sec, 45 secs
lola: sara is running 50 secs || sara is running 50 secs || 44822652 markings, 59751740 edges, 788210 markings/sec, 50 secs
lola: sara is running 55 secs || sara is running 55 secs || 48803197 markings, 65057357 edges, 796109 markings/sec, 55 secs
lola: sara is running 60 secs || sara is running 60 secs || 53278484 markings, 71025065 edges, 895057 markings/sec, 60 secs
lola: sara is running 65 secs || sara is running 65 secs || 57240075 markings, 76307253 edges, 792318 markings/sec, 65 secs
lola: sara is running 70 secs || sara is running 70 secs || 61139271 markings, 81505852 edges, 779839 markings/sec, 70 secs
lola: sara is running 75 secs || sara is running 75 secs || 65133427 markings, 86831887 edges, 798831 markings/sec, 75 secs
lola: sara is running 80 secs || sara is running 80 secs || 69089061 markings, 92105140 edges, 791127 markings/sec, 80 secs
lola: sara is running 85 secs || sara is running 85 secs || 72967704 markings, 97277911 edges, 775729 markings/sec, 85 secs
lola: sara is running 90 secs || sara is running 90 secs || 76842274 markings, 102444572 edges, 774914 markings/sec, 90 secs
lola: sara is running 95 secs || sara is running 95 secs || 80765943 markings, 107674879 edges, 784734 markings/sec, 95 secs
lola: sara is running 100 secs || sara is running 100 secs || 84577913 markings, 112757644 edges, 762394 markings/sec, 100 secs
lola: sara is running 105 secs || sara is running 105 secs || 88410272 markings, 117865990 edges, 766472 markings/sec, 105 secs
lola: sara is running 110 secs || sara is running 110 secs || 92216650 markings, 122940366 edges, 761276 markings/sec, 110 secs
lola: sara is running 115 secs || sara is running 115 secs || 96132112 markings, 128163364 edges, 783092 markings/sec, 115 secs
lola: sara is running 120 secs || sara is running 120 secs || 99956076 markings, 133259407 edges, 764793 markings/sec, 120 secs
lola: sara is running 125 secs || sara is running 125 secs || 103764703 markings, 138338161 edges, 761725 markings/sec, 125 secs
lola: sara is running 130 secs || sara is running 130 secs || 107556395 markings, 143394218 edges, 758338 markings/sec, 130 secs
lola: sara is running 135 secs || sara is running 135 secs || 111410215 markings, 148533928 edges, 770764 markings/sec, 135 secs
lola: sara is running 140 secs || sara is running 140 secs || 115234689 markings, 153631274 edges, 764895 markings/sec, 140 secs
lola: sara is running 145 secs || sara is running 145 secs || 118794286 markings, 158378245 edges, 711919 markings/sec, 145 secs
lola: sara is running 150 secs || sara is running 150 secs || 122447133 markings, 163249581 edges, 730569 markings/sec, 150 secs
lola: sara is running 155 secs || sara is running 155 secs || 126347918 markings, 168450562 edges, 780157 markings/sec, 155 secs
lola: sara is running 160 secs || sara is running 160 secs || 130188889 markings, 173571828 edges, 768194 markings/sec, 160 secs
lola: sara is running 165 secs || sara is running 165 secs || 134023640 markings, 178683762 edges, 766950 markings/sec, 165 secs
lola: sara is running 170 secs || sara is running 170 secs || 137850211 markings, 183784805 edges, 765314 markings/sec, 170 secs
lola: sara is running 175 secs || sara is running 175 secs || 141696701 markings, 188912970 edges, 769298 markings/sec, 175 secs
lola: sara is running 180 secs || sara is running 180 secs || 145491498 markings, 193974976 edges, 758959 markings/sec, 180 secs
lola: sara is running 185 secs || sara is running 185 secs || 149308177 markings, 199063153 edges, 763336 markings/sec, 185 secs
lola: sara is running 190 secs || sara is running 190 secs || 153083625 markings, 204097787 edges, 755090 markings/sec, 190 secs
lola: sara is running 195 secs || sara is running 195 secs || 156912920 markings, 209201538 edges, 765859 markings/sec, 195 secs
lola: sara is running 200 secs || sara is running 200 secs || 160667867 markings, 214208769 edges, 750989 markings/sec, 200 secs
lola: sara is running 205 secs || sara is running 205 secs || 163452882 markings, 217921155 edges, 557003 markings/sec, 205 secs
lola: sara is running 210 secs || sara is running 210 secs || 165896020 markings, 221180738 edges, 488628 markings/sec, 210 secs
lola: sara is running 215 secs || sara is running 215 secs || 168685568 markings, 224899920 edges, 557910 markings/sec, 215 secs
lola: sara is running 220 secs || sara is running 220 secs || 171620311 markings, 228811888 edges, 586949 markings/sec, 220 secs
lola: sara is running 225 secs || sara is running 225 secs || 173151055 markings, 230852929 edges, 306149 markings/sec, 225 secs
lola: sara is running 230 secs || sara is running 230 secs || 175313994 markings, 233737228 edges, 432588 markings/sec, 230 secs
lola: sara is running 235 secs || sara is running 235 secs || 177351027 markings, 236452677 edges, 407407 markings/sec, 235 secs
lola: sara is running 240 secs || sara is running 240 secs || 179465802 markings, 239271783 edges, 422955 markings/sec, 240 secs
lola: sara is running 245 secs || sara is running 245 secs || 181947549 markings, 242582230 edges, 496349 markings/sec, 245 secs
lola: sara is running 250 secs || sara is running 250 secs || 184159130 markings, 245529492 edges, 442316 markings/sec, 250 secs
lola: sara is running 255 secs || sara is running 255 secs || 186861326 markings, 249132650 edges, 540439 markings/sec, 255 secs
lola: sara is running 260 secs || sara is running 260 secs || 189123033 markings, 252149336 edges, 452341 markings/sec, 260 secs
lola: sara is running 265 secs || sara is running 265 secs || 191147212 markings, 254846264 edges, 404836 markings/sec, 265 secs
lola: sara is running 270 secs || sara is running 270 secs || 193539968 markings, 258036417 edges, 478551 markings/sec, 270 secs
lola: sara is running 275 secs || sara is running 275 secs || 196465024 markings, 261937715 edges, 585011 markings/sec, 275 secs
lola: sara is running 280 secs || sara is running 280 secs || 197248969 markings, 262983595 edges, 156789 markings/sec, 280 secs
lola: sara is running 285 secs || sara is running 285 secs || 199315490 markings, 265738273 edges, 413304 markings/sec, 285 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: E ((E (F ((2 <= p12))) U A (G ((1 <= p14)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: processed formula: E(EF((2 <= p12)) U AG((1 <= p14)))
lola: processed formula length: 34
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: 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: 3978329 markings, 5292300 edges, 795666 markings/sec, 0 secs
lola: 7274378 markings, 9686207 edges, 659210 markings/sec, 5 secs
lola: 11176719 markings, 14889524 edges, 780468 markings/sec, 10 secs
lola: 15074798 markings, 20086447 edges, 779616 markings/sec, 15 secs
lola: 18975156 markings, 25286789 edges, 780072 markings/sec, 20 secs
lola: 22845604 markings, 30447267 edges, 774090 markings/sec, 25 secs
lola: 26721334 markings, 35615669 edges, 775146 markings/sec, 30 secs
lola: 30526300 markings, 40687927 edges, 760993 markings/sec, 35 secs
lola: 34330777 markings, 45761923 edges, 760895 markings/sec, 40 secs
lola: 37796150 markings, 50382340 edges, 693075 markings/sec, 45 secs
lola: 41557066 markings, 55398452 edges, 752183 markings/sec, 50 secs
lola: 45235642 markings, 60301205 edges, 735715 markings/sec, 55 secs
lola: 48983094 markings, 65297196 edges, 749490 markings/sec, 60 secs
lola: 52593481 markings, 70112597 edges, 722077 markings/sec, 65 secs
lola: 56344283 markings, 75113612 edges, 750160 markings/sec, 70 secs
lola: 60039495 markings, 80041246 edges, 739042 markings/sec, 75 secs
lola: 63748802 markings, 84985020 edges, 741861 markings/sec, 80 secs
lola: 67395724 markings, 89847972 edges, 729384 markings/sec, 85 secs
lola: 70971585 markings, 94613952 edges, 715172 markings/sec, 90 secs
lola: 74586516 markings, 99436048 edges, 722986 markings/sec, 95 secs
lola: 78221165 markings, 104282842 edges, 726930 markings/sec, 100 secs
lola: 81807649 markings, 109062388 edges, 717297 markings/sec, 105 secs
lola: 85362256 markings, 113804121 edges, 710921 markings/sec, 110 secs
lola: 88947991 markings, 118582544 edges, 717147 markings/sec, 115 secs
lola: 92543921 markings, 123377007 edges, 719186 markings/sec, 120 secs
lola: 96178166 markings, 128222444 edges, 726849 markings/sec, 125 secs
lola: 99759130 markings, 132998712 edges, 716193 markings/sec, 130 secs
lola: 103380601 markings, 137825737 edges, 724294 markings/sec, 135 secs
lola: 106967699 markings, 142611206 edges, 717420 markings/sec, 140 secs
lola: 110573061 markings, 147416748 edges, 721072 markings/sec, 145 secs
lola: 114104920 markings, 152126680 edges, 706372 markings/sec, 150 secs
lola: 117642693 markings, 156843163 edges, 707555 markings/sec, 155 secs
lola: 120969395 markings, 161278410 edges, 665340 markings/sec, 160 secs
lola: 122388145 markings, 163171531 edges, 283750 markings/sec, 165 secs
lola: 125177310 markings, 166890783 edges, 557833 markings/sec, 170 secs
lola: 126151460 markings, 168186356 edges, 194830 markings/sec, 175 secs
lola: 127879148 markings, 170492334 edges, 345538 markings/sec, 180 secs
lola: 129680072 markings, 172893628 edges, 360185 markings/sec, 185 secs
lola: 132408097 markings, 176530532 edges, 545605 markings/sec, 190 secs
lola: 134748044 markings, 179650333 edges, 467989 markings/sec, 195 secs
lola: 136122370 markings, 181481753 edges, 274865 markings/sec, 200 secs
lola: 138678529 markings, 184890864 edges, 511232 markings/sec, 205 secs
lola: 140561521 markings, 187400257 edges, 376598 markings/sec, 210 secs
lola: 142401025 markings, 189854422 edges, 367901 markings/sec, 215 secs
lola: 144352340 markings, 192456297 edges, 390263 markings/sec, 220 secs
lola: 146260697 markings, 194998738 edges, 381671 markings/sec, 225 secs
lola: 147832329 markings, 197096107 edges, 314326 markings/sec, 230 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: E ((((p9 + 1 <= p7) AND (p0 + 1 <= p6)) U A (G ((p2 <= p4)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: processed formula: E(((p9 + 1 <= p7) AND (p0 + 1 <= p6)) U AG((p2 <= p4)))
lola: processed formula length: 55
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: 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: 3964199 markings, 5274333 edges, 792840 markings/sec, 0 secs
lola: 7904964 markings, 10527053 edges, 788153 markings/sec, 5 secs
lola: 11817487 markings, 15745643 edges, 782505 markings/sec, 10 secs
lola: 15646337 markings, 20848725 edges, 765770 markings/sec, 15 secs
lola: 19524867 markings, 26021327 edges, 775706 markings/sec, 20 secs
lola: 23153231 markings, 30858692 edges, 725673 markings/sec, 25 secs
lola: 27035255 markings, 36036157 edges, 776405 markings/sec, 30 secs
lola: 30863529 markings, 41138754 edges, 765655 markings/sec, 35 secs
lola: 34647139 markings, 46183979 edges, 756722 markings/sec, 40 secs
lola: 38345966 markings, 51117036 edges, 739765 markings/sec, 45 secs
lola: 42047082 markings, 56048523 edges, 740223 markings/sec, 50 secs
lola: 45717645 markings, 60944185 edges, 734113 markings/sec, 55 secs
lola: 49481169 markings, 65962819 edges, 752705 markings/sec, 60 secs
lola: 53223464 markings, 70952539 edges, 748459 markings/sec, 65 secs
lola: 56963305 markings, 75937112 edges, 747968 markings/sec, 70 secs
lola: 60654836 markings, 80859225 edges, 738306 markings/sec, 75 secs
lola: 64379102 markings, 85825438 edges, 744853 markings/sec, 80 secs
lola: 68039310 markings, 90705566 edges, 732042 markings/sec, 85 secs
lola: 71685918 markings, 95568308 edges, 729322 markings/sec, 90 secs
lola: 75195071 markings, 100247578 edges, 701831 markings/sec, 95 secs
lola: 78633655 markings, 104831554 edges, 687717 markings/sec, 100 secs
lola: 82256026 markings, 109659929 edges, 724474 markings/sec, 105 secs
lola: 85842025 markings, 114443749 edges, 717200 markings/sec, 110 secs
lola: 89409138 markings, 119199241 edges, 713423 markings/sec, 115 secs
lola: 93002865 markings, 123989651 edges, 718745 markings/sec, 120 secs
lola: 96672020 markings, 128883200 edges, 733831 markings/sec, 125 secs
lola: 100261521 markings, 133667272 edges, 717900 markings/sec, 130 secs
lola: 103884033 markings, 138497495 edges, 724502 markings/sec, 135 secs
lola: 107466960 markings, 143275070 edges, 716585 markings/sec, 140 secs
lola: 111089989 markings, 148104433 edges, 724606 markings/sec, 145 secs
lola: 114608646 markings, 152797243 edges, 703731 markings/sec, 150 secs
lola: 118170969 markings, 157545548 edges, 712465 markings/sec, 155 secs
lola: 120335469 markings, 160434662 edges, 432900 markings/sec, 160 secs
lola: 123056772 markings, 164060873 edges, 544261 markings/sec, 165 secs
lola: 125071005 markings, 166745257 edges, 402847 markings/sec, 170 secs
lola: 127069132 markings, 169412348 edges, 399625 markings/sec, 175 secs
lola: 127953166 markings, 170588355 edges, 176807 markings/sec, 180 secs
lola: 130413663 markings, 173868978 edges, 492099 markings/sec, 185 secs
lola: 131842763 markings, 175777158 edges, 285820 markings/sec, 190 secs
lola: 134709132 markings, 179596965 edges, 573274 markings/sec, 195 secs
lola: 135989110 markings, 181303643 edges, 255996 markings/sec, 200 secs
lola: 138368111 markings, 184475251 edges, 475800 markings/sec, 205 secs
lola: 140466168 markings, 187272231 edges, 419611 markings/sec, 210 secs
lola: 142604610 markings, 190124789 edges, 427688 markings/sec, 215 secs
lola: 144440133 markings, 192572981 edges, 367105 markings/sec, 220 secs
lola: 146444105 markings, 195243838 edges, 400794 markings/sec, 225 secs
lola: 147878841 markings, 197155871 edges, 286947 markings/sec, 230 secs
lola: 148013124 markings, 197337289 edges, 26857 markings/sec, 235 secs
lola: 148013152 markings, 197337331 edges, 6 markings/sec, 240 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: (A (G (A (F ((p12 <= p14))))) AND (E (G ((p1 <= 2))) OR E (F ((p2 <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: E (F ((p2 <= 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 ((p2 <= 2)))
lola: processed formula length: 17
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:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p2 <= 2)
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: 0 markings, 0 edges
lola: state equation: write sara problem file to CTLCardinality-18-0.sara
lola: state equation: calling and running sara
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (G (A (F ((p12 <= p14)))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence from all states
lola: rewrite Frontend/Parser/formula_rewrite.k:599
lola: rewrite Frontend/Parser/formula_rewrite.k:634
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (p14 + 1 <= p12)
lola: processed formula length: 16
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 /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:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p12 <= p14)
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: (p14 + 1 <= p12)
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
sara: try reading problem file CTLCardinality-18-0.sara.
lola: state equation: write sara problem file to CTLCardinality-19-0.sara
lola: state equation: write sara problem file to CTLCardinality-19-1.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-19-0.sara.
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-19-1.sara.
lola: state equation 1: solution produced
lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EFEG
lola: The predicate does not eventually occur from all states.
lola: 50009 markings, 50009 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: unknown yes yes unknown no unknown no yes unknown no no yes yes yes
lola:
preliminary result: unknown yes yes unknown no unknown no yes unknown no no yes yes yes
lola: memory consumption: 3520 KB
lola: time consumption: 2129 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="FMS-PT-10000"
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 FMS-PT-10000, 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-158987815400091"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FMS-PT-10000.tgz
mv FMS-PT-10000 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 '
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 ;