About the Execution of ITS-LoLa for Diffusion2D-PT-D05N300
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
15797.860 | 3600000.00 | 1342459.00 | 77634.20 | TT?F?T?TTTFTTFFF | 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-158987882300403.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-D05N300, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-tajo-158987882300403
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 256K
-rw-r--r-- 1 mcc users 3.5K Mar 31 06:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 31 06:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.3K Mar 29 22:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 21K Mar 29 22:48 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.9K 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.4K 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.6K Mar 28 14:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 28 14:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.1K Mar 27 07:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 25K 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-D05N300-CTLCardinality-00
FORMULA_NAME Diffusion2D-PT-D05N300-CTLCardinality-01
FORMULA_NAME Diffusion2D-PT-D05N300-CTLCardinality-02
FORMULA_NAME Diffusion2D-PT-D05N300-CTLCardinality-03
FORMULA_NAME Diffusion2D-PT-D05N300-CTLCardinality-04
FORMULA_NAME Diffusion2D-PT-D05N300-CTLCardinality-05
FORMULA_NAME Diffusion2D-PT-D05N300-CTLCardinality-06
FORMULA_NAME Diffusion2D-PT-D05N300-CTLCardinality-07
FORMULA_NAME Diffusion2D-PT-D05N300-CTLCardinality-08
FORMULA_NAME Diffusion2D-PT-D05N300-CTLCardinality-09
FORMULA_NAME Diffusion2D-PT-D05N300-CTLCardinality-10
FORMULA_NAME Diffusion2D-PT-D05N300-CTLCardinality-11
FORMULA_NAME Diffusion2D-PT-D05N300-CTLCardinality-12
FORMULA_NAME Diffusion2D-PT-D05N300-CTLCardinality-13
FORMULA_NAME Diffusion2D-PT-D05N300-CTLCardinality-14
FORMULA_NAME Diffusion2D-PT-D05N300-CTLCardinality-15
=== Now, execution of the tool begins
BK_START 1591219825178
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 21:30:27] [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:30:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 21:30:27] [INFO ] Load time of PNML (sax parser for PT used): 39 ms
[2020-06-03 21:30:27] [INFO ] Transformed 25 places.
[2020-06-03 21:30:27] [INFO ] Transformed 144 transitions.
[2020-06-03 21:30:27] [INFO ] Parsed PT model containing 25 places and 144 transitions in 95 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 48 ms.
Incomplete random walk after 100237 steps, including 0 resets, run finished after 65 ms. (steps per millisecond=1542 ) properties seen :[0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0]
// Phase 1: matrix 144 rows 25 cols
[2020-06-03 21:30:27] [INFO ] Computed 1 place invariants in 17 ms
[2020-06-03 21:30:28] [INFO ] [Real]Absence check using 1 positive place invariants in 19 ms returned sat
[2020-06-03 21:30:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 21:30:28] [INFO ] [Real]Absence check using state equation in 117 ms returned sat
[2020-06-03 21:30:28] [INFO ] Computed and/alt/rep : 136/848/136 causal constraints in 18 ms.
[2020-06-03 21:30:28] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 21:30:28] [INFO ] [Nat]Absence check using 1 positive place invariants in 14 ms returned sat
[2020-06-03 21:30:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 21:30:28] [INFO ] [Nat]Absence check using state equation in 132 ms returned sat
[2020-06-03 21:30:28] [INFO ] Computed and/alt/rep : 136/848/136 causal constraints in 42 ms.
[2020-06-03 21:30:29] [INFO ] Added : 129 causal constraints over 26 iterations in 719 ms. Result :sat
[2020-06-03 21:30:29] [INFO ] [Real]Absence check using 1 positive place invariants in 26 ms returned unsat
Successfully simplified 1 atomic propositions for a total of 1 simplifications.
[2020-06-03 21:30:29] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2020-06-03 21:30:29] [INFO ] Flatten gal took : 66 ms
[2020-06-03 21:30:29] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2020-06-03 21:30:29] [INFO ] Flatten gal took : 15 ms
FORMULA Diffusion2D-PT-D05N300-CTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Diffusion2D-PT-D05N300-CTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Diffusion2D-PT-D05N300-CTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Diffusion2D-PT-D05N300-CTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Diffusion2D-PT-D05N300-CTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 21:30:29] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLCardinality.sr.xml took 10 ms.
[2020-06-03 21:30:29] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 4 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLCardinality @ Diffusion2D-PT-D05N300 @ 3570 seconds
FORMULA Diffusion2D-PT-D05N300-CTLCardinality-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Diffusion2D-PT-D05N300-CTLCardinality-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Diffusion2D-PT-D05N300-CTLCardinality-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Diffusion2D-PT-D05N300-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Diffusion2D-PT-D05N300-CTLCardinality-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Diffusion2D-PT-D05N300-CTLCardinality-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Diffusion2D-PT-D05N300-CTLCardinality-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Diffusion2D-PT-D05N300-CTLCardinality-02 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Diffusion2D-PT-D05N300-CTLCardinality-06 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Diffusion2D-PT-D05N300-CTLCardinality-04 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Diffusion2D-PT-D05N300-CTLCardinality-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2286
rslt: Output for CTLCardinality @ Diffusion2D-PT-D05N300
{
"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:30:30 2020
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 336
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "AX((1 <= p18))",
"processed_size": 14,
"rewrites": 8
},
"net":
{
"conflict_clusters": 25,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 0,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 336
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 336
},
"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 <= p18)",
"processed_size": 10,
"rewrites": 7
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 1,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 373
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "((p4 <= p14) OR (3 <= p22))",
"processed_size": 28,
"rewrites": 7
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 2,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 420
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (G ((p9 <= p12)))",
"processed_size": 19,
"rewrites": 9
},
"result":
{
"edges": 304,
"markings": 304,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 1,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 373
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "EF(((3 <= p15) AND AX((p12 <= p2))))",
"processed_size": 36,
"rewrites": 9
},
"net":
{
"conflict_clusters": 25,
"singleton_clusters": 0
},
"result":
{
"edges": 6004610,
"markings": 1822381,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 420
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 420
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(2 <= p24)",
"processed_size": 10,
"rewrites": 7
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 3,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 480
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(1 <= p5)",
"processed_size": 9,
"rewrites": 7
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 4,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 560
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "AX(((p5 <= 1) OR (p24 + 1 <= p3)))",
"processed_size": 35,
"rewrites": 8
},
"net":
{
"conflict_clusters": 25,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 3,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 480
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "AX((2 <= p13))",
"processed_size": 14,
"rewrites": 8
},
"net":
{
"conflict_clusters": 25,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 560
},
"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 ((3 <= p15)))",
"processed_size": 18,
"rewrites": 8
},
"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": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 672
},
"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 ((3 <= p21)))",
"processed_size": 18,
"rewrites": 8
},
"result":
{
"edges": 14,
"markings": 11,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1042
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1042
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(1 <= p22)",
"processed_size": 10,
"rewrites": 7
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 8,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 8,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1458
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1458
},
"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 ((3 <= p2)))",
"processed_size": 17,
"rewrites": 8
},
"result":
{
"edges": 61,
"markings": 39,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2917
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"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 ((((2 <= p5) AND (1 <= p13)) U (p18 <= 0)))",
"processed_size": 45,
"rewrites": 10
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space /EU",
"value": true
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "eu preserving",
"visible": 13
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "existential_until",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 9,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2917
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2917
},
"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 ((3 <= p22)))",
"processed_size": 18,
"rewrites": 8
},
"result":
{
"edges": 6,
"markings": 7,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 10,
"type": "boolean"
}
},
{
"child":
[
{
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "AX((1 <= p18))",
"processed_size": 14,
"rewrites": 8
},
"net":
{
"conflict_clusters": 25,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
}
],
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 11,
"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": "(1 <= p22)",
"processed_size": 10,
"rewrites": 7
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 13,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 13,
"type": "boolean"
}
},
{
"child":
[
{
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "E (F ((3 <= p22)))",
"processed_size": 18,
"rewrites": 8
},
"result":
{
"edges": 6,
"markings": 7,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (G ((p9 <= p6)))",
"processed_size": 18,
"rewrites": 9
},
"result":
{
"edges": 1802,
"markings": 1203,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 14,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 3920,
"runtime": 1284.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(E((** U **)) AND E(F(**))) : (E(F(**)) OR (A(G(**)) AND E(F(**)))) : (E(F(A(G(**)))) OR A(X(**))) : (** OR (A(G(**)) AND (E(X(**)) AND **))) : (E(F(A(G(**)))) OR **) : E(F(**)) : E(F(A(G(**)))) : E(F((** AND A(X(**))))) : E(F(**)) : (** OR (A(X(*)) OR (A(X(**)) AND **))) : A(X(**))"
},
"net":
{
"arcs": 288,
"conflict_clusters": 25,
"places": 25,
"places_significant": 24,
"singleton_clusters": 0,
"transitions": 144
},
"result":
{
"preliminary_value": "yes yes unknown no unknown yes unknown yes yes yes no ",
"value": "yes yes unknown no unknown yes unknown yes yes yes no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 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: (E ((((2 <= p5) AND (1 <= p13)) U (p18 <= 0))) AND E (F ((3 <= p2)))) : A ((A (G ((p9 <= p6))) U E (F ((3 <= p22))))) : (E (F (A (G ((1 <= p10))))) OR A (X ((1 <= p18)))) : ((3 <= p18) OR ((A (G ((p9 <= p12))) AND E (X ((p9 <= p11)))) AND ((p4 <= p14) OR (3 <= p22)))) : (E (F (A (G ((1 <= p4))))) OR (1 <= p22)) : E (F ((3 <= p15))) : E (F (A (G (((p23 <= p6) AND (p3 <= p10)))))) : E (F (((3 <= p15) AND A (X ((p12 <= p2)))))) : E (F ((3 <= p21))) : (((1 <= p5) OR NOT(E (X (((2 <= p5) AND (p3 <= p24)))))) OR (A (X ((2 <= p19))) AND (2 <= p24))) : A (X ((2 <= p13)))
lola: rewrite Frontend/Parser/formula_rewrite.k:479
lola: rewrite Frontend/Parser/formula_rewrite.k:449
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F (A (G ((1 <= p10))))) OR A (X ((1 <= p18))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (G ((1 <= p10)))))
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: (p10 <= 0)
lola: processed formula length: 10
lola: 11 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using tscc preserving stubborn set method (--stubborn)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (1 <= p10)
lola: state equation task get result unparse finished id 0
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: (p10 <= 0)
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-0.sara
lola: state equation: calling and running sara
lola: state equation: write sara problem file to CTLCardinality-1.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-0.sara.
sara: try reading problem file CTLCardinality-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 || 2817278 markings, 8543655 edges, 563456 markings/sec, 0 secs
lola: sara is running 5 secs || sara is running 5 secs || 5422185 markings, 15685591 edges, 520981 markings/sec, 5 secs
lola: sara is running 10 secs || sara is running 10 secs || 8015995 markings, 22806558 edges, 518762 markings/sec, 10 secs
lola: sara is running 15 secs || sara is running 15 secs || 10498671 markings, 29621396 edges, 496535 markings/sec, 15 secs
lola: sara is running 20 secs || sara is running 20 secs || 12967416 markings, 36350516 edges, 493749 markings/sec, 20 secs
lola: sara is running 25 secs || sara is running 25 secs || 15518771 markings, 43333185 edges, 510271 markings/sec, 25 secs
lola: sara is running 30 secs || sara is running 30 secs || 17939522 markings, 49942701 edges, 484150 markings/sec, 30 secs
lola: sara is running 35 secs || sara is running 35 secs || 20248207 markings, 56246982 edges, 461737 markings/sec, 35 secs
lola: sara is running 40 secs || sara is running 40 secs || 22609566 markings, 62680817 edges, 472272 markings/sec, 40 secs
lola: sara is running 45 secs || sara is running 45 secs || 25090574 markings, 69483441 edges, 496202 markings/sec, 45 secs
lola: sara is running 50 secs || sara is running 50 secs || 27599764 markings, 76336994 edges, 501838 markings/sec, 50 secs
lola: sara is running 55 secs || sara is running 55 secs || 30126614 markings, 83243842 edges, 505370 markings/sec, 55 secs
lola: sara is running 60 secs || sara is running 60 secs || 32604256 markings, 90013158 edges, 495528 markings/sec, 60 secs
lola: sara is running 65 secs || sara is running 65 secs || 35101788 markings, 96822480 edges, 499506 markings/sec, 65 secs
lola: sara is running 70 secs || sara is running 70 secs || 37584690 markings, 103612552 edges, 496580 markings/sec, 70 secs
lola: sara is running 75 secs || sara is running 75 secs || 39841143 markings, 109769041 edges, 451291 markings/sec, 75 secs
lola: sara is running 80 secs || sara is running 80 secs || 41952060 markings, 115546270 edges, 422183 markings/sec, 80 secs
lola: sara is running 85 secs || sara is running 85 secs || 44133294 markings, 121487349 edges, 436247 markings/sec, 85 secs
lola: sara is running 90 secs || sara is running 90 secs || 46427707 markings, 127765012 edges, 458883 markings/sec, 90 secs
lola: sara is running 95 secs || sara is running 95 secs || 48887408 markings, 134476309 edges, 491940 markings/sec, 95 secs
lola: sara is running 100 secs || sara is running 100 secs || 51138138 markings, 140599701 edges, 450146 markings/sec, 100 secs
lola: sara is running 105 secs || sara is running 105 secs || 53539145 markings, 147256247 edges, 480201 markings/sec, 105 secs
lola: sara is running 110 secs || sara is running 110 secs || 55988041 markings, 153919209 edges, 489779 markings/sec, 110 secs
lola: sara is running 115 secs || sara is running 115 secs || 58374063 markings, 160435357 edges, 477204 markings/sec, 115 secs
lola: sara is running 120 secs || sara is running 120 secs || 60766410 markings, 166973922 edges, 478469 markings/sec, 120 secs
lola: sara is running 125 secs || sara is running 125 secs || 62972675 markings, 172993965 edges, 441253 markings/sec, 125 secs
lola: sara is running 130 secs || sara is running 130 secs || 65293365 markings, 179319577 edges, 464138 markings/sec, 130 secs
lola: sara is running 135 secs || sara is running 135 secs || 66861057 markings, 183601771 edges, 313538 markings/sec, 135 secs
lola: sara is running 140 secs || sara is running 140 secs || 67973411 markings, 186633307 edges, 222471 markings/sec, 140 secs
lola: sara is running 145 secs || sara is running 145 secs || 69493784 markings, 190779979 edges, 304075 markings/sec, 145 secs
lola: sara is running 150 secs || sara is running 150 secs || 70388874 markings, 193245808 edges, 179018 markings/sec, 150 secs
lola: sara is running 155 secs || sara is running 155 secs || 71680698 markings, 196784920 edges, 258365 markings/sec, 155 secs
lola: sara is running 160 secs || sara is running 160 secs || 73185745 markings, 200877330 edges, 301009 markings/sec, 160 secs
lola: sara is running 165 secs || sara is running 165 secs || 74288296 markings, 203892311 edges, 220510 markings/sec, 165 secs
lola: sara is running 170 secs || sara is running 170 secs || 75862170 markings, 208164920 edges, 314775 markings/sec, 170 secs
lola: sara is running 175 secs || sara is running 175 secs || 77100687 markings, 211531003 edges, 247703 markings/sec, 175 secs
lola: sara is running 180 secs || sara is running 180 secs || 78666141 markings, 215805909 edges, 313091 markings/sec, 180 secs
lola: sara is running 185 secs || sara is running 185 secs || 79397478 markings, 217799123 edges, 146267 markings/sec, 185 secs
lola: sara is running 190 secs || sara is running 190 secs || 81003746 markings, 222167128 edges, 321254 markings/sec, 190 secs
lola: sara is running 195 secs || sara is running 195 secs || 82364699 markings, 225873286 edges, 272191 markings/sec, 195 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 1 will run for 336 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((1 <= p18)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX((1 <= p18))
lola: processed formula length: 14
lola: 8 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: subprocess 1 will run for 336 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((3 <= p18) OR (A (G ((p9 <= p12))) AND (E (X ((p9 <= p11))) AND ((p4 <= p14) OR (3 <= p22)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 336 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (3 <= p18)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= p18)
lola: processed formula length: 10
lola: 7 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 2 will run for 373 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p4 <= p14) OR (3 <= p22))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p4 <= p14) OR (3 <= p22))
lola: processed formula length: 28
lola: 7 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 420 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p9 <= p12)))
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 ((p9 <= p12)))
lola: processed formula length: 19
lola: 9 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: (p12 + 1 <= p9)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 304 markings, 304 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 373 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= p15) AND A (X ((p12 <= 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(((3 <= p15) AND AX((p12 <= p2))))
lola: processed formula length: 36
lola: 9 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 1822381 markings, 6004610 edges
lola: ========================================
lola: subprocess 3 will run for 420 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p5) OR (A (X (((p5 <= 1) OR (p24 + 1 <= p3)))) OR (A (X ((2 <= p19))) AND (2 <= p24))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 420 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (2 <= p24)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= p24)
lola: processed formula length: 10
lola: 7 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 4 will run for 480 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= p5)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p5)
lola: processed formula length: 9
lola: 7 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 5 will run for 560 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (((p5 <= 1) OR (p24 + 1 <= p3))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX(((p5 <= 1) OR (p24 + 1 <= p3)))
lola: processed formula length: 35
lola: 8 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 4 will run for 480 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((2 <= p13)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX((2 <= p13))
lola: processed formula length: 14
lola: 8 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 5 will run for 560 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= p15)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((3 <= p15)))
lola: processed formula length: 18
lola: 8 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)
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: 11 markings, 14 edges
lola: ========================================
lola: subprocess 6 will run for 672 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= p21)))
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 <= p21)))
lola: processed formula length: 18
lola: 8 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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (3 <= p21)
lola: state equation task get result unparse finished id 0
lola: The predicate is reachable.
lola: 11 markings, 14 edges
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: ========================================
lola: subprocess 7 will run for 840 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (G (((p23 <= p6) AND (p3 <= p10))))))
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: ((p6 + 1 <= p23) OR (p10 + 1 <= p3))
lola: processed formula length: 37
lola: 11 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using tscc preserving stubborn set method (--stubborn)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result unparse finished++ id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 1
lola: formula 0: ((p23 <= p6) AND (p3 <= p10))
lola: state equation task get result unparse finished id 0
lola: state equation task get result unparse finished++ id 1
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: formula 1: ((p6 + 1 <= p23) OR (p10 + 1 <= p3))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-7-0.sara
lola: state equation: calling and running sara
lola: state equation: write sara problem file to CTLCardinality-7-1.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-7-0.sara.
sara: try reading problem file CTLCardinality-7-1.sara.
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 || 2306139 markings, 6940991 edges, 461228 markings/sec, 0 secs
lola: sara is running 5 secs || sara is running 5 secs || 4753467 markings, 14226033 edges, 489466 markings/sec, 5 secs
lola: sara is running 10 secs || sara is running 10 secs || 7218139 markings, 21439008 edges, 492934 markings/sec, 10 secs
lola: sara is running 15 secs || sara is running 15 secs || 9672273 markings, 28595472 edges, 490827 markings/sec, 15 secs
lola: sara is running 20 secs || sara is running 20 secs || 12107794 markings, 35725616 edges, 487104 markings/sec, 20 secs
lola: sara is running 25 secs || sara is running 25 secs || 14528775 markings, 42776971 edges, 484196 markings/sec, 25 secs
lola: sara is running 30 secs || sara is running 30 secs || 16787581 markings, 49388715 edges, 451761 markings/sec, 30 secs
lola: sara is running 35 secs || sara is running 35 secs || 19186708 markings, 56395542 edges, 479825 markings/sec, 35 secs
lola: sara is running 40 secs || sara is running 40 secs || 21533040 markings, 63223348 edges, 469266 markings/sec, 40 secs
lola: sara is running 45 secs || sara is running 45 secs || 23877989 markings, 70005165 edges, 468990 markings/sec, 45 secs
lola: sara is running 50 secs || sara is running 50 secs || 26204965 markings, 76750294 edges, 465395 markings/sec, 50 secs
lola: sara is running 55 secs || sara is running 55 secs || 28499240 markings, 83404982 edges, 458855 markings/sec, 55 secs
lola: sara is running 60 secs || sara is running 60 secs || 30523411 markings, 89264785 edges, 404834 markings/sec, 60 secs
lola: sara is running 65 secs || sara is running 65 secs || 32846691 markings, 95994080 edges, 464656 markings/sec, 65 secs
lola: sara is running 70 secs || sara is running 70 secs || 35150007 markings, 102629073 edges, 460663 markings/sec, 70 secs
lola: sara is running 75 secs || sara is running 75 secs || 37456487 markings, 109270733 edges, 461296 markings/sec, 75 secs
lola: sara is running 80 secs || sara is running 80 secs || 39737157 markings, 115865568 edges, 456134 markings/sec, 80 secs
lola: sara is running 85 secs || sara is running 85 secs || 41935700 markings, 122207368 edges, 439709 markings/sec, 85 secs
lola: sara is running 90 secs || sara is running 90 secs || 44030632 markings, 128274792 edges, 418986 markings/sec, 90 secs
lola: sara is running 95 secs || sara is running 95 secs || 46373160 markings, 134994198 edges, 468506 markings/sec, 95 secs
lola: sara is running 100 secs || sara is running 100 secs || 48672197 markings, 141616067 edges, 459807 markings/sec, 100 secs
lola: sara is running 105 secs || sara is running 105 secs || 50979910 markings, 148240713 edges, 461543 markings/sec, 105 secs
lola: sara is running 110 secs || sara is running 110 secs || 53333428 markings, 154994455 edges, 470704 markings/sec, 110 secs
lola: sara is running 115 secs || sara is running 115 secs || 55492546 markings, 161219143 edges, 431824 markings/sec, 115 secs
lola: sara is running 120 secs || sara is running 120 secs || 57800990 markings, 167844514 edges, 461689 markings/sec, 120 secs
lola: sara is running 125 secs || sara is running 125 secs || 60073612 markings, 174386574 edges, 454524 markings/sec, 125 secs
lola: sara is running 130 secs || sara is running 130 secs || 62398013 markings, 181088350 edges, 464880 markings/sec, 130 secs
lola: sara is running 135 secs || sara is running 135 secs || 64555830 markings, 187281588 edges, 431563 markings/sec, 135 secs
lola: sara is running 140 secs || sara is running 140 secs || 66850969 markings, 193871453 edges, 459028 markings/sec, 140 secs
lola: sara is running 145 secs || sara is running 145 secs || 69007960 markings, 200039043 edges, 431398 markings/sec, 145 secs
lola: sara is running 150 secs || sara is running 150 secs || 70929108 markings, 205564109 edges, 384230 markings/sec, 150 secs
lola: sara is running 155 secs || sara is running 155 secs || 71120599 markings, 206117556 edges, 38298 markings/sec, 155 secs
lola: sara is running 160 secs || sara is running 160 secs || 72767752 markings, 210866152 edges, 329431 markings/sec, 160 secs
lola: sara is running 165 secs || sara is running 165 secs || 73488152 markings, 212933206 edges, 144080 markings/sec, 165 secs
lola: sara is running 170 secs || sara is running 170 secs || 74464076 markings, 215712533 edges, 195185 markings/sec, 170 secs
lola: sara is running 175 secs || sara is running 175 secs || 75618062 markings, 219007543 edges, 230797 markings/sec, 175 secs
lola: sara is running 180 secs || sara is running 180 secs || 76793613 markings, 222375140 edges, 235110 markings/sec, 180 secs
lola: sara is running 185 secs || sara is running 185 secs || 77874504 markings, 225475908 edges, 216178 markings/sec, 185 secs
lola: sara is running 190 secs || sara is running 190 secs || 79195097 markings, 229268293 edges, 264119 markings/sec, 190 secs
lola: sara is running 195 secs || sara is running 195 secs || 80467976 markings, 232915537 edges, 254576 markings/sec, 195 secs
lola: sara is running 200 secs || sara is running 200 secs || 81995396 markings, 237295331 edges, 305484 markings/sec, 200 secs
lola: sara is running 205 secs || sara is running 205 secs || 83563268 markings, 241778722 edges, 313574 markings/sec, 205 secs
lola: sara is running 210 secs || sara is running 210 secs || 84631264 markings, 244844874 edges, 213599 markings/sec, 210 secs
lola: sara is running 215 secs || sara is running 215 secs || 85809837 markings, 248223931 edges, 235715 markings/sec, 215 secs
lola: sara is running 220 secs || sara is running 220 secs || 87082265 markings, 251872593 edges, 254486 markings/sec, 220 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 8 will run for 1042 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F (A (G ((1 <= p4))))) OR (1 <= p22))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 1042 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= p22)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p22)
lola: processed formula length: 10
lola: 7 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 9 will run for 1563 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (G ((1 <= p4)))))
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: (p4 <= 0)
lola: processed formula length: 9
lola: 11 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: (p4 <= 0)
lola: state equation task get result unparse finished id 1
lola: state equation task get result started, id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
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: (1 <= p4)
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-9-1.sara
lola: state equation: write sara problem file to CTLCardinality-9-0.sara
lola: state equation: calling and running sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-9-1.sara.
sara: try reading problem file CTLCardinality-9-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 || 2356493 markings, 6712945 edges, 471299 markings/sec, 0 secs
lola: sara is running 5 secs || sara is running 5 secs || 4768829 markings, 13481148 edges, 482467 markings/sec, 5 secs
lola: sara is running 10 secs || sara is running 10 secs || 7232769 markings, 20339561 edges, 492788 markings/sec, 10 secs
lola: sara is running 15 secs || sara is running 15 secs || 9744015 markings, 27336822 edges, 502249 markings/sec, 15 secs
lola: sara is running 20 secs || sara is running 20 secs || 12115790 markings, 33956270 edges, 474355 markings/sec, 20 secs
lola: sara is running 25 secs || sara is running 25 secs || 14662330 markings, 41092656 edges, 509308 markings/sec, 25 secs
lola: sara is running 30 secs || sara is running 30 secs || 17198246 markings, 48208130 edges, 507183 markings/sec, 30 secs
lola: sara is running 35 secs || sara is running 35 secs || 19675268 markings, 55068508 edges, 495404 markings/sec, 35 secs
lola: sara is running 40 secs || sara is running 40 secs || 22121979 markings, 61810522 edges, 489342 markings/sec, 40 secs
lola: sara is running 45 secs || sara is running 45 secs || 24570206 markings, 68574347 edges, 489645 markings/sec, 45 secs
lola: sara is running 50 secs || sara is running 50 secs || 27016546 markings, 75351161 edges, 489268 markings/sec, 50 secs
lola: sara is running 55 secs || sara is running 55 secs || 29461633 markings, 82078668 edges, 489017 markings/sec, 55 secs
lola: sara is running 60 secs || sara is running 60 secs || 31906528 markings, 88855926 edges, 488979 markings/sec, 60 secs
lola: sara is running 65 secs || sara is running 65 secs || 34332005 markings, 95522451 edges, 485095 markings/sec, 65 secs
lola: sara is running 70 secs || sara is running 70 secs || 36733970 markings, 102166169 edges, 480393 markings/sec, 70 secs
lola: sara is running 75 secs || sara is running 75 secs || 39137707 markings, 108790229 edges, 480747 markings/sec, 75 secs
lola: sara is running 80 secs || sara is running 80 secs || 41577453 markings, 115543289 edges, 487949 markings/sec, 80 secs
lola: sara is running 85 secs || sara is running 85 secs || 44012166 markings, 122277073 edges, 486943 markings/sec, 85 secs
lola: sara is running 90 secs || sara is running 90 secs || 46430384 markings, 128923465 edges, 483644 markings/sec, 90 secs
lola: sara is running 95 secs || sara is running 95 secs || 48894985 markings, 135749499 edges, 492920 markings/sec, 95 secs
lola: sara is running 100 secs || sara is running 100 secs || 51367451 markings, 142514325 edges, 494493 markings/sec, 100 secs
lola: sara is running 105 secs || sara is running 105 secs || 53860716 markings, 149473681 edges, 498653 markings/sec, 105 secs
lola: sara is running 110 secs || sara is running 110 secs || 56268348 markings, 156110959 edges, 481526 markings/sec, 110 secs
lola: sara is running 115 secs || sara is running 115 secs || 58527506 markings, 162410883 edges, 451832 markings/sec, 115 secs
lola: sara is running 120 secs || sara is running 120 secs || 60974274 markings, 169231571 edges, 489354 markings/sec, 120 secs
lola: sara is running 125 secs || sara is running 125 secs || 63371002 markings, 175764473 edges, 479346 markings/sec, 125 secs
lola: sara is running 130 secs || sara is running 130 secs || 65595500 markings, 181864404 edges, 444900 markings/sec, 130 secs
lola: sara is running 135 secs || sara is running 135 secs || 66946950 markings, 185588042 edges, 270290 markings/sec, 135 secs
lola: sara is running 140 secs || sara is running 140 secs || 68613012 markings, 190187889 edges, 333212 markings/sec, 140 secs
lola: sara is running 145 secs || sara is running 145 secs || 69946888 markings, 193857518 edges, 266775 markings/sec, 145 secs
lola: sara is running 150 secs || sara is running 150 secs || 71323388 markings, 197606216 edges, 275300 markings/sec, 150 secs
lola: sara is running 155 secs || sara is running 155 secs || 72622709 markings, 201207872 edges, 259864 markings/sec, 155 secs
lola: sara is running 160 secs || sara is running 160 secs || 74183654 markings, 205510491 edges, 312189 markings/sec, 160 secs
lola: sara is running 165 secs || sara is running 165 secs || 74543868 markings, 206494830 edges, 72043 markings/sec, 165 secs
lola: sara is running 170 secs || sara is running 170 secs || 75504362 markings, 209121317 edges, 192099 markings/sec, 170 secs
lola: sara is running 175 secs || sara is running 175 secs || 75751348 markings, 209796908 edges, 49397 markings/sec, 175 secs
lola: sara is running 180 secs || sara is running 180 secs || 76856409 markings, 212825396 edges, 221012 markings/sec, 180 secs
lola: sara is running 185 secs || sara is running 185 secs || 77662825 markings, 215064541 edges, 161283 markings/sec, 185 secs
lola: sara is running 190 secs || sara is running 190 secs || 78630654 markings, 217715415 edges, 193566 markings/sec, 190 secs
lola: sara is running 195 secs || sara is running 195 secs || 78915992 markings, 218503379 edges, 57068 markings/sec, 195 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 9 will run for 1458 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E ((((2 <= p5) AND (1 <= p13)) U (p18 <= 0))) AND E (F ((3 <= p2))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 1458 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((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 ((3 <= p2)))
lola: processed formula length: 17
lola: 8 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 <= p2)
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: 39 markings, 61 edges
lola: ========================================
lola: subprocess 10 will run for 2917 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((((2 <= p5) AND (1 <= p13)) U (p18 <= 0)))
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 ((((2 <= p5) AND (1 <= p13)) U (p18 <= 0)))
lola: processed formula length: 45
lola: 10 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: SUBRESULT
lola: result: yes
lola: produced by: state space /EU
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: There is a path where Predicate Phi holds until Predicate Psi.
lola: 0 markings, 0 edges
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p18 <= 0)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 10 will run for 2917 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F ((3 <= p22))) OR (A (G ((p9 <= p6))) AND E (F ((3 <= p22)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 2917 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= p22)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((3 <= p22)))
lola: processed formula length: 18
lola: 8 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 <= p22)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 7 markings, 6 edges
lola: state equation: write sara problem file to CTLCardinality-10-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-10-0.sara.
lola: ========================================
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 (F (A (G ((1 <= p10))))) OR A (X ((1 <= p18))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: E (F (A (G ((1 <= p10)))))
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: (p10 <= 0)
lola: processed formula length: 10
lola: 11 rewrites
lola: sara: place or transition ordering is non-deterministic
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: (p10 <= 0)
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-11-1.sara
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: (1 <= p10)
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-11-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-11-1.sara.
sara: place or transition ordering is non-deterministic
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-11-0.sara.
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 || 2591955 markings, 7925629 edges, 518391 markings/sec, 0 secs
lola: sara is running 5 secs || sara is running 5 secs || 5216791 markings, 15122889 edges, 524967 markings/sec, 5 secs
lola: sara is running 10 secs || sara is running 10 secs || 7812892 markings, 22251433 edges, 519220 markings/sec, 10 secs
lola: sara is running 15 secs || sara is running 15 secs || 10259158 markings, 28969851 edges, 489253 markings/sec, 15 secs
lola: sara is running 20 secs || sara is running 20 secs || 12847501 markings, 36023653 edges, 517669 markings/sec, 20 secs
lola: sara is running 25 secs || sara is running 25 secs || 15414575 markings, 43049640 edges, 513415 markings/sec, 25 secs
lola: sara is running 30 secs || sara is running 30 secs || 17945683 markings, 49959368 edges, 506222 markings/sec, 30 secs
lola: sara is running 35 secs || sara is running 35 secs || 20468352 markings, 56846355 edges, 504534 markings/sec, 35 secs
lola: sara is running 40 secs || sara is running 40 secs || 22982259 markings, 63697847 edges, 502781 markings/sec, 40 secs
lola: sara is running 45 secs || sara is running 45 secs || 25486714 markings, 70565351 edges, 500891 markings/sec, 45 secs
lola: sara is running 50 secs || sara is running 50 secs || 27990864 markings, 77406531 edges, 500830 markings/sec, 50 secs
lola: sara is running 55 secs || sara is running 55 secs || 30514967 markings, 84308738 edges, 504821 markings/sec, 55 secs
lola: sara is running 60 secs || sara is running 60 secs || 33016403 markings, 91137904 edges, 500287 markings/sec, 60 secs
lola: sara is running 65 secs || sara is running 65 secs || 35508385 markings, 97933315 edges, 498396 markings/sec, 65 secs
lola: sara is running 70 secs || sara is running 70 secs || 37771078 markings, 104119190 edges, 452539 markings/sec, 70 secs
lola: sara is running 75 secs || sara is running 75 secs || 40118978 markings, 110523848 edges, 469580 markings/sec, 75 secs
lola: sara is running 80 secs || sara is running 80 secs || 42374618 markings, 116693559 edges, 451128 markings/sec, 80 secs
lola: sara is running 85 secs || sara is running 85 secs || 44819759 markings, 123367092 edges, 489028 markings/sec, 85 secs
lola: sara is running 90 secs || sara is running 90 secs || 47251789 markings, 130011369 edges, 486406 markings/sec, 90 secs
lola: sara is running 95 secs || sara is running 95 secs || 49695443 markings, 136679475 edges, 488731 markings/sec, 95 secs
lola: sara is running 100 secs || sara is running 100 secs || 52069263 markings, 143242109 edges, 474764 markings/sec, 100 secs
lola: sara is running 105 secs || sara is running 105 secs || 54358684 markings, 149489367 edges, 457884 markings/sec, 105 secs
lola: sara is running 110 secs || sara is running 110 secs || 56803973 markings, 156153726 edges, 489058 markings/sec, 110 secs
lola: sara is running 115 secs || sara is running 115 secs || 59248743 markings, 162826415 edges, 488954 markings/sec, 115 secs
lola: sara is running 120 secs || sara is running 120 secs || 61700933 markings, 169536919 edges, 490438 markings/sec, 120 secs
lola: sara is running 125 secs || sara is running 125 secs || 64150916 markings, 176210696 edges, 489997 markings/sec, 125 secs
lola: sara is running 130 secs || sara is running 130 secs || 66546596 markings, 182741700 edges, 479136 markings/sec, 130 secs
lola: sara is running 135 secs || sara is running 135 secs || 68546928 markings, 188202462 edges, 400066 markings/sec, 135 secs
lola: sara is running 140 secs || sara is running 140 secs || 69864801 markings, 191795818 edges, 263575 markings/sec, 140 secs
lola: sara is running 145 secs || sara is running 145 secs || 70389117 markings, 193246551 edges, 104863 markings/sec, 145 secs
lola: sara is running 150 secs || sara is running 150 secs || 71334536 markings, 195844634 edges, 189084 markings/sec, 150 secs
lola: sara is running 155 secs || sara is running 155 secs || 72017499 markings, 197697269 edges, 136593 markings/sec, 155 secs
lola: sara is running 160 secs || sara is running 160 secs || 73512911 markings, 201770297 edges, 299082 markings/sec, 160 secs
lola: sara is running 165 secs || sara is running 165 secs || 74590213 markings, 204715293 edges, 215460 markings/sec, 165 secs
lola: sara is running 170 secs || sara is running 170 secs || 75810854 markings, 208021285 edges, 244128 markings/sec, 170 secs
lola: sara is running 175 secs || sara is running 175 secs || 76995583 markings, 211242107 edges, 236946 markings/sec, 175 secs
lola: sara is running 180 secs || sara is running 180 secs || 78245602 markings, 214659336 edges, 250004 markings/sec, 180 secs
lola: sara is running 185 secs || sara is running 185 secs || 79046060 markings, 216847320 edges, 160092 markings/sec, 185 secs
lola: sara is running 190 secs || sara is running 190 secs || 80281457 markings, 220197562 edges, 247079 markings/sec, 190 secs
lola: sara is running 195 secs || sara is running 195 secs || 81786768 markings, 224305995 edges, 301062 markings/sec, 195 secs
lola: sara is running 200 secs || sara is running 200 secs || 82648857 markings, 226647338 edges, 172418 markings/sec, 200 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: A (X ((1 <= p18)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX((1 <= p18))
lola: processed formula length: 14
lola: 8 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (F (A (G (((p23 <= p6) AND (p3 <= p10))))))
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: ((p6 + 1 <= p23) OR (p10 + 1 <= p3))
lola: processed formula length: 37
lola: 11 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using tscc preserving stubborn set method (--stubborn)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: 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: 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: formula 1: ((p6 + 1 <= p23) OR (p10 + 1 <= p3))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p23 <= p6) AND (p3 <= p10))
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-12-1.sara
lola: state equation: calling and running 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.
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
lola: state equation 1: solution produced
lola: state equation 0: solution produced
lola: sara is running 0 secs || sara is running 0 secs || 2069323 markings, 6221791 edges, 413865 markings/sec, 0 secs
lola: sara is running 5 secs || sara is running 5 secs || 4417210 markings, 13242104 edges, 469577 markings/sec, 5 secs
lola: sara is running 10 secs || sara is running 10 secs || 6794943 markings, 20208522 edges, 475547 markings/sec, 10 secs
lola: sara is running 15 secs || sara is running 15 secs || 8882322 markings, 26299260 edges, 417476 markings/sec, 15 secs
lola: sara is running 20 secs || sara is running 20 secs || 10997374 markings, 32477082 edges, 423010 markings/sec, 20 secs
lola: sara is running 25 secs || sara is running 25 secs || 13114376 markings, 38652874 edges, 423400 markings/sec, 25 secs
lola: sara is running 30 secs || sara is running 30 secs || 15223312 markings, 44814210 edges, 421787 markings/sec, 30 secs
lola: sara is running 35 secs || sara is running 35 secs || 17399392 markings, 51177380 edges, 435216 markings/sec, 35 secs
lola: sara is running 40 secs || sara is running 40 secs || 19769844 markings, 58098718 edges, 474090 markings/sec, 40 secs
lola: sara is running 45 secs || sara is running 45 secs || 21927753 markings, 64366134 edges, 431582 markings/sec, 45 secs
lola: sara is running 50 secs || sara is running 50 secs || 24055235 markings, 70512995 edges, 425496 markings/sec, 50 secs
lola: sara is running 55 secs || sara is running 55 secs || 26241960 markings, 76856741 edges, 437345 markings/sec, 55 secs
lola: sara is running 60 secs || sara is running 60 secs || 28590175 markings, 83666731 edges, 469643 markings/sec, 60 secs
lola: sara is running 65 secs || sara is running 65 secs || 30723010 markings, 89848081 edges, 426567 markings/sec, 65 secs
lola: sara is running 70 secs || sara is running 70 secs || 32935385 markings, 96253455 edges, 442475 markings/sec, 70 secs
lola: sara is running 75 secs || sara is running 75 secs || 35197647 markings, 102769198 edges, 452452 markings/sec, 75 secs
lola: sara is running 80 secs || sara is running 80 secs || 37411272 markings, 109142395 edges, 442725 markings/sec, 80 secs
lola: sara is running 85 secs || sara is running 85 secs || 39674766 markings, 115681608 edges, 452699 markings/sec, 85 secs
lola: sara is running 90 secs || sara is running 90 secs || 41927581 markings, 122184092 edges, 450563 markings/sec, 90 secs
lola: sara is running 95 secs || sara is running 95 secs || 44088072 markings, 128442688 edges, 432098 markings/sec, 95 secs
lola: sara is running 100 secs || sara is running 100 secs || 46344425 markings, 134909547 edges, 451271 markings/sec, 100 secs
lola: sara is running 105 secs || sara is running 105 secs || 48644317 markings, 141533959 edges, 459978 markings/sec, 105 secs
lola: sara is running 110 secs || sara is running 110 secs || 50926150 markings, 148092871 edges, 456367 markings/sec, 110 secs
lola: sara is running 115 secs || sara is running 115 secs || 53020491 markings, 154100396 edges, 418868 markings/sec, 115 secs
lola: sara is running 120 secs || sara is running 120 secs || 55290459 markings, 160631014 edges, 453994 markings/sec, 120 secs
lola: sara is running 125 secs || sara is running 125 secs || 57502430 markings, 166987709 edges, 442394 markings/sec, 125 secs
lola: sara is running 130 secs || sara is running 130 secs || 59482973 markings, 172697971 edges, 396109 markings/sec, 130 secs
lola: sara is running 135 secs || sara is running 135 secs || 61234329 markings, 177739223 edges, 350271 markings/sec, 135 secs
lola: sara is running 140 secs || sara is running 140 secs || 63171225 markings, 183297360 edges, 387379 markings/sec, 140 secs
lola: sara is running 145 secs || sara is running 145 secs || 65151144 markings, 188978357 edges, 395984 markings/sec, 145 secs
lola: sara is running 150 secs || sara is running 150 secs || 67263183 markings, 195052200 edges, 422408 markings/sec, 150 secs
lola: sara is running 155 secs || sara is running 155 secs || 69532979 markings, 201541741 edges, 453959 markings/sec, 155 secs
lola: sara is running 160 secs || sara is running 160 secs || 71040615 markings, 205885349 edges, 301527 markings/sec, 160 secs
lola: sara is running 165 secs || sara is running 165 secs || 72375137 markings, 209733017 edges, 266904 markings/sec, 165 secs
lola: sara is running 170 secs || sara is running 170 secs || 73758501 markings, 213710262 edges, 276673 markings/sec, 170 secs
lola: sara is running 175 secs || sara is running 175 secs || 75212333 markings, 217846139 edges, 290766 markings/sec, 175 secs
lola: sara is running 180 secs || sara is running 180 secs || 76537789 markings, 221634640 edges, 265091 markings/sec, 180 secs
lola: sara is running 185 secs || sara is running 185 secs || 78099048 markings, 226121282 edges, 312252 markings/sec, 185 secs
lola: sara is running 190 secs || sara is running 190 secs || 79556263 markings, 230296452 edges, 291443 markings/sec, 190 secs
lola: sara is running 195 secs || sara is running 195 secs || 80942809 markings, 234277114 edges, 277309 markings/sec, 195 secs
lola: sara is running 200 secs || sara is running 200 secs || 82300739 markings, 238174825 edges, 271586 markings/sec, 200 secs
lola: sara is running 205 secs || sara is running 205 secs || 83615141 markings, 241929504 edges, 262880 markings/sec, 205 secs
lola: sara is running 210 secs || sara is running 210 secs || 85185481 markings, 246443083 edges, 314068 markings/sec, 210 secs
lola: sara is running 215 secs || sara is running 215 secs || 86577441 markings, 250428668 edges, 278392 markings/sec, 215 secs
lola: sara is running 220 secs || sara is running 220 secs || 87144989 markings, 252046765 edges, 113510 markings/sec, 220 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: (E (F (A (G ((1 <= p4))))) OR (1 <= p22))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: (1 <= p22)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p22)
lola: processed formula length: 10
lola: 7 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: ...considering subproblem: E (F (A (G ((1 <= p4)))))
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: (p4 <= 0)
lola: processed formula length: 9
lola: 11 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: ========================================
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: (p4 <= 0)
lola: state equation task get result unparse finished id 1
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k: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: (1 <= p4)
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-14-1.sara
lola: state equation: write sara problem file to CTLCardinality-14-0.sara
lola: state equation: calling and running sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-14-1.sara.
sara: try reading problem file CTLCardinality-14-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 || 2509839 markings, 7140840 edges, 501968 markings/sec, 0 secs
lola: sara is running 5 secs || sara is running 5 secs || 5035507 markings, 14230935 edges, 505134 markings/sec, 5 secs
lola: sara is running 10 secs || sara is running 10 secs || 7485644 markings, 21052375 edges, 490027 markings/sec, 10 secs
lola: sara is running 15 secs || sara is running 15 secs || 9773504 markings, 27418764 edges, 457572 markings/sec, 15 secs
lola: sara is running 20 secs || sara is running 20 secs || 12121363 markings, 33972208 edges, 469572 markings/sec, 20 secs
lola: sara is running 25 secs || sara is running 25 secs || 14384176 markings, 40332030 edges, 452563 markings/sec, 25 secs
lola: sara is running 30 secs || sara is running 30 secs || 16810236 markings, 47099561 edges, 485212 markings/sec, 30 secs
lola: sara is running 35 secs || sara is running 35 secs || 19300006 markings, 54029567 edges, 497954 markings/sec, 35 secs
lola: sara is running 40 secs || sara is running 40 secs || 21752471 markings, 60772426 edges, 490493 markings/sec, 40 secs
lola: sara is running 45 secs || sara is running 45 secs || 23904558 markings, 66734133 edges, 430417 markings/sec, 45 secs
lola: sara is running 50 secs || sara is running 50 secs || 26135741 markings, 72922698 edges, 446237 markings/sec, 50 secs
lola: sara is running 55 secs || sara is running 55 secs || 28417892 markings, 79201193 edges, 456430 markings/sec, 55 secs
lola: sara is running 60 secs || sara is running 60 secs || 30601992 markings, 85263695 edges, 436820 markings/sec, 60 secs
lola: sara is running 65 secs || sara is running 65 secs || 32804753 markings, 91308327 edges, 440552 markings/sec, 65 secs
lola: sara is running 70 secs || sara is running 70 secs || 35054885 markings, 97509500 edges, 450026 markings/sec, 70 secs
lola: sara is running 75 secs || sara is running 75 secs || 37399054 markings, 104017147 edges, 468834 markings/sec, 75 secs
lola: sara is running 80 secs || sara is running 80 secs || 39798831 markings, 110637747 edges, 479955 markings/sec, 80 secs
lola: sara is running 85 secs || sara is running 85 secs || 42234828 markings, 117362950 edges, 487199 markings/sec, 85 secs
lola: sara is running 90 secs || sara is running 90 secs || 44509370 markings, 123624655 edges, 454908 markings/sec, 90 secs
lola: sara is running 95 secs || sara is running 95 secs || 46873029 markings, 130155989 edges, 472732 markings/sec, 95 secs
lola: sara is running 100 secs || sara is running 100 secs || 49079144 markings, 136248284 edges, 441223 markings/sec, 100 secs
lola: sara is running 105 secs || sara is running 105 secs || 51224649 markings, 142130743 edges, 429101 markings/sec, 105 secs
lola: sara is running 110 secs || sara is running 110 secs || 53424380 markings, 148266080 edges, 439946 markings/sec, 110 secs
lola: sara is running 115 secs || sara is running 115 secs || 55638771 markings, 154369790 edges, 442878 markings/sec, 115 secs
lola: sara is running 120 secs || sara is running 120 secs || 57925005 markings, 160677856 edges, 457247 markings/sec, 120 secs
lola: sara is running 125 secs || sara is running 125 secs || 60196849 markings, 167089227 edges, 454369 markings/sec, 125 secs
lola: sara is running 130 secs || sara is running 130 secs || 62417996 markings, 173189708 edges, 444229 markings/sec, 130 secs
lola: sara is running 135 secs || sara is running 135 secs || 64423203 markings, 178648639 edges, 401041 markings/sec, 135 secs
lola: sara is running 140 secs || sara is running 140 secs || 65990722 markings, 182950476 edges, 313504 markings/sec, 140 secs
lola: sara is running 145 secs || sara is running 145 secs || 66891095 markings, 185435738 edges, 180075 markings/sec, 145 secs
lola: sara is running 150 secs || sara is running 150 secs || 68547005 markings, 190001020 edges, 331182 markings/sec, 150 secs
lola: sara is running 155 secs || sara is running 155 secs || 69987536 markings, 193967219 edges, 288106 markings/sec, 155 secs
lola: sara is running 160 secs || sara is running 160 secs || 70982386 markings, 196680844 edges, 198970 markings/sec, 160 secs
lola: sara is running 165 secs || sara is running 165 secs || 72538295 markings, 200971230 edges, 311182 markings/sec, 165 secs
lola: sara is running 170 secs || sara is running 170 secs || 73988174 markings, 204973052 edges, 289976 markings/sec, 170 secs
lola: sara is running 175 secs || sara is running 175 secs || 75345152 markings, 208690148 edges, 271396 markings/sec, 175 secs
lola: sara is running 180 secs || sara is running 180 secs || 76865266 markings, 212849009 edges, 304023 markings/sec, 180 secs
lola: sara is running 185 secs || sara is running 185 secs || 78278329 markings, 216749684 edges, 282613 markings/sec, 185 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 (F ((3 <= p22))) OR (A (G ((p9 <= p6))) AND E (F ((3 <= p22)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= p22)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((3 <= p22)))
lola: processed formula length: 18
lola: 8 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 <= p22)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 7 markings, 6 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (G ((p9 <= p6)))
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 ((p9 <= p6)))
lola: processed formula length: 18
lola: 9 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: (p6 + 1 <= p9)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-15-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 1203 markings, 1802 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes yes unknown no unknown yes unknown yes yes yes no
lola:
preliminary result: yes yes unknown no unknown yes unknown yes yes yes no
lola: memory consumption: 3920 KB
lola: time consumption: 1284 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-D05N300"
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-D05N300, 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-158987882300403"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Diffusion2D-PT-D05N300.tgz
mv Diffusion2D-PT-D05N300 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 ;