About the Execution of ITS-LoLa for FlexibleBarrier-PT-06a
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15745.710 | 3600000.00 | 115094.00 | 595.00 | FFFTFTFTTFTTFFFT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2020-input.r170-smll-158987815600275.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is FlexibleBarrier-PT-06a, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r170-smll-158987815600275
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 232K
-rw-r--r-- 1 mcc users 3.7K Apr 4 18:11 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Apr 4 18:11 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 4 06:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 4 06:23 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 8 14:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 8 14:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Apr 3 20:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K Apr 3 20:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 3 13:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 3 13:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 4 01:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 4 01:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 41K 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 FlexibleBarrier-PT-06a-CTLCardinality-00
FORMULA_NAME FlexibleBarrier-PT-06a-CTLCardinality-01
FORMULA_NAME FlexibleBarrier-PT-06a-CTLCardinality-02
FORMULA_NAME FlexibleBarrier-PT-06a-CTLCardinality-03
FORMULA_NAME FlexibleBarrier-PT-06a-CTLCardinality-04
FORMULA_NAME FlexibleBarrier-PT-06a-CTLCardinality-05
FORMULA_NAME FlexibleBarrier-PT-06a-CTLCardinality-06
FORMULA_NAME FlexibleBarrier-PT-06a-CTLCardinality-07
FORMULA_NAME FlexibleBarrier-PT-06a-CTLCardinality-08
FORMULA_NAME FlexibleBarrier-PT-06a-CTLCardinality-09
FORMULA_NAME FlexibleBarrier-PT-06a-CTLCardinality-10
FORMULA_NAME FlexibleBarrier-PT-06a-CTLCardinality-11
FORMULA_NAME FlexibleBarrier-PT-06a-CTLCardinality-12
FORMULA_NAME FlexibleBarrier-PT-06a-CTLCardinality-13
FORMULA_NAME FlexibleBarrier-PT-06a-CTLCardinality-14
FORMULA_NAME FlexibleBarrier-PT-06a-CTLCardinality-15
=== Now, execution of the tool begins
BK_START 1591333634043
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-05 05:07:17] [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-05 05:07:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-05 05:07:17] [INFO ] Load time of PNML (sax parser for PT used): 106 ms
[2020-06-05 05:07:17] [INFO ] Transformed 75 places.
[2020-06-05 05:07:17] [INFO ] Transformed 154 transitions.
[2020-06-05 05:07:17] [INFO ] Found NUPN structural information;
[2020-06-05 05:07:17] [INFO ] Parsed PT model containing 75 places and 154 transitions in 196 ms.
Ensure Unique test removed 26 transitions
Reduce redundant transitions removed 26 transitions.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 37 ms.
Incomplete random walk after 100000 steps, including 0 resets, run finished after 482 ms. (steps per millisecond=207 ) properties seen :[1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-06-05 05:07:18] [INFO ] Flow matrix only has 122 transitions (discarded 6 similar events)
// Phase 1: matrix 122 rows 75 cols
[2020-06-05 05:07:18] [INFO ] Computed 8 place invariants in 11 ms
[2020-06-05 05:07:18] [INFO ] [Real]Absence check using 8 positive place invariants in 30 ms returned sat
[2020-06-05 05:07:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 05:07:18] [INFO ] [Real]Absence check using state equation in 142 ms returned sat
[2020-06-05 05:07:18] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 05:07:18] [INFO ] [Nat]Absence check using 8 positive place invariants in 19 ms returned unsat
Successfully simplified 1 atomic propositions for a total of 1 simplifications.
[2020-06-05 05:07:18] [INFO ] Initial state reduction rules for CTL removed 8 formulas.
[2020-06-05 05:07:18] [INFO ] Flatten gal took : 89 ms
[2020-06-05 05:07:19] [INFO ] Initial state reduction rules for CTL removed 8 formulas.
[2020-06-05 05:07:19] [INFO ] Flatten gal took : 30 ms
FORMULA FlexibleBarrier-PT-06a-CTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-06a-CTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-06a-CTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-06a-CTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-06a-CTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-06a-CTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-06a-CTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-06a-CTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-05 05:07:19] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLCardinality.sr.xml took 6 ms.
[2020-06-05 05:07:19] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 8 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLCardinality @ FlexibleBarrier-PT-06a @ 3570 seconds
FORMULA FlexibleBarrier-PT-06a-CTLCardinality-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA FlexibleBarrier-PT-06a-CTLCardinality-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA FlexibleBarrier-PT-06a-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA FlexibleBarrier-PT-06a-CTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA FlexibleBarrier-PT-06a-CTLCardinality-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA FlexibleBarrier-PT-06a-CTLCardinality-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA FlexibleBarrier-PT-06a-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA FlexibleBarrier-PT-06a-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3469
rslt: Output for CTLCardinality @ FlexibleBarrier-PT-06a
{
"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": "Fri Jun 5 05:07:20 2020
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 0
},
"processed": "DEADLOCK",
"processed_size": 8,
"rewrites": 21
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 0,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"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": "(((1 <= p59)) AND ((p62 <= 0)))",
"processed_size": 31,
"rewrites": 25
},
"result":
{
"edges": 7,
"markings": 7,
"produced_by": "state space /EFEG",
"value": false
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 8
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "eventual_occurrence_from_all_states",
"workflow": "stateequation"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"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": "(((1 <= p69)) AND ((p64 <= 0)))",
"processed_size": 31,
"rewrites": 25
},
"result":
{
"edges": 7928065,
"markings": 2985985,
"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": 711
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"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": "((((p66 <= 0)) OR ((1 <= p18))) AND (((p50 <= 0)) OR ((1 <= p61))))",
"processed_size": 69,
"rewrites": 24
},
"result":
{
"edges": 23741980,
"markings": 2985985,
"produced_by": "tscc_search",
"value": true
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "tscc preserving/always up"
}
},
"stateequation":
{
"literals": 8,
"problems": 4
},
"store":
{
"type": "dfs/tscc"
},
"type": "liveness",
"workflow": "stateequation"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 879
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 0,
"G": 1,
"U": 1,
"X": 0,
"aconj": 4,
"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((((p47 <= 0)) OR ((1 <= p26))) U AG((((p1 <= 0)) OR ((1 <= p39)))))",
"processed_size": 71,
"rewrites": 23
},
"net":
{
"conflict_clusters": 28,
"singleton_clusters": 0
},
"result":
{
"edges": 29546703,
"markings": 2985985,
"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": 1156
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1156
},
"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": "(((p18 <= 0)) OR ((1 <= p64)))",
"processed_size": 31,
"rewrites": 21
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 5,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1734
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 4,
"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 (F ((((1 <= p28)) AND ((p12 <= 0)) AND ((1 <= p41)) AND ((p22 <= 0)))))",
"processed_size": 73,
"rewrites": 22
},
"result":
{
"edges": 17,
"markings": 18,
"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": 4,
"problems": 4
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 5,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1734
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1734
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"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": "(((1 <= p74)) AND ((p30 <= 0)))",
"processed_size": 31,
"rewrites": 21
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 6,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3469
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 4,
"adisj": 1,
"aneg": 1,
"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 (F ((((1 <= p68)) AND ((p39 <= 0)) AND ((1 <= p53)) AND ((p65 <= 0)))))",
"processed_size": 73,
"rewrites": 22
},
"result":
{
"edges": 12,
"markings": 13,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 4
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 6,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3469
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3469
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 11,
"adisj": 5,
"aneg": 0,
"comp": 10,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 10,
"visible_transitions": 0
},
"processed": "((((p10 <= 0)) OR ((1 <= p47))) AND (DEADLOCK OR ((((p67 <= 0)) OR ((1 <= p64))) AND (((p24 <= 0)) OR ((1 <= p52))) AND (((p18 <= 0)) OR ((1 <= p30))))) AND (((p2 <= 0)) OR ((1 <= p51))))",
"processed_size": 192,
"rewrites": 25
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 7,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 7,
"type": "boolean"
}
},
{
"child":
[
{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 11,
"adisj": 5,
"aneg": 0,
"comp": 10,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 10,
"visible_transitions": 0
},
"processed": "((((p10 <= 0)) OR ((1 <= p47))) AND (DEADLOCK OR ((((p67 <= 0)) OR ((1 <= p64))) AND (((p24 <= 0)) OR ((1 <= p52))) AND (((p18 <= 0)) OR ((1 <= p30))))) AND (((p2 <= 0)) OR ((1 <= p51))))",
"processed_size": 192,
"rewrites": 25
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 8,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 3,
"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": "E (((((p49 <= 0)) OR ((1 <= p3))) U ((1 <= p13) AND (1 <= p32))))",
"processed_size": 66,
"rewrites": 24
},
"result":
{
"edges": 58,
"markings": 37,
"produced_by": "state space /EU",
"value": true
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "eu preserving",
"visible": 2
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "existential_until",
"workflow": "stateequation"
}
}
],
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 8,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 30232,
"runtime": 101.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "E((** U A(G(**)))) : A(G(A(F(**)))) : (** AND E(F(**))) : DEADLOCK : (E((** U **)) AND (** AND ((DEADLOCK OR **) AND **))) : (E(F(*)) OR **) : E(F(A(G(**)))) : A(G(E(F(**))))"
},
"net":
{
"arcs": 447,
"conflict_clusters": 28,
"places": 75,
"places_significant": 67,
"singleton_clusters": 0,
"transitions": 128
},
"result":
{
"preliminary_value": "no no yes no yes yes no yes ",
"value": "no no yes no yes yes no 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: 203/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 75
lola: finding significant places
lola: 75 places, 128 transitions, 67 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: (p26 <= 1)
lola: LP says that atomic proposition is always true: (p39 <= 1)
lola: LP says that atomic proposition is always true: (p62 <= 1)
lola: LP says that atomic proposition is always true: (p64 <= 1)
lola: LP says that atomic proposition is always true: (p12 <= 1)
lola: LP says that atomic proposition is always true: (p22 <= 1)
lola: LP says that atomic proposition is always true: (p3 <= 1)
lola: LP says that atomic proposition is always true: (p13 <= 1)
lola: LP says that atomic proposition is always true: (p32 <= 1)
lola: LP says that atomic proposition is always true: (p47 <= 1)
lola: LP says that atomic proposition is always true: (p64 <= 1)
lola: LP says that atomic proposition is always true: (p52 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p51 <= 1)
lola: LP says that atomic proposition is always true: (p39 <= 1)
lola: LP says that atomic proposition is always true: (p65 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p64 <= 1)
lola: LP says that atomic proposition is always true: (p57 <= 1)
lola: LP says that atomic proposition is always true: (p18 <= 1)
lola: LP says that atomic proposition is always true: (p61 <= 1)
lola: E (((((p47 <= 0)) OR ((1 <= p26))) U A (G ((((p1 <= 0)) OR ((1 <= p39))))))) : A (G (A (F ((((p59 <= 0)) OR ((1 <= p62))))))) : (E (((1 <= 0) U (((p18 <= 0)) OR ((1 <= p64))))) AND E (F ((((1 <= p28)) AND ((p12 <= 0)) AND ((1 <= p41)) AND ((p22 <= 0)))))) : E (G (A (X ((1 <= 0))))) : (((E (((((p49 <= 0)) OR ((1 <= p3))) U ((1 <= p13) AND (1 <= p32)))) AND (((p10 <= 0)) OR ((1 <= p47)))) AND (A (X ((1 <= 0))) OR ((((p67 <= 0)) OR ((1 <= p64))) AND (((p24 <= 0)) OR ((1 <= p52))) AND (((p18 <= 0)) OR ((1 <= p30)))))) AND (((p2 <= 0)) OR ((1 <= p51)))) : (NOT(A (G ((((p68 <= 0)) OR ((1 <= p39)) OR ((p53 <= 0)) OR ((1 <= p65)))))) OR (((1 <= p74)) AND ((p30 <= 0)))) : (E (F (A (G ((((p69 <= 0)) OR ((1 <= p64))))))) OR (E (X ((1 <= 0))) AND E (((((p71 <= 0)) OR ((1 <= p57))) U (1 <= 0))))) : A (G (E (F (((((p66 <= 0)) OR ((1 <= p18))) AND (((p50 <= 0)) OR ((1 <= p61))))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:183
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:139
lola: rewrite Frontend/Parser/formula_rewrite.k:200
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:139
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:133
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:118
lola: rewrite Frontend/Parser/formula_rewrite.k:121
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: DEADLOCK
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: DEADLOCK
lola: processed formula length: 8
lola: 21 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 0 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 1 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (A (F ((((p59 <= 0)) OR ((1 <= p62)))))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence from all states
lola: rewrite Frontend/Parser/formula_rewrite.k:599
lola: rewrite Frontend/Parser/formula_rewrite.k:634
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (((1 <= p59)) AND ((p62 <= 0)))
lola: processed formula length: 31
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 /EFEG)
lola: state space: using reachability graph (EFEG version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 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: SUBRESULT
lola: result: no
lola: produced by: state space /EFEG
lola: The predicate does not eventually occur from all states.
lola: 7 markings, 7 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:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((p59 <= 0)) OR ((1 <= p62)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: ========================================
lola: subprocess 2 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (G ((((p69 <= 0)) OR ((1 <= p64)))))))
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: (((1 <= p69)) AND ((p64 <= 0)))
lola: processed formula length: 31
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
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: (((p69 <= 0)) OR ((1 <= p64)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: (((1 <= p69)) AND ((p64 <= 0)))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-2-0.sara
lola: state equation: calling and running sara
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-0.sara.
sara: try reading problem file CTLCardinality-2-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 || 1590283 markings, 3405279 edges, 318057 markings/sec, 0 secs
lola: sara is running 5 secs || sara is running 5 secs || 2691487 markings, 6931478 edges, 220241 markings/sec, 5 secs
lola: SUBRESULT
lola: result: no
lola: produced by: parallel
lola: The predicate is not possibly invariant.
lola: 2985985 markings, 7928065 edges
lola: ========================================
lola: subprocess 3 will run for 711 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (F (((((p66 <= 0)) OR ((1 <= p18))) AND (((p50 <= 0)) OR ((1 <= p61))))))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: rewrite Frontend/Parser/formula_rewrite.k:603
lola: rewrite Frontend/Parser/formula_rewrite.k:613
lola: rewrite Frontend/Parser/formula_rewrite.k:703
lola: processed formula: ((((p66 <= 0)) OR ((1 <= p18))) AND (((p50 <= 0)) OR ((1 <= p61))))
lola: processed formula length: 69
lola: 24 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using tscc preserving stubborn set method (--stubborn)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 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 <= p66)) AND ((p18 <= 0))) OR (((1 <= p50)) AND ((p61 <= 0))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: ((((p66 <= 0)) OR ((1 <= p18))) AND (((p50 <= 0)) OR ((1 <= p61))))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 8 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-3-0.sara
lola: state equation: write sara problem file to CTLCardinality-3-1.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-3-0.sara.
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-3-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 || 1104682 markings, 3352893 edges, 220936 markings/sec, 0 secs
lola: sara is running 5 secs || sara is running 5 secs || 1952669 markings, 6422226 edges, 169597 markings/sec, 5 secs
lola: sara is running 10 secs || sara is running 10 secs || 2695858 markings, 9538015 edges, 148638 markings/sec, 10 secs
lola: sara is running 15 secs || sara is running 15 secs || 2937748 markings, 12716526 edges, 48378 markings/sec, 15 secs
lola: sara is running 20 secs || sara is running 20 secs || 2965127 markings, 15649593 edges, 5476 markings/sec, 20 secs
lola: sara is running 25 secs || sara is running 25 secs || 2978189 markings, 18574962 edges, 2612 markings/sec, 25 secs
lola: sara is running 30 secs || sara is running 30 secs || 2985049 markings, 21613699 edges, 1372 markings/sec, 30 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: tscc_search
lola: The predicate is live.
lola: 2985985 markings, 23741980 edges
lola: ========================================
lola: subprocess 4 will run for 879 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (((((p47 <= 0)) OR ((1 <= p26))) U A (G ((((p1 <= 0)) OR ((1 <= p39)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: processed formula: E((((p47 <= 0)) OR ((1 <= p26))) U AG((((p1 <= 0)) OR ((1 <= p39)))))
lola: processed formula length: 71
lola: 23 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 670518 markings, 3089272 edges, 134104 markings/sec, 0 secs
lola: 1275285 markings, 6218337 edges, 120953 markings/sec, 5 secs
lola: 1802716 markings, 9376987 edges, 105486 markings/sec, 10 secs
lola: 2300417 markings, 12514595 edges, 99540 markings/sec, 15 secs
lola: 2737433 markings, 15716855 edges, 87403 markings/sec, 20 secs
lola: 2887574 markings, 18762808 edges, 30028 markings/sec, 25 secs
lola: 2892084 markings, 21627678 edges, 902 markings/sec, 30 secs
lola: 2899007 markings, 24572160 edges, 1385 markings/sec, 35 secs
lola: 2954441 markings, 27403974 edges, 11087 markings/sec, 40 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 2985985 markings, 29546703 edges
lola: ========================================
lola: subprocess 5 will run for 1156 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((((p18 <= 0)) OR ((1 <= p64))) AND E (F ((((1 <= p28)) AND ((p12 <= 0)) AND ((1 <= p41)) AND ((p22 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 1156 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p18 <= 0)) OR ((1 <= p64)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((p18 <= 0)) OR ((1 <= p64)))
lola: processed formula length: 31
lola: 21 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 6 will run for 1734 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((1 <= p28)) AND ((p12 <= 0)) AND ((1 <= p41)) AND ((p22 <= 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 <= p28)) AND ((p12 <= 0)) AND ((1 <= p41)) AND ((p22 <= 0)))))
lola: processed formula length: 73
lola: 22 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= p28)) AND ((p12 <= 0)) AND ((1 <= p41)) AND ((p22 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-6-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 18 markings, 17 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 6 will run for 1734 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F ((((1 <= p68)) AND ((p39 <= 0)) AND ((1 <= p53)) AND ((p65 <= 0))))) OR (((1 <= p74)) AND ((p30 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 1734 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p74)) AND ((p30 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((1 <= p74)) AND ((p30 <= 0)))
lola: processed formula length: 31
lola: 21 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 7 will run for 3469 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((1 <= p68)) AND ((p39 <= 0)) AND ((1 <= p53)) AND ((p65 <= 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 <= p68)) AND ((p39 <= 0)) AND ((1 <= p53)) AND ((p65 <= 0)))))
lola: processed formula length: 73
lola: 22 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= p68)) AND ((p39 <= 0)) AND ((1 <= p53)) AND ((p65 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 13 markings, 12 edges
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: subprocess 7 will run for 3469 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (((((p49 <= 0)) OR ((1 <= p3))) U ((1 <= p13) AND (1 <= p32)))) AND ((((p10 <= 0)) OR ((1 <= p47))) AND ((DEADLOCK OR ((((p67 <= 0)) OR ((1 <= p64))) AND (((p24 <= 0)) OR ((1 <= p52))) AND (((p18 <= 0)) OR ((1 <= p30))))) AND (((p2 <= 0)) OR ((1 <= p51))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 3469 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((((p10 <= 0)) OR ((1 <= p47))) AND ((DEADLOCK OR ((((p67 <= 0)) OR ((1 <= p64))) AND (((p24 <= 0)) OR ((1 <= p52))) AND (((p18 <= 0)) OR ((1 <= p30))))) AND (((p2 <= 0)) OR ((1 <= p51)))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: rewrite Frontend/Parser/formula_rewrite.k:794
lola: processed formula: ((((p10 <= 0)) OR ((1 <= p47))) AND (DEADLOCK OR ((((p67 <= 0)) OR ((1 <= p64))) AND (((p24 <= 0)) OR ((1 <= p52))) AND (((p18 <= 0)) OR ((1 <= p30))))) AND (((p2 <= 0)) OR ((1 <= p51))))
lola: processed formula length: 192
lola: 25 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 10 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: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (E (((((p49 <= 0)) OR ((1 <= p3))) U ((1 <= p13) AND (1 <= p32)))) AND ((((p10 <= 0)) OR ((1 <= p47))) AND ((DEADLOCK OR ((((p67 <= 0)) OR ((1 <= p64))) AND (((p24 <= 0)) OR ((1 <= p52))) AND (((p18 <= 0)) OR ((1 <= p30))))) AND (((p2 <= 0)) OR ((1 <= p51))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: ((((p10 <= 0)) OR ((1 <= p47))) AND ((DEADLOCK OR ((((p67 <= 0)) OR ((1 <= p64))) AND (((p24 <= 0)) OR ((1 <= p52))) AND (((p18 <= 0)) OR ((1 <= p30))))) AND (((p2 <= 0)) OR ((1 <= p51)))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: rewrite Frontend/Parser/formula_rewrite.k:794
lola: processed formula: ((((p10 <= 0)) OR ((1 <= p47))) AND (DEADLOCK OR ((((p67 <= 0)) OR ((1 <= p64))) AND (((p24 <= 0)) OR ((1 <= p52))) AND (((p18 <= 0)) OR ((1 <= p30))))) AND (((p2 <= 0)) OR ((1 <= p51))))
lola: processed formula length: 192
lola: 25 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 10 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: ========================================
lola: ...considering subproblem: E (((((p49 <= 0)) OR ((1 <= p3))) U ((1 <= p13) AND (1 <= p32))))
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 (((((p49 <= 0)) OR ((1 <= p3))) U ((1 <= p13) AND (1 <= p32))))
lola: processed formula length: 66
lola: 24 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EU)
lola: state space: using reachability graph (EU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p13) AND (1 <= p32))
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 /EU
lola: There is a path where Predicate Phi holds until Predicate Psi.
lola: 37 markings, 58 edges
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no yes no yes yes no yes
lola:
preliminary result: no no yes no yes yes no yes
lola: memory consumption: 30232 KB
lola: time consumption: 101 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="FlexibleBarrier-PT-06a"
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 FlexibleBarrier-PT-06a, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r170-smll-158987815600275"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FlexibleBarrier-PT-06a.tgz
mv FlexibleBarrier-PT-06a 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 ;