About the Execution of LoLA for QuasiCertifProtocol-COL-06
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
4317.940 | 28821.00 | 6162.00 | 32.40 | FFFFFTFFFTTTFTFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fko/mcc2019-input.r126-oct2-155274853300206.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2019-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................
=====================================================================
Generated by BenchKit 2-3954
Executing tool lola
Input is QuasiCertifProtocol-COL-06, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r126-oct2-155274853300206
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 224K
-rw-r--r-- 1 mcc users 3.1K Feb 12 10:31 CTLCardinality.txt
-rw-r--r-- 1 mcc users 15K Feb 12 10:31 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Feb 8 12:39 CTLFireability.txt
-rw-r--r-- 1 mcc users 21K Feb 8 12:39 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Mar 10 17:31 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 113 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 351 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 2.4K Feb 5 00:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.7K Feb 5 00:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Feb 4 22:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 7.6K Feb 4 22:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Feb 4 13:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Feb 4 13:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Feb 1 10:18 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 1 10:18 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 4 22:26 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 4 22:26 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Jan 29 09:34 equiv_pt
-rw-r--r-- 1 mcc users 3 Jan 29 09:34 instance
-rw-r--r-- 1 mcc users 5 Jan 29 09:34 iscolored
-rw-r--r-- 1 mcc users 61K Mar 10 17:31 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 QuasiCertifProtocol-COL-06-ReachabilityCardinality-00
FORMULA_NAME QuasiCertifProtocol-COL-06-ReachabilityCardinality-01
FORMULA_NAME QuasiCertifProtocol-COL-06-ReachabilityCardinality-02
FORMULA_NAME QuasiCertifProtocol-COL-06-ReachabilityCardinality-03
FORMULA_NAME QuasiCertifProtocol-COL-06-ReachabilityCardinality-04
FORMULA_NAME QuasiCertifProtocol-COL-06-ReachabilityCardinality-05
FORMULA_NAME QuasiCertifProtocol-COL-06-ReachabilityCardinality-06
FORMULA_NAME QuasiCertifProtocol-COL-06-ReachabilityCardinality-07
FORMULA_NAME QuasiCertifProtocol-COL-06-ReachabilityCardinality-08
FORMULA_NAME QuasiCertifProtocol-COL-06-ReachabilityCardinality-09
FORMULA_NAME QuasiCertifProtocol-COL-06-ReachabilityCardinality-10
FORMULA_NAME QuasiCertifProtocol-COL-06-ReachabilityCardinality-11
FORMULA_NAME QuasiCertifProtocol-COL-06-ReachabilityCardinality-12
FORMULA_NAME QuasiCertifProtocol-COL-06-ReachabilityCardinality-13
FORMULA_NAME QuasiCertifProtocol-COL-06-ReachabilityCardinality-14
FORMULA_NAME QuasiCertifProtocol-COL-06-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1553893176143
info: Time: 3600 - MCC
vrfy: Checking ReachabilityCardinality @ QuasiCertifProtocol-COL-06 @ 3570 seconds
FORMULA QuasiCertifProtocol-COL-06-ReachabilityCardinality-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA QuasiCertifProtocol-COL-06-ReachabilityCardinality-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA QuasiCertifProtocol-COL-06-ReachabilityCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA QuasiCertifProtocol-COL-06-ReachabilityCardinality-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA QuasiCertifProtocol-COL-06-ReachabilityCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA QuasiCertifProtocol-COL-06-ReachabilityCardinality-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA QuasiCertifProtocol-COL-06-ReachabilityCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA QuasiCertifProtocol-COL-06-ReachabilityCardinality-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA QuasiCertifProtocol-COL-06-ReachabilityCardinality-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA QuasiCertifProtocol-COL-06-ReachabilityCardinality-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA QuasiCertifProtocol-COL-06-ReachabilityCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA QuasiCertifProtocol-COL-06-ReachabilityCardinality-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA QuasiCertifProtocol-COL-06-ReachabilityCardinality-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA QuasiCertifProtocol-COL-06-ReachabilityCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA QuasiCertifProtocol-COL-06-ReachabilityCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA QuasiCertifProtocol-COL-06-ReachabilityCardinality-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3542
rslt: Output for ReachabilityCardinality @ QuasiCertifProtocol-COL-06
{
"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": "mcc2019",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=ReachabilityCardinality.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--json=ReachabilityCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Fri Mar 29 20:59:36 2019
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 222
},
"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": "TRUE",
"processed_size": 4,
"rewrites": 6
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 0,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 237
},
"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": "FALSE",
"processed_size": 5,
"rewrites": 6
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 1,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "E (F ((p152 + p158 + p157 + p156 + p155 + p154 + p153 <= 2)))",
"processed_size": 61,
"rewrites": 7
},
"result":
{
"edges": 38,
"markings": 39,
"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": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "E (F ((p206 + p205 + p200 + p201 + p202 + p203 + p204 + 1 <= p65)))",
"processed_size": 67,
"rewrites": 7
},
"result":
{
"edges": 19,
"markings": 20,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "A (G ((p182 <= p206 + p205 + p200 + p201 + p202 + p203 + p204)))",
"processed_size": 64,
"rewrites": 8
},
"result":
{
"edges": 35,
"markings": 36,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 14,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 14,
"visible_transitions": 0
},
"processed": "A (G (((p207 + p208 + p209 + p210 + p211 + p212 + p213 <= 1) OR (2 <= p187 + p188 + p189 + p190 + p191 + p192 + p186))))",
"processed_size": 121,
"rewrites": 8
},
"result":
{
"edges": 10,
"markings": 11,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 28,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 21,
"visible_transitions": 0
},
"processed": "A (G (((p207 + p208 + p209 + p210 + p211 + p212 + p213 <= 1) OR (p64 + p63 + p62 + p61 + p60 + p59 + p58 + 1 <= p207 + p208 + p209 + p210 + p211 + p212 + p213) OR (p187 + p188 + p189 + p190 + p191 + p192 + p186 <= 0))))",
"processed_size": 221,
"rewrites": 8
},
"result":
{
"produced_by": "state equation",
"value": true
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3,
"problems": 3
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 23,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 23,
"visible_transitions": 0
},
"processed": "E (F (((1 <= p138 + p140 + p141 + p142 + p143 + p144 + p139) AND (1 <= p137) AND (((3 <= p193 + p194 + p195 + p196 + p197 + p198 + p199) AND (p80 <= p81 + p82 + p83 + p84 + p85 + p86 + p87))))))",
"processed_size": 194,
"rewrites": 7
},
"result":
{
"edges": 16182,
"markings": 6078,
"produced_by": "state space",
"value": false
},
"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"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 28,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 28,
"visible_transitions": 0
},
"processed": "E (F (((p0 + p1 + p2 + p3 + p4 + p5 + p6 + 1 <= p161 + p162 + p163 + p164 + p165 + p166 + p167) AND (p152 + p158 + p157 + p156 + p155 + p154 + p153 <= p175 + p176 + p177 + p178 + p179 + p180 + p181))))",
"processed_size": 201,
"rewrites": 7
},
"result":
{
"produced_by": "state equation",
"value": false
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 106,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 57,
"visible_transitions": 0
},
"processed": "A (G (((p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p88 + p109 + p116 + p123 + p130 + p136 + p135 + p134 + p133 + p132 + p131 + p129 + p128 + p127 + p126 + p125 + p124 + p122 + p121 + p120 + p119 + p118 + p117 + p115 + p114 + p113 + p112 + p111 + p110 + p108 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99 <= 1) OR ((p160 + 1 <= p71 + p70 + p69 + p68 + p67 + p66 + p72) AND (p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p88 + p109 + p116 + p123 + p130 + p136 + p135 + p134 + p133 + p132 + p131 + p129 + p128 + p127 + p126 + p125 + p124 + p122 + p121 + p120 + p119 + p118 + p117 + p115 + p114 + p113 + p112 + p111 + p110 + p108 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99 <= 0)))))",
"processed_size": 745,
"rewrites": 8
},
"result":
{
"edges": 21,
"markings": 22,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 58,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 58,
"visible_transitions": 0
},
"processed": "E (F (((p182 <= 1) AND (p184 <= p256 + p249 + p242 + p235 + p228 + p221 + p214 + p215 + p216 + p217 + p218 + p219 + p220 + p222 + p223 + p224 + p225 + p226 + p227 + p229 + p230 + p231 + p232 + p233 + p234 + p236 + p237 + p238 + p239 + p240 + p241 + p243 + p244 + p245 + p246 + p247 + p248 + p250 + p251 + p252 + p253 + p254 + p255 + p257 + p258 + p259 + p260 + p261 + p262) AND (3 <= p168 + p169 + p170 + p171 + p172 + p173 + p174))))",
"processed_size": 434,
"rewrites": 7
},
"result":
{
"edges": 25,
"markings": 26,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3,
"problems": 3
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 70,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 63,
"visible_transitions": 0
},
"processed": "E (F (((p187 + p188 + p189 + p190 + p191 + p192 + p186 + 1 <= p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56) AND (p187 + p188 + p189 + p190 + p191 + p192 + p186 <= p175 + p176 + p177 + p178 + p179 + p180 + p181))))",
"processed_size": 458,
"rewrites": 7
},
"result":
{
"produced_by": "state equation",
"value": false
},
"task":
{
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 65,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 65,
"visible_transitions": 0
},
"processed": "A (G (((p187 + p188 + p189 + p190 + p191 + p192 + p186 <= p193 + p194 + p195 + p196 + p197 + p198 + p199) OR ((p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + 1 <= p182) AND (p160 <= 2)))))",
"processed_size": 434,
"rewrites": 8
},
"result":
{
"edges": 26922,
"markings": 6490,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1188
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 69,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 69,
"visible_transitions": 0
},
"processed": "A (G (((3 <= p152 + p158 + p157 + p156 + p155 + p154 + p153) AND (p182 <= p206 + p205 + p200 + p201 + p202 + p203 + p204) AND ((p185 <= p159) OR (p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p88 + p109 + p116 + p123 + p130 + p136 + p135 + p134 + p133 + p132 + p131 + p129 + p128 + p127 + p126 + p125 + p124 + p122 + p121 + p120 + p119 + p118 + p117 + p115 + p114 + p113 + p112 + p111 + p110 + p108 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99 <= p80)) AND (p7 <= p160))))",
"processed_size": 504,
"rewrites": 8
},
"result":
{
"produced_by": "state equation",
"value": false
},
"task":
{
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 5,
"problems": 4
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1783
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 70,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 70,
"visible_transitions": 0
},
"processed": "A (G (((p256 + p249 + p242 + p235 + p228 + p221 + p214 + p215 + p216 + p217 + p218 + p219 + p220 + p222 + p223 + p224 + p225 + p226 + p227 + p229 + p230 + p231 + p232 + p233 + p234 + p236 + p237 + p238 + p239 + p240 + p241 + p243 + p244 + p245 + p246 + p247 + p248 + p250 + p251 + p252 + p253 + p254 + p255 + p257 + p258 + p259 + p260 + p261 + p262 <= p152 + p158 + p157 + p156 + p155 + p154 + p153) AND (p145 + p146 + p147 + p148 + p149 + p150 + p151 <= p81 + p82 + p83 + p84 + p85 + p86 + p87))))",
"processed_size": 498,
"rewrites": 8
},
"result":
{
"edges": 34,
"markings": 35,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3566
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 71,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 71,
"visible_transitions": 0
},
"processed": "A (G (((p256 + p249 + p242 + p235 + p228 + p221 + p214 + p215 + p216 + p217 + p218 + p219 + p220 + p222 + p223 + p224 + p225 + p226 + p227 + p229 + p230 + p231 + p232 + p233 + p234 + p236 + p237 + p238 + p239 + p240 + p241 + p243 + p244 + p245 + p246 + p247 + p248 + p250 + p251 + p252 + p253 + p254 + p255 + p257 + p258 + p259 + p260 + p261 + p262 <= 1) OR ((p182 + 1 <= p152 + p158 + p157 + p156 + p155 + p154 + p153) AND (p193 + p194 + p195 + p196 + p197 + p198 + p199 + 1 <= p145 + p146 + p147 + p148 + p149 + p150 + p151)))))",
"processed_size": 531,
"rewrites": 8
},
"result":
{
"edges": 35,
"markings": 36,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"error": null,
"memory": 80112,
"runtime": 4.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "E(F(**)) : E(F(**)) : A(G(**)) : A(G(**)) : A(G(**)) : TRUE : FALSE : E(F(**)) : A(G(**)) : E(F(**)) : A(G(**)) : E(F(**)) : A(G(**)) : E(F(**)) : A(G(**)) : A(G(**))"
},
"net":
{
"arcs": 659,
"conflict_clusters": 32,
"places": 270,
"places_significant": 115,
"singleton_clusters": 0,
"transitions": 116
},
"result":
{
"preliminary_value": "no no no no no yes no no no yes yes yes no yes no no ",
"value": "no no no no no yes no no no yes yes yes no yes no 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 High-Level net
lola: Places: 270, Transitions: 116
lola: @ trans malA4
lola: @ trans SgetTS
lola: @ trans malA5
lola: @ trans malS3
lola: @ trans AreqCS
lola: @ trans AendCS
lola: @ trans ScertCS
lola: @ trans malA2
lola: @ trans SreqTS
lola: @ trans AackCS
lola: @ trans malS2
lola: @ trans AgetTS
lola: @ trans malA3
lola: @ trans malC1
lola: @ trans AstartCS
lola: @ trans Sperform
lola: @ trans malS1
lola: @ trans SsendTS
lola: @ trans malS4
lola: @ trans AreqTS
lola: @ trans CsendTS1
lola: @ trans malA1
lola: @ trans malS6
lola: @ trans malS5
lola: @ trans SackCS
lola: @ trans CgenCertif
lola: finished unfolding
lola: finished parsing
lola: closed net file model.pnml
lola: 386/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 8640
lola: finding significant places
lola: 270 places, 116 transitions, 115 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 ReachabilityCardinality.xml
lola: LP says that atomic proposition is always false: (3 <= p57)
lola: LP says that atomic proposition is always false: (2 <= p183)
lola: LP says that atomic proposition is always false: (3 <= p184)
lola: LP says that atomic proposition is always false: (2 <= p183)
lola: LP says that atomic proposition is always false: (3 <= p184)
lola: E (F (((p0 + p1 + p2 + p3 + p4 + p5 + p6 + 1 <= p161 + p162 + p163 + p164 + p165 + p166 + p167) AND (p152 + p158 + p157 + p156 + p155 + p154 + p153 <= p175 + p176 + p177 + p178 + p179 + p180 + p181)))) : E (F (((p187 + p188 + p189 + p190 + p191 + p192 + p186 + 1 <= p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56) AND (p187 + p188 + p189 + p190 + p191 + p192 + p186 <= p175 + p176 + p177 + p178 + p179 + p180 + p181)))) : A (G (((p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p88 + p109 + p116 + p123 + p130 + p136 + p135 + p134 + p133 + p132 + p131 + p129 + p128 + p127 + p126 + p125 + p124 + p122 + p121 + p120 + p119 + p118 + p117 + p115 + p114 + p113 + p112 + p111 + p110 + p108 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99 <= 1) OR ((p160 + 1 <= p71 + p70 + p69 + p68 + p67 + p66 + p72) AND (p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p88 + p109 + p116 + p123 + p130 + p136 + p135 + p134 + p133 + p132 + p131 + p129 + p128 + p127 + p126 + p125 + p124 + p122 + p121 + p120 + p119 + p118 + p117 + p115 + p114 + p113 + p112 + p111 + p110 + p108 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99 <= 0))))) : A (G (((p207 + p208 + p209 + p210 + p211 + p212 + p213 <= 1) OR (2 <= p187 + p188 + p189 + p190 + p191 + p192 + p186)))) : A (G (((p187 + p188 + p189 + p190 + p191 + p192 + p186 <= p193 + p194 + p195 + p196 + p197 + p198 + p199) OR ((p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + 1 <= p182) AND (p160 <= 2))))) : A (G (())) : E (F (())) : E (F (((1 <= p138 + p140 + p141 + p142 + p143 + p144 + p139) AND (1 <= p137) AND (((3 <= p193 + p194 + p195 + p196 + p197 + p198 + p199) AND (p80 <= p81 + p82 + p83 + p84 + p85 + p86 + p87)))))) : A (G (((p256 + p249 + p242 + p235 + p228 + p221 + p214 + p215 + p216 + p217 + p218 + p219 + p220 + p222 + p223 + p224 + p225 + p226 + p227 + p229 + p230 + p231 + p232 + p233 + p234 + p236 + p237 + p238 + p239 + p240 + p241 + p243 + p244 + p245 + p246 + p247 + p248 + p250 + p251 + p252 + p253 + p254 + p255 + p257 + p258 + p259 + p260 + p261 + p262 <= 1) OR ((p182 + 1 <= p152 + p158 + p157 + p156 + p155 + p154 + p153) AND (p193 + p194 + p195 + p196 + p197 + p198 + p199 + 1 <= p145 + p146 + p147 + p148 + p149 + p150 + p151))))) : E (F ((p206 + p205 + p200 + p201 + p202 + p203 + p204 + 1 <= p65))) : A (G (((p207 + p208 + p209 + p210 + p211 + p212 + p213 <= 1) OR (p64 + p63 + p62 + p61 + p60 + p59 + p58 + 1 <= p207 + p208 + p209 + p210 + p211 + p212 + p213) OR (p187 + p188 + p189 + p190 + p191 + p192 + p186 <= 0)))) : E (F ((p152 + p158 + p157 + p156 + p155 + p154 + p153 <= 2))) : A (G ((p182 <= p206 + p205 + p200 + p201 + p202 + p203 + p204))) : E (F (((p182 <= 1) AND (p184 <= p256 + p249 + p242 + p235 + p228 + p221 + p214 + p215 + p216 + p217 + p218 + p219 + p220 + p222 + p223 + p224 + p225 + p226 + p227 + p229 + p230 + p231 + p232 + p233 + p234 + p236 + p237 + p238 + p239 + p240 + p241 + p243 + p244 + p245 + p246 + p247 + p248 + p250 + p251 + p252 + p253 + p254 + p255 + p257 + p258 + p259 + p260 + p261 + p262) AND (3 <= p168 + p169 + p170 + p171 + p172 + p173 + p174)))) : A (G (((p256 + p249 + p242 + p235 + p228 + p221 + p214 + p215 + p216 + p217 + p218 + p219 + p220 + p222 + p223 + p224 + p225 + p226 + p227 + p229 + p230 + p231 + p232 + p233 + p234 + p236 + p237 + p238 + p239 + p240 + p241 + p243 + p244 + p245 + p246 + p247 + p248 + p250 + p251 + p252 + p253 + p254 + p255 + p257 + p258 + p259 + p260 + p261 + p262 <= p152 + p158 + p157 + p156 + p155 + p154 + p153) AND (p145 + p146 + p147 + p148 + p149 + p150 + p151 <= p81 + p82 + p83 + p84 + p85 + p86 + p87)))) : A (G (((3 <= p152 + p158 + p157 + p156 + p155 + p154 + p153) AND (p182 <= p206 + p205 + p200 + p201 + p202 + p203 + p204) AND ((p185 <= p159) OR (p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p88 + p109 + p116 + p123 + p130 + p136 + p135 + p134 + p133 + p132 + p131 + p129 + p128 + p127 + p126 + p125 + p124 + p122 + p121 + p120 + p119 + p118 + p117 + p115 + p114 + p113 + p112 + p111 + p110 + p108 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99 <= p80)) AND (p7 <= p160))))
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 6 rewrites
lola: closed formula file ReachabilityCardinality.xml
lola: processed formula with 0 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 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 6 rewrites
lola: closed formula file ReachabilityCardinality.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 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((p152 + p158 + p157 + p156 + p155 + p154 + p153 <= 2)))
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 ((p152 + p158 + p157 + p156 + p155 + p154 + p153 <= 2)))
lola: processed formula length: 61
lola: 7 rewrites
lola: closed formula file ReachabilityCardinality.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: (p152 + p158 + p157 + p156 + p155 + p154 + p153 <= 2)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 39 markings, 38 edges
lola: state equation: write sara problem file to ReachabilityCardinality-2-0.sara
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((p206 + p205 + p200 + p201 + p202 + p203 + p204 + 1 <= p65)))
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 ((p206 + p205 + p200 + p201 + p202 + p203 + p204 + 1 <= p65)))
lola: processed formula length: 67
lola: 7 rewrites
lola: closed formula file ReachabilityCardinality.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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 20 markings, 19 edges
lola: ========================================
lola: state equation: calling and running sara
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p182 <= p206 + p205 + p200 + p201 + p202 + p203 + p204)))
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 ((p182 <= p206 + p205 + p200 + p201 + p202 + p203 + p204)))
lola: processed formula length: 64
lola: 8 rewrites
lola: closed formula file ReachabilityCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: SUBRESULT
lola: state equation task get result unparse finished++ id 0
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: formula 0: (p206 + p205 + p200 + p201 + p202 + p203 + p204 + 1 <= p182)
lola: state equation task get result unparse finished id 0
lola: 36 markings, 35 edges
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: ========================================
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p207 + p208 + p209 + p210 + p211 + p212 + p213 <= 1) OR (2 <= p187 + p188 + p189 + p190 + p191 + p192 + p186))))
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 (((p207 + p208 + p209 + p210 + p211 + p212 + p213 <= 1) OR (2 <= p187 + p188 + p189 + p190 + p191 + p192 + p186))))
lola: processed formula length: 121
lola: 8 rewrites
lola: closed formula file ReachabilityCardinality.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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: formula 0: ((2 <= p207 + p208 + p209 + p210 + p211 + p212 + p213) AND (p187 + p188 + p189 + p190 + p191 + p192 + p186 <= 1))
lola: state equation task get result unparse finished id 0
lola: The predicate is not invariant.
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: 11 markings, 10 edges
lola: ========================================
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p207 + p208 + p209 + p210 + p211 + p212 + p213 <= 1) OR (p64 + p63 + p62 + p61 + p60 + p59 + p58 + 1 <= p207 + p208 + p209 + p210 + p211 + p212 + p213) OR (p187 + p188 + p189 + p190 + p191 + p192 + p186 <= 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 (((p207 + p208 + p209 + p210 + p211 + p212 + p213 <= 1) OR (p64 + p63 + p62 + p61 + p60 + p59 + p58 + 1 <= p207 + p208 + p209 + p210 + p211 + p212 + p213) OR (p187 + p188 + p189 + p190 + p191 + p192 + p186 <= 0))))
lola: processed formula length: 221
lola: 8 rewrites
lola: closed formula file ReachabilityCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((2 <= p207 + p208 + p209 + p210 + p211 + p212 + p213) AND (p207 + p208 + p209 + p210 + p211 + p212 + p213 <= p64 + p63 + p62 + p61 + p60 + p59 + p58) AND (1 <= p187 + p188 + p189 + p190 + p191 + p192 + p186))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityCardinality-6-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-2-0.sara.
sara: try reading problem file ReachabilityCardinality-6-0.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p138 + p140 + p141 + p142 + p143 + p144 + p139) AND (1 <= p137) AND (((3 <= p193 + p194 + p195 + p196 + p197 + p198 + p199) AND (p80 <= p81 + p82 + p83 + p84 + p85 + p86 + p87))))))
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 <= p138 + p140 + p141 + p142 + p143 + p144 + p139) AND (1 <= p137) AND (((3 <= p193 + p194 + p195 + p196 + p197 + p198 + p199) AND (p80 <= p81 + p82 + p83 + p84 + p85 + p86 + p87))))))
lola: processed formula length: 194
lola: 7 rewrites
lola: closed formula file ReachabilityCardinality.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 <= p138 + p140 + p141 + p142 + p143 + p144 + p139) AND (1 <= p137) AND (((3 <= p193 + p194 + p195 + p196 + p197 + p198 + p199) AND (p80 <= p81 + p82 + p83 + p84 + p85 + p86 + p87))))
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 ReachabilityCardinality-7-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-7-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 6078 markings, 16182 edges
lola: ========================================
lola: subprocess 8 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((p0 + p1 + p2 + p3 + p4 + p5 + p6 + 1 <= p161 + p162 + p163 + p164 + p165 + p166 + p167) AND (p152 + p158 + p157 + p156 + p155 + p154 + p153 <= p175 + p176 + p177 + p178 + p179 + p180 + p181))))
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 (((p0 + p1 + p2 + p3 + p4 + p5 + p6 + 1 <= p161 + p162 + p163 + p164 + p165 + p166 + p167) AND (p152 + p158 + p157 + p156 + p155 + p154 + p153 <= p175 + p176 + p177 + p178 + p179 + p180 + p181))))
lola: processed formula length: 201
lola: 7 rewrites
lola: closed formula file ReachabilityCardinality.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: ((p0 + p1 + p2 + p3 + p4 + p5 + p6 + 1 <= p161 + p162 + p163 + p164 + p165 + p166 + p167) AND (p152 + p158 + p157 + p156 + p155 + p154 + p153 <= p175 + p176 + p177 + p178 + p179 + p180 + p181))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityCardinality-8-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-8-0.sara.
sara: place or transition ordering is non-deterministic
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p88 + p109 + p116 + p123 + p130 + p136 + p135 + p134 + p133 + p132 + p131 + p129 + p128 + p127 + p126 + p125 + p124 + p122 + p121 + p120 + p119 + p118 + p117 + p115 + p114 + p113 + p112 + p111 + p110 + p108 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99 <= 1) OR ((p160 + 1 <= p71 + p70 + p69 + p68 + p67 + p66 + p72... (shortened)
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 (((p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p88 + p109 + p116 + p123 + p130 + p136 + p135 + p134 + p133 + p132 + p131 + p129 + p128 + p127 + p126 + p125 + p124 + p122 + p121 + p120 + p119 + p118 + p117 + p115 + p114 + p113 + p112 + p111 + p110 + p108 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99 <= 1) OR ((p160 + 1 <= p71 + p70 + p69 + p68 + p67 + p66 + p72... (shortened)
lola: processed formula length: 745
lola: 8 rewrites
lola: closed formula file ReachabilityCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((2 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p88 + p109 + p116 + p123 + p130 + p136 + p135 + p134 + p133 + p132 + p131 + p129 + p128 + p127 + p126 + p125 + p124 + p122 + p121 + p120 + p119 + p118 + p117 + p115 + p114 + p113 + p112 + p111 + p110 + p108 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99) AND ((p71 + p70 + p69 + p68 + p67 + p66 + p72 <= p160) OR (1 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p88 + p109 + p116 + p123 + p130 + p136 + p135 + p134 + p133 + p132 + p131 + p129 + p128 + p127 + p126 + p125 + p124 + p122 + p121 + p120 + p119 + p118 + p117 + p115 + p114 + p113 + p112 + p111 + p110 + p108 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99)))
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: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 22 markings, 21 edges
lola: ========================================
lola: subprocess 10 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((p182 <= 1) AND (p184 <= p256 + p249 + p242 + p235 + p228 + p221 + p214 + p215 + p216 + p217 + p218 + p219 + p220 + p222 + p223 + p224 + p225 + p226 + p227 + p229 + p230 + p231 + p232 + p233 + p234 + p236 + p237 + p238 + p239 + p240 + p241 + p243 + p244 + p245 + p246 + p247 + p248 + p250 + p251 + p252 + p253 + p254 + p255 + p257 + p258 + p259 + p260 + p261 + p262) AND (3 <= p168 + p169 + p1... (shortened)
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 (((p182 <= 1) AND (p184 <= p256 + p249 + p242 + p235 + p228 + p221 + p214 + p215 + p216 + p217 + p218 + p219 + p220 + p222 + p223 + p224 + p225 + p226 + p227 + p229 + p230 + p231 + p232 + p233 + p234 + p236 + p237 + p238 + p239 + p240 + p241 + p243 + p244 + p245 + p246 + p247 + p248 + p250 + p251 + p252 + p253 + p254 + p255 + p257 + p258 + p259 + p260 + p261 + p262) AND (3 <= p168 + p169 + p1... (shortened)
lola: processed formula length: 434
lola: 7 rewrites
lola: closed formula file ReachabilityCardinality.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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: formula 0: ((p182 <= 1) AND (p184 <= p256 + p249 + p242 + p235 + p228 + p221 + p214 + p215 + p216 + p217 + p218 + p219 + p220 + p222 + p223 + p224 + p225 + p226 + p227 + p229 + p230 + p231 + p232 + p233 + p234 + p236 + p237 + p238 + p239 + p240 + p241 + p243 + p244 + p245 + p246 + p247 + p248 + p250 + p251 + p252 + p253 + p254 + p255 + p257 + p258 + p259 + p260 + p261 + p262) AND (3 <= p168 + p169 + p170 + p171 + p172 + p173 + p174))
lola: state equation task get result unparse finished id 0
lola: The predicate is reachable.
lola: 26 markings, 25 edges
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: ========================================
lola: subprocess 11 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((p187 + p188 + p189 + p190 + p191 + p192 + p186 + 1 <= p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56) AND (p187 + p188 + p189 + p190 + p191 + p192 + ... (shortened)
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 (((p187 + p188 + p189 + p190 + p191 + p192 + p186 + 1 <= p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56) AND (p187 + p188 + p189 + p190 + p191 + p192 + ... (shortened)
lola: processed formula length: 458
lola: 7 rewrites
lola: closed formula file ReachabilityCardinality.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: ((p187 + p188 + p189 + p190 + p191 + p192 + p186 + 1 <= p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56) AND (p187 + p188 + p189 + p190 + p191 + p192 + p186 <= p175 + p176 + p177 + p178 + p179 + p180 + p181))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityCardinality-11-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-11-0.sara.
sara: place or transition ordering is non-deterministic
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: subprocess 12 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p187 + p188 + p189 + p190 + p191 + p192 + p186 <= p193 + p194 + p195 + p196 + p197 + p198 + p199) OR ((p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p5... (shortened)
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 (((p187 + p188 + p189 + p190 + p191 + p192 + p186 <= p193 + p194 + p195 + p196 + p197 + p198 + p199) OR ((p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p5... (shortened)
lola: processed formula length: 434
lola: 8 rewrites
lola: closed formula file ReachabilityCardinality.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: ((p193 + p194 + p195 + p196 + p197 + p198 + p199 + 1 <= p187 + p188 + p189 + p190 + p191 + p192 + p186) AND ((p182 <= p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56) OR (3 <= p160)))
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: write sara problem file to ReachabilityCardinality-12-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-12-0.sara.
lola: ========================================
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 6490 markings, 26922 edges
lola: ========================================
lola: subprocess 13 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((3 <= p152 + p158 + p157 + p156 + p155 + p154 + p153) AND (p182 <= p206 + p205 + p200 + p201 + p202 + p203 + p204) AND ((p185 <= p159) OR (p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p88 + p109 + p116 + p123 + p130 + p136 + p135 + p134 + p133 + p132 + p131 + p129 + p128 + p127 + p126 + p125 + p124 + p122 + p121 + p120 + p119 + p118 + p117 + p115 + p114 + p113 + p112 + p111 + p1... (shortened)
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 (((3 <= p152 + p158 + p157 + p156 + p155 + p154 + p153) AND (p182 <= p206 + p205 + p200 + p201 + p202 + p203 + p204) AND ((p185 <= p159) OR (p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p88 + p109 + p116 + p123 + p130 + p136 + p135 + p134 + p133 + p132 + p131 + p129 + p128 + p127 + p126 + p125 + p124 + p122 + p121 + p120 + p119 + p118 + p117 + p115 + p114 + p113 + p112 + p111 + p1... (shortened)
lola: processed formula length: 504
lola: 8 rewrites
lola: closed formula file ReachabilityCardinality.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: ((p152 + p158 + p157 + p156 + p155 + p154 + p153 <= 2) OR (p206 + p205 + p200 + p201 + p202 + p203 + p204 + 1 <= p182) OR ((p159 + 1 <= p185) AND (p80 + 1 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p88 + p109 + p116 + p123 + p130 + p136 + p135 + p134 + p133 + p132 + p131 + p129 + p128 + p127 + p126 + p125 + p124 + p122 + p121 + p120 + p119 + p118 + p117 + p115 + p114 + p113 + p112 + p111 + p110 + p108 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99)) OR (p160 + 1 <= p7))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 5 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityCardinality-13-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-13-0.sara.
sara: place or transition ordering is non-deterministic
lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 14 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p256 + p249 + p242 + p235 + p228 + p221 + p214 + p215 + p216 + p217 + p218 + p219 + p220 + p222 + p223 + p224 + p225 + p226 + p227 + p229 + p230 + p231 + p232 + p233 + p234 + p236 + p237 + p238 + p239 + p240 + p241 + p243 + p244 + p245 + p246 + p247 + p248 + p250 + p251 + p252 + p253 + p254 + p255 + p257 + p258 + p259 + p260 + p261 + p262 <= p152 + p158 + p157 + p156 + p155 + p154 + p153) ... (shortened)
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 (((p256 + p249 + p242 + p235 + p228 + p221 + p214 + p215 + p216 + p217 + p218 + p219 + p220 + p222 + p223 + p224 + p225 + p226 + p227 + p229 + p230 + p231 + p232 + p233 + p234 + p236 + p237 + p238 + p239 + p240 + p241 + p243 + p244 + p245 + p246 + p247 + p248 + p250 + p251 + p252 + p253 + p254 + p255 + p257 + p258 + p259 + p260 + p261 + p262 <= p152 + p158 + p157 + p156 + p155 + p154 + p153) ... (shortened)
lola: processed formula length: 498
lola: 8 rewrites
lola: closed formula file ReachabilityCardinality.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: ((p152 + p158 + p157 + p156 + p155 + p154 + p153 + 1 <= p256 + p249 + p242 + p235 + p228 + p221 + p214 + p215 + p216 + p217 + p218 + p219 + p220 + p222 + p223 + p224 + p225 + p226 + p227 + p229 + p230 + p231 + p232 + p233 + p234 + p236 + p237 + p238 + p239 + p240 + p241 + p243 + p244 + p245 + p246 + p247 + p248 + p250 + p251 + p252 + p253 + p254 + p255 + p257 + p258 + p259 + p260 + p261 + p262) OR (p81 + p82 + p83 + p84 + p85 + p86 + p87 + 1 <= p145 + p146 + p147 + p148 + p149 + p150 + p151))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 35 markings, 34 edges
lola: ========================================
lola: subprocess 15 will run for 3566 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p256 + p249 + p242 + p235 + p228 + p221 + p214 + p215 + p216 + p217 + p218 + p219 + p220 + p222 + p223 + p224 + p225 + p226 + p227 + p229 + p230 + p231 + p232 + p233 + p234 + p236 + p237 + p238 + p239 + p240 + p241 + p243 + p244 + p245 + p246 + p247 + p248 + p250 + p251 + p252 + p253 + p254 + p255 + p257 + p258 + p259 + p260 + p261 + p262 <= 1) OR ((p182 + 1 <= p152 + p158 + p157 + p156 +... (shortened)
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 (((p256 + p249 + p242 + p235 + p228 + p221 + p214 + p215 + p216 + p217 + p218 + p219 + p220 + p222 + p223 + p224 + p225 + p226 + p227 + p229 + p230 + p231 + p232 + p233 + p234 + p236 + p237 + p238 + p239 + p240 + p241 + p243 + p244 + p245 + p246 + p247 + p248 + p250 + p251 + p252 + p253 + p254 + p255 + p257 + p258 + p259 + p260 + p261 + p262 <= 1) OR ((p182 + 1 <= p152 + p158 + p157 + p156 +... (shortened)
lola: processed formula length: 531
lola: 8 rewrites
lola: closed formula file ReachabilityCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((2 <= p256 + p249 + p242 + p235 + p228 + p221 + p214 + p215 + p216 + p217 + p218 + p219 + p220 + p222 + p223 + p224 + p225 + p226 + p227 + p229 + p230 + p231 + p232 + p233 + p234 + p236 + p237 + p238 + p239 + p240 + p241 + p243 + p244 + p245 + p246 + p247 + p248 + p250 + p251 + p252 + p253 + p254 + p255 + p257 + p258 + p259 + p260 + p261 + p262) AND ((p152 + p158 + p157 + p156 + p155 + p154 + p153 <= p182) OR (p145 + p146 + p147 + p148 + p149 + p150 + p151 <= p193 + p194 + p195 + p196 + p197 + p198 + p199)))
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: write sara problem file to ReachabilityCardinality-15-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 36 markings, 35 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no no yes no no no yes yes yes no yes no no
lola:
preliminary result: no no no no no yes no no no yes yes yes no yes no no
lola: memory consumption: 80112 KB
lola: time consumption: 4 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityCardinality.json
lola: closed JSON file ReachabilityCardinality.json
rslt: finished
BK_STOP 1553893204964
--------------------
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="QuasiCertifProtocol-COL-06"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="lola"
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-3954"
echo " Executing tool lola"
echo " Input is QuasiCertifProtocol-COL-06, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r126-oct2-155274853300206"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/QuasiCertifProtocol-COL-06.tgz
mv QuasiCertifProtocol-COL-06 execution
cd execution
if [ "ReachabilityCardinality" = "GlobalProperties" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
if [ "ReachabilityCardinality" = "UpperBounds" ] ; 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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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
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 ;