About the Execution of ITS-LoLa for DLCshifumi-PT-6a
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15737.680 | 3600000.00 | 829550.00 | 139.40 | TTFTTTFFFFFTFTTT | 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-158987881800067.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 DLCshifumi-PT-6a, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-tajo-158987881800067
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 7.0M
-rw-r--r-- 1 mcc users 3.7K Mar 31 04:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 31 04:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 29 20:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 29 20:50 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 8 14:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 8 14:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K Mar 28 13:40 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K Mar 28 13:40 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 27 06:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 27 06:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 28 14:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 28 14:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 6.9M 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 DLCshifumi-PT-6a-CTLCardinality-00
FORMULA_NAME DLCshifumi-PT-6a-CTLCardinality-01
FORMULA_NAME DLCshifumi-PT-6a-CTLCardinality-02
FORMULA_NAME DLCshifumi-PT-6a-CTLCardinality-03
FORMULA_NAME DLCshifumi-PT-6a-CTLCardinality-04
FORMULA_NAME DLCshifumi-PT-6a-CTLCardinality-05
FORMULA_NAME DLCshifumi-PT-6a-CTLCardinality-06
FORMULA_NAME DLCshifumi-PT-6a-CTLCardinality-07
FORMULA_NAME DLCshifumi-PT-6a-CTLCardinality-08
FORMULA_NAME DLCshifumi-PT-6a-CTLCardinality-09
FORMULA_NAME DLCshifumi-PT-6a-CTLCardinality-10
FORMULA_NAME DLCshifumi-PT-6a-CTLCardinality-11
FORMULA_NAME DLCshifumi-PT-6a-CTLCardinality-12
FORMULA_NAME DLCshifumi-PT-6a-CTLCardinality-13
FORMULA_NAME DLCshifumi-PT-6a-CTLCardinality-14
FORMULA_NAME DLCshifumi-PT-6a-CTLCardinality-15
=== Now, execution of the tool begins
BK_START 1591202852915
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 16:47:35] [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 16:47:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 16:47:36] [INFO ] Load time of PNML (sax parser for PT used): 917 ms
[2020-06-03 16:47:36] [INFO ] Transformed 3568 places.
[2020-06-03 16:47:36] [INFO ] Transformed 25936 transitions.
[2020-06-03 16:47:36] [INFO ] Found NUPN structural information;
[2020-06-03 16:47:36] [INFO ] Parsed PT model containing 3568 places and 25936 transitions in 1120 ms.
Ensure Unique test removed 2976 transitions
Reduce redundant transitions removed 2976 transitions.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 364 ms.
Incomplete random walk after 100000 steps, including 0 resets, run finished after 7303 ms. (steps per millisecond=13 ) properties seen :[1, 0, 0, 1, 1, 1, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0]
[2020-06-03 16:47:44] [INFO ] Flow matrix only has 1928 transitions (discarded 21032 similar events)
// Phase 1: matrix 1928 rows 3568 cols
[2020-06-03 16:47:44] [INFO ] Computed 2415 place invariants in 78 ms
[2020-06-03 16:47:52] [INFO ] [Real]Absence check using 2415 positive place invariants in 6804 ms returned sat
[2020-06-03 16:47:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:48:04] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe (= s1135 (- t1408 t154))") while checking expression at index 0
[2020-06-03 16:48:10] [INFO ] [Real]Absence check using 2415 positive place invariants in 5107 ms returned sat
[2020-06-03 16:48:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:48:24] [INFO ] [Real]Absence check using state equation in 14383 ms returned (error "Solver has unexpectedly terminated")
[2020-06-03 16:48:31] [INFO ] [Real]Absence check using 2415 positive place invariants in 6378 ms returned sat
[2020-06-03 16:48:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:48:44] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 16:48:44] [INFO ] [Real]Absence check using state equation in 13018 ms returned (error "Failed to check-sat")
[2020-06-03 16:48:52] [INFO ] [Real]Absence check using 2415 positive place invariants in 7152 ms returned sat
[2020-06-03 16:48:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:49:04] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 16:49:04] [INFO ] [Real]Absence check using state equation in 12228 ms returned (error "Failed to check-sat")
[2020-06-03 16:49:10] [INFO ] [Real]Absence check using 2415 positive place invariants in 4937 ms returned sat
[2020-06-03 16:49:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:49:24] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 16:49:24] [INFO ] [Real]Absence check using state equation in 14596 ms returned (error "Failed to check-sat")
[2020-06-03 16:49:29] [INFO ] [Real]Absence check using 2415 positive place invariants in 4822 ms returned sat
[2020-06-03 16:49:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:49:44] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 16:49:44] [INFO ] [Real]Absence check using state equation in 14644 ms returned unknown
[2020-06-03 16:49:50] [INFO ] [Real]Absence check using 2415 positive place invariants in 5555 ms returned sat
[2020-06-03 16:49:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:50:04] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 16:50:04] [INFO ] [Real]Absence check using state equation in 13922 ms returned (error "Failed to check-sat")
[2020-06-03 16:50:10] [INFO ] [Real]Absence check using 2415 positive place invariants in 4933 ms returned sat
[2020-06-03 16:50:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:50:24] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 16:50:24] [INFO ] [Real]Absence check using state equation in 14551 ms returned unknown
[2020-06-03 16:50:30] [INFO ] [Real]Absence check using 2415 positive place invariants in 5523 ms returned sat
[2020-06-03 16:50:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:50:44] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 16:50:44] [INFO ] [Real]Absence check using state equation in 13933 ms returned unknown
[2020-06-03 16:50:50] [INFO ] [Real]Absence check using 2415 positive place invariants in 4762 ms returned sat
[2020-06-03 16:50:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:51:04] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 16:51:04] [INFO ] [Real]Absence check using state equation in 14674 ms returned unknown
[2020-06-03 16:51:11] [INFO ] [Real]Absence check using 2415 positive place invariants in 5787 ms returned sat
[2020-06-03 16:51:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:51:24] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 16:51:24] [INFO ] [Real]Absence check using state equation in 13708 ms returned (error "Failed to check-sat")
[2020-06-03 16:51:32] [INFO ] [Real]Absence check using 2415 positive place invariants in 7004 ms returned sat
[2020-06-03 16:51:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:51:44] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 16:51:44] [INFO ] [Real]Absence check using state equation in 12426 ms returned (error "Failed to check-sat")
[2020-06-03 16:51:49] [INFO ] [Real]Absence check using 2415 positive place invariants in 4301 ms returned sat
[2020-06-03 16:51:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:52:04] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 16:52:04] [INFO ] [Real]Absence check using state equation in 15251 ms returned unknown
[2020-06-03 16:52:09] [INFO ] [Real]Absence check using 2415 positive place invariants in 4728 ms returned sat
[2020-06-03 16:52:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:52:24] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 16:52:24] [INFO ] [Real]Absence check using state equation in 14827 ms returned unknown
[2020-06-03 16:52:25] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2020-06-03 16:52:26] [INFO ] Flatten gal took : 1433 ms
[2020-06-03 16:52:26] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2020-06-03 16:52:27] [INFO ] Flatten gal took : 943 ms
FORMULA DLCshifumi-PT-6a-CTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCshifumi-PT-6a-CTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCshifumi-PT-6a-CTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCshifumi-PT-6a-CTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 16:52:27] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLCardinality.sr.xml took 22 ms.
[2020-06-03 16:52:27] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 143 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLCardinality @ DLCshifumi-PT-6a @ 3570 seconds
FORMULA DLCshifumi-PT-6a-CTLCardinality-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DLCshifumi-PT-6a-CTLCardinality-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DLCshifumi-PT-6a-CTLCardinality-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DLCshifumi-PT-6a-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DLCshifumi-PT-6a-CTLCardinality-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DLCshifumi-PT-6a-CTLCardinality-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DLCshifumi-PT-6a-CTLCardinality-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DLCshifumi-PT-6a-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DLCshifumi-PT-6a-CTLCardinality-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DLCshifumi-PT-6a-CTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DLCshifumi-PT-6a-CTLCardinality-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DLCshifumi-PT-6a-CTLCardinality-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3219
rslt: Output for CTLCardinality @ DLCshifumi-PT-6a
{
"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",
"--safe",
"--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 16:52:28 2020
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 273
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 273
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(((p2814 <= 0)) OR ((1 <= p3457)))",
"processed_size": 35,
"rewrites": 24
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 0,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 298
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (G ((((p1992 <= 0)) OR ((1 <= p1826)))))",
"processed_size": 43,
"rewrites": 26
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 0,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 298
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 298
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(((p215 <= 0)) OR ((1 <= p358)))",
"processed_size": 33,
"rewrites": 27
},
"result":
{
"edges": 2,
"markings": 2,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 10
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 1,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 328
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(((p1994 <= 0)) OR ((1 <= p2564)))",
"processed_size": 35,
"rewrites": 28
},
"result":
{
"produced_by": "parallel",
"value": false
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "tscc preserving/always up"
}
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"store":
{
"type": "dfs/tscc"
},
"type": "possible_invariance",
"workflow": "stateequation"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 357
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "E (G ((((p1890 <= 0)) OR ((1 <= p2045)))))",
"processed_size": 43,
"rewrites": 25
},
"result":
{
"edges": 2,
"markings": 2,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 20
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "possible_preservation",
"workflow": "stateequation"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 402
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 7,
"aneg": 1,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "(((p816 <= 0)) OR ((1 <= p3508)) OR ((((p1125 <= 0)) OR ((1 <= p942))) AND (((p2571 <= 0)) OR ((1 <= p1352)))))",
"processed_size": 115,
"rewrites": 27
},
"result":
{
"edges": 2,
"markings": 2,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 45
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 8,
"problems": 2
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 460
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "EG(AF((((1 <= p1918)) AND ((p1223 <= 0)))))",
"processed_size": 43,
"rewrites": 26
},
"net":
{
"conflict_clusters": 557,
"singleton_clusters": 0
},
"result":
{
"edges": 11,
"markings": 5,
"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"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 536
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "AF(EG((((p1268 <= 0)) OR ((1 <= p2994)))))",
"processed_size": 43,
"rewrites": 26
},
"net":
{
"conflict_clusters": 557,
"singleton_clusters": 0
},
"result":
{
"edges": 6,
"markings": 5,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 644
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 2,
"F": 0,
"G": 2,
"U": 0,
"X": 0,
"aconj": 7,
"adisj": 3,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "EG((EG((((p735 <= 0)) OR ((1 <= p2613)))) OR ((((p705 <= 0)) OR ((1 <= p2058))) AND (((p1323 <= 0)) OR ((1 <= p1388))))))",
"processed_size": 124,
"rewrites": 26
},
"net":
{
"conflict_clusters": 557,
"singleton_clusters": 0
},
"result":
{
"edges": 15,
"markings": 5,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 805
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 805
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 4,
"adisj": 1,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "(((p1374 <= 0)) OR ((1 <= p1956)) OR ((p2560 <= 0)) OR ((1 <= p1806)))",
"processed_size": 73,
"rewrites": 24
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 8,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1073
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 2,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "E (F ((((1 <= p2756)) AND ((p1548 <= 0)))))",
"processed_size": 43,
"rewrites": 25
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 8,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1073
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 1,
"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": "(((p3083 <= 0)) OR ((1 <= p2260)) OR ((1 <= p2837)))",
"processed_size": 54,
"rewrites": 27
},
"result":
{
"edges": 5,
"markings": 5,
"produced_by": "state space /EGEF",
"value": true
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving",
"visible": 32
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3,
"problems": 3
},
"type": "possible_preservation_of_reachability",
"workflow": "stateequation"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1610
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1610
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "((1 <= p1531))",
"processed_size": 14,
"rewrites": 24
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 10,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3220
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "E (G ((((p1894 <= 0)) OR ((1 <= p519)))))",
"processed_size": 42,
"rewrites": 25
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 16
},
"threads": 1,
"type": "dfs"
},
"type": "possible_preservation",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 10,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3220
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3220
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 4,
"adisj": 1,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "(((p1539 <= 0)) OR ((1 <= p2966)) OR ((p1614 <= 0)) OR ((1 <= p2368)))",
"processed_size": 73,
"rewrites": 24
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 11,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "((p664 <= 0))",
"processed_size": 13,
"rewrites": 28
},
"result":
{
"edges": 5,
"markings": 5,
"produced_by": "state space /EGEF",
"value": false
},
"task":
{
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving",
"visible": 6
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "eventual_invariance",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 11,
"type": "boolean"
}
},
{
"child":
[
{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "((1 <= p1531))",
"processed_size": 14,
"rewrites": 24
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 12,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "E (G ((((p1894 <= 0)) OR ((1 <= p519)))))",
"processed_size": 42,
"rewrites": 25
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 16
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "possible_preservation",
"workflow": "stateequation"
}
},
{
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 5,
"adisj": 2,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "E (G (((((p1721 <= 0)) OR ((1 <= p889))) AND (((p1760 <= 0)) OR ((1 <= p2825))))))",
"processed_size": 84,
"rewrites": 25
},
"result":
{
"edges": 2,
"markings": 2,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 62
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 2
},
"type": "possible_preservation",
"workflow": "stateequation"
}
}
],
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 12,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 528244,
"runtime": 351.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "E(G(A(F(*)))) : E(F(A(G(*)))) : A(F(E(G(**)))) : (E(G(**)) OR (** OR E(G(**)))) : (E(X(*)) OR (A(G(**)) AND **)) : (A(F(A(G(**)))) AND (A(F(**)) AND **)) : A(F(**)) : (E(F(**)) AND **) : (E(X(**)) AND A(F(*))) : E(G((E(G(**)) OR **))) : E(G(**)) : E(G(E(F(**))))"
},
"net":
{
"arcs": 90778,
"conflict_clusters": 557,
"places": 3568,
"places_significant": 1153,
"singleton_clusters": 0,
"transitions": 22960
},
"result":
{
"preliminary_value": "yes no yes yes yes no no no no yes yes yes ",
"value": "yes no yes yes yes no no no no yes yes yes "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 26528/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 3568
lola: finding significant places
lola: 3568 places, 22960 transitions, 1153 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from CTLCardinality.xml
lola: LP says that atomic proposition is always true: (p1223 <= 1)
lola: LP says that atomic proposition is always true: (p2564 <= 1)
lola: LP says that atomic proposition is always true: (p2994 <= 1)
lola: LP says that atomic proposition is always true: (p519 <= 1)
lola: LP says that atomic proposition is always true: (p1531 <= 1)
lola: LP says that atomic proposition is always true: (p889 <= 1)
lola: LP says that atomic proposition is always true: (p2825 <= 1)
lola: LP says that atomic proposition is always true: (p2575 <= 1)
lola: LP says that atomic proposition is always true: (p2671 <= 1)
lola: LP says that atomic proposition is always true: (p1826 <= 1)
lola: LP says that atomic proposition is always true: (p3457 <= 1)
lola: LP says that atomic proposition is always true: (p664 <= 1)
lola: LP says that atomic proposition is always true: (p1851 <= 1)
lola: LP says that atomic proposition is always true: (p2966 <= 1)
lola: LP says that atomic proposition is always true: (p2368 <= 1)
lola: LP says that atomic proposition is always true: (p3508 <= 1)
lola: LP says that atomic proposition is always true: (p942 <= 1)
lola: LP says that atomic proposition is always true: (p1352 <= 1)
lola: LP says that atomic proposition is always true: (p1548 <= 1)
lola: LP says that atomic proposition is always true: (p1956 <= 1)
lola: LP says that atomic proposition is always true: (p1806 <= 1)
lola: LP says that atomic proposition is always true: (p55 <= 1)
lola: LP says that atomic proposition is always true: (p358 <= 1)
lola: LP says that atomic proposition is always true: (p2613 <= 1)
lola: LP says that atomic proposition is always true: (p2058 <= 1)
lola: LP says that atomic proposition is always true: (p1388 <= 1)
lola: LP says that atomic proposition is always true: (p2045 <= 1)
lola: LP says that atomic proposition is always true: (p2260 <= 1)
lola: LP says that atomic proposition is always true: (p2837 <= 1)
lola: NOT(A (F (E (G ((((p1918 <= 0)) OR ((1 <= p1223)))))))) : E (F (NOT(E (F ((((p1994 <= 0)) OR ((1 <= p2564)))))))) : A (F (E (G ((((p1268 <= 0)) OR ((1 <= p2994))))))) : ((E (G ((((p1894 <= 0)) OR ((1 <= p519))))) OR E (((1 <= 0) U ((1 <= p1531))))) OR E (G (((((p1721 <= 0)) OR ((1 <= p889))) AND (((p1760 <= 0)) OR ((1 <= p2825))))))) : ((NOT(A (X ((((p1048 <= 0)) OR ((1 <= p2575)))))) OR A (((((p2661 <= 0)) OR ((1 <= p2671))) U (1 <= 0)))) OR (A (G ((((p1992 <= 0)) OR ((1 <= p1826))))) AND (((p2814 <= 0)) OR ((1 <= p3457))))) : ((A (F (A (G (((1 <= p664)))))) AND A (F (((1 <= p1851))))) AND (((p1539 <= 0)) OR ((1 <= p2966)) OR ((p1614 <= 0)) OR ((1 <= p2368)))) : A (F ((((1 <= p816)) AND ((p3508 <= 0)) AND ((((1 <= p1125)) AND ((p942 <= 0))) OR (((1 <= p2571)) AND ((p1352 <= 0))))))) : (E (((0 <= 0) U (((1 <= p2756)) AND ((p1548 <= 0))))) AND (((p1374 <= 0)) OR ((1 <= p1956)) OR ((p2560 <= 0)) OR ((1 <= p1806)))) : (E (X ((((p1026 <= 0)) OR ((1 <= p55))))) AND NOT(E (G ((((p215 <= 0)) OR ((1 <= p358))))))) : E (G ((E (G ((((p735 <= 0)) OR ((1 <= p2613))))) OR ((((p705 <= 0)) OR ((1 <= p2058))) AND (((p1323 <= 0)) OR ((1 <= p1388))))))) : E (G ((((p1890 <= 0)) OR ((1 <= p2045))))) : E (G (E (F ((((p3083 <= 0)) OR ((1 <= p2260)) OR ((1 <= p2837)))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:183
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:121
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 273 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (X ((((1 <= p1048)) AND ((p2575 <= 0))))) OR (A (G ((((p1992 <= 0)) OR ((1 <= p1826))))) AND (((p2814 <= 0)) OR ((1 <= p3457)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 273 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p2814 <= 0)) OR ((1 <= p3457)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((p2814 <= 0)) OR ((1 <= p3457)))
lola: processed formula length: 35
lola: 24 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 1 will run for 298 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((p1992 <= 0)) OR ((1 <= p1826)))))
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 ((((p1992 <= 0)) OR ((1 <= p1826)))))
lola: processed formula length: 43
lola: 26 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
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: (((1 <= p1992)) AND ((p1826 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 2 markings, 1 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 1 will run for 298 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (X ((((p1026 <= 0)) OR ((1 <= p55))))) AND A (F ((((1 <= p215)) AND ((p358 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 298 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((((1 <= p215)) AND ((p358 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: (((p215 <= 0)) OR ((1 <= p358)))
lola: processed formula length: 33
lola: 27 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= p215)) AND ((p358 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 2 markings, 2 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 328 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (G ((((1 <= p1994)) AND ((p2564 <= 0)))))))
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:788
lola: processed formula: (((p1994 <= 0)) OR ((1 <= p2564)))
lola: processed formula length: 35
lola: 28 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using tscc preserving stubborn set method (--stubborn)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 1
lola: formula 1: (((p1994 <= 0)) OR ((1 <= p2564)))
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: (((1 <= p1994)) AND ((p2564 <= 0)))
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-2-1.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-2-1.sara.
lola: state equation: write sara problem file to CTLCardinality-2-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-2-0.sara.
lola: sara is running 0 secs || sara is running 0 secs || 11767 markings, 601161 edges, 2353 markings/sec, 0 secs
lola: sara is running 5 secs || sara is running 5 secs || 24511 markings, 1251262 edges, 2549 markings/sec, 5 secs
lola: sara is running 10 secs || sara is running 10 secs || 37263 markings, 1901618 edges, 2550 markings/sec, 10 secs
lola: sara is running 15 secs || sara is running 15 secs || 50045 markings, 2553523 edges, 2556 markings/sec, 15 secs
lola: sara is running 20 secs || sara is running 20 secs || 62804 markings, 3204311 edges, 2552 markings/sec, 20 secs
lola: sara is running 25 secs || sara is running 25 secs || 74517 markings, 3801725 edges, 2343 markings/sec, 25 secs
lola: sara is running 30 secs || sara is running 30 secs || 86026 markings, 4388704 edges, 2302 markings/sec, 30 secs
lola: sara is running 35 secs || sara is running 35 secs || 98189 markings, 5008976 edges, 2433 markings/sec, 35 secs
lola: sara is running 40 secs || sara is running 40 secs || 111018 markings, 5663279 edges, 2566 markings/sec, 40 secs
lola: sara is running 45 secs || sara is running 45 secs || 122124 markings, 6229817 edges, 2221 markings/sec, 45 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 50 secs || sara is running 50 secs || 134056 markings, 6838457 edges, 2386 markings/sec, 50 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 55 secs || sara is running 55 secs || 146794 markings, 7488035 edges, 2548 markings/sec, 55 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: parallel
lola: The predicate is not possibly invariant.
lola: subprocess 3 will run for 357 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((((p1890 <= 0)) OR ((1 <= p2045)))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G ((((p1890 <= 0)) OR ((1 <= p2045)))))
lola: processed formula length: 43
lola: 25 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: ========================================
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= p1890)) AND ((p2045 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 2 markings, 2 edges
lola: ========================================
lola: subprocess 4 will run for 402 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((((1 <= p816)) AND ((p3508 <= 0)) AND ((((1 <= p1125)) AND ((p942 <= 0))) OR (((1 <= p2571)) AND ((p1352 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (((p816 <= 0)) OR ((1 <= p3508)) OR ((((p1125 <= 0)) OR ((1 <= p942))) AND (((p2571 <= 0)) OR ((1 <= p1352)))))
lola: processed formula length: 115
lola: 27 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= p816)) AND ((p3508 <= 0)) AND ((((1 <= p1125)) AND ((p942 <= 0))) OR (((1 <= p2571)) AND ((p1352 <= 0)))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 8 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 2 markings, 2 edges
lola: ========================================
lola: subprocess 5 will run for 460 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (A (F ((((1 <= p1918)) AND ((p1223 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: processed formula: EG(AF((((1 <= p1918)) AND ((p1223 <= 0)))))
lola: processed formula length: 43
lola: 26 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 5 markings, 11 edges
lola: ========================================
lola: subprocess 6 will run for 536 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (E (G ((((p1268 <= 0)) OR ((1 <= p2994)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF(EG((((p1268 <= 0)) OR ((1 <= p2994)))))
lola: processed formula length: 43
lola: 26 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 5 markings, 6 edges
lola: ========================================
lola: subprocess 7 will run for 644 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((E (G ((((p735 <= 0)) OR ((1 <= p2613))))) OR ((((p705 <= 0)) OR ((1 <= p2058))) AND (((p1323 <= 0)) OR ((1 <= p1388)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: processed formula: EG((EG((((p735 <= 0)) OR ((1 <= p2613)))) OR ((((p705 <= 0)) OR ((1 <= p2058))) AND (((p1323 <= 0)) OR ((1 <= p1388))))))
lola: processed formula length: 124
lola: 26 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 5 markings, 15 edges
lola: ========================================
lola: subprocess 8 will run for 805 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F ((((1 <= p2756)) AND ((p1548 <= 0))))) AND (((p1374 <= 0)) OR ((1 <= p1956)) OR ((p2560 <= 0)) OR ((1 <= p1806))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 805 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p1374 <= 0)) OR ((1 <= p1956)) OR ((p2560 <= 0)) OR ((1 <= p1806)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((p1374 <= 0)) OR ((1 <= p1956)) OR ((p2560 <= 0)) OR ((1 <= p1806)))
lola: processed formula length: 73
lola: 24 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 4 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 9 will run for 1073 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((1 <= p2756)) AND ((p1548 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((((1 <= p2756)) AND ((p1548 <= 0)))))
lola: processed formula length: 43
lola: 25 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= p2756)) AND ((p1548 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 2 markings, 1 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 9 will run for 1073 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (E (F ((((p3083 <= 0)) OR ((1 <= p2260)) OR ((1 <= p2837)))))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation of reachability
lola: rewrite Frontend/Parser/formula_rewrite.k:593
lola: rewrite Frontend/Parser/formula_rewrite.k:628
lola: rewrite Frontend/Parser/formula_rewrite.k:731
lola: processed formula: (((p3083 <= 0)) OR ((1 <= p2260)) OR ((1 <= p2837)))
lola: processed formula length: 54
lola: 27 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EGEF)
lola: state space: using reachability graph (EGEF version) (--search=depth)
lola: state space: using ctl preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 0
lola: state equation task get result unparse finished++ id 1
lola: formula 0: (((1 <= p3083)) AND ((p2260 <= 0)) AND ((p2837 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: formula 1: (((p3083 <= 0)) OR ((1 <= p2260)) OR ((1 <= p2837)))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 3 literals and 3 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EGEF
lola: Reachability of the predicate is possibly preserved.
lola: 5 markings, 5 edges
lola: ========================================
lola: subprocess 10 will run for 1610 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (G ((((p1894 <= 0)) OR ((1 <= p519))))) OR (((1 <= p1531)) OR E (G (((((p1721 <= 0)) OR ((1 <= p889))) AND (((p1760 <= 0)) OR ((1 <= p2825))))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 1610 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p1531))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p1531))
lola: processed formula length: 14
lola: 24 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 11 will run for 3220 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((((p1894 <= 0)) OR ((1 <= p519)))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G ((((p1894 <= 0)) OR ((1 <= p519)))))
lola: processed formula length: 42
lola: 25 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate is not possibly preserved.
lola: 1 markings, 0 edges
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: 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: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= p1894)) AND ((p519 <= 0)))
lola: state equation task get result unparse finished id 0
lola: ========================================
lola: ========================================
lola: subprocess 11 will run for 3220 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F (A (G (((1 <= p664)))))) AND (A (F (((1 <= p1851)))) AND (((p1539 <= 0)) OR ((1 <= p2966)) OR ((p1614 <= 0)) OR ((1 <= p2368)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 3220 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p1539 <= 0)) OR ((1 <= p2966)) OR ((p1614 <= 0)) OR ((1 <= p2368)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((p1539 <= 0)) OR ((1 <= p2966)) OR ((p1614 <= 0)) OR ((1 <= p2368)))
lola: processed formula length: 73
lola: 24 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 4 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 13 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (A (G (((1 <= p664))))))
lola: ========================================
lola: SUBTASK
lola: checking eventual invariance
lola: rewrite Frontend/Parser/formula_rewrite.k:594
lola: rewrite Frontend/Parser/formula_rewrite.k:629
lola: rewrite Frontend/Parser/formula_rewrite.k:758
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((p664 <= 0))
lola: processed formula length: 13
lola: 28 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EGEF)
lola: state space: using reachability graph (EGEF version) (--search=depth)
lola: state space: using ctl preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result started, id 1
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p664))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
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: ((p664 <= 0))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EGEF
lola: The predicate is not eventually invariant.
lola: 5 markings, 5 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (E (G ((((p1894 <= 0)) OR ((1 <= p519))))) OR (((1 <= p1531)) OR E (G (((((p1721 <= 0)) OR ((1 <= p889))) AND (((p1760 <= 0)) OR ((1 <= p2825))))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: ((1 <= p1531))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p1531))
lola: processed formula length: 14
lola: 24 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (G ((((p1894 <= 0)) OR ((1 <= p519)))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G ((((p1894 <= 0)) OR ((1 <= p519)))))
lola: processed formula length: 42
lola: 25 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= p1894)) AND ((p519 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate is not possibly preserved.
lola: 1 markings, 0 edges
lola: ========================================
lola: ...considering subproblem: E (G (((((p1721 <= 0)) OR ((1 <= p889))) AND (((p1760 <= 0)) OR ((1 <= p2825))))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G (((((p1721 <= 0)) OR ((1 <= p889))) AND (((p1760 <= 0)) OR ((1 <= p2825))))))
lola: processed formula length: 84
lola: 25 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: ========================================
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((((1 <= p1721)) AND ((p889 <= 0))) OR (((1 <= p1760)) AND ((p2825 <= 0))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 2 markings, 2 edges
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no yes yes yes no no no no yes yes yes
lola:
preliminary result: yes no yes yes yes no no no no yes yes yes
lola: ========================================
lola: memory consumption: 528244 KB
lola: time consumption: 351 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="DLCshifumi-PT-6a"
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 DLCshifumi-PT-6a, 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-158987881800067"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DLCshifumi-PT-6a.tgz
mv DLCshifumi-PT-6a 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 ;