About the Execution of ITS-LoLa for CloudReconfiguration-PT-308
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15757.860 | 3600000.00 | 490536.00 | 225.40 | FTTFFTFTFTFTFTFF | 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.r180-ebro-158987899600059.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 CloudReconfiguration-PT-308, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r180-ebro-158987899600059
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 836K
-rw-r--r-- 1 mcc users 3.9K Mar 30 01:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 30 01:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 28 16:12 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 28 16:12 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.4K Apr 8 14:46 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 8 14:46 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 27 08:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 27 08:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Mar 26 08:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 26 08:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 28 14:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K 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 4 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 660K 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 CloudReconfiguration-PT-308-CTLCardinality-00
FORMULA_NAME CloudReconfiguration-PT-308-CTLCardinality-01
FORMULA_NAME CloudReconfiguration-PT-308-CTLCardinality-02
FORMULA_NAME CloudReconfiguration-PT-308-CTLCardinality-03
FORMULA_NAME CloudReconfiguration-PT-308-CTLCardinality-04
FORMULA_NAME CloudReconfiguration-PT-308-CTLCardinality-05
FORMULA_NAME CloudReconfiguration-PT-308-CTLCardinality-06
FORMULA_NAME CloudReconfiguration-PT-308-CTLCardinality-07
FORMULA_NAME CloudReconfiguration-PT-308-CTLCardinality-08
FORMULA_NAME CloudReconfiguration-PT-308-CTLCardinality-09
FORMULA_NAME CloudReconfiguration-PT-308-CTLCardinality-10
FORMULA_NAME CloudReconfiguration-PT-308-CTLCardinality-11
FORMULA_NAME CloudReconfiguration-PT-308-CTLCardinality-12
FORMULA_NAME CloudReconfiguration-PT-308-CTLCardinality-13
FORMULA_NAME CloudReconfiguration-PT-308-CTLCardinality-14
FORMULA_NAME CloudReconfiguration-PT-308-CTLCardinality-15
=== Now, execution of the tool begins
BK_START 1591135842856
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-02 22:10:45] [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-02 22:10:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-02 22:10:46] [INFO ] Load time of PNML (sax parser for PT used): 331 ms
[2020-06-02 22:10:46] [INFO ] Transformed 2585 places.
[2020-06-02 22:10:46] [INFO ] Transformed 3095 transitions.
[2020-06-02 22:10:46] [INFO ] Found NUPN structural information;
[2020-06-02 22:10:46] [INFO ] Parsed PT model containing 2585 places and 3095 transitions in 437 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 164 ms.
Incomplete random walk after 100000 steps, including 727 resets, run finished after 707 ms. (steps per millisecond=141 ) properties seen :[0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 1, 1, 0, 0, 1, 0, 0, 0, 0, 0]
// Phase 1: matrix 3095 rows 2585 cols
[2020-06-02 22:10:47] [INFO ] Computed 4 place invariants in 148 ms
[2020-06-02 22:10:48] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 138 ms returned sat
[2020-06-02 22:10:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 22:11:07] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 22:11:07] [INFO ] [Real]Absence check using state equation in 19218 ms returned (error "Failed to check-sat")
[2020-06-02 22:11:08] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 110 ms returned sat
[2020-06-02 22:11:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 22:11:27] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 22:11:27] [INFO ] [Real]Absence check using state equation in 19024 ms returned (error "Failed to check-sat")
[2020-06-02 22:11:28] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 111 ms returned sat
[2020-06-02 22:11:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 22:11:47] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 22:11:47] [INFO ] [Real]Absence check using state equation in 19350 ms returned (error "Failed to check-sat")
[2020-06-02 22:11:48] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 115 ms returned sat
[2020-06-02 22:11:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 22:12:07] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 22:12:07] [INFO ] [Real]Absence check using state equation in 19366 ms returned (error "Failed to check-sat")
[2020-06-02 22:12:08] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 109 ms returned sat
[2020-06-02 22:12:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 22:12:27] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 22:12:27] [INFO ] [Real]Absence check using state equation in 19414 ms returned unknown
[2020-06-02 22:12:28] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 114 ms returned sat
[2020-06-02 22:12:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 22:12:47] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 22:12:47] [INFO ] [Real]Absence check using state equation in 19400 ms returned (error "Failed to check-sat")
[2020-06-02 22:12:48] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 108 ms returned sat
[2020-06-02 22:12:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 22:13:07] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 22:13:07] [INFO ] [Real]Absence check using state equation in 19445 ms returned unknown
[2020-06-02 22:13:08] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 116 ms returned sat
[2020-06-02 22:13:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 22:13:27] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 22:13:27] [INFO ] [Real]Absence check using state equation in 19436 ms returned (error "Failed to check-sat")
[2020-06-02 22:13:28] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 110 ms returned sat
[2020-06-02 22:13:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 22:13:47] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 22:13:47] [INFO ] [Real]Absence check using state equation in 19402 ms returned (error "Failed to check-sat")
[2020-06-02 22:13:48] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 109 ms returned sat
[2020-06-02 22:13:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 22:14:07] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 22:14:07] [INFO ] [Real]Absence check using state equation in 19433 ms returned (error "Failed to check-sat")
[2020-06-02 22:14:08] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 110 ms returned sat
[2020-06-02 22:14:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 22:14:27] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 22:14:27] [INFO ] [Real]Absence check using state equation in 19431 ms returned unknown
[2020-06-02 22:14:28] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 110 ms returned sat
[2020-06-02 22:14:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 22:14:47] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 22:14:47] [INFO ] [Real]Absence check using state equation in 19250 ms returned unknown
[2020-06-02 22:14:48] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 110 ms returned sat
[2020-06-02 22:14:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 22:15:07] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 22:15:07] [INFO ] [Real]Absence check using state equation in 19454 ms returned (error "Failed to check-sat")
[2020-06-02 22:15:08] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 111 ms returned sat
[2020-06-02 22:15:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 22:15:27] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 22:15:27] [INFO ] [Real]Absence check using state equation in 19417 ms returned unknown
[2020-06-02 22:15:28] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 108 ms returned sat
[2020-06-02 22:15:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 22:15:47] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 22:15:47] [INFO ] [Real]Absence check using state equation in 19444 ms returned unknown
[2020-06-02 22:15:48] [INFO ] Initial state reduction rules for CTL removed 6 formulas.
[2020-06-02 22:15:48] [INFO ] Flatten gal took : 493 ms
[2020-06-02 22:15:49] [INFO ] Initial state reduction rules for CTL removed 6 formulas.
[2020-06-02 22:15:49] [INFO ] Flatten gal took : 275 ms
FORMULA CloudReconfiguration-PT-308-CTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-308-CTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-308-CTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-308-CTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-308-CTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-308-CTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-02 22:15:49] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLCardinality.sr.xml took 8 ms.
[2020-06-02 22:15:49] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 53 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLCardinality @ CloudReconfiguration-PT-308 @ 3570 seconds
FORMULA CloudReconfiguration-PT-308-CTLCardinality-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA CloudReconfiguration-PT-308-CTLCardinality-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA CloudReconfiguration-PT-308-CTLCardinality-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA CloudReconfiguration-PT-308-CTLCardinality-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA CloudReconfiguration-PT-308-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA CloudReconfiguration-PT-308-CTLCardinality-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA CloudReconfiguration-PT-308-CTLCardinality-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA CloudReconfiguration-PT-308-CTLCardinality-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA CloudReconfiguration-PT-308-CTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA CloudReconfiguration-PT-308-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3408
rslt: Output for CTLCardinality @ CloudReconfiguration-PT-308
{
"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": "Tue Jun 2 22:15:49 2020
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 348
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 348
},
"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": "(((p2018 <= 0)) OR ((1 <= p1302)))",
"processed_size": 35,
"rewrites": 5
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 0,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 387
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"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": "AX(EG((((p672 <= 0)) OR ((1 <= p2539)))))",
"processed_size": 42,
"rewrites": 7
},
"net":
{
"conflict_clusters": 2448,
"singleton_clusters": 0
},
"result":
{
"edges": 72,
"markings": 72,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 0,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 387
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 387
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"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": "E (F ((((1 <= p1828)) AND ((p1113 <= 0)))))",
"processed_size": 43,
"rewrites": 6
},
"result":
{
"edges": 59,
"markings": 60,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 1,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 435
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 435
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 5,
"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 <= p1008)) AND ((p2302 <= 0))) OR (((1 <= p517)) AND ((p2041 <= 0))))))",
"processed_size": 84,
"rewrites": 6
},
"result":
{
"edges": 57,
"markings": 58,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 498
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"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": "AX(EG((((p1245 <= 0)) OR ((1 <= p759)))))",
"processed_size": 42,
"rewrites": 7
},
"net":
{
"conflict_clusters": 2448,
"singleton_clusters": 0
},
"result":
{
"edges": 96,
"markings": 96,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 2,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 498
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 3,
"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": "A (G ((((p850 <= 0)) OR ((1 <= p2325)) OR (((1 <= p1929)) AND ((p1715 <= 0))))))",
"processed_size": 82,
"rewrites": 7
},
"result":
{
"edges": 54,
"markings": 55,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 6,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 581
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 5,
"adisj": 6,
"aneg": 0,
"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": "E (F (((((p345 <= 0)) OR ((1 <= p2231))) AND ((((1 <= p200)) AND ((p1887 <= 0))) OR (((1 <= p395)) AND ((p2422 <= 0)))))))",
"processed_size": 124,
"rewrites": 6
},
"result":
{
"edges": 60,
"markings": 61,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 12,
"problems": 4
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 697
},
"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 <= p676)) AND ((p2020 <= 0)))",
"processed_size": 34,
"rewrites": 9
},
"result":
{
"edges": 183,
"markings": 176,
"produced_by": "parallel",
"value": true
},
"task":
{
"compoundnumber": 5,
"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": 871
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 871
},
"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 <= p1382)) AND ((p2217 <= 0)))",
"processed_size": 35,
"rewrites": 5
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 6,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1161
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"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": "E (F (((1 <= p1306))))",
"processed_size": 22,
"rewrites": 6
},
"result":
{
"edges": 38,
"markings": 39,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 6,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1161
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 9,
"adisj": 2,
"aneg": 0,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "A ((((((p2446 <= 0)) OR ((1 <= p2318)) OR ((1 <= p1564))) AND (((p826 <= 0)) OR ((1 <= p337)) OR ((p540 <= 0)) OR ((1 <= p352)))) U ((1 <= p1732))))",
"processed_size": 153,
"rewrites": 10
},
"result":
{
"edges": 89,
"markings": 89,
"produced_by": "state space /ER",
"value": false
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl",
"visible": 9
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 24,
"problems": 12
},
"type": "universal_until",
"workflow": "stateequation"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1742
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 5,
"adisj": 2,
"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": "((((1 <= p868)) AND ((p379 <= 0))) OR (((1 <= p157)) AND ((p354 <= 0))))",
"processed_size": 73,
"rewrites": 9
},
"result":
{
"edges": 2730818,
"markings": 743327,
"produced_by": "state space /EGEF",
"value": false
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving",
"visible": 4
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 8,
"problems": 4
},
"type": "eventual_invariance",
"workflow": "stateequation"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3408
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 5,
"adisj": 2,
"aneg": 2,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "(((p1269 <= 0) OR (((1 <= p35)) AND ((p2564 <= 0)))) R F ((((1 <= p1319)) AND ((p13 <= 0)))))",
"processed_size": 94,
"rewrites": 14
},
"result":
{
"edges": 89,
"markings": 89,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "existential single path",
"workflow": "product automaton"
}
}
],
"exit":
{
"error": null,
"memory": 102908,
"runtime": 162.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(A(X(E(G(**)))) AND **) : (E(X(**)) OR E(F(*))) : (E(F(**)) OR **) : A((** U **)) : (E(F(**)) AND A(X(E(G(**))))) : A(G(**)) : E(F(A(G(**)))) : E((** U E(G(**)))) : E(F(**)) : A(F(A(G(**))))"
},
"net":
{
"arcs": 6463,
"conflict_clusters": 2448,
"places": 2585,
"places_significant": 2581,
"singleton_clusters": 0,
"transitions": 3095
},
"result":
{
"preliminary_value": "yes yes yes no yes no yes yes yes no ",
"value": "yes yes yes no yes no yes yes yes no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 5680/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 2585
lola: finding significant places
lola: 2585 places, 3095 transitions, 2581 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: (p2539 <= 1)
lola: LP says that atomic proposition is always true: (p1302 <= 1)
lola: LP says that atomic proposition is always true: (p2402 <= 1)
lola: LP says that atomic proposition is always true: (p1113 <= 1)
lola: LP says that atomic proposition is always true: (p1306 <= 1)
lola: LP says that atomic proposition is always true: (p2217 <= 1)
lola: LP says that atomic proposition is always true: (p2318 <= 1)
lola: LP says that atomic proposition is always true: (p1564 <= 1)
lola: LP says that atomic proposition is always true: (p337 <= 1)
lola: LP says that atomic proposition is always true: (p352 <= 1)
lola: LP says that atomic proposition is always true: (p1732 <= 1)
lola: LP says that atomic proposition is always true: (p2302 <= 1)
lola: LP says that atomic proposition is always true: (p2041 <= 1)
lola: LP says that atomic proposition is always true: (p759 <= 1)
lola: LP says that atomic proposition is always true: (p2325 <= 1)
lola: LP says that atomic proposition is always true: (p1715 <= 1)
lola: LP says that atomic proposition is always true: (p2020 <= 1)
lola: LP says that atomic proposition is always true: (p1269 <= 1)
lola: LP says that atomic proposition is always true: (p2564 <= 1)
lola: LP says that atomic proposition is always true: (p13 <= 1)
lola: LP says that atomic proposition is always true: (p2231 <= 1)
lola: LP says that atomic proposition is always true: (p1887 <= 1)
lola: LP says that atomic proposition is always true: (p2422 <= 1)
lola: LP says that atomic proposition is always true: (p379 <= 1)
lola: LP says that atomic proposition is always true: (p354 <= 1)
lola: (A (X (E (G ((((p672 <= 0)) OR ((1 <= p2539))))))) AND (((p2018 <= 0)) OR ((1 <= p1302)))) : (E (X (((1 <= p2402)))) OR NOT(A (G ((((p1828 <= 0)) OR ((1 <= p1113))))))) : (E (F (((1 <= p1306)))) OR A (((1 <= 0) U (((1 <= p1382)) AND ((p2217 <= 0)))))) : A ((((((p2446 <= 0)) OR ((1 <= p2318)) OR ((1 <= p1564))) AND (((p826 <= 0)) OR ((1 <= p337)) OR ((p540 <= 0)) OR ((1 <= p352)))) U ((1 <= p1732)))) : (E (F (((((1 <= p1008)) AND ((p2302 <= 0))) OR (((1 <= p517)) AND ((p2041 <= 0)))))) AND A (X (E (G ((((p1245 <= 0)) OR ((1 <= p759)))))))) : A (G ((((p850 <= 0)) OR ((1 <= p2325)) OR (((1 <= p1929)) AND ((p1715 <= 0)))))) : E (F (A (G ((((p676 <= 0)) OR ((1 <= p2020))))))) : E ((((1 <= p1269) AND (((p35 <= 0)) OR ((1 <= p2564)))) U E (G ((((p1319 <= 0)) OR ((1 <= p13))))))) : E (F (((((p345 <= 0)) OR ((1 <= p2231))) AND ((((1 <= p200)) AND ((p1887 <= 0))) OR (((1 <= p395)) AND ((p2422 <= 0))))))) : A (F (A (G (((((p868 <= 0)) OR ((1 <= p379))) AND (((p157 <= 0)) OR ((1 <= p354))))))))
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:184
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 348 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (X (E (G ((((p672 <= 0)) OR ((1 <= p2539))))))) AND (((p2018 <= 0)) OR ((1 <= p1302))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 348 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p2018 <= 0)) OR ((1 <= p1302)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((p2018 <= 0)) OR ((1 <= p1302)))
lola: processed formula length: 35
lola: 5 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 387 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (E (G ((((p672 <= 0)) OR ((1 <= p2539)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX(EG((((p672 <= 0)) OR ((1 <= p2539)))))
lola: processed formula length: 42
lola: 7 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 72 markings, 72 edges
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: subprocess 1 will run for 387 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (X (((1 <= p2402)))) OR E (F ((((1 <= p1828)) AND ((p1113 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 387 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((1 <= p1828)) AND ((p1113 <= 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 <= p1828)) AND ((p1113 <= 0)))))
lola: processed formula length: 43
lola: 6 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 <= p1828)) AND ((p1113 <= 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 reachable.
lola: 60 markings, 59 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 2 will run for 435 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F (((((1 <= p1008)) AND ((p2302 <= 0))) OR (((1 <= p517)) AND ((p2041 <= 0)))))) AND A (X (E (G ((((p1245 <= 0)) OR ((1 <= p759))))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 435 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((((1 <= p1008)) AND ((p2302 <= 0))) OR (((1 <= p517)) AND ((p2041 <= 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 <= p1008)) AND ((p2302 <= 0))) OR (((1 <= p517)) AND ((p2041 <= 0))))))
lola: processed formula length: 84
lola: 6 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 <= p1008)) AND ((p2302 <= 0))) OR (((1 <= p517)) AND ((p2041 <= 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
lola: The predicate is reachable.
lola: 58 markings, 57 edges
lola: ========================================
lola: subprocess 3 will run for 498 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (E (G ((((p1245 <= 0)) OR ((1 <= p759)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX(EG((((p1245 <= 0)) OR ((1 <= p759)))))
lola: processed formula length: 42
lola: 7 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 96 markings, 96 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 3 will run for 498 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((p850 <= 0)) OR ((1 <= p2325)) OR (((1 <= p1929)) AND ((p1715 <= 0))))))
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 ((((p850 <= 0)) OR ((1 <= p2325)) OR (((1 <= p1929)) AND ((p1715 <= 0))))))
lola: processed formula length: 82
lola: 7 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 <= p850)) AND ((p2325 <= 0)) AND (((p1929 <= 0)) OR ((1 <= p1715))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 55 markings, 54 edges
lola: ========================================
lola: subprocess 4 will run for 581 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((((p345 <= 0)) OR ((1 <= p2231))) AND ((((1 <= p200)) AND ((p1887 <= 0))) OR (((1 <= p395)) AND ((p2422 <= 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 (((((p345 <= 0)) OR ((1 <= p2231))) AND ((((1 <= p200)) AND ((p1887 <= 0))) OR (((1 <= p395)) AND ((p2422 <= 0)))))))
lola: processed formula length: 124
lola: 6 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: ((((p345 <= 0)) OR ((1 <= p2231))) AND ((((1 <= p200)) AND ((p1887 <= 0))) OR (((1 <= p395)) AND ((p2422 <= 0)))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 12 literals and 4 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 61 markings, 60 edges
lola: ========================================
lola: subprocess 5 will run for 697 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (G ((((p676 <= 0)) OR ((1 <= p2020)))))))
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 <= p676)) AND ((p2020 <= 0)))
lola: processed formula length: 34
lola: 9 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using tscc preserving stubborn set method (--stubborn)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: 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 0
lola: state equation task get result unparse finished++ id 1
lola: formula 0: (((p676 <= 0)) OR ((1 <= p2020)))
lola: state equation task get result unparse finished id 0
lola: formula 1: (((1 <= p676)) AND ((p2020 <= 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: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: parallel
lola: The predicate is possibly invariant.
lola: 176 markings, 183 edges
lola: ========================================
lola: subprocess 6 will run for 871 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F (((1 <= p1306)))) OR (((1 <= p1382)) AND ((p2217 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 871 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p1382)) AND ((p2217 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((1 <= p1382)) AND ((p2217 <= 0)))
lola: processed formula length: 35
lola: 5 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 1161 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p1306))))
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 <= p1306))))
lola: processed formula length: 22
lola: 6 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 <= p1306))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 39 markings, 38 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 7 will run for 1161 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((((((p2446 <= 0)) OR ((1 <= p2318)) OR ((1 <= p1564))) AND (((p826 <= 0)) OR ((1 <= p337)) OR ((p540 <= 0)) OR ((1 <= p352)))) U ((1 <= p1732))))
lola: ========================================
lola: SUBTASK
lola: checking universal until
lola: rewrite Frontend/Parser/formula_rewrite.k:577
lola: rewrite Frontend/Parser/formula_rewrite.k:735
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A ((((((p2446 <= 0)) OR ((1 <= p2318)) OR ((1 <= p1564))) AND (((p826 <= 0)) OR ((1 <= p337)) OR ((p540 <= 0)) OR ((1 <= p352)))) U ((1 <= p1732))))
lola: processed formula length: 153
lola: 10 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /ER)
lola: state space: using reachability graph (ER version) (--search=depth)
lola: state space: using ltl 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: ((((p2446 <= 0)) OR ((1 <= p2318)) OR ((1 <= p1564))) AND (((p826 <= 0)) OR ((1 <= p337)) OR ((p540 <= 0)) OR ((1 <= p352))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 24 literals and 12 conjunctive subformulas
lola: 1
lola: SUBRESULT
lola: result: no
lola: produced by: state space /ER
lola: Predicate Phi does not hild until Predicate Psi on all paths.
lola: 89 markings, 89 edges
lola: ========================================
lola: subprocess 8 will run for 1742 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (A (G (((((p868 <= 0)) OR ((1 <= p379))) AND (((p157 <= 0)) OR ((1 <= p354))))))))
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: ((((1 <= p868)) AND ((p379 <= 0))) OR (((1 <= p157)) AND ((p354 <= 0))))
lola: processed formula length: 73
lola: 9 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /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 rewrite finished id 0
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: ((((1 <= p868)) AND ((p379 <= 0))) OR (((1 <= p157)) AND ((p354 <= 0))))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((((p868 <= 0)) OR ((1 <= p379))) AND (((p157 <= 0)) OR ((1 <= p354))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 8 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-8-1.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-8-1.sara.
lola: state equation: write sara problem file to CTLCardinality-8-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-8-0.sara.
sara: error: :12003: error near 'TRANSITION': syntax error, unexpected KEY_TRANSITION, expecting SEMICOLON or COMMA
sara: error while reading Petri net from file -- aborting [#04]
sara: see manual for a documentation of this error
sara: last error message: No such file or directory
lola: state equation:solution unknown
sara: error: :12003: error near 'TRANSITION': syntax error, unexpected KEY_TRANSITION, expecting SEMICOLON or COMMA
sara: error while reading Petri net from file -- aborting [#04]
sara: see manual for a documentation of this error
sara: last error message: No such file or directory
lola: state equation:solution unknown
lola: sara is running 0 secs || sara is running 0 secs || 54465 markings, 177075 edges, 10893 markings/sec, 0 secs
lola: sara is running 5 secs || sara is running 5 secs || 109204 markings, 355001 edges, 10948 markings/sec, 5 secs
lola: sara is running 10 secs || sara is running 10 secs || 169667 markings, 530857 edges, 12093 markings/sec, 10 secs
lola: sara is running 15 secs || sara is running 15 secs || 220444 markings, 708251 edges, 10155 markings/sec, 15 secs
lola: sara is running 20 secs || sara is running 20 secs || 274288 markings, 885308 edges, 10769 markings/sec, 20 secs
lola: sara is running 25 secs || sara is running 25 secs || 325365 markings, 1061999 edges, 10215 markings/sec, 25 secs
lola: sara is running 30 secs || sara is running 30 secs || 370418 markings, 1239573 edges, 9011 markings/sec, 30 secs
lola: sara is running 35 secs || sara is running 35 secs || 413240 markings, 1417527 edges, 8564 markings/sec, 35 secs
lola: sara is running 40 secs || sara is running 40 secs || 453276 markings, 1596563 edges, 8007 markings/sec, 40 secs
lola: sara is running 45 secs || sara is running 45 secs || 501327 markings, 1775798 edges, 9610 markings/sec, 45 secs
lola: sara is running 50 secs || sara is running 50 secs || 543659 markings, 1955557 edges, 8466 markings/sec, 50 secs
lola: sara is running 55 secs || sara is running 55 secs || 583077 markings, 2131284 edges, 7884 markings/sec, 55 secs
lola: sara is running 60 secs || sara is running 60 secs || 624260 markings, 2312038 edges, 8237 markings/sec, 60 secs
lola: sara is running 65 secs || sara is running 65 secs || 663572 markings, 2490310 edges, 7862 markings/sec, 65 secs
lola: sara is running 70 secs || sara is running 70 secs || 718390 markings, 2655415 edges, 10964 markings/sec, 70 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EGEF
lola: The predicate is not eventually invariant.
lola: 743327 markings, 2730818 edges
lola: ========================================
lola: subprocess 9 will run for 3408 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((((1 <= p1269) AND (((p35 <= 0)) OR ((1 <= p2564)))) U E (G ((((p1319 <= 0)) OR ((1 <= p13)))))))
lola: ========================================
lola: SUBTASK
lola: checking an existential CTL formula with single witness path (use LTL...)
lola: rewrite Frontend/Parser/formula_rewrite.k:658
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:663
lola: rewrite Frontend/Parser/formula_rewrite.k:668
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:662
lola: rewrite Frontend/Parser/formula_rewrite.k:668
lola: rewrite Frontend/Parser/formula_rewrite.k:679
lola: rewrite Frontend/Parser/formula_rewrite.k:679
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (((p1269 <= 0) OR (((1 <= p35)) AND ((p2564 <= 0)))) R F ((((1 <= p1319)) AND ((p13 <= 0)))))
lola: processed formula length: 94
lola: 14 rewrites
lola: closed formula file CTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The existential single path CTL formula holds.
lola: 89 markings, 89 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes yes yes no yes no yes yes yes no
lola:
preliminary result: yes yes yes no yes no yes yes yes no
lola: memory consumption: 102908 KB
lola: time consumption: 162 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="CloudReconfiguration-PT-308"
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 CloudReconfiguration-PT-308, 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 r180-ebro-158987899600059"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/CloudReconfiguration-PT-308.tgz
mv CloudReconfiguration-PT-308 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 ;