About the Execution of ITS-LoLa for Diffusion2D-PT-D05N350
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
15794.670 | 3600000.00 | 1880619.00 | 121388.60 | FF?T?TTTTT??TFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2020-input.r178-tajo-158987882300411.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is Diffusion2D-PT-D05N350, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-tajo-158987882300411
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 236K
-rw-r--r-- 1 mcc users 4.0K Mar 31 06:30 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 31 06:30 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 29 22:49 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 29 22:49 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.8K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Apr 8 14:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 8 14:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 28 14:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 28 14:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.8K Mar 27 07:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 22K Mar 27 07:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 28 14:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 28 14:50 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 8 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 55K 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 Diffusion2D-PT-D05N350-CTLCardinality-00
FORMULA_NAME Diffusion2D-PT-D05N350-CTLCardinality-01
FORMULA_NAME Diffusion2D-PT-D05N350-CTLCardinality-02
FORMULA_NAME Diffusion2D-PT-D05N350-CTLCardinality-03
FORMULA_NAME Diffusion2D-PT-D05N350-CTLCardinality-04
FORMULA_NAME Diffusion2D-PT-D05N350-CTLCardinality-05
FORMULA_NAME Diffusion2D-PT-D05N350-CTLCardinality-06
FORMULA_NAME Diffusion2D-PT-D05N350-CTLCardinality-07
FORMULA_NAME Diffusion2D-PT-D05N350-CTLCardinality-08
FORMULA_NAME Diffusion2D-PT-D05N350-CTLCardinality-09
FORMULA_NAME Diffusion2D-PT-D05N350-CTLCardinality-10
FORMULA_NAME Diffusion2D-PT-D05N350-CTLCardinality-11
FORMULA_NAME Diffusion2D-PT-D05N350-CTLCardinality-12
FORMULA_NAME Diffusion2D-PT-D05N350-CTLCardinality-13
FORMULA_NAME Diffusion2D-PT-D05N350-CTLCardinality-14
FORMULA_NAME Diffusion2D-PT-D05N350-CTLCardinality-15
=== Now, execution of the tool begins
BK_START 1591220020006
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 21:33:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-03 21:33:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 21:33:41] [INFO ] Load time of PNML (sax parser for PT used): 41 ms
[2020-06-03 21:33:41] [INFO ] Transformed 25 places.
[2020-06-03 21:33:41] [INFO ] Transformed 144 transitions.
[2020-06-03 21:33:41] [INFO ] Parsed PT model containing 25 places and 144 transitions in 77 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 13 ms.
Incomplete random walk after 100028 steps, including 0 resets, run finished after 33 ms. (steps per millisecond=3031 ) properties seen :[0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 0, 1, 1, 1]
// Phase 1: matrix 144 rows 25 cols
[2020-06-03 21:33:42] [INFO ] Computed 1 place invariants in 4 ms
[2020-06-03 21:33:42] [INFO ] [Real]Absence check using 1 positive place invariants in 12 ms returned sat
[2020-06-03 21:33:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 21:33:42] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2020-06-03 21:33:42] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 21:33:42] [INFO ] [Nat]Absence check using 1 positive place invariants in 6 ms returned sat
[2020-06-03 21:33:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 21:33:42] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2020-06-03 21:33:42] [INFO ] Computed and/alt/rep : 136/848/136 causal constraints in 16 ms.
[2020-06-03 21:33:42] [INFO ] Added : 131 causal constraints over 27 iterations in 339 ms. Result :sat
[2020-06-03 21:33:42] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2020-06-03 21:33:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 21:33:42] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2020-06-03 21:33:42] [INFO ] Computed and/alt/rep : 136/848/136 causal constraints in 8 ms.
[2020-06-03 21:33:42] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 21:33:42] [INFO ] [Nat]Absence check using 1 positive place invariants in 6 ms returned sat
[2020-06-03 21:33:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 21:33:42] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2020-06-03 21:33:42] [INFO ] Computed and/alt/rep : 136/848/136 causal constraints in 12 ms.
[2020-06-03 21:33:42] [INFO ] Added : 128 causal constraints over 26 iterations in 297 ms. Result :sat
[2020-06-03 21:33:43] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2020-06-03 21:33:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 21:33:43] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2020-06-03 21:33:43] [INFO ] Computed and/alt/rep : 136/848/136 causal constraints in 10 ms.
[2020-06-03 21:33:43] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 21:33:43] [INFO ] [Nat]Absence check using 1 positive place invariants in 5 ms returned sat
[2020-06-03 21:33:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 21:33:43] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2020-06-03 21:33:43] [INFO ] Computed and/alt/rep : 136/848/136 causal constraints in 9 ms.
[2020-06-03 21:33:43] [INFO ] Added : 128 causal constraints over 26 iterations in 284 ms. Result :sat
[2020-06-03 21:33:43] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2020-06-03 21:33:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 21:33:43] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2020-06-03 21:33:43] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 21:33:43] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2020-06-03 21:33:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 21:33:43] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2020-06-03 21:33:43] [INFO ] Computed and/alt/rep : 136/848/136 causal constraints in 7 ms.
[2020-06-03 21:33:43] [INFO ] Added : 129 causal constraints over 26 iterations in 290 ms. Result :sat
[2020-06-03 21:33:43] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2020-06-03 21:33:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 21:33:43] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2020-06-03 21:33:43] [INFO ] Computed and/alt/rep : 136/848/136 causal constraints in 8 ms.
[2020-06-03 21:33:43] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 21:33:43] [INFO ] [Nat]Absence check using 1 positive place invariants in 6 ms returned sat
[2020-06-03 21:33:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 21:33:43] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2020-06-03 21:33:43] [INFO ] Computed and/alt/rep : 136/848/136 causal constraints in 12 ms.
[2020-06-03 21:33:44] [INFO ] Added : 128 causal constraints over 26 iterations in 263 ms. Result :sat
[2020-06-03 21:33:44] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2020-06-03 21:33:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 21:33:44] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2020-06-03 21:33:44] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 21:33:44] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2020-06-03 21:33:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 21:33:44] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2020-06-03 21:33:44] [INFO ] Computed and/alt/rep : 136/848/136 causal constraints in 7 ms.
[2020-06-03 21:33:44] [INFO ] Added : 129 causal constraints over 26 iterations in 267 ms. Result :sat
[2020-06-03 21:33:44] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2020-06-03 21:33:44] [INFO ] Flatten gal took : 36 ms
[2020-06-03 21:33:44] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2020-06-03 21:33:44] [INFO ] Flatten gal took : 11 ms
FORMULA Diffusion2D-PT-D05N350-CTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Diffusion2D-PT-D05N350-CTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 21:33:44] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2020-06-03 21:33:44] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 3 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLCardinality @ Diffusion2D-PT-D05N350 @ 3570 seconds
FORMULA Diffusion2D-PT-D05N350-CTLCardinality-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Diffusion2D-PT-D05N350-CTLCardinality-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Diffusion2D-PT-D05N350-CTLCardinality-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Diffusion2D-PT-D05N350-CTLCardinality-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Diffusion2D-PT-D05N350-CTLCardinality-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Diffusion2D-PT-D05N350-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Diffusion2D-PT-D05N350-CTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Diffusion2D-PT-D05N350-CTLCardinality-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Diffusion2D-PT-D05N350-CTLCardinality-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Diffusion2D-PT-D05N350-CTLCardinality-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Diffusion2D-PT-D05N350-CTLCardinality-02 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Diffusion2D-PT-D05N350-CTLCardinality-04 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Diffusion2D-PT-D05N350-CTLCardinality-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Diffusion2D-PT-D05N350-CTLCardinality-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 1730
rslt: Output for CTLCardinality @ Diffusion2D-PT-D05N350
{
"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 21:33:46 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": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "((p10 <= p23) OR (3 <= p15) OR ((2 <= p8) AND (p18 <= p22)))",
"processed_size": 60,
"rewrites": 26
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 0,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "A (G ((((p8 <= p21) AND (p7 <= p24)) OR (p24 <= 2))))",
"processed_size": 54,
"rewrites": 25
},
"result":
{
"edges": 7,
"markings": 8,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 0,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "EF(AX(((1 <= p22) AND (1 <= p2))))",
"processed_size": 34,
"rewrites": 25
},
"net":
{
"conflict_clusters": 25,
"singleton_clusters": 0
},
"result":
{
"edges": 8807245,
"markings": 2691197,
"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"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 296
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 296
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"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": "((p5 <= 1))",
"processed_size": 11,
"rewrites": 23
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 2,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 323
},
"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": "(p16 <= 2)",
"processed_size": 10,
"rewrites": 23
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 3,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"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 ((p12 <= 1)))",
"processed_size": 18,
"rewrites": 24
},
"result":
{
"edges": 349,
"markings": 350,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 2,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 330
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "E (F (((p6 + 1 <= p23) AND (3 <= p2))))",
"processed_size": 39,
"rewrites": 24
},
"result":
{
"produced_by": "state equation",
"value": true
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 367
},
"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": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "E (F (((3 <= p15) AND (p10 <= 1) AND (p19 <= 1))))",
"processed_size": 50,
"rewrites": 24
},
"result":
{
"edges": 14,
"markings": 11,
"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": 3,
"problems": 3
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 413
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "A (G (((p18 <= 0) OR (p11 + 1 <= p12) OR (p6 + 1 <= p21) OR (p24 + 1 <= p18))))",
"processed_size": 82,
"rewrites": 25
},
"result":
{
"produced_by": "state equation",
"value": false
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 4
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 561
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 2,
"F": 0,
"G": 1,
"U": 1,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "E(EG((p22 <= p19)) U ((p10 <= p20) AND (3 <= p9) AND (p20 + 1 <= p19)))",
"processed_size": 71,
"rewrites": 25
},
"net":
{
"conflict_clusters": 25,
"singleton_clusters": 0
},
"result":
{
"edges": 317108,
"markings": 62969,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 701
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(3 <= p4)",
"processed_size": 9,
"rewrites": 27
},
"result":
{
"edges": 67532,
"markings": 23437,
"produced_by": "state space /EGEF",
"value": false
},
"task":
{
"compoundnumber": 10,
"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": 935
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 935
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(3 <= p24)",
"processed_size": 10,
"rewrites": 23
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 11,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 11,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1311
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "E ((((1 <= p0) OR (p14 <= p12)) U ((3 <= p23) AND (p7 <= p21) AND (p16 <= p5))))",
"processed_size": 81,
"rewrites": 26
},
"result":
{
"edges": 8215028,
"markings": 2622098,
"produced_by": "state space /EU",
"value": true
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "eu preserving",
"visible": 16
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3,
"problems": 3
},
"type": "existential_until",
"workflow": "stateequation"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2611
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2611
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (G (((p12 <= 1) OR (1 <= p15))))",
"processed_size": 35,
"rewrites": 25
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 13,
"type": "boolean"
}
},
{
"child":
[
{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(3 <= p24)",
"processed_size": 10,
"rewrites": 23
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 17,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 17,
"type": "boolean"
}
},
{
"child":
[
{
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (G (((p12 <= 1) OR (1 <= p15))))",
"processed_size": 35,
"rewrites": 25
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 18,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "E ((((p17 <= p6) OR (2 <= p21)) U ((3 <= p1) AND (3 <= p11))))",
"processed_size": 63,
"rewrites": 26
},
"result":
{
"edges": 111846,
"markings": 40691,
"produced_by": "state space /EU",
"value": true
},
"task":
{
"compoundnumber": 19,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "eu preserving",
"visible": 20
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "existential_until",
"workflow": "stateequation"
}
}
],
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 18,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 3636,
"runtime": 1840.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(A(G(**)) AND (** OR (E(X(**)) OR (** OR (** OR **))))) : A(F(A(G(*)))) : A(G(E(F(*)))) : E(F(A(X(**)))) : E(F((A(G(**)) AND A(F(**))))) : (E((** U **)) OR A(G(**))) : E((** U **)) : (** AND (E(F(**)) AND (E(X(**)) OR **))) : E(F(*)) : E(F(**)) : A(X(E(F(**)))) : (E(F(A(G(**)))) OR **) : E((E(G(**)) U **)) : A(G(*))"
},
"net":
{
"arcs": 288,
"conflict_clusters": 25,
"places": 25,
"places_significant": 24,
"singleton_clusters": 0,
"transitions": 144
},
"result":
{
"preliminary_value": "no no unknown yes unknown yes yes yes yes yes unknown unknown yes no ",
"value": "no no unknown yes unknown yes yes yes yes yes unknown unknown yes no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 169/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 800
lola: finding significant places
lola: 25 places, 144 transitions, 24 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from CTLCardinality.xml
lola: (A (G ((((p8 <= p21) AND (p7 <= p24)) OR (p24 <= 2)))) AND (((((p10 <= p16) OR E (X ((p0 <= p12)))) OR (p10 <= p23)) OR (3 <= p15)) OR ((2 <= p8) AND (p18 <= p22)))) : NOT(E (G (E (F ((3 <= p4)))))) : NOT(E (F (A (G ((p17 <= p16)))))) : E (F (A (X (((1 <= p22) AND (1 <= p2)))))) : E (F ((A (G ((1 <= p12))) AND A (F ((3 <= p20)))))) : (E ((((p17 <= p6) OR (2 <= p21)) U ((3 <= p1) AND (3 <= p11)))) OR A (G (((p12 <= 1) OR (1 <= p15))))) : E ((((1 <= p0) OR (p14 <= p12)) U ((3 <= p23) AND (p7 <= p21) AND (p16 <= p5)))) : (((p16 <= 2) AND E (F ((p12 <= 1)))) AND (E (X ((1 <= p18))) OR ((p5 <= 1)))) : NOT(A (G (((p15 <= 2) OR (2 <= p10) OR (2 <= p19))))) : E (F (((p6 + 1 <= p23) AND (3 <= p2)))) : A (X (E (F (((2 <= p24) AND (2 <= p18)))))) : (E (F (A (G ((p15 <= p20))))) OR (3 <= p24)) : E ((E (G ((p22 <= p19))) U ((p10 <= p20) AND (3 <= p9) AND (p20 + 1 <= p19)))) : NOT(E (F (((1 <= p18) AND (p12 <= p11) AND (p21 <= p6) AND (p18 <= p24)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
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:251
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:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G ((((p8 <= p21) AND (p7 <= p24)) OR (p24 <= 2)))) AND ((p10 <= p16) OR (E (X ((p0 <= p12))) OR ((p10 <= p23) OR ((3 <= p15) OR ((2 <= p8) AND (p18 <= p22)))))))
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: ((p10 <= p23) OR ((3 <= p15) OR ((2 <= p8) AND (p18 <= p22))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: processed formula: ((p10 <= p23) OR (3 <= p15) OR ((2 <= p8) AND (p18 <= p22)))
lola: processed formula length: 60
lola: 26 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 4 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((p8 <= p21) AND (p7 <= p24)) OR (p24 <= 2))))
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 ((((p8 <= p21) AND (p7 <= p24)) OR (p24 <= 2))))
lola: processed formula length: 54
lola: 25 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
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: SUBRESULT
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: (((p21 + 1 <= p8) OR (p24 + 1 <= p7)) AND (3 <= p24))
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 8 markings, 7 edges
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (X (((1 <= p22) AND (1 <= p2))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: processed formula: EF(AX(((1 <= p22) AND (1 <= p2))))
lola: processed formula length: 34
lola: 25 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: 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: 1839073 markings, 6059821 edges, 367815 markings/sec, 0 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 2691197 markings, 8807245 edges
lola: ========================================
lola: subprocess 2 will run for 296 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p16 <= 2) AND (E (F ((p12 <= 1))) AND (E (X ((1 <= p18))) OR ((p5 <= 1)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 296 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p5 <= 1))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p5 <= 1))
lola: processed formula length: 11
lola: 23 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 323 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p16 <= 2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p16 <= 2)
lola: processed formula length: 10
lola: 23 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 4 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((p12 <= 1)))
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 ((p12 <= 1)))
lola: processed formula length: 18
lola: 24 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
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: (p12 <= 1)
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: 350 markings, 349 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 3 will run for 323 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (E (F (((2 <= p24) AND (2 <= p18))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX(EF(((2 <= p24) AND (2 <= p18))))
lola: processed formula length: 35
lola: 25 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: 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: 2487448 markings, 8196150 edges, 497490 markings/sec, 0 secs
lola: 4836273 markings, 14998980 edges, 469765 markings/sec, 5 secs
lola: 7151576 markings, 21622461 edges, 463061 markings/sec, 10 secs
lola: 9432221 markings, 28044143 edges, 456129 markings/sec, 15 secs
lola: 11720598 markings, 34559337 edges, 457675 markings/sec, 20 secs
lola: 13801672 markings, 40446005 edges, 416215 markings/sec, 25 secs
lola: 16041082 markings, 46749414 edges, 447882 markings/sec, 30 secs
lola: 18276115 markings, 52975379 edges, 447007 markings/sec, 35 secs
lola: 20493705 markings, 59206685 edges, 443518 markings/sec, 40 secs
lola: 22760212 markings, 65558932 edges, 453301 markings/sec, 45 secs
lola: 25023184 markings, 71954468 edges, 452594 markings/sec, 50 secs
lola: 27126502 markings, 77844216 edges, 420664 markings/sec, 55 secs
lola: 29381405 markings, 84136459 edges, 450981 markings/sec, 60 secs
lola: 31528527 markings, 90211626 edges, 429424 markings/sec, 65 secs
lola: 33694758 markings, 96271479 edges, 433246 markings/sec, 70 secs
lola: 35794387 markings, 102099200 edges, 419926 markings/sec, 75 secs
lola: 38052565 markings, 108430783 edges, 451636 markings/sec, 80 secs
lola: 40295764 markings, 114694828 edges, 448640 markings/sec, 85 secs
lola: 42513439 markings, 120918135 edges, 443535 markings/sec, 90 secs
lola: 44783200 markings, 127309581 edges, 453952 markings/sec, 95 secs
lola: 47018105 markings, 133529404 edges, 446981 markings/sec, 100 secs
lola: 49250722 markings, 139727914 edges, 446523 markings/sec, 105 secs
lola: 51499271 markings, 145963284 edges, 449710 markings/sec, 110 secs
lola: 53766287 markings, 152255001 edges, 453403 markings/sec, 115 secs
lola: 55946025 markings, 158347649 edges, 435948 markings/sec, 120 secs
lola: 57878912 markings, 163729975 edges, 386577 markings/sec, 125 secs
lola: 59058340 markings, 166971148 edges, 235886 markings/sec, 130 secs
lola: 59473627 markings, 168126682 edges, 83057 markings/sec, 135 secs
lola: 60687549 markings, 171599338 edges, 242784 markings/sec, 140 secs
lola: 61595415 markings, 174159123 edges, 181573 markings/sec, 145 secs
lola: 62419201 markings, 176473342 edges, 164757 markings/sec, 150 secs
lola: 62887295 markings, 177783989 edges, 93619 markings/sec, 155 secs
lola: 64116300 markings, 181214109 edges, 245801 markings/sec, 160 secs
lola: 64406840 markings, 182021132 edges, 58108 markings/sec, 165 secs
lola: 64793123 markings, 183096782 edges, 77257 markings/sec, 170 secs
lola: 64956946 markings, 183556738 edges, 32765 markings/sec, 175 secs
lola: 65676347 markings, 185578885 edges, 143880 markings/sec, 180 secs
lola: 66224059 markings, 187103156 edges, 109542 markings/sec, 185 secs
lola: 67024470 markings, 189339267 edges, 160082 markings/sec, 190 secs
lola: 67901638 markings, 191801977 edges, 175434 markings/sec, 195 secs
lola: 68395878 markings, 193167313 edges, 98848 markings/sec, 200 secs
lola: 68869521 markings, 194482287 edges, 94729 markings/sec, 205 secs
lola: 69157180 markings, 195268477 edges, 57532 markings/sec, 210 secs
lola: 70052236 markings, 197797623 edges, 179011 markings/sec, 215 secs
lola: 70736466 markings, 199688923 edges, 136846 markings/sec, 220 secs
lola: 71240502 markings, 201090064 edges, 100807 markings/sec, 225 secs
lola: 71612495 markings, 202127128 edges, 74399 markings/sec, 230 secs
lola: 71661544 markings, 202266764 edges, 9810 markings/sec, 235 secs
lola: 71688169 markings, 202342544 edges, 5325 markings/sec, 240 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 330 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((p6 + 1 <= p23) AND (3 <= p2))))
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 (((p6 + 1 <= p23) AND (3 <= p2))))
lola: processed formula length: 39
lola: 24 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p6 + 1 <= p23) AND (3 <= p2))
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-4-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-4-0.sara.
sara: place or transition ordering is non-deterministic
lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 5 will run for 367 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= p15) AND (p10 <= 1) AND (p19 <= 1))))
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 (((3 <= p15) AND (p10 <= 1) AND (p19 <= 1))))
lola: processed formula length: 50
lola: 24 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((3 <= p15) AND (p10 <= 1) AND (p19 <= 1))
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-5-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-5-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 11 markings, 14 edges
lola: ========================================
lola: subprocess 6 will run for 413 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p18 <= 0) OR (p11 + 1 <= p12) OR (p6 + 1 <= p21) OR (p24 + 1 <= p18))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: A (G (((p18 <= 0) OR (p11 + 1 <= p12) OR (p6 + 1 <= p21) OR (p24 + 1 <= p18))))
lola: processed formula length: 82
lola: 25 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p18) AND (p12 <= p11) AND (p21 <= p6) AND (p18 <= p24))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-6-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-6-0.sara.
sara: place or transition ordering is non-deterministic
lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is not invariant.
lola: subprocess 7 will run for 472 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (G (E (F ((p16 + 1 <= p17)))))
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: (p16 + 1 <= p17)
lola: processed formula length: 16
lola: 26 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using tscc preserving stubborn set method (--stubborn)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 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: (p16 + 1 <= p17)
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p17 <= p16)
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-1.sara
lola: state equation: calling and running sara
lola: state equation: write sara problem file to CTLCardinality-7-0.sara
sara: try reading problem file CTLCardinality-7-1.sara.
sara: place or transition ordering is non-deterministic
lola: state equation: calling and running sara
lola: state equation 1: solution produced
sara: try reading problem file CTLCardinality-7-0.sara.
sara: place or transition ordering is non-deterministic
lola: state equation 0: solution produced
lola: sara is running 0 secs || sara is running 0 secs || 2785246 markings, 5587493 edges, 557049 markings/sec, 0 secs
lola: sara is running 5 secs || sara is running 5 secs || 5470596 markings, 11087156 edges, 537070 markings/sec, 5 secs
lola: sara is running 10 secs || sara is running 10 secs || 8163511 markings, 16614181 edges, 538583 markings/sec, 10 secs
lola: sara is running 15 secs || sara is running 15 secs || 10981409 markings, 22279282 edges, 563580 markings/sec, 15 secs
lola: sara is running 20 secs || sara is running 20 secs || 13614333 markings, 27757741 edges, 526585 markings/sec, 20 secs
lola: sara is running 25 secs || sara is running 25 secs || 16109116 markings, 32957745 edges, 498957 markings/sec, 25 secs
lola: sara is running 30 secs || sara is running 30 secs || 18569958 markings, 38101383 edges, 492168 markings/sec, 30 secs
lola: sara is running 35 secs || sara is running 35 secs || 21052718 markings, 43279840 edges, 496552 markings/sec, 35 secs
lola: sara is running 40 secs || sara is running 40 secs || 23416050 markings, 48215392 edges, 472666 markings/sec, 40 secs
lola: sara is running 45 secs || sara is running 45 secs || 25840121 markings, 53309236 edges, 484814 markings/sec, 45 secs
lola: sara is running 50 secs || sara is running 50 secs || 28294749 markings, 58497677 edges, 490926 markings/sec, 50 secs
lola: sara is running 55 secs || sara is running 55 secs || 30763282 markings, 63764780 edges, 493707 markings/sec, 55 secs
lola: sara is running 60 secs || sara is running 60 secs || 33191670 markings, 68965269 edges, 485678 markings/sec, 60 secs
lola: sara is running 65 secs || sara is running 65 secs || 35632849 markings, 74157551 edges, 488236 markings/sec, 65 secs
lola: sara is running 70 secs || sara is running 70 secs || 38463790 markings, 79829399 edges, 566188 markings/sec, 70 secs
lola: sara is running 75 secs || sara is running 75 secs || 41089420 markings, 85275886 edges, 525126 markings/sec, 75 secs
lola: sara is running 80 secs || sara is running 80 secs || 43622506 markings, 90594748 edges, 506617 markings/sec, 80 secs
lola: sara is running 85 secs || sara is running 85 secs || 46075003 markings, 95744997 edges, 490499 markings/sec, 85 secs
lola: sara is running 90 secs || sara is running 90 secs || 48733148 markings, 101098369 edges, 531629 markings/sec, 90 secs
lola: sara is running 95 secs || sara is running 95 secs || 51400527 markings, 106525340 edges, 533476 markings/sec, 95 secs
lola: sara is running 100 secs || sara is running 100 secs || 53883934 markings, 111750686 edges, 496681 markings/sec, 100 secs
lola: sara is running 105 secs || sara is running 105 secs || 56524575 markings, 117127635 edges, 528128 markings/sec, 105 secs
lola: sara is running 110 secs || sara is running 110 secs || 59192071 markings, 122546233 edges, 533499 markings/sec, 110 secs
lola: sara is running 115 secs || sara is running 115 secs || 61761404 markings, 127867464 edges, 513867 markings/sec, 115 secs
lola: sara is running 120 secs || sara is running 120 secs || 64444656 markings, 133313183 edges, 536650 markings/sec, 120 secs
lola: sara is running 125 secs || sara is running 125 secs || 66765163 markings, 138050876 edges, 464101 markings/sec, 125 secs
lola: sara is running 130 secs || sara is running 130 secs || 68129265 markings, 140888482 edges, 272820 markings/sec, 130 secs
lola: sara is running 135 secs || sara is running 135 secs || 69280481 markings, 143274919 edges, 230243 markings/sec, 135 secs
lola: sara is running 140 secs || sara is running 140 secs || 70558265 markings, 145935535 edges, 255557 markings/sec, 140 secs
lola: sara is running 145 secs || sara is running 145 secs || 71024343 markings, 146899717 edges, 93216 markings/sec, 145 secs
lola: sara is running 150 secs || sara is running 150 secs || 72344742 markings, 149630007 edges, 264080 markings/sec, 150 secs
lola: sara is running 155 secs || sara is running 155 secs || 72924160 markings, 150844473 edges, 115884 markings/sec, 155 secs
lola: sara is running 160 secs || sara is running 160 secs || 74524097 markings, 154207845 edges, 319987 markings/sec, 160 secs
lola: sara is running 165 secs || sara is running 165 secs || 74948600 markings, 155100826 edges, 84901 markings/sec, 165 secs
lola: sara is running 170 secs || sara is running 170 secs || 75696718 markings, 156666297 edges, 149624 markings/sec, 170 secs
lola: sara is running 175 secs || sara is running 175 secs || 76357115 markings, 158047390 edges, 132079 markings/sec, 175 secs
lola: sara is running 180 secs || sara is running 180 secs || 77880735 markings, 161224153 edges, 304724 markings/sec, 180 secs
lola: sara is running 185 secs || sara is running 185 secs || 78170128 markings, 161841298 edges, 57879 markings/sec, 185 secs
lola: sara is running 190 secs || sara is running 190 secs || 79106661 markings, 163817601 edges, 187307 markings/sec, 190 secs
lola: sara is running 195 secs || sara is running 195 secs || 80521961 markings, 166812653 edges, 283060 markings/sec, 195 secs
lola: sara is running 200 secs || sara is running 200 secs || 81768079 markings, 169436170 edges, 249224 markings/sec, 200 secs
lola: sara is running 205 secs || sara is running 205 secs || 82686188 markings, 171247596 edges, 183622 markings/sec, 205 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 8 will run for 514 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((A (G ((1 <= p12))) AND A (F ((3 <= p20))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: processed formula: EF((AG((1 <= p12)) AND AF((3 <= p20))))
lola: processed formula length: 39
lola: 26 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: 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: 1832028 markings, 7970529 edges, 366406 markings/sec, 0 secs
lola: 3436594 markings, 14774749 edges, 320913 markings/sec, 5 secs
lola: 5169423 markings, 21960390 edges, 346566 markings/sec, 10 secs
lola: 6858255 markings, 28977845 edges, 337766 markings/sec, 15 secs
lola: 8552074 markings, 35991505 edges, 338764 markings/sec, 20 secs
lola: 10212704 markings, 42915317 edges, 332126 markings/sec, 25 secs
lola: 11881984 markings, 49843344 edges, 333856 markings/sec, 30 secs
lola: 13548275 markings, 56760092 edges, 333258 markings/sec, 35 secs
lola: 15226441 markings, 63725355 edges, 335633 markings/sec, 40 secs
lola: 16764195 markings, 70108687 edges, 307551 markings/sec, 45 secs
lola: 18339052 markings, 76648688 edges, 314971 markings/sec, 50 secs
lola: 20002111 markings, 83563433 edges, 332612 markings/sec, 55 secs
lola: 21704789 markings, 90646660 edges, 340536 markings/sec, 60 secs
lola: 23339689 markings, 97455495 edges, 326980 markings/sec, 65 secs
lola: 25001922 markings, 104391690 edges, 332447 markings/sec, 70 secs
lola: 26684602 markings, 111370581 edges, 336536 markings/sec, 75 secs
lola: 28371272 markings, 118382335 edges, 337334 markings/sec, 80 secs
lola: 30043388 markings, 125333051 edges, 334423 markings/sec, 85 secs
lola: 31764816 markings, 132466952 edges, 344286 markings/sec, 90 secs
lola: 33399252 markings, 139284841 edges, 326887 markings/sec, 95 secs
lola: 35058684 markings, 146163105 edges, 331886 markings/sec, 100 secs
lola: 36710666 markings, 153025962 edges, 330396 markings/sec, 105 secs
lola: 38386751 markings, 160008152 edges, 335217 markings/sec, 110 secs
lola: 40028459 markings, 166848388 edges, 328342 markings/sec, 115 secs
lola: 41682601 markings, 173728210 edges, 330828 markings/sec, 120 secs
lola: 43291091 markings, 180457005 edges, 321698 markings/sec, 125 secs
lola: 44981464 markings, 187472782 edges, 338075 markings/sec, 130 secs
lola: 46620940 markings, 194313506 edges, 327895 markings/sec, 135 secs
lola: 48258329 markings, 201155111 edges, 327478 markings/sec, 140 secs
lola: 50034584 markings, 208546439 edges, 355251 markings/sec, 145 secs
lola: 51795589 markings, 215890243 edges, 352201 markings/sec, 150 secs
lola: 53447703 markings, 222767311 edges, 330423 markings/sec, 155 secs
lola: 55127008 markings, 229734188 edges, 335861 markings/sec, 160 secs
lola: 56751084 markings, 236535317 edges, 324815 markings/sec, 165 secs
lola: 58357867 markings, 243244877 edges, 321357 markings/sec, 170 secs
lola: 59328803 markings, 247300998 edges, 194187 markings/sec, 175 secs
lola: 60226069 markings, 251067541 edges, 179453 markings/sec, 180 secs
lola: 61327599 markings, 255650252 edges, 220306 markings/sec, 185 secs
lola: 62386772 markings, 260031357 edges, 211835 markings/sec, 190 secs
lola: 63312556 markings, 263875895 edges, 185157 markings/sec, 195 secs
lola: 64085498 markings, 267082359 edges, 154588 markings/sec, 200 secs
lola: 64710490 markings, 269680124 edges, 124998 markings/sec, 205 secs
lola: 65750664 markings, 274004664 edges, 208035 markings/sec, 210 secs
lola: 66349383 markings, 276507796 edges, 119744 markings/sec, 215 secs
lola: 67254790 markings, 280273220 edges, 181081 markings/sec, 220 secs
lola: 68010569 markings, 283405715 edges, 151156 markings/sec, 225 secs
lola: 68435219 markings, 285179842 edges, 84930 markings/sec, 230 secs
lola: 68840647 markings, 286879212 edges, 81086 markings/sec, 235 secs
lola: 69175800 markings, 288300328 edges, 67031 markings/sec, 240 secs
lola: 69753831 markings, 290717046 edges, 115606 markings/sec, 245 secs
lola: 70638091 markings, 294396858 edges, 176852 markings/sec, 250 secs
lola: 71237475 markings, 296881207 edges, 119877 markings/sec, 255 secs
lola: 71699804 markings, 298796734 edges, 92466 markings/sec, 260 secs
lola: 71775617 markings, 299111831 edges, 15163 markings/sec, 265 secs
lola: 71807537 markings, 299244999 edges, 6384 markings/sec, 270 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 9 will run for 561 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((E (G ((p22 <= p19))) U ((p10 <= p20) AND (3 <= p9) AND (p20 + 1 <= p19))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: processed formula: E(EG((p22 <= p19)) U ((p10 <= p20) AND (3 <= p9) AND (p20 + 1 <= p19)))
lola: processed formula length: 71
lola: 25 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 62969 markings, 317108 edges
lola: subprocess 10 will run for 701 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (F (A (G ((p4 <= 2)))))
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:788
lola: processed formula: (3 <= p4)
lola: processed formula length: 9
lola: 27 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 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: (3 <= p4)
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation task get result 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: (p4 <= 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: no
lola: produced by: state space /EGEF
lola: The predicate is not eventually invariant.
lola: 23437 markings, 67532 edges
lola: state equation: write sara problem file to CTLCardinality-10-1.sara
lola: state equation: calling and running sara
lola: state equation: write sara problem file to CTLCardinality-10-0.sara
lola: state equation: calling and running sara
lola: ========================================
lola: subprocess 11 will run for 935 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F (A (G ((p15 <= p20))))) OR (3 <= p24))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 935 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (3 <= p24)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= p24)
lola: processed formula length: 10
lola: 23 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 12 will run for 1403 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (G ((p15 <= p20)))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: rewrite Frontend/Parser/formula_rewrite.k:604
lola: rewrite Frontend/Parser/formula_rewrite.k:614
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (p20 + 1 <= p15)
lola: processed formula length: 16
lola: 27 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using tscc preserving stubborn set method (--stubborn)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: 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: (p20 + 1 <= p15)
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation task get result 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: (p15 <= p20)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
sara: try reading problem file CTLCardinality-10-1.sara.
sara: try reading problem file CTLCardinality-10-0.sara.
lola: state equation: write sara problem file to CTLCardinality-12-1.sara
lola: state equation: write sara problem file to CTLCardinality-12-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-12-1.sara.
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-12-0.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic
lola: state equation 0: solution produced
lola: state equation 1: solution produced
lola: sara is running 0 secs || sara is running 0 secs || 2420322 markings, 6450066 edges, 484064 markings/sec, 0 secs
lola: sara is running 5 secs || sara is running 5 secs || 5177592 markings, 13848733 edges, 551454 markings/sec, 5 secs
lola: sara is running 10 secs || sara is running 10 secs || 8003423 markings, 21431310 edges, 565166 markings/sec, 10 secs
lola: sara is running 15 secs || sara is running 15 secs || 10516096 markings, 28172641 edges, 502535 markings/sec, 15 secs
lola: sara is running 20 secs || sara is running 20 secs || 13145297 markings, 35226941 edges, 525840 markings/sec, 20 secs
lola: sara is running 25 secs || sara is running 25 secs || 15684090 markings, 42038976 edges, 507759 markings/sec, 25 secs
lola: sara is running 30 secs || sara is running 30 secs || 18278348 markings, 48999306 edges, 518852 markings/sec, 30 secs
lola: sara is running 35 secs || sara is running 35 secs || 20767889 markings, 55679355 edges, 497908 markings/sec, 35 secs
lola: sara is running 40 secs || sara is running 40 secs || 23134980 markings, 62030440 edges, 473418 markings/sec, 40 secs
lola: sara is running 45 secs || sara is running 45 secs || 25560813 markings, 68548543 edges, 485167 markings/sec, 45 secs
lola: sara is running 50 secs || sara is running 50 secs || 28040938 markings, 75203053 edges, 496025 markings/sec, 50 secs
lola: sara is running 55 secs || sara is running 55 secs || 30729782 markings, 82412917 edges, 537769 markings/sec, 55 secs
lola: sara is running 60 secs || sara is running 60 secs || 33381202 markings, 89523837 edges, 530284 markings/sec, 60 secs
lola: sara is running 65 secs || sara is running 65 secs || 36031399 markings, 96635485 edges, 530039 markings/sec, 65 secs
lola: sara is running 70 secs || sara is running 70 secs || 38472798 markings, 103187202 edges, 488280 markings/sec, 70 secs
lola: sara is running 75 secs || sara is running 75 secs || 40888124 markings, 109668170 edges, 483065 markings/sec, 75 secs
lola: sara is running 80 secs || sara is running 80 secs || 43341716 markings, 116251952 edges, 490718 markings/sec, 80 secs
lola: sara is running 85 secs || sara is running 85 secs || 45819772 markings, 122902106 edges, 495611 markings/sec, 85 secs
lola: sara is running 90 secs || sara is running 90 secs || 48415039 markings, 129866981 edges, 519053 markings/sec, 90 secs
lola: sara is running 95 secs || sara is running 95 secs || 50694359 markings, 135974149 edges, 455864 markings/sec, 95 secs
lola: sara is running 100 secs || sara is running 100 secs || 53126815 markings, 142502129 edges, 486491 markings/sec, 100 secs
lola: sara is running 105 secs || sara is running 105 secs || 55719865 markings, 149461431 edges, 518610 markings/sec, 105 secs
lola: sara is running 110 secs || sara is running 110 secs || 58315251 markings, 156419132 edges, 519077 markings/sec, 110 secs
lola: sara is running 115 secs || sara is running 115 secs || 60898946 markings, 163353705 edges, 516739 markings/sec, 115 secs
lola: sara is running 120 secs || sara is running 120 secs || 63186588 markings, 169485344 edges, 457528 markings/sec, 120 secs
lola: sara is running 125 secs || sara is running 125 secs || 64244547 markings, 172328234 edges, 211592 markings/sec, 125 secs
lola: sara is running 130 secs || sara is running 130 secs || 65765418 markings, 176407360 edges, 304174 markings/sec, 130 secs
lola: sara is running 135 secs || sara is running 135 secs || 67293906 markings, 180506826 edges, 305698 markings/sec, 135 secs
lola: sara is running 140 secs || sara is running 140 secs || 68871267 markings, 184736397 edges, 315472 markings/sec, 140 secs
lola: sara is running 145 secs || sara is running 145 secs || 70588612 markings, 189338290 edges, 343469 markings/sec, 145 secs
lola: sara is running 150 secs || sara is running 150 secs || 71982578 markings, 193076568 edges, 278793 markings/sec, 150 secs
lola: sara is running 155 secs || sara is running 155 secs || 73304346 markings, 196621603 edges, 264354 markings/sec, 155 secs
lola: sara is running 160 secs || sara is running 160 secs || 74848813 markings, 200765117 edges, 308893 markings/sec, 160 secs
lola: sara is running 165 secs || sara is running 165 secs || 76237024 markings, 204488379 edges, 277642 markings/sec, 165 secs
lola: sara is running 170 secs || sara is running 170 secs || 77406246 markings, 207623644 edges, 233844 markings/sec, 170 secs
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: subprocess 12 will run for 1311 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((((1 <= p0) OR (p14 <= p12)) U ((3 <= p23) AND (p7 <= p21) AND (p16 <= p5))))
lola: ========================================
lola: SUBTASK
lola: checking existential until
lola: rewrite Frontend/Parser/formula_rewrite.k:618
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: rewrite Frontend/Parser/formula_rewrite.k:738
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: E ((((1 <= p0) OR (p14 <= p12)) U ((3 <= p23) AND (p7 <= p21) AND (p16 <= p5))))
lola: processed formula length: 81
lola: 26 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EU)
lola: state space: using reachability graph (EU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((3 <= p23) AND (p7 <= p21) AND (p16 <= p5))
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-12-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-12-0.sara.
sara: place or transition ordering is non-deterministic
lola: state equation 0: solution produced
lola: sara is running 0 secs || 1233187 markings, 3870634 edges, 246637 markings/sec, 0 secs
lola: sara is running 5 secs || 2350584 markings, 7400038 edges, 223479 markings/sec, 5 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EU
lola: There is a path where Predicate Phi holds until Predicate Psi.
lola: 2622098 markings, 8215028 edges
lola: ========================================
lola: subprocess 13 will run for 2611 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E ((((p17 <= p6) OR (2 <= p21)) U ((3 <= p1) AND (3 <= p11)))) OR A (G (((p12 <= 1) OR (1 <= p15)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 2611 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p12 <= 1) OR (1 <= p15))))
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 (((p12 <= 1) OR (1 <= p15))))
lola: processed formula length: 35
lola: 25 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((2 <= p12) AND (p15 <= 0))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (X (E (F (((2 <= p24) AND (2 <= p18))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX(EF(((2 <= p24) AND (2 <= p18))))
lola: processed formula length: 35
lola: 25 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: 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: 2040621 markings, 6725064 edges, 408124 markings/sec, 0 secs
lola: 3645911 markings, 11593651 edges, 321058 markings/sec, 5 secs
lola: 5872559 markings, 17947872 edges, 445330 markings/sec, 10 secs
lola: 8146762 markings, 24433845 edges, 454841 markings/sec, 15 secs
lola: 10418606 markings, 30857188 edges, 454369 markings/sec, 20 secs
lola: 12719191 markings, 37391131 edges, 460117 markings/sec, 25 secs
lola: 14995873 markings, 43813116 edges, 455336 markings/sec, 30 secs
lola: 17016544 markings, 49459206 edges, 404134 markings/sec, 35 secs
lola: 19144972 markings, 55410016 edges, 425686 markings/sec, 40 secs
lola: 21413127 markings, 61780499 edges, 453631 markings/sec, 45 secs
lola: 23486935 markings, 67630842 edges, 414762 markings/sec, 50 secs
lola: 25565302 markings, 73474515 edges, 415673 markings/sec, 55 secs
lola: 27672923 markings, 79377543 edges, 421524 markings/sec, 60 secs
lola: 29850737 markings, 85481504 edges, 435563 markings/sec, 65 secs
lola: 32135573 markings, 91916053 edges, 456967 markings/sec, 70 secs
lola: 34365123 markings, 98123837 edges, 445910 markings/sec, 75 secs
lola: 36614453 markings, 104395975 edges, 449866 markings/sec, 80 secs
lola: 38834653 markings, 110597936 edges, 444040 markings/sec, 85 secs
lola: 41009228 markings, 116710052 edges, 434915 markings/sec, 90 secs
lola: 43164004 markings, 122721627 edges, 430955 markings/sec, 95 secs
lola: 45394833 markings, 129040486 edges, 446166 markings/sec, 100 secs
lola: 47198539 markings, 134026600 edges, 360741 markings/sec, 105 secs
lola: 49095980 markings, 139293379 edges, 379488 markings/sec, 110 secs
lola: 51238837 markings, 145247431 edges, 428571 markings/sec, 115 secs
lola: 53435132 markings, 151337688 edges, 439259 markings/sec, 120 secs
lola: 55421623 markings, 156891113 edges, 397298 markings/sec, 125 secs
lola: 57351245 markings, 162220353 edges, 385924 markings/sec, 130 secs
lola: 59000778 markings, 166813349 edges, 329907 markings/sec, 135 secs
lola: 60573474 markings, 171276757 edges, 314539 markings/sec, 140 secs
lola: 61719730 markings, 174507454 edges, 229251 markings/sec, 145 secs
lola: 62815302 markings, 177587740 edges, 219114 markings/sec, 150 secs
lola: 63964831 markings, 180800337 edges, 229906 markings/sec, 155 secs
lola: 65015461 markings, 183716708 edges, 210126 markings/sec, 160 secs
lola: 65979261 markings, 186423045 edges, 192760 markings/sec, 165 secs
lola: 66870195 markings, 188901153 edges, 178187 markings/sec, 170 secs
lola: 67903129 markings, 191806104 edges, 206587 markings/sec, 175 secs
lola: 68601900 markings, 193741778 edges, 139754 markings/sec, 180 secs
lola: 68976549 markings, 194776803 edges, 74930 markings/sec, 185 secs
lola: 69419122 markings, 195986703 edges, 88515 markings/sec, 190 secs
lola: 70320956 markings, 198545287 edges, 180367 markings/sec, 195 secs
lola: 71275762 markings, 201185979 edges, 190961 markings/sec, 200 secs
lola: 71620673 markings, 202151234 edges, 68982 markings/sec, 205 secs
lola: 71720709 markings, 202438819 edges, 20007 markings/sec, 210 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: A (G (E (F ((p16 + 1 <= p17)))))
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: (p16 + 1 <= p17)
lola: processed formula length: 16
lola: 26 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using tscc preserving stubborn set method (--stubborn)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 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: (p16 + 1 <= p17)
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p17 <= p16)
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-15-1.sara
lola: state equation: calling and running sara
lola: state equation: write sara problem file to CTLCardinality-15-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-15-0.sara.
sara: try reading problem file CTLCardinality-15-1.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic
lola: state equation 1: solution produced
lola: state equation 0: solution produced
lola: sara is running 0 secs || sara is running 0 secs || 2302883 markings, 4591417 edges, 460577 markings/sec, 0 secs
lola: sara is running 5 secs || sara is running 5 secs || 4988381 markings, 10082328 edges, 537100 markings/sec, 5 secs
lola: sara is running 10 secs || sara is running 10 secs || 7016726 markings, 14300542 edges, 405669 markings/sec, 10 secs
lola: sara is running 15 secs || sara is running 15 secs || 9645715 markings, 19570130 edges, 525798 markings/sec, 15 secs
lola: sara is running 20 secs || sara is running 20 secs || 12351063 markings, 25114557 edges, 541070 markings/sec, 20 secs
lola: sara is running 25 secs || sara is running 25 secs || 14873884 markings, 30383380 edges, 504564 markings/sec, 25 secs
lola: sara is running 30 secs || sara is running 30 secs || 17355775 markings, 35558586 edges, 496378 markings/sec, 30 secs
lola: sara is running 35 secs || sara is running 35 secs || 19591260 markings, 40218000 edges, 447097 markings/sec, 35 secs
lola: sara is running 40 secs || sara is running 40 secs || 21902479 markings, 45038723 edges, 462244 markings/sec, 40 secs
lola: sara is running 45 secs || sara is running 45 secs || 24142148 markings, 49747983 edges, 447934 markings/sec, 45 secs
lola: sara is running 50 secs || sara is running 50 secs || 26375866 markings, 54447207 edges, 446744 markings/sec, 50 secs
lola: sara is running 55 secs || sara is running 55 secs || 28606463 markings, 59150713 edges, 446119 markings/sec, 55 secs
lola: sara is running 60 secs || sara is running 60 secs || 30699013 markings, 63622127 edges, 418510 markings/sec, 60 secs
lola: sara is running 65 secs || sara is running 65 secs || 32877765 markings, 68301045 edges, 435750 markings/sec, 65 secs
lola: sara is running 70 secs || sara is running 70 secs || 35281708 markings, 73448161 edges, 480789 markings/sec, 70 secs
lola: sara is running 75 secs || sara is running 75 secs || 38075518 markings, 79059155 edges, 558762 markings/sec, 75 secs
lola: sara is running 80 secs || sara is running 80 secs || 40705949 markings, 84462316 edges, 526086 markings/sec, 80 secs
lola: sara is running 85 secs || sara is running 85 secs || 43236519 markings, 89784655 edges, 506114 markings/sec, 85 secs
lola: sara is running 90 secs || sara is running 90 secs || 45642926 markings, 94839143 edges, 481281 markings/sec, 90 secs
lola: sara is running 95 secs || sara is running 95 secs || 48271733 markings, 100185151 edges, 525761 markings/sec, 95 secs
lola: sara is running 100 secs || sara is running 100 secs || 50895037 markings, 105491577 edges, 524661 markings/sec, 100 secs
lola: sara is running 105 secs || sara is running 105 secs || 53280552 markings, 110483201 edges, 477103 markings/sec, 105 secs
lola: sara is running 110 secs || sara is running 110 secs || 55836526 markings, 115776422 edges, 511195 markings/sec, 110 secs
lola: sara is running 115 secs || sara is running 115 secs || 58586462 markings, 121294320 edges, 549987 markings/sec, 115 secs
lola: sara is running 120 secs || sara is running 120 secs || 61093045 markings, 126471173 edges, 501317 markings/sec, 120 secs
lola: sara is running 125 secs || sara is running 125 secs || 63781205 markings, 131991263 edges, 537632 markings/sec, 125 secs
lola: sara is running 130 secs || sara is running 130 secs || 66448952 markings, 137388967 edges, 533549 markings/sec, 130 secs
lola: sara is running 135 secs || sara is running 135 secs || 68047088 markings, 140720564 edges, 319627 markings/sec, 135 secs
lola: sara is running 140 secs || sara is running 140 secs || 69634835 markings, 144012898 edges, 317549 markings/sec, 140 secs
lola: sara is running 145 secs || sara is running 145 secs || 71249257 markings, 147369701 edges, 322884 markings/sec, 145 secs
lola: sara is running 150 secs || sara is running 150 secs || 73140974 markings, 151291578 edges, 378343 markings/sec, 150 secs
lola: sara is running 155 secs || sara is running 155 secs || 74676943 markings, 154524345 edges, 307194 markings/sec, 155 secs
lola: sara is running 160 secs || sara is running 160 secs || 76410017 markings, 158160289 edges, 346615 markings/sec, 160 secs
lola: sara is running 165 secs || sara is running 165 secs || 78005040 markings, 161490549 edges, 319005 markings/sec, 165 secs
lola: sara is running 170 secs || sara is running 170 secs || 79764237 markings, 165208069 edges, 351839 markings/sec, 170 secs
lola: sara is running 175 secs || sara is running 175 secs || 81392672 markings, 168660781 edges, 325687 markings/sec, 175 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: E (F ((A (G ((1 <= p12))) AND A (F ((3 <= p20))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: processed formula: EF((AG((1 <= p12)) AND AF((3 <= p20))))
lola: processed formula length: 39
lola: 26 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: 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: 1867879 markings, 8126526 edges, 373576 markings/sec, 0 secs
lola: 3576223 markings, 15351922 edges, 341669 markings/sec, 5 secs
lola: 5309569 markings, 22541797 edges, 346669 markings/sec, 10 secs
lola: 6851523 markings, 28950335 edges, 308391 markings/sec, 15 secs
lola: 8313065 markings, 35007918 edges, 292308 markings/sec, 20 secs
lola: 9681037 markings, 40693764 edges, 273594 markings/sec, 25 secs
lola: 11224350 markings, 47111904 edges, 308663 markings/sec, 30 secs
lola: 12834136 markings, 53798417 edges, 321957 markings/sec, 35 secs
lola: 14528831 markings, 60826476 edges, 338939 markings/sec, 40 secs
lola: 16016563 markings, 67004767 edges, 297546 markings/sec, 45 secs
lola: 17462125 markings, 73005326 edges, 289112 markings/sec, 50 secs
lola: 19114423 markings, 79874101 edges, 330460 markings/sec, 55 secs
lola: 20783095 markings, 86819393 edges, 333734 markings/sec, 60 secs
lola: 22435610 markings, 93701571 edges, 330503 markings/sec, 65 secs
lola: 24095834 markings, 100601843 edges, 332045 markings/sec, 70 secs
lola: 25577399 markings, 106779621 edges, 296313 markings/sec, 75 secs
lola: 27102343 markings, 113106644 edges, 304989 markings/sec, 80 secs
lola: 28720532 markings, 119836926 edges, 323638 markings/sec, 85 secs
lola: 30372843 markings, 126701358 edges, 330462 markings/sec, 90 secs
lola: 31941164 markings, 133198875 edges, 313664 markings/sec, 95 secs
lola: 33557653 markings, 139947062 edges, 323298 markings/sec, 100 secs
lola: 35208457 markings, 146787714 edges, 330161 markings/sec, 105 secs
lola: 36868539 markings, 153681772 edges, 332016 markings/sec, 110 secs
lola: 38516171 markings, 160553559 edges, 329526 markings/sec, 115 secs
lola: 40152435 markings, 167364685 edges, 327253 markings/sec, 120 secs
lola: 41807034 markings, 174243624 edges, 330920 markings/sec, 125 secs
lola: 43423537 markings, 181008285 edges, 323301 markings/sec, 130 secs
lola: 45117973 markings, 188037646 edges, 338887 markings/sec, 135 secs
lola: 46596906 markings, 194212009 edges, 295787 markings/sec, 140 secs
lola: 48064099 markings, 200344022 edges, 293439 markings/sec, 145 secs
lola: 49682765 markings, 207086988 edges, 323733 markings/sec, 150 secs
lola: 51293647 markings, 213801024 edges, 322176 markings/sec, 155 secs
lola: 52943029 markings, 220656607 edges, 329876 markings/sec, 160 secs
lola: 54433159 markings, 226857351 edges, 298026 markings/sec, 165 secs
lola: 55964128 markings, 233216888 edges, 306194 markings/sec, 170 secs
lola: 57564502 markings, 239929671 edges, 320075 markings/sec, 175 secs
lola: 58920105 markings, 245604014 edges, 271121 markings/sec, 180 secs
lola: 59699931 markings, 248873406 edges, 155965 markings/sec, 185 secs
lola: 60610321 markings, 252676867 edges, 182078 markings/sec, 190 secs
lola: 61578873 markings, 256692924 edges, 193710 markings/sec, 195 secs
lola: 62645038 markings, 261104239 edges, 213233 markings/sec, 200 secs
lola: 63705962 markings, 265497309 edges, 212185 markings/sec, 205 secs
lola: 64434702 markings, 268529031 edges, 145748 markings/sec, 210 secs
lola: 65300581 markings, 272128443 edges, 173176 markings/sec, 215 secs
lola: 66012456 markings, 275096233 edges, 142375 markings/sec, 220 secs
lola: 66613582 markings, 277606404 edges, 120225 markings/sec, 225 secs
lola: 67452955 markings, 281092473 edges, 167875 markings/sec, 230 secs
lola: 68300491 markings, 284609447 edges, 169507 markings/sec, 235 secs
lola: 68847107 markings, 286905654 edges, 109323 markings/sec, 240 secs
lola: 69139273 markings, 288146802 edges, 58433 markings/sec, 245 secs
lola: 69615828 markings, 290143006 edges, 95311 markings/sec, 250 secs
lola: 70317421 markings, 293068292 edges, 140319 markings/sec, 255 secs
lola: 70908495 markings, 295513951 edges, 118215 markings/sec, 260 secs
lola: 71573401 markings, 298275020 edges, 132981 markings/sec, 265 secs
lola: 71812629 markings, 299266106 edges, 47846 markings/sec, 270 secs
lola: 71882818 markings, 299559380 edges, 14038 markings/sec, 275 secs
lola: 72228345 markings, 300991530 edges, 69105 markings/sec, 280 secs
lola: 72422076 markings, 301812869 edges, 38746 markings/sec, 285 secs
lola: 72513045 markings, 302198110 edges, 18194 markings/sec, 290 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: (E (F (A (G ((p15 <= p20))))) OR (3 <= p24))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: (3 <= p24)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= p24)
lola: processed formula length: 10
lola: 23 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (F (A (G ((p15 <= p20)))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: rewrite Frontend/Parser/formula_rewrite.k:604
lola: rewrite Frontend/Parser/formula_rewrite.k:614
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (p20 + 1 <= p15)
lola: processed formula length: 16
lola: 27 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using tscc preserving stubborn set method (--stubborn)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 1
lola: state equation task get result started, id 0
lola: state equation task get result unparse finished++ id 1
lola: formula 1: (p20 + 1 <= p15)
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: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p15 <= p20)
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-18-1.sara
lola: state equation: calling and running sara
lola: state equation: write sara problem file to CTLCardinality-18-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-18-1.sara.
sara: try reading problem file CTLCardinality-18-0.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic
lola: state equation 1: solution produced
lola: state equation 0: solution produced
lola: sara is running 0 secs || sara is running 0 secs || 2336060 markings, 6225618 edges, 467212 markings/sec, 0 secs
lola: sara is running 5 secs || sara is running 5 secs || 4887913 markings, 13070084 edges, 510371 markings/sec, 5 secs
lola: sara is running 10 secs || sara is running 10 secs || 7634670 markings, 20440357 edges, 549351 markings/sec, 10 secs
lola: sara is running 15 secs || sara is running 15 secs || 10374421 markings, 27791989 edges, 547950 markings/sec, 15 secs
lola: sara is running 20 secs || sara is running 20 secs || 12938376 markings, 34671512 edges, 512791 markings/sec, 20 secs
lola: sara is running 25 secs || sara is running 25 secs || 15493322 markings, 41526519 edges, 510989 markings/sec, 25 secs
lola: sara is running 30 secs || sara is running 30 secs || 17943861 markings, 48100980 edges, 490108 markings/sec, 30 secs
lola: sara is running 35 secs || sara is running 35 secs || 20198838 markings, 54160422 edges, 450995 markings/sec, 35 secs
lola: sara is running 40 secs || sara is running 40 secs || 22619608 markings, 60655150 edges, 484154 markings/sec, 40 secs
lola: sara is running 45 secs || sara is running 45 secs || 24956847 markings, 66925680 edges, 467448 markings/sec, 45 secs
lola: sara is running 50 secs || sara is running 50 secs || 27444607 markings, 73600807 edges, 497552 markings/sec, 50 secs
lola: sara is running 55 secs || sara is running 55 secs || 30123111 markings, 80788524 edges, 535701 markings/sec, 55 secs
lola: sara is running 60 secs || sara is running 60 secs || 32754026 markings, 87848318 edges, 526183 markings/sec, 60 secs
lola: sara is running 65 secs || sara is running 65 secs || 35365963 markings, 94857329 edges, 522387 markings/sec, 65 secs
lola: sara is running 70 secs || sara is running 70 secs || 37976510 markings, 101853767 edges, 522109 markings/sec, 70 secs
lola: sara is running 75 secs || sara is running 75 secs || 40620850 markings, 108949784 edges, 528868 markings/sec, 75 secs
lola: sara is running 80 secs || sara is running 80 secs || 43230766 markings, 115954236 edges, 521983 markings/sec, 80 secs
lola: sara is running 85 secs || sara is running 85 secs || 45689186 markings, 122551093 edges, 491684 markings/sec, 85 secs
lola: sara is running 90 secs || sara is running 90 secs || 48204162 markings, 129300148 edges, 502995 markings/sec, 90 secs
lola: sara is running 95 secs || sara is running 95 secs || 50733582 markings, 136079364 edges, 505884 markings/sec, 95 secs
lola: sara is running 100 secs || sara is running 100 secs || 53289319 markings, 142938894 edges, 511147 markings/sec, 100 secs
lola: sara is running 105 secs || sara is running 105 secs || 55582031 markings, 149091070 edges, 458542 markings/sec, 105 secs
lola: sara is running 110 secs || sara is running 110 secs || 57990592 markings, 155550547 edges, 481712 markings/sec, 110 secs
lola: sara is running 115 secs || sara is running 115 secs || 60582350 markings, 162503337 edges, 518352 markings/sec, 115 secs
lola: sara is running 120 secs || sara is running 120 secs || 63058351 markings, 169140302 edges, 495200 markings/sec, 120 secs
lola: sara is running 125 secs || sara is running 125 secs || 64231133 markings, 172292163 edges, 234556 markings/sec, 125 secs
lola: sara is running 130 secs || sara is running 130 secs || 65705618 markings, 176246449 edges, 294897 markings/sec, 130 secs
lola: sara is running 135 secs || sara is running 135 secs || 67460203 markings, 180953088 edges, 350917 markings/sec, 135 secs
lola: sara is running 140 secs || sara is running 140 secs || 68994334 markings, 185061237 edges, 306826 markings/sec, 140 secs
lola: sara is running 145 secs || sara is running 145 secs || 70813787 markings, 189943430 edges, 363891 markings/sec, 145 secs
lola: sara is running 150 secs || sara is running 150 secs || 72017431 markings, 193170331 edges, 240729 markings/sec, 150 secs
lola: sara is running 155 secs || sara is running 155 secs || 73341077 markings, 196720562 edges, 264729 markings/sec, 155 secs
lola: sara is running 160 secs || sara is running 160 secs || 74442308 markings, 199672394 edges, 220246 markings/sec, 160 secs
lola: sara is running 165 secs || sara is running 165 secs || 76288354 markings, 204626403 edges, 369209 markings/sec, 165 secs
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (E ((((p17 <= p6) OR (2 <= p21)) U ((3 <= p1) AND (3 <= p11)))) OR A (G (((p12 <= 1) OR (1 <= p15)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: A (G (((p12 <= 1) OR (1 <= p15))))
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 (((p12 <= 1) OR (1 <= p15))))
lola: processed formula length: 35
lola: 25 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((2 <= p12) AND (p15 <= 0))
lola: state equation task get result unparse finished id 0
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E ((((p17 <= p6) OR (2 <= p21)) U ((3 <= p1) AND (3 <= p11))))
lola: ========================================
lola: SUBTASK
lola: checking existential until
lola: rewrite Frontend/Parser/formula_rewrite.k:618
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: rewrite Frontend/Parser/formula_rewrite.k:738
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: E ((((p17 <= p6) OR (2 <= p21)) U ((3 <= p1) AND (3 <= p11))))
lola: processed formula length: 63
lola: 26 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EU)
lola: state space: using reachability graph (EU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((3 <= p1) AND (3 <= p11))
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-19-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-19-0.sara.
sara: place or transition ordering is non-deterministic
lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EU
lola: There is a path where Predicate Phi holds until Predicate Psi.
lola: 40691 markings, 111846 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no unknown yes unknown yes yes yes yes yes unknown unknown yes no
lola:
preliminary result: no no unknown yes unknown yes yes yes yes yes unknown unknown yes no
lola: memory consumption: 3636 KB
lola: time consumption: 1840 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="Diffusion2D-PT-D05N350"
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 Diffusion2D-PT-D05N350, 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 r178-tajo-158987882300411"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Diffusion2D-PT-D05N350.tgz
mv Diffusion2D-PT-D05N350 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 ;